Principal Investigator Shafrira Goldwasser
Project Website http://groups.csail.mit.edu/cis/zk/zk.html
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 in The Knowledge Complexity of Interactive Proof Systems. 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. In particular, assuming the existence of one-way functions, they showed that every language in NP has a zero-knowledge proof system.