Parallel Hashing via List Recoverability

DOI10.1007/978-3-662-48000-7_9MaRDI QIDQ3457065zbMATH OpenOpenAlexFDO

Authors Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Parallel hashing
• scientific article; zbMATH DE number 177852
• On parallel hashing and integer sorting
• Simple fast parallel hashing
• Simple Fast Parallel Hashing by Oblivious Execution
• ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING
• Analysis of parallel uniform hashing
• Parallel hash function construction based on coupled map lattices

Cites work

• Amplifying Collision Resistance: A Complexity-Theoretic Treatment
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• Computationally Sound Proofs
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Decoding of Reed Solomon codes beyond the error-correction bound
• Domain Extension of Public Random Functions: Beyond the Birthday Barrier
• Domain extension for MACs beyond the birthday barrier
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Generalized Compact Knapsacks Are Collision Resistant
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to Break MD5 and Other Hash Functions
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures
• Short PCPs with Polylog Query Complexity
• Stam's conjecture and threshold phenomena in collision resistance
• Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes

Cited in

(5)

• scientific article; zbMATH DE number 7758311 (Why is no real title available?)
• Verifiable quantum advantage without structure
• Low-complexity cryptographic hash functions
• Local list recovery of high-rate tensor codes and applications
• Nearly optimal pseudorandomness from hardness

Describes a project that uses

Uses Software

• Keccak

This page was built for publication: Parallel Hashing via List Recoverability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457065)