Making zero-knowledge provers efficient
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Security with Low Communication Overhead
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract)
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Interactive Proofs with Space Bounded Provers
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Low Communication 2-Prover Zero-Knowledge Proofs for NP
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Improved Efficient Arguments (Preliminary Version)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Primality and Identity Testing via Chinese Remaindering
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Limitations of Hardness vs. Randomness under Uniform Reductions
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Interactive locking, zero-knowledge PCPs, and unconditional cryptography
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On the role of shared entanglement
Quantum Information & Computation
Efficient probabilistically checkable debates
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On efficient zero-knowledge PCPs
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Languages with efficient zero-knowledge PCPs are in SZK
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Delegation of computation with verification outsourcing: curious verifiers
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
The exact power of two-prover interactive proof systems (MIP) introduced by M. Ben-Or et al. (Proc. 20th Symp. on Theory of Computing, 1988, p.113-31) is determined. In this system, two all-powerful noncommunicating provers convince a randomizing polynomial-time verifier in polynomial time that the input x belongs to the language L. It was previously suspected (and proved in a relativized sense) that coNP-complete languages do not admit such proof systems. In sharp contrast, it is shown that the class of languages having two-prover interactive proof systems is computable in nondeterministic exponential time (NEXP). This represents a further step demonstrating the unexpectedly immense power for randomization and interaction in efficient provability.