Constant-round perfect zero-knowledge computationally convincing protocols

This publication has 11 references indexed in Scilit:

• One-Way Group Actions
  Published by Springer Nature ,2001
• How convincing is your protocol?
  ACM SIGACT News, 1991
• A discrete logarithm implementation of perfect zero-knowledge blobs
  Journal of Cryptology, 1990
• The Knowledge Complexity of Interactive Proof Systems
  SIAM Journal on Computing, 1989
• Minimum disclosure proofs of knowledge
  Journal of Computer and System Sciences, 1988
• Zero-knowledge proofs of identity
  Journal of Cryptology, 1988
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
  SIAM Journal on Computing, 1984
• Experimental Realization of Einstein-Podolsky-Rosen-BohmGedankenexperiment: A New Violation of Bell's Inequalities
  Physical Review Letters, 1982
• An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
  IEEE Transactions on Information Theory, 1978
• A Mathematical Theory of Communication
  Bell System Technical Journal, 1948