Building Cryptographic Proofs from Hash Functions with Alessandro Chiesa and Eylon Yogev
Zero Knowledge
Exploring Limitations and Challenges in Constructing Cryptographic Proofs from Hash Functions
This chapter explores the limitations and complexities of constructing cryptographic proofs using hash functions, specifically focusing on the challenges in achieving certain functionalities like homomorphic commitments and recursive proofs. The discussion highlights the tensions between hash function security and structural limitations, while also mentioning potential solutions to address these issues and progress cryptographic techniques.
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.
