Everything Provable is Provable in Zero-Knowledge

This publication has 20 references indexed in Scilit:

• The Notion of Security for Probabilistic Cryptosystems
  SIAM Journal on Computing, 1988
• Interactive proof systems: Provers that never fail and random selection
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• On the cunning power of cheating verifiers: Some observations about zero knowledge proofs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Recognizing primes in random polynomial time
  Published by Association for Computing Machinery (ACM) ,1987
• The complexity of perfect zero-knowledge
  Published by Association for Computing Machinery (ACM) ,1987
• 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
• One-way functions and pseudorandom generators
  Published by Association for Computing Machinery (ACM) ,1985
• Probabilistic encryption
  Journal of Computer and System Sciences, 1984