Abstract
In undeniable signature, a signature can only be verified with cooperation of the signer. If the signer refuses to cooperate, it is infeasible to check the validity of a signature. This problem is eliminated in confirmer signature schemes where the verification capacity is given to a confirmer rather than the signer. In this paper, we present a variation of confirmer signature, called undeniable confirmer signature in that both the signer and a confirmer can verify the validity of a signature. The scheme provides a better flexibility for the signer and the user as well as reduces the involvement of designated confirmers, who are usually trusted in practice. Furthermore, we show that our scheme is divertible, i.e., our signature can be blindly issued. This is essential in some applications such as subscription payment system, which is also shown.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Bellare and P. Rogaway, “Random Oracles are practical: a paradigm for designing efficient protocols”, Proc. 1st ACM Conference on Computer and Communications Security, ACM Press, 1993, pp. 62–73.
J. Boyar, D. Chaum, I. Damgåar and T. Pedersen, “Convertible undeniable signatures”, Proc. of Crypto’90, Springer-Verlag, 1991, pp. 189–205.
J. Camenisch and M. Stadler, “Efficient group signature schemes for large groups”, Proc. of Crypto’97, Springer-Verlag 1997, pp. 410–424.
D. Chaum and H. van Antwerpen, “Undeniable signatures”, Proceedings of Crypto’89, Springer-Verlag, 1990, pp. 212–216.
D. Chaum, “Zero-knowledge undeniable signatures”, Proceedings of Eurocrypt’90, Springer-Verlag, 1991, pp. 458–464.
D. Chaum, “Designated confirmer signatures”, Proc. of Eurocrypt’94, Springer-Verlag, 1995, pp.86–91.
D. Chaum and T. Pedersen, “Wallet databases with observers”, Proc. of Crypto’92, Springer-Verlag, 1993, pp. 89–105.
L. Chen, “Efficient fair exchange with verifiable confirmation of signature” in Proceedings of Asiacrypt’98, Springer-Verlag, 1998, pp. 286–298.
I. Damgård and T. Pedersen, “New convertible undeniable signature schemes”, Proceedings of Eurocrypt’96, Springer-Verlag, 1996, pp. 372–386.
A. Fujioka, T. Okamoto and K. Ohta, “Interactive bi-proof systems and undeniable signature schemes”, Proc. of Eurocrypt’91, Springer-Verlag, 1992, pp. 243–256.
R. Gennaro, H. Krawczyk and T. Rabin, “RSA-based undeniable signatures”, Proc. of Crypto’97, Springer-Verlag, 1997, pp. 132–149.
O. Goldreich, S. Micali and A. Wigderson, “Proofs that yield nothing but their validity and a methodology of cryptographic protocol design”, Proceedings of IEEE 27th Annual Symposium on Foundations of Computer Science, pp. 174–187, 1986.
S. Goldwasser, S. Micali and R. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks”, SIAM J. Computing, 17(2):281–308, April 1988.
M. Michels and M. Stadler, “Efficient convertible undeniable signature schemes”, Proc. of 4th Annual Workshop on Selected Areas in Cryptology(SAC’97), 1997, pp. 231–243.
M. Michels and M. Stadler, “Generic constructions for secure and efficient confirmer signature Schemes”, Proceedings of Eurocrypt’98, Springer-Verlag, 1998, pp.405–421.
T. Okamoto, “Designated confirmer signatures and public key encryption”, Proceedings of Crypto’94, LNCS 839, Springer-Verlag, 1994, pp. 61–74.
T. Okamoto and K. Ohta, “Divertible zero-knowledge interactive proofs and commutative random self-reducibility”, Proceedings of Eurocrypt’89, Springer-Verlag, 1990, pp. 134–149.
D. Pointcheval and J. Stern, “Security proofs for signature schemes”, Proceedings of Eurocrypt’96, Springer-Verlag, 1996, pp. 387–398.
C. Rackoff and D. Simon, “Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack”, Proceedings of Crypto’91, Springer-Verlag, 1991, pp. 433–444.
C. Schnorr, “Efficient identification and signatures for smart cards”, Proc. of Crypto’89, Springer-Verlag, 1990, pp. 239–252.
M. Stadler, “Cryptographic Protocols for Revocable Privacy”, Ph.D Thesis, Swiss Federal Institute of Technology, Zurich, 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, K., Mu, Y., Varadharajan, V. (1999). Undeniable Confirmer Signature. In: Information Security. ISW 1999. Lecture Notes in Computer Science, vol 1729. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47790-X_20
Download citation
DOI: https://doi.org/10.1007/3-540-47790-X_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66695-0
Online ISBN: 978-3-540-47790-7
eBook Packages: Springer Book Archive