Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs

DOI10.1007/978-3-642-11799-2_11zbMath1274.94120OpenAlexW1586891508MaRDI QIDQ3408193

Yevgeniy Vahlis

Publication date: 24 February 2010

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_11

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resettable zero-knowledge (extended abstract)
• Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
• Towards a Separation of Semantic and CCA Security for Public Key Encryption
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Chosen-Ciphertext Security via Correlated Products
• Deterministic and Efficiently Searchable Encryption
• New directions in cryptography
• Nonmalleable Cryptography
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Theory of Cryptography

This page was built for publication: Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs