Divertible protocols and atomic proxy cryptography

This publication has 14 references indexed in Scilit:

• An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
  Published by Springer Nature ,2000
• Blind signatures based on the discrete logarithm problem
  Published by Springer Nature ,1995
• All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions
  Published by Springer Nature ,1991
• The Knowledge Complexity of Interactive Proof Systems
  SIAM Journal on Computing, 1989
• Zero-knowledge proofs of identity
  Journal of Cryptology, 1988
• A public key cryptosystem and a signature scheme based on discrete logarithms
  IEEE Transactions on Information Theory, 1985
• A FURTHER WEAKNESS IN THE COMMON MODULUS PROTOCOL FOR THE RSA CRYPTOALGORITHM
  Cryptologia, 1984
• A “WEAK” PRIVACY PROTOCOL USING THE RSA CRYPTO ALGORITHM
  Cryptologia, 1983
• A method for obtaining digital signatures and public-key cryptosystems
  Communications of the ACM, 1978
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976