Making zero-knowledge provers efficient
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The random oracle hypothesis is false
Journal of Computer and System Sciences
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Small PCPs with Low Query Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
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
Computational Complexity and Mathematical Proofs
Informatics - 10 Years Back. 10 Years Ahead.
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
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Communications of the ACM
Separating succinct non-interactive arguments from all falsifiable assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
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
Guest column: algebraic construction of projection PCPs
ACM SIGACT News
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.02 |
An algebraic technique for the construction of interactive proof systems is proposed. The technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. For the proof, a method is developed for reducing the problem of verifying the value of a low-degree polynomial at two points to verifying the value at one new point. The results have implications for program checking, verification, and self-correction.