Math 2.0

Computer science Randomized, circuit, counting and interactive complexity Concept

Zero-knowledge proof

Summary

A zero-knowledge proof is an interactive proof in which the verifier becomes convinced that a statement is true but learns nothing else. "Nothing else" is made precise by a simulator. Whatever the verifier sees could have been produced by an efficient algorithm that never talked to the prover. The notion was introduced by Goldwasser, Micali and Rackoff in the 1980s. It is a basic tool of cryptography, used for identification schemes and for protocols that must stay secure against cheating parties.

Further reading

  1. Web https://en.wikipedia.org/wiki/Zero-knowledge_proof
About this page
Tag8JGQQCPNQT
URIm2://8JGQQCPNQT
Kindconcept
WritingW0 stub
MSC68Q10, 94A60, 68Q15
SpecializesInteractive proof system
Same as
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions