Building Cryptographic Proofs from Hash Functions with Alessandro Chiesa and Eylon Yogev
Zero Knowledge
00:00
Exploring Superposition Queries and Cryptographic Proofs
The chapter covers superposition queries in the random oracle and quantum random oracle models, delving into adversaries' use of multiple queries with different amplitudes. It discusses cryptographic proofs utilizing random oracles, Merkle trees, SNARGS, and the Fiat-Chamir transformation, emphasizing security and efficiency trade-offs. The chapter also explores Merkle commitment schemes, Michali snarks, and the transition from interactive Oracle proofs to SNARKs, highlighting the need for precise definitions and parameter settings in cryptographic proofs.
Transcript
Play full episode
