The original protocol has to be what's called public coin, which means that all the verifier does is just toss random coins and tell the results of the poover. If you apply Fiatramiou to them, no matter what hash function you use, the result is going to be insecure. In theory land, we are somewhat unhappy with this random Oracle situation. We would like to base things on standard model. Can we do it based on discrete log or factory or something concrete? Why do you dislike the random Oracle model?
This week, host Anna Rose and Nico Mohnblatt chat with Ron Rothblum, Professor of Computer Science at Technion. They explore information theory and ZK, diving into the weeds on multiple topics including error correcting codes, FRI, FFTs, Reed-Solomon encoding, Fiat-Shamir and more.
Here’s some additional links for this episode:
zkSummit 10 is happening in London on September 20, 2023! Apply to attend now -> https://9lcje6jbgv1.typeform.com/zkSummit10
Aleo is a new Layer-1 blockchain that achieves the programmability of Ethereum, the privacy of Zcash, and the scalability of a rollup.
Interested in building private applications? Check out Aleo’s programming language called Leo that enables non-cryptographers to harness the power of ZKPs to deploy decentralized exchanges, hidden information games, regulated stablecoins, and more. Visit http://developer.aleo.org.
For questions, join their Discord at aleo.org/discord.
If you like what we do: