Zero-Knowledge Simulation of Boolean Circuits

This publication has 14 references indexed in Scilit:

• A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
  IEEE Transactions on Information Theory, 1986
• Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• Almost all primes can be quickly certified
  Published by Association for Computing Machinery (ACM) ,1986
• Trading group theory for randomness
  Published by Association for Computing Machinery (ACM) ,1985
• The knowledge complexity of interactive proof-systems
  Published by Association for Computing Machinery (ACM) ,1985
• A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Probabilistic encryption
  Journal of Computer and System Sciences, 1984
• A method for obtaining digital signatures and public-key cryptosystems
  Communications of the ACM, 1978
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• Every Prime Has a Succinct Certificate
  SIAM Journal on Computing, 1975