Eli Ben-Sasson: Zero Knowledge Proofs
Epicenter - Learn about Crypto, Blockchain, Ethereum, Bitcoin and Distributed Technologies
00:00
Using Addatively Homomorphic Cinscription to Speed Up the Way You Use Proximally Checkable Proofs
An adatively homomorphic conscription is something that's been around for some time. It started in two thousand and seven in a work of two of my peers, atechnion uvalishaanal kushilevits and a researcher from au c l a, raphael ostrovski. Theoretically, constructions were inefficient but they can now be speeded up by using this technique. But before we go into the set up slike in yor innor scenario, perhaps we should go into a the set of phase that is needed before you can actually generate the proof.
Transcript
Play full episode
