Brassard, G. and C. Crépeau, Zero-knowledge simulation of Boolean circuits, presented at Crypto’ 86, 1986.
Brassard, G. and C. Crépeau, Zero-knowledge simulation of Boolean circuits, Proc. of 27th Symp. on Foundations of Computer Science, 1986.
Brassard, G., Chaum D., and C. Crépeau, Minimum Disclosure Proofs of Knowledge. Center for Mathematics and Computer Science, Report PM-R8710, December 1987.
Chaum, D., Security without identification: transaction systems to make big brother obsolete, Comm. ACM 28,10 (October 1985).
Chaum, D., Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How, presented at Crypto’ 86, 1986.
Chaum, D., Privacy Protected Payments: Unconditional Payer And/Or Payee Untracability, Smartcard 2000, North Holland, 1988.
Chaum, D. and J.H. Evertse, Showing credentials without identification: signatures transferred between unconditionally unlinkable pseudonyms, Proceedings of Crypto’ 86, Springer-Verlag, 1987.
Chaum, D., I. Damgaard, and J. v.d. Graaf, Multiparty computations ensuring the privacy of each party’s input and the correctness of the result, Proceedings of Crypto 87, Springer-Verlag, 1988.
Goldwasser, S., S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, Proc. of 17th ACM symp. on Theory of Computation, 1985.
Goldreich, O., S. Micali, and A. Wigderson, How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design, presented at Crypto’ 86, 1986.
Goldreich, O., S. Micali, and A. Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, Proc. of 27th Symp. on Foundations of Computer Science, 1986.
Rabin, M.O., Digitalized signatures, in Foundations of Secure Computation, Academic Press, NY, 1978.Google Scholar
Rivest, R.L., A. Shamir, and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, CACM 21,2 (February 1978).