Paper 2004/317

Adaptively-Secure, Non-Interactive Public-Key Encryption

Ran Canetti, Shai Halevi, and Jonathan Katz


Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of already-corrupted parties. Ideally, an adaptively-secure encryption scheme should, like standard public-key encryption, allow arbitrarily-many parties to use a single encryption key to securely encrypt arbitrarily-many messages to a given receiver who maintains only a single short decryption key. However, it is known that these requirements are impossible to achieve: no non-interactive encryption scheme that supports encryption of an unbounded number of messages and uses a single, unchanging decryption key can be adaptively secure. Impossibility holds even if secure data erasure is possible. We show that this limitation can be overcome by updating the decryption key over time and making some mild assumptions about the frequency of communication between parties. Using this approach, we construct adaptively-secure, completely non-interactive encryption schemes supporting secure encryption of arbitrarily-many messages from arbitrarily-many senders. Our schemes additionally provide forward security and security against chosen-ciphertext attacks.

Available format(s)
Publication info
Published elsewhere. An extended abstract will appear at TCC '05
adaptively-secure encryption
Contact author(s)
jkatz @ cs umd edu
2004-11-24: last of 2 revisions
2004-11-19: received
See all versions
Short URL
Creative Commons Attribution


      author = {Ran Canetti and Shai Halevi and Jonathan Katz},
      title = {Adaptively-Secure, Non-Interactive Public-Key Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2004/317},
      year = {2004},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.