Abstract
In this work, we present efficient public-key encryption schemes resilient against linear related key attacks (RKA) under standard assumptions and in the standard model. Specifically, we obtain encryption schemes based on hardness of factoring, BDDH and LWE that remain secure even against an adversary that may query the decryption oracle on linear shifts of the actual secret key. Moreover, the ciphertext overhead is only an additive constant number of group elements. © 2012 International Association for Cryptologic Research.
Cite
CITATION STYLE
Wee, H. (2012). Public key encryption against related key attacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7293 LNCS, pp. 262–279). https://doi.org/10.1007/978-3-642-30057-8_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
