On the complexity of collision resistant hash functions: new and old black-box separations
From MaRDI portal
Publication:2175920
DOI10.1007/978-3-030-36030-6_17zbMath1455.94128OpenAlexW2991369715MaRDI QIDQ2175920
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_17
Related Items (3)
Collision-resistance from multi-collision-resistance ⋮ Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness ⋮ Structure Versus Hardness Through the Obfuscation Lens
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limits on the power of garbling techniques for public-key encryption
- On total functions, existence theorems and computational complexity
- Checking the correctness of memories
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- Random oracles and non-uniformity
- Multi-collision resistant hash functions and their applications
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Structure vs. hardness through the obfuscation lens
- On distributional collision resistant hashing
- Necessary and sufficient conditions for collision-free hashing
- Statistical difference beyond the polarizing regime
- Collision resistant hashing from sub-exponential learning parity with noise
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- On Basing Private Information Retrieval on NP-Hardness
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
- Limits of Provable Security for Homomorphic Encryption
- Notions of Black-Box Reductions, Revisited
- On the Instantiability of Hash-and-Sign RSA Signatures
- On Black-Box Reductions between Predicate Encryption Schemes
- Black-Box Reductions and Separations in Cryptography
- On basing one-way functions on NP-hardness
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- The Dual BKR Inequality and Rudich's Conjecture
- Collision-Free Hashing from Lattice Problems
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
- A complete problem for statistical zero knowledge
- Generalized Compact Knapsacks Are Collision Resistant
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- A Framework for Efficient and Composable Oblivious Transfer
- On the (Im)Possibility of Key Dependent Encryption
- Random Oracles and Auxiliary Input
- The knowledge complexity of interactive proof-systems
- Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
- White-Box vs. Black-Box Complexity of Search Problems
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- On Basing Size-Verifiable One-Way Functions on NP-Hardness
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Theory of Cryptography
- On Worst‐Case to Average‐Case Reductions for NP Problems
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: On the complexity of collision resistant hash functions: new and old black-box separations
