Live briefing
Everything about Interactive proof system
Abstract machine that models computation
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. The parties interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover is assumed to possess unlimited computational resources but cannot be trusted, while the verifier has bounded computation power but is assumed to be always honest. Messages are sent between the verifier and prover until the verifier has an answer to the problem and has "convinced" itself that it is correct. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Interactive proof systemA 5-minute orientation
- Skim a recent paper: Improvements on Non-Interactive Zero-Knowledge Proof Systems Related to Quadratic Residuosity LanguagesInfluential work since 2022
- Pick up a classic book: Chemical Process SafetyThe most-reprinted book on the subject
- Read the landmark paper: The Knowledge Complexity of Interactive Proof SystemsCited 2,194 times
- Go sideways: IP (complexity)A closely related topic
- Go sideways: Arthur–Merlin protocolA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The Knowledge Complexity of Interactive Proof Systems
Algebraic methods for interactive proof systems
IMPS: An interactive mathematical proof system
Privacy preserving authentication system based on non-interactive zero knowledge proof suitable for Internet of Things
PSPACE has constant-round quantum interactive proof systems
An application of quantum finite automata to interactive proof systems
Interactive proof systems and alternating time—space complexity
On Doubly-Efficient Interactive Proof Systems
🆕 Influential since 2022
Improvements on Non-Interactive Zero-Knowledge Proof Systems Related to Quadratic Residuosity Languages
A classical proof of quantum knowledge for multi-prover interactive proof systems
A Resolution-Based Interactive Proof System for UNSAT
Asynchronous Repetition of Interactive Proof Systems
Classification of non-interactive knowledge argument proof systems
📚 Books worth reading
Chemical Process SafetyDaniel A. Crowl, Joseph F. Louvar · 1989
Solid State PhysicsDavid Turnbull · 1955
Multivariable Calculus, Concepts and ContextsJames Stewart · 1998
Science and religionAlister E. McGrath · 2010
Logical Foundations of Computer ScienceSergei Artemov · 2007
Advances in Lipid ResearchRodolfo Paoletti, David Kritchevsky · 1969
Advances in dynamics and controlS. Sivasundaram · 2003
The physiology of insectaMorris Rockstein · 1964
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- IP (complexity) In computational complexity theory, the class IP (which stands for interactive proof) is the class of problems solvable by an interactive proof system…
- Arthur–Merlin protocol In computational complexity theory, an Arthur–Merlin protocol, introduced by Babai (1985), is an interactive proof system in which the verifier's coin…
- PCP theorem In computational complexity theory, the PCP theorem (also known as the PCP characterization theorem) states that every decision problem in the NP complexity…
- QIP (complexity) In computational complexity theory, the class QIP (which stands for Quantum Interactive Proof) is the quantum computing analogue of the classical complexity…
- Probabilistically checkable proof In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a…
- QMA QMA, as an abbreviation for Quantum Merlin Arthur, refers to a complexity class in computational complexity theory. It is the set of all formal languages…
- Lance Fortnow Lance Jeremy Fortnow (born August 15, 1963) is a computer scientist known for major results in computational complexity and interactive proof systems.…
- NEXPTIME In computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a non-determinis…