Building Cryptographic Proofs from Hash Functions with Alessandro Chiesa and Eylon Yogev
Zero Knowledge
Differing Security in Quantum Random Models
Different tools and analyses are required for security in a quantum random model compared to a random model. While some constructions may be secure in a random oracle model, they may not be in a quantum random oracle model. Constructions like the Micali and BCS constructions have been shown to withstand even T superposition queries without being compromised.
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
