University of Cambridge > Talks.cam > Technical Talks - Department of Computer Science and Technology  > Nethermind: Zero-knowledge proofs. From theory to practice in less than 40 years

Nethermind: Zero-knowledge proofs. From theory to practice in less than 40 years

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Ben Karniely.

In this talk, I will introduce and overview zero-knowledge proofs. First, I will describe the idea of interactive proofs invented by Goldwasser, Micali, and Rackoff. Then, I will define the zero-knowledge property that allows a prover to convince a verifier of the veracity of a statement without revealing any information besides that. After showing some classic examples of zero-knowledge protocols, I will introduce zkSNARKs — zero-knowledge proofs that are powerful and efficient enough to be practical and demonstrate their use cases.

Please sign-up at the following link to attend: https://forms.gle/W6tkWm5pkwT1cENa9

Some catering will be provided before the talk.

This talk is part of the Technical Talks - Department of Computer Science and Technology series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity