Error Correcting Codes & Information Theory with Ron Rothblum
Zero Knowledge
00:00
How to Make Fia Chamere Secure With a Hash Function
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
Transcript
Play full episode
