Undeniable signatures are digital signatures that can be verified only by some help from the signer. These were introduced by Chaum and van Antwerpen [2]. Unlike an ordinary digital signature that can be verified by anyone who has accessed the public verifying key of the signer (universal verifiability), an undeniable signature can only be verified by engaging in a—usually interactive—protocol with the signer. The outcome of the protocol is an affirming or {rejecting} assertion telling the verifier whether the undeniable signature has originated from the alleged signer or not. The verifier cannot enforce a clarification about a signature's validity because a signer can always refuse to cooperate, but nonrepudiation is still guaranteed since a signer cannot convince a verifier that a correct signature is invalid or that an incorrect signature is valid.
Undeniable signatures are useful for signers of nonpublic sensitive information who seek to keep control over who can verify their...
References
Boyar, Joan, David Chaum, Ivan Damgård, and Torben Pedersen (1991). “Convertible undeniable signatures.” Advances in Cryptology—CRYPTO'90, Lecture Notes in Computer Science, vol. 537, eds. A.J. Menezes and S.A. Vanstone. Springer-Verlag, Berlin, 189–205.
Chaum, David and Hans van Antwerpen (1990). “Undeniable signatures.” Advances in Cryptology—CRYPTO'89, Lecture Notes in Computer Science, vol. 435, ed. G. Brassand. Springer- Verlag, Berlin, 212–216.
Chaum, David, Eugène van Heijst, and Birgit Pfitzmann (1990). “Cryptographically strong undeniable signatures, unconditionally secure for the signer.” Advances in Cryptology—CRYPTO'91, Lecture Notes in Computer Science, vol. 576, ed. J. Feigenbaum. Springer-Verlag, Berlin, 470–484.
Damgård, Ivan Bjerre and Torben P. Pedersen (1996). “New convertible undeniable signature schemes.” Advances in Cryptology—EUROCRYPT'96, Lecture Notes in Computer Science, vol. 1070, ed. U. Maurer. Springer-Verlag, Berlin, 372–386.
Gennaro, Rosario, Hugo Krawczyk, and Tal Rabin (1997). “RSA-based undeniable signatures.” Advances in Cryptology—CRYPTO'97, Lecture Notes in Computer Science, vol. 1294, ed. B.S. Kaliski. Springer-Verlag, Berlin, 132–149.
Harn, Lein and Shoubao Yang (1993). “Group-oriented undeniable signature schemes without the assistance of a mutually trusted party.” Advances in Cryptology—ASIACRYPT'92, Lecture Notes in Computer Science, vol. 718, eds. J. Sebermy and Y. Zheng. Springer-Verlag, Berlin, 133–142.
Jakobsson, Markus (1995). “Blackmailing using undeniable signatures.” Advances in Cryptology—EUROCRYPT'94, Lecture Notes in Computer Science, vol. 950, ed. A. De Santis. Springer-Verlag, Berlin, 425–427.
Jakobsson, Markus, Kazue Sako, and Russell, Impagliazzo (1996). “Designated verifier proofs and their applications.” Advances in Cryptology—EUROCRYPT'96, Lecture Notes in Computer Science, vol. 1070, ed. U. Maurer. Springer-Verlag, Berlin, 143–154.
Michels, Markus and Markus Stadler (1997). “Efficient convertible undeniable signature schemes.” International Workshop on Selected Areas in Cryptography (SAC'97). Springer-Verlag, Berlin, 231–244.
Pedersen, Pryds Torben (1991). “Distributed provers with applications to undeniable signatures (Extended abstract).” Advances in Cryptology—EUROCRYPT'91, Lecture Notes in Computer Science, vol. 547, ed. D.W. Davies. Springer-Verlag, Berlin, 221–242.
Sakurai, Kouichi and Yoshinori Yamane (1996). “Blind decoding, blind undeniable sigatures, and their applications to privacy protection.” Information Hiding (IHW'96), Lecture Notes in Computer Science, vol. 1174, ed. R. Anderson. Springer-Verlag, Berlin, 257–264.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this entry
Cite this entry
Bleumer, G. (2005). Undeniable Signatures. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_446
Download citation
DOI: https://doi.org/10.1007/0-387-23483-7_446
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23473-1
Online ISBN: 978-0-387-23483-0
eBook Packages: Computer ScienceReference Module Computer Science and Engineering