Zero Knowledge Building Cryptographic Proofs from Hash Functions with Alessandro Chiesa and Eylon Yogev
8 snips
Jun 26, 2024 Alessandro Chiesa and Eylon Yogev discuss constructing cryptographic proofs from ideal hash functions, exploring SNARKs and Alessandro's role in ZK systems. They delve into superposition queries, limitations of the random oracle model, and future standardizations. The podcast highlights the importance of systematizing cryptographic proofs for security and efficiency.
Chapters
Transcript
Episode notes
1 2 3 4 5 6 7 8
Intro
00:00 • 4min
Evolution of Snark-related Topics and Writing a Book
04:19 • 2min
Transition from Berkeley to EPFL and Building a New Research Group
06:24 • 2min
Exploring Cryptographic Proofs from Hash Functions
08:38 • 25min
Exploring Superposition Queries and Cryptographic Proofs
34:06 • 25min
Discussion on Hosting Study Group for a Book, Publishing Approach, and Limitations of the Random Oracle Model
58:48 • 2min
Exploring Limitations and Challenges in Constructing Cryptographic Proofs from Hash Functions
01:00:44 • 5min
Exploring Future Standardizations in Cryptography and Importance of Systematization
01:05:30 • 5min