Advertisement

Undeniable Signatures

  • David Chaum
  • Hans van Antwerpen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 435)

Abstract

Digital signatures [DH]—unlike handwritten signatures and banknote printing—are easily copied exactly. This property can be advantageous for some uses, such as dissemination of announcements and public keys, where the more copies distributed the better. But it is unsuitable for many other applications. Consider electronic replacements for all the written or oral commitments that are to some extent personally or commercially sensitive. In such cases the proliferation of certified copies could facilitate improper uses like blackmail or industrial espionage. The recipient of such a commitment should of course be able to ensure that the issuer cannot later disavow it—but the recipient should also be unable to show the commitment to anyone else without the issuer’s consent.

References

  1. [BCC]
    Brassard, G., D. Chaum, and C. Crépeau, “Minimum disclosure proofs of knowledge,” Journal of Computer and System Sciences, vol. 37, 1988, pp. 156–189.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [C]
    Chaum, D., “Blinding for unanticipated signatures,” Advances in Cryptology—EUROCRYPT’ 87, D. Chaum & W.L. Price Eds., Springer Verlag, 1987, pp. 227–233.Google Scholar
  3. [CE]
    Chaum, D. and J.-H. Evertse, “A secure and privacy-protecting protocol for transmitting personal information between organizations,” Advances in Cryptology—CRYPTO’ 86, A.M. Odlyzko Ed., Springer Verlag, 1987, pp. 118–167.Google Scholar
  4. [DH]
    Diffie, W. and M.E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, Vol. IT-22, 1976, pp. 644–654.CrossRefMathSciNetGoogle Scholar
  5. [EG]
    ElGamal, T., “A public key cryptosystem and a signature scheme based on discrete logarithm,” IEEE Transactions on Information Theory, vol. IT-31, 1985, pp. 469–472.CrossRefMathSciNetGoogle Scholar
  6. [PH]
    Pohlig, S. and M.E. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance,” IEEE Transactions on Information Theory, vol. IT-24, 1978, pp. 106–110.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • David Chaum
    • 1
  • Hans van Antwerpen
    • 1
  1. 1.Centre for Mathematics and Computer ScienceAmsterdam

Personalised recommendations