Proofs, Arguments, and Zero-Knowledge
Author:
Top Cited Papers
Open Access
- 7 December 2022
- journal article
- review article
- Published by Emerald Publishing in Foundations and Trends® in Privacy and Security
- Vol. 4 (2-4) , 117-660
Abstract
Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted prover to provide a guarantee that it performed a requested computation correctly. Introduced in the 1980s, IPs and arguments represented a major conceptual expansion of what constitutes a “proof” that a statement is true. Traditionally, a proof is a static object that can be easily checked step-by-step for correctness. In contrast, IPs allow for interaction between prover and verifier, as well as a tiny but nonzero probability that an invalid proof passes verification. Arguments (but not IPs) even permit there to be “proofs” of false statements, so long as those “proofs” require exorbitant computational power to find. To an extent, these notions mimic in-person interactions that mathematicians use to convince each other that a claim is true, without going through the painstaking process of writing out and checking a traditional static proof. Celebrated theoretical results from the 1980s and 1990s such as IP = PSPACE and MIP = NEXP showed that, in principle, surprisingly complicated statements can be verified efficiently. What is more, any argument can in principle be transformed into one that is zero-knowledge, which means that proofs reveal no information other than their own validity. Zero-knowledge arguments have a myriad of applications in cryptography. Within the last decade, general-purpose zero-knowledge arguments have made the jump from theory to practice. This has opened new doors in the design of cryptographic systems, and generated additional insights into the power of IPs and arguments (zero-knowledge or otherwise). There are now no fewer than five promising approaches to designing efficient, general-purpose zero-knowledge arguments. This survey covers these approaches in a unified manner, emphasizing commonalities between them.Keywords
This publication has 89 references indexed in Scilit:
- On the Correlation Intractability of Obfuscated Pseudorandom Functions2015
- Signatures of Correct Computation2013
- Best-Order Streaming ModelLecture Notes in Computer Science, 2009
- On Compressible Pairings and Their Computation2008
- Derandomizing Arthur–Merlin Games using Hitting Setscomputational complexity, 2005
- On interactive proofs with a laconic provercomputational complexity, 2002
- Quantum cryptanalysis of hash and claw-free functions1998
- On the All-Pairs-Shortest-Path Problem in Unweighted Undirected GraphsJournal of Computer and System Sciences, 1995
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Efficient checking of computations1990