Parallel Hashing via List Recoverability
From MaRDI portal
Publication:3457065
DOI10.1007/978-3-662-48000-7_9zbMath1351.94050OpenAlexW1477430157MaRDI QIDQ3457065
Eran Omri, Yuval Ishai, Ronen Shaltiel, Iftach Haitner
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_9
Related Items
Uses Software
Cites Work
- Decoding of Reed Solomon codes beyond the error-correction bound
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- Stam’s Conjecture and Threshold Phenomena in Collision Resistance
- Domain Extension for MACs Beyond the Birthday Barrier
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Building a Collision-Resistant Compression Function from Non-compressing Primitives
- Generalized Compact Knapsacks Are Collision Resistant
- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Domain Extension of Public Random Functions: Beyond the Birthday Barrier
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- Short PCPs with Polylog Query Complexity
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Computationally Sound Proofs
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- How to Break MD5 and Other Hash Functions
- Merkle-Damgård Revisited: How to Construct a Hash Function
