Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
From MaRDI portal
Publication:3408193
DOI10.1007/978-3-642-11799-2_11zbMath1274.94120MaRDI QIDQ3408193
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
94A60: Cryptography
Related Items
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions, Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations, Reproducible circularly secure bit encryption: applications and realizations, Black-box use of one-way functions is useless for optimal fair coin-tossing, Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs, Reproducible Circularly-Secure Bit Encryption: Applications and Realizations
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item