Zero Knowledge Proofs of Knowledge in Two Rounds

This publication has 12 references indexed in Scilit:

• The Knowledge Complexity of Interactive Proof Systems
  SIAM Journal on Computing, 1989
• A hard-core predicate for all one-way functions
  Published by Association for Computing Machinery (ACM) ,1989
• Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
  Published by Springer Nature ,1989
• Zero-knowledge proofs of identity
  Journal of Cryptology, 1988
• Non-interactive zero-knowledge and its applications
  Published by Association for Computing Machinery (ACM) ,1988
• Non-Interactive Zero-Knowledge Proof Systems
  Published by Springer Nature ,1988
• 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
• Every Prime Has a Succinct Certificate
  SIAM Journal on Computing, 1975
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971