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

Adaptive Trapdoor Functions and Chosen-Ciphertext Security

Eike Kiltz, Payman Mohassel, Adam O’Neill

Published Jan 1, 2010• 91 citations
Publisher
DOI
10.1007/978-3-642-13190-5_34

Related papers

Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions

Petros Mol, Scott Yilek

Lecture notes in computer science•Jan 1, 2010•54 citations

All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE

Benoît Libert, Amin Sakzad, Damien Stehlé +1 more

Lecture notes in computer science•Jan 1, 2017•44 citations

An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack

Ran Canetti, Shafi Goldwasser

Theory and Application of Cryptographic Techniques•May 2, 1999•140 citations

An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)

Ran Canetti, Shafi Goldwasser

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

Chosen-Ciphertext Security via Correlated Products

Alon Rosen, Gil Segev

We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs $(x_1,\dots,x_k)$ so that the function $(f(x_1),\dots,f(x_k))$ is one-way. The main motivation of this study is the construction of public-key encryption schemes that are secure against chosen-ciphertext attacks (CCAs). We show that any collection of injective trapdoor functions that is secure under a very natural correlated product can be used to construct a CCA-secure public-key encryption scheme. The construction is simple, black-box, and admits a direct proof of security. It can be viewed as a simplification of the seminal work of Dolev, Dwork, and Naor [SIAM J. Comput., 30 (2000), pp. 391–437], while relying on a seemingly incomparable assumption. We provide evidence that security under correlated products is achievable by demonstrating that lossy trapdoor functions [Peikert and Waters, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008, pp. 187–196] yield injective trapdoor functions that are secure under the above-mentioned correlated product. Although we currently base security under correlated products on existing constructions of lossy trapdoor functions, we argue that the former notion is potentially weaker as a general assumption. Specifically, there is no fully black-box construction of lossy trapdoor functions from trapdoor functions that are secure under correlated products.

SIAM Journal on Computing•Jan 1, 2010•35 citations

ALGAES : An authenticated lattice-based generic asymmetric encryption scheme

S. S. Aravind Vishnu, Madathil Sethumadhavan, K. V. Lakshmy

In this article, we propose a generic hybrid encryption scheme providing entity authentication.The scheme is based on lossy trapdoor functions relying on the hardness of the Learning With Errors problem.The construction can be used on a number of different security requirements with minimal reconfiguration.It ensures entity authentication and ciphertext integrity while providing security against adaptive chosen ciphertext attacks in the standard model.As a desired characteristic of schemes providing entity authentication, we prove the strong unforgeability under chosen message attack for the construction.In addition, the scheme is post-quantum secure based on the hardness of the underlying assumption.

Journal of Discrete Mathematical Sciences and Cryptography•May 12, 2026•0 citations
We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs (x1,…,xk)(x_1,\dots,x_k)(x1​,…,xk​) so that the function (f(x1),…,f(xk))(f(x_1),\dots,f(x_k))(f(x1​),…,f(xk​)) is one-way. The main motivation of this study is the construction of public-key encryption schemes that are secure against chosen-ciphertext attacks (CCAs). We show that any collection of injective trapdoor functions that is secure under a very natural correlated product can be used to construct a CCA-secure public-key encryption scheme. The construction is simple, black-box, and admits a direct proof of security. It can be viewed as a simplification of the seminal work of Dolev, Dwork, and Naor [SIAM J. Comput., 30 (2000), pp. 391–437], while relying on a seemingly incomparable assumption. We provide evidence that security under correlated products is achievable by demonstrating that lossy trapdoor functions [Peikert and Waters, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008, pp. 187–196] yield injective trapdoor functions that are secure under the above-mentioned correlated product. Although we currently base security under correlated products on existing constructions of lossy trapdoor functions, we argue that the former notion is potentially weaker as a general assumption. Specifically, there is no fully black-box construction of lossy trapdoor functions from trapdoor functions that are secure under correlated products.
In this article, we propose a generic hybrid encryption scheme providing entity authentication.The scheme is based on lossy trapdoor functions relying on the hardness of the Learning With Errors problem.The construction can be used on a number of different security requirements with minimal reconfiguration.It ensures entity authentication and ciphertext integrity while providing security against adaptive chosen ciphertext attacks in the standard model.As a desired characteristic of schemes providing entity authentication, we prove the strong unforgeability under chosen message attack for the construction.In addition, the scheme is post-quantum secure based on the hardness of the underlying assumption.