Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions

This publication has 20 references indexed in Scilit:

• Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions
  Published by Springer Nature ,2001
• Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
  Published by Springer Nature ,2001
• Zero Knowledge Proofs of Knowledge in Two Rounds
  Published by Springer Nature ,2001
• On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs
  Published by Springer Nature ,2001
• On Defining Proofs of Knowledge
  Published by Springer Nature ,2001
• Robust efficient distributed RSA-key generation
  Published by Association for Computing Machinery (ACM) ,1998
• Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?
  Published by Springer Nature ,1998
• Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function
  Published by Springer Nature ,1997
• Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
  Published by Association for Computing Machinery (ACM) ,1996
• Perfect zero-knowledge in constant rounds
  Published by Association for Computing Machinery (ACM) ,1990