AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 282: Error Correcting Codes & Information Theory with Ron Rothblum
Zero Knowledge
How to Make Fia Chamere Secure With a Hash Function
3min Snip
00:00
Summary
Transcript
Episode notes
There's been a huge body of work on trying to make Fia Chamere secure when we have a hash function. We didn't know how to do anything positively until 2016, I think. And then we had this paper showing for the first time a concrete hash function based on a very strong but still concrete cryptographic assumption. But only for that limited set of protocol. Do you have any examples of those? What were the nice ones? The nice one would be GKR. So GKR is an interactive protocol for all bounded depth computations. And it's an interactive proof with statistical soundness. It has security even against an unbounded proof. For those type of protocols, since
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode
Save any
moment
Hear something you like? Tap your headphones to save it with AI-generated key takeaways
Share
& Export
Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more
AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode