Interactive Proof Verification
Interactive Proof Verification is an academic construct within computational complexity theory that distinguishes itself by formalizing the process through which a verifier probabilistically checks the correctness of a claimed solution via interaction with a prover, ensuring soundness and completeness within a bounded number of rounds.
38
Publications
3.3K
Citations
72
Authors
55
Institutions
Publications per year
2017–2026
11
Parents
38
Algebraic methods for interactive proof systems
Carsten Lund, Lance Fortnow, Howard Karloff et al. · Journal of the ACM · 1992 · 702 citations · Full text
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum · 2008 · 477 citations
Universal Blind Quantum Computation
2009 · 460 citations · Full text
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum · Journal of the ACM · 2015 · 205 citations
1–5 of 38
72
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 72
55
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
4 publications
575 citations
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
81 citations
Technical University of Munich
Munich, Germany
3 h-index
3 publications
55 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
3 publications
93 citations
Microsoft (United States)
Redmond, United States
3 h-index
4 publications
311 citations

University of Edinburgh
Edinburgh, United Kingdom
2 h-index
4 publications
654 citations
Princeton University
Princeton, United States
2 h-index
2 publications
172 citations
Shandong University of Political Science and Law
Jinan, China
2 h-index
6 publications
327 citations
1–8 of 55
2 publications · 161 citations
2
h-index
CC · 2 publications · 97 citations
2
h-index
Repository · 2 publications · 108 citations
2
h-index
JACM · 2 publications · 907 citations
2
h-index
Repository · 2 publications · 26 citations
2
h-index
1–5