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.
Wee REF presents chosen ciphertext RKA-secure public-key encryption scheme constructions from the DBDH and LWE assumptions, also for linear related-key attacks.
Public key encryption against related key attacks
Public Key Cryptography
Computer Science