(Q56427208)
Statements
The knowledge complexity of interactive proof-systems (English)
0 references
1 reference
Zero-knowledge proofs belong to a category known as interactive proofs, so to learn how the former work, it helps to understand the latter. First described in a 1985 paper by the computer scientists Shafi Goldwasser, Silvio Micali and Charles Rackoff, interactive proofs work like an interrogation: Over a series of messages, one party (the prover) tries to convince the other (the verifier) that a given statement is true. An interactive proof must satisfy two properties. https://dl.acm.org/doi/10.1145/22145.22178 (English)
1985
0 references