Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Adaptively-Secure, Non-interactive Public-Key Encryption

Ran Canetti, Shai Halevi, Jonathan I. Katz

Published Jan 1, 2005• 69 citations
Publisher
DOI
10.1007/978-3-540-30576-7_9

Related papers

Public-Key Encryption with Non-interactive Opening

Ivan Damgård, Dennis Hofheinz, Eike Kiltz +1 more

Lecture notes in computer science•Apr 4, 2008•48 citations

Adaptively-Secure, Non-Interactive Public-Key Encryption.

Ran Canetti, Shai Halevi, Jonathan I. Katz

Abstract. 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 alreadycorrupted 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 arbitrarilymany senders. Our schemes additionally provide forward security and security against chosen-ciphertext attacks. 1

•Jan 1, 2004•1 citation

Symmetric Public-Key Encryption

Zvi Galil, Stuart Haber, Moti M. Yung

Springer eBooks•Feb 28, 2007•26 citations

UC-Secure Non-interactive Public-Key Encryption

Jan L. Camenisch, Anja Lehmann, Gregory Neven +1 more

The universal composability (UC) framework enables the modular design of cryptographic protocols by allowing arbitrary compositions of lower-level building blocks. Public-key encryption is unarguably a very important such building block. However, so far no UC-functionality exists that offers non-interactive encryption necessary for modular protocol construction. We provide an ideal functionality for non-committing encryption (i.e., public-key encryption secure against adaptive corruptions) with locally generated, and therefore non-interactive, ciphertexts. As a sanity check, we also provide a property-based security notion that we prove to be equivalent to the UC notion. We then show that the encryption scheme of Camenisch et al. (SCN '16) based on trapdoor permutations securely implements our notion in the random-oracle model without assuming secure erasures. This is the best one can hope to achieve as standard-model constructions do not exist due to the uninstantiability of round-optimal adaptively secure message transfer in the standard model (Nielsen, Crypto '02). We illustrate the modular reusability of our functionality by constructing the first non-interactive signcryption scheme secure against adaptive corruptions without secure erasures in the UC framework.

IEEE Computer Security Foundations Workshop (CSFW)•Aug 1, 2017•7 citations

Adaptively-Secure Distributed Public-Key Systems

Yair Frankel, PHILIP D. MACKENZIE, Moti M. Yung

Lecture notes in computer science•Jan 1, 1999•43 citations

Adaptive and composable multi-media transcoders

Huafei Zhu

In this paper, a new construction of adaptive and composable transcoders from universally composabley secure (the uc-security) commitments is introduced and analyzed. Our transcoder is built on the top of scalable video coding standard, known as H.264/SVC. The idea behind of our implementation is simple: a base layer of streams is encoded by an extractable key while an enhanced layer of streams is encoded by an equivocable key of the underlying universally composable commitment scheme. We show that our construction reaches the UC-security in the presence of adaptive adversaries in the common reference string model assuming that the underlying Paillier's public-key encryption scheme is semantically secure and the Damgård-Fazio-Nicolosi's non-interactive protocol is zero-knowledge in the registered public-key model. Furthermore, if the underlying Paillier's public-key encryption scheme is replaced by Damgård-Jurik's length-flexible public key encryption scheme, then the derived adaptive and composable transcoder is length-flexible as well.

IEEE International Conference on Ubi-Media Computing•Jul 1, 2010•1 citation
Abstract. 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 alreadycorrupted 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 arbitrarilymany senders. Our schemes additionally provide forward security and security against chosen-ciphertext attacks. 1
The universal composability (UC) framework enables the modular design of cryptographic protocols by allowing arbitrary compositions of lower-level building blocks. Public-key encryption is unarguably a very important such building block. However, so far no UC-functionality exists that offers non-interactive encryption necessary for modular protocol construction. We provide an ideal functionality for non-committing encryption (i.e., public-key encryption secure against adaptive corruptions) with locally generated, and therefore non-interactive, ciphertexts. As a sanity check, we also provide a property-based security notion that we prove to be equivalent to the UC notion. We then show that the encryption scheme of Camenisch et al. (SCN '16) based on trapdoor permutations securely implements our notion in the random-oracle model without assuming secure erasures. This is the best one can hope to achieve as standard-model constructions do not exist due to the uninstantiability of round-optimal adaptively secure message transfer in the standard model (Nielsen, Crypto '02). We illustrate the modular reusability of our functionality by constructing the first non-interactive signcryption scheme secure against adaptive corruptions without secure erasures in the UC framework.
In this paper, a new construction of adaptive and composable transcoders from universally composabley secure (the uc-security) commitments is introduced and analyzed. Our transcoder is built on the top of scalable video coding standard, known as H.264/SVC. The idea behind of our implementation is simple: a base layer of streams is encoded by an extractable key while an enhanced layer of streams is encoded by an equivocable key of the underlying universally composable commitment scheme. We show that our construction reaches the UC-security in the presence of adaptive adversaries in the common reference string model assuming that the underlying Paillier's public-key encryption scheme is semantically secure and the Damgård-Fazio-Nicolosi's non-interactive protocol is zero-knowledge in the registered public-key model. Furthermore, if the underlying Paillier's public-key encryption scheme is replaced by Damgård-Jurik's length-flexible public key encryption scheme, then the derived adaptive and composable transcoder is length-flexible as well.