Proof verification and hardness of approximation problems. Proc. 33rd. IEEE Conference on Foundation of Computer Science, 1992, pp. 14-23.,
Probabilistic checking of proofs. Proc. 33rd. IEEE Conference on Foundation of Computer Science, 1992, pp. 2-13. and
and and and
Checking Computation in Polylogarithmic Time. Proc. of STOC91.
and JCSS 1988. A preliminary version due to the first author, “Trading Group Theory for Randomness,” appeared in Proc. 17th Annual Symposium on Theory of Computing, 1985, pp. 421-429.
Multi Prover Interactive Proofs: How to Remove Intractability. Proc. 20th ACM Symp. on Theory of Computing, 1988, pp. 113-131. and and and
SIAM J. on Comp. 1991.,
Non-Interactive Zero-Knowledge Proof Systems and Applications.
Designing Programs that check their work. Proc. 21st Symposium on Theory of Computing, 1989, pp. 86-97. and
Self-Testing and Self-Correcting Programs, With Applications to Numerical Problems. Proc. 22nd ACM Symp. on Theory of Computing, 1990, pp. 73-83., and
How to Generate Cryptographically-Strong Sequences of Pseudo-Random Bits.
SIAM J. on Comp. vol 13, 1984
Minimum Disclosure Proofs of Knowledge.
J. Comput. System Sci., 37, 1988, pp. 156-189. and and
The Complexity of Theorem Proving Procedures. Proc. 3rd Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.
Approximating Clique is Almost NP-complete. 32nd FOCS, 1991, pp. 2-12. and and and and
How to Prove Yourselves: Practical Solutions of Identification and Signature Problems. Proc. Crypto 86, Springer-Verlag, 263, 1987, pp. 186-194. and
The Complexity of Perfect Zero Knowledge.
Randomness and Computation, Advances in Computer Research, ed.
JAI Press, 1989, pp. 327-344.
On the Power of Multi-Prover Interactive Protocols. Proc. 3rd Structure in Complexity Theory Conf., 1988, pp. 151-158., and
How To Construct Random Functions.
J. of ACM
The Knowledge Complexity of Interactive Proof Systems.
SIAM J. Comput., 18, 1989, pp. 186-208. An earlier version of this result informally introducing the notion of a proof of knowledge appeared in Proc. 17th Annual Symposium on Theory of Computing, 1985, pp. 291-304. (Earlier yet versions include “Knowledge Complexity,” submitted to the 25th Annual Symposium on the Foundations of Computer Science, 1984.) and and
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM J. Comput., Vol 17, No. 2, April 1988, pp. 281-308. (A preliminary version of this article appeared with the title “A paradoxical solution to the signature problem” in Proc. of 25th Annual IEEE Symposium on the Foundations of Computer Science, FL, November 1984, pp. 464-479.), and
Proofs that Yield Nothing But Their Validity or All Languages in have Zero-Knowledge Proof Systems.
J. of the ACM, Vol 38, No. 1, July 1991, pp. 691-729. (A preliminary version of this paper, under the title “Proofs that yield nothing but their validity and a methodology for cryptographic protocol design,” appeared in Proc. 27th Annual Symposium on Foundations of Computer Science, IEEE, New York, 1986, pp. 174-187.), and
Reducibility among combinatorial problems.
Complexity of Computer Computations, and eds., Plenum, New York, 1972, pp. 85-103.
A Note on Efficient Zero-Knowledge Proofs and Arguments.
Proc. 24th Ann. Symp. on Theory of Computing, Victoria, Canada, 1992.
Pseudo-Random Generation under uniform Assumptions.
Pseudo-Random Generation From one-way functions.
Universal Sequential Search Problems.
Problems Inform. Transmission, Vol. 9, No. 3, 1973, pp. 265-266.
Algebraic Methods for Interactive Proof Systems.
Proc. 22nd STOC, 1990. and and and
A Certified Digital Signature. Proc. Crypto 1989. Springer Verlag, 1990.
1994, pp. (An earlier version of this paper appeared as Technical Memo MIT/LCS/TM-510. Earlier yet versions were submitted to the 25th Annual Symposium on Theory of Computing, 1993, and the 34th Annual Symposium on Foundations of Computer Science, 1993.)
CS Proofs. Proc. 35th Annual Symposium on Foundations of Computer Science,
1992., Private Communication to Shan Goldwasser,
Nearly-linear Size Holographic Proofs. Proc. STOC
Digitalized Signatures, in Foundations of Secure Computation, Academic Press, 1978, pp. 155-168.
Digitalized Signatures as Intractable as Factorization. MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-212, Massachusetts Institute of Technology, Cambridge, MA, January 1979.
Probabilistic algorithms for testing primality.
J. Number Theory, Vol. 12, 1980, pp. 128-138.
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.
Comm. ACM, Vol. 21, 1978, pp. 120-126., and
The MD5 Message-Digest Algorithm. Internet Activities Board, Request for Comments 1321, April
Secure Hash Standard. Federal Information Processing Standards, Publication 180, 1993.
IP = PSPACE. Proc. 31st IEEE Foundation of Computer Science Conference, 1990, pp. 11-15.
A fast Monte-Carlo test for primality.
SIAM J. Comp., Vol. 6, 1977, pp. 84-85. and
Efficient checking of polynomials and proofs and the hardness of approximation problems. Ph.D. Thesis, University of California at Berkeley, 1992.
Theory and Applications of Trap-Door Functions. Proc. 23rd IEEE on Foundations of Computer Science,