Circular-Secure Encryption from Decision Diffie-Hellman

We describe a public-key encryption system that remains secure even encrypting messages that depend on the secret keys in use. In particular, it remains secure under a "key cycle" usage, where we have a cycle of public/secret key-pairs (pki, ski) for i = 1, . . . , n, and we encrypt each ski under

• Type: Conference
• Year: 2008
• Where: CRYPTO
• Authors: Dan Boneh, Shai Halevi, Michael Hamburg, Rafail Ostrovsky
• Keywords: CRYPTO 2008, Cryptology, Public-key Encryption, Secret Keys