Fully Parallelized Multi-prover Protocols for NEXP-Time

The Knowledge Complexity of Interactive Proof Systems

Shafi Goldwasser, Silvio Micali, Charles Rackoff · SIAM Journal on Computing · 1989 · 3.3K citations

Computing, Computer Science, Mathematics +13

Trading group theory for randomness

László Babai · 1985 · 782 citations

Natural Sciences, Mathematics, Combinatorics +8

IP = PSPACE

Adi Shamir · Journal of the ACM · 1992 · 657 citations · Full text

Computing, Computer Science, Mathematics +14

Non-deterministic exponential time has two-prover interactive protocols

László Babai, Lance Fortnow, Carsten Lund · Computational Complexity · 1992 · 533 citations · Full text

Computing, Computer Science, Cryptography +3

Multi-prover interactive proofs: how to remove intractability

Michael Ben-Or, Shafi Goldwasser, Joe Kilian · 1988 · 484 citations

Computing, Computer Science, Mathematics +15