Interactive proof system (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Interactive proof system" in English language version.

Last modified: 23:26:53, 26 May 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

54acm.org

1,200^th place

821^st place

54mit.edu

476^th place

340^th place

44web.archive.org

1^st place

33doi.org

2^nd place

33psu.edu

299^th place

159^th place

22semanticscholar.org

15^th place

8^th place

11weizmann.ac.il

6,932^nd place

9,400^th place

11mcgill.ca

2,445^th place

1,513^th place

11worldcat.org

4^th place

11arxiv.org

49^th place

31^st place

11springer.com

182^nd place

172^nd place

acm.org (Global: 1,200^th place; English: 821^st place)

portal.acm.org

László Babai. Trading group theory for randomness. Proceedings of the Seventeenth Annual Symposium on the Theory of Computing, ACM. 1985.
László Babai and Shlomo Moran. Arthur–Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36: p.254–276. 1988.
O. Goldreich, S. Micali, A. Wigderson. Proofs that yield nothing but their validity. Journal of the ACM, volume 38, issue 3, p.690–728. July 1991.
Adi Shamir. IP = PSPACE. Journal of the ACM, volume 39, issue 4, p.869–877. October 1992.

arxiv.org (Global: 49^th place; English: 31^st place)

Tsuyoshi Ito; Hirotada Kobayashi; John Watrous (2010). "Quantum interactive proofs with weak error bounds". arXiv:1012.4427v2 [quant-ph].

doi.org (Global: 2^nd place; English: 2^nd place)

Goldwasser, S.; Micali, S.; Rackoff, C. (1989). "The knowledge complexity of interactive proof systems" (PDF). SIAM Journal on Computing. 18 (1): 186–208. doi:10.1137/0218012. ISSN 1095-7111. Extended abstract Archived 2006-06-23 at the Wayback Machine
Aaronson, S. (2010). "QIP = PSPACE breakthrough". Communications of the ACM. 53 (12): 101. doi:10.1145/1859204.1859230. S2CID 34380788.
Ben-Or, Michael; Goldwasser, Shafi; Kilian, Joe; Widgerson, Avi (1988). "Multi-prover interactive proofs: How to remove intractability" (PDF). Proceedings of the twentieth annual ACM Symposium on the Theory of Computing - STOC '88. pp. 113–131. doi:10.1145/62212.62223. ISBN 0897912640. S2CID 11008365. Archived from the original (PDF) on 13 July 2010. Retrieved 17 November 2022.

mcgill.ca (Global: 2,445^th place; English: 1,513^th place)

crypto.cs.mcgill.ca

Goldwasser, S.; Micali, S.; Rackoff, C. (1989). "The knowledge complexity of interactive proof systems" (PDF). SIAM Journal on Computing. 18 (1): 186–208. doi:10.1137/0218012. ISSN 1095-7111. Extended abstract Archived 2006-06-23 at the Wayback Machine

mit.edu (Global: 476^th place; English: 340^th place)

theory.lcs.mit.edu

Goldwasser, S.; Micali, S.; Rackoff, C. (1989). "The knowledge complexity of interactive proof systems" (PDF). SIAM Journal on Computing. 18 (1): 186–208. doi:10.1137/0218012. ISSN 1095-7111. Extended abstract Archived 2006-06-23 at the Wayback Machine
Shafi Goldwasser and Michael Sipser. Private coins versus public coins in interactive proof systems Archived 2005-01-27 at the Wayback Machine. Proceedings of ACM STOC'86, pp. 58–68. 1986.
M. Ben-or, Shafi Goldwasser, J. Kilian, and A. Wigderson. Multi prover interactive proofs: How to remove intractability assumptions. Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 113–121. 1988.

groups.csail.mit.edu

Ben-Or, Michael; Goldwasser, Shafi; Kilian, Joe; Widgerson, Avi (1988). "Multi-prover interactive proofs: How to remove intractability" (PDF). Proceedings of the twentieth annual ACM Symposium on the Theory of Computing - STOC '88. pp. 113–131. doi:10.1145/62212.62223. ISBN 0897912640. S2CID 11008365. Archived from the original (PDF) on 13 July 2010. Retrieved 17 November 2022.

psu.edu (Global: 299^th place; English: 159^th place)

citeseer.ist.psu.edu

László Babai; L. Fortnow; C. Lund (1991). "Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity". pp. 3–40. Archived from the original on 8 February 2007.{{cite web}}: CS1 maint: miscellaneous url (link)
Sanjeev Arora and Shmuel Safra. Probabilistic Checking of Proofs: A New Characterization of NP. Journal of the ACM, volume 45, issue 1, pp. 70–122. January 1998.
Sanjeev Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof Verification and the Hardness of Approximation Problems. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pp. 13–22. 1992.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Aaronson, S. (2010). "QIP = PSPACE breakthrough". Communications of the ACM. 53 (12): 101. doi:10.1145/1859204.1859230. S2CID 34380788.
Ben-Or, Michael; Goldwasser, Shafi; Kilian, Joe; Widgerson, Avi (1988). "Multi-prover interactive proofs: How to remove intractability" (PDF). Proceedings of the twentieth annual ACM Symposium on the Theory of Computing - STOC '88. pp. 113–131. doi:10.1145/62212.62223. ISBN 0897912640. S2CID 11008365. Archived from the original (PDF) on 13 July 2010. Retrieved 17 November 2022.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Russell Impagliazzo, Moti Yung: Direct Minimum-Knowledge Computations. CRYPTO 1987: 40-51

web.archive.org (Global: 1^st place; English: 1^st place)

Goldwasser, S.; Micali, S.; Rackoff, C. (1989). "The knowledge complexity of interactive proof systems" (PDF). SIAM Journal on Computing. 18 (1): 186–208. doi:10.1137/0218012. ISSN 1095-7111. Extended abstract Archived 2006-06-23 at the Wayback Machine
Shafi Goldwasser and Michael Sipser. Private coins versus public coins in interactive proof systems Archived 2005-01-27 at the Wayback Machine. Proceedings of ACM STOC'86, pp. 58–68. 1986.
László Babai; L. Fortnow; C. Lund (1991). "Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity". pp. 3–40. Archived from the original on 8 February 2007.{{cite web}}: CS1 maint: miscellaneous url (link)
Ben-Or, Michael; Goldwasser, Shafi; Kilian, Joe; Widgerson, Avi (1988). "Multi-prover interactive proofs: How to remove intractability" (PDF). Proceedings of the twentieth annual ACM Symposium on the Theory of Computing - STOC '88. pp. 113–131. doi:10.1145/62212.62223. ISBN 0897912640. S2CID 11008365. Archived from the original (PDF) on 13 July 2010. Retrieved 17 November 2022.

weizmann.ac.il (Global: 6,932^nd place; English: 9,400^th place)

eccc.weizmann.ac.il

Goldreich, Oded (2002), Zero-Knowledge twenty years after its invention, ECCC TR02-063.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Goldwasser, S.; Micali, S.; Rackoff, C. (1989). "The knowledge complexity of interactive proof systems" (PDF). SIAM Journal on Computing. 18 (1): 186–208. doi:10.1137/0218012. ISSN 1095-7111. Extended abstract Archived 2006-06-23 at the Wayback Machine

Interactive proof system (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)

portal.acm.org

arxiv.org (Global: 49th place; English: 31st place)

doi.org (Global: 2nd place; English: 2nd place)

mcgill.ca (Global: 2,445th place; English: 1,513th place)