Sciweavers

10 search results - page 2 / 2
» All-But-Many Lossy Trapdoor Functions
Sort
View
TCC
2009
Springer
142views Cryptology» more  TCC 2009»
14 years 5 months ago
Chosen-Ciphertext Security via Correlated Products
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 ...
Alon Rosen, Gil Segev
EUROCRYPT
2010
Springer
13 years 9 months ago
Adaptive Trapdoor Functions and Chosen-Ciphertext Security
We introduce the notion of adaptive trapdoor functions (ATDFs); roughly, ATDFs remain one-way even when the adversary is given access to an inversion oracle. Our main application ...
Eike Kiltz, Payman Mohassel, Adam O'Neill
IACR
2011
107views more  IACR 2011»
12 years 4 months ago
Identity-Based (Lossy) Trapdoor Functions and Applications
Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Wa...
CRYPTO
2010
Springer
189views Cryptology» more  CRYPTO 2010»
13 years 2 months ago
Instantiability of RSA-OAEP under Chosen-Plaintext Attack
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
Eike Kiltz, Adam O'Neill, Adam Smith
ASIACRYPT
2009
Springer
13 years 8 months ago
Hedged Public-Key Encryption: How to Protect against Bad Randomness
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas ...