Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs

This publication has 13 references indexed in Scilit:

• One-way functions are essential for non-trivial zero-knowledge
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Interactive Hashing Simplifies Zero-Knowledge Protocol Design
  Published by Springer Nature ,2001
• Zero Knowledge Proofs of Knowledge in Two Rounds
  Published by Springer Nature ,2001
• Hashing Functions can Simplify Zero-Knowledge Protocol Design (too)
  BRICS Report Series, 1994
• The (true) complexity of statistical zero knowledge
  Published by Association for Computing Machinery (ACM) ,1990
• The Knowledge Complexity of Interactive Proof Systems
  SIAM Journal on Computing, 1989
• Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
  Published by Springer Nature ,1989
• Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• Private coins versus public coins in interactive proof systems
  Published by Association for Computing Machinery (ACM) ,1986
• Trading group theory for randomness
  Published by Association for Computing Machinery (ACM) ,1985