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.
Summary
In this week’s episode Anna and Nico chat with Alessandro Chiesa, Associate Professor at EPFL and Eylon Yogev, Professor at Bar-Ilan University. They discuss their recent publication; Building Cryptographic Proofs from Hash Functions, which provides a comprehensive and rigorous treatment of cryptographic proofs and goes on to analyze notable constructions of SNARGs based on ideal hash functions.
Here’s some additional links for this episode:
ZK Hack Montreal has been announced for Aug 9 - 11! Apply to join the hackathon here.
Episode Sponsors
Launching soon, Namada is a proof-of-stake L1 blockchain focused on multichain, asset-agnostic privacy, via a unified shielded set. Namada is natively interoperable with fast-finality chains via IBC, and with Ethereum using a trust-minimized bridge.
Follow Namada on Twitter @namada for more information and join the community on Discord.
Aleo is a new Layer-1 blockchain that achieves the programmability of Ethereum, the privacy of Zcash, and the scalability of a rollup.
As Aleo is gearing up for their mainnet launch in Q1, this is an invitation to be part of a transformational ZK journey.
Dive deeper and discover more about Aleo at http://aleo.org/.
If you like what we do: