✳flâneur — a map of the web's best reading

Zero-Knowledge Proofs | MIT CSAIL Theory of Computation

toc.csail.mit.edu · 1,576 words · saved by 1 readers

Zero-knowledge proofs are probabilistic and interactive proofs that efficiently demonstrate membership in the language without conveying any additional knowledge. Zero-knowledge proofs were introduced by Goldwasser, Micali and Rackoff in The Knowledge Complexity of Interactive Proof Systems (SIAM J. of Comuting, January 1989). The wide applicability of zero-knowledge was demonstrated in Proofs that Yield Nothing But their Validity or All Languages in NP have Zero-Knowledge Proofs, coauthored by Goldreich, Micali and Wigderson [JACM, July 1991]. In particular, assuming the existence of one-way functions, they showed that every language in NP has a zero-knowledge proof system. This work is not available on-line, yet most of the material is covered in Foundations of Cryptography - Fragments of a Book [by Oded Goldreich]. (See also an extract of the relevant part.)

Zero-Knowledge Proofs | MIT CSAIL Theory of Computation Skip to main content Accessibility login home About TOC Calendar Contact People Faculty Research Scientists lecturers Postdocs Students Visitors Support Staff Alumni Research Groups Algorithms Complexity Theory Complexity Theory Courses Computation & Biology Computation and Economics Computational Connectomics Cryptography and Information Security Learning-Augmented Algorithms Multicore Algorithmics Parallel Computing Applied Computing Supertech Research Quantum Information Science Sublinear Algorithms Theory of Distributed Systems Theory

Explore this link on the map →

saved by

related reading