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• 93 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•53 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•43 citations

The Gap between Intractable Problem and Adaptive Chosen Ciphertext Security

路献辉, 来学嘉, 何大可

上海交通大学学报:英文版•Jan 1, 2009•0 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•142 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•113 citations

Chosen-Ciphertext Security via Correlated Products.

Alon Rosen, Gil Segev

Abstract We initiate the study of one-wayness under correlated products. We are interested in identify-ing necessary and sufficient conditions for a function f and a distribution on inputs (x1,..., xk),so that the function ( f (x1),..., f (xk)) is one-way. The main motivation of this study is theconstruction of public-key encryption schemes that are secure against chosen-ciphertext attacks (CCA). We show that any collection of injective trapdoor functions that is secure under a verynatural 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.We provide evidence that security under correlated products is achievable by demonstrating that lossy trapdoor functions (Peikert and Waters, STOC '08) yield injective trapdoor functionsthat are secure under the above mentioned correlated product. Although we currently base security under correlated products on existing constructions of lossy trapdoor functions, weargue 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 aresecure under correlated products.

•Jan 1, 2008•0 citations
Abstract We initiate the study of one-wayness under correlated products. We are interested in identify-ing necessary and sufficient conditions for a function f and a distribution on inputs (x1,..., xk),so that the function ( f (x1),..., f (xk)) is one-way. The main motivation of this study is theconstruction of public-key encryption schemes that are secure against chosen-ciphertext attacks (CCA). We show that any collection of injective trapdoor functions that is secure under a verynatural 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.We provide evidence that security under correlated products is achievable by demonstrating that lossy trapdoor functions (Peikert and Waters, STOC '08) yield injective trapdoor functionsthat are secure under the above mentioned correlated product. Although we currently base security under correlated products on existing constructions of lossy trapdoor functions, weargue 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 aresecure under correlated products.