A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm

This publication has 24 references indexed in Scilit:

• An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
  Published by Springer Nature ,2000
• Everything Provable is Provable in Zero-Knowledge
  Published by Springer Nature ,1990
• Minimum disclosure proofs of knowledge
  Journal of Computer and System Sciences, 1988
• Perfect zero-knowledge languages can be recognized in two rounds
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Does co-NP have short interactive proofs?
  Information Processing Letters, 1987
• Demonstrating Possession of a Discrete Logarithm Without Revealing it
  Published by Springer Nature ,1987
• The complexity of perfect zero-knowledge
  Published by Association for Computing Machinery (ACM) ,1987
• A randomized protocol for signing contracts
  Communications of the ACM, 1985
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
  SIAM Journal on Computing, 1984
• The complexity of promise problems with applications to public-key cryptography
  Information and Control, 1984