Efficient and Non-interactive Non-malleable Commitment

This publication has 9 references indexed in Scilit:

• Efficient Non-malleable Commitment Schemes
  Published by Springer Nature ,2000
• Nonmalleable Cryptography
  SIAM Journal on Computing, 2000
• The Foundations of Modern Cryptography
  Published by Springer Nature ,1999
• Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
  Journal of Cryptology, 1998
• Fair games against an all-powerful adversary
  Published by American Mathematical Society (AMS) ,1993
• Noninteractive Zero-Knowledge
  SIAM Journal on Computing, 1991
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
  Journal of the ACM, 1991
• Bit commitment using pseudorandomness
  Journal of Cryptology, 1991
• A randomized protocol for signing contracts
  Communications of the ACM, 1985