Parallel Hashing via List Recoverability

Explore the concept of parallel hashing through the lens of list recoverability in this 20-minute conference talk. Delve into the Merkle Tree Construction and the Maurer-Tessaro Scheme before examining the main results of parallel domain extension schemes. Investigate the requirements on C through attack analysis, and learn about error correction codes and list recoverable codes. Conclude by discussing applications beyond collision resistance and considering open questions in the field.

Intro
The Merkle Tree Construction Merkle 87
The Maurer-Tessaro Scheme [MT 07]
Overview of the Main Result
Parallel Domain Extension Scheme
Requirements on C - via Attacks
Error Correction Codes
List Recoverable Codes
Beyond Collision Resistance
Open Questions