Abstract
Group undeniable signatures are like ordinary group signatures except that verifying signatures needs the help of the group manager. In this paper, we propose a convertible group undeniable signature scheme in which the group manager can turn all or selective signatures, which are originally group undeniable signatures, into ordinary group signatures without compromising security of the secret key needed to generate signatures. The proposed scheme also allows the group manager to delegate the ability to confirm and deny to a limited set of parties without providing them the capability of generating signatures. For business applications, convertible group undeniable signatures can be widely used to validate price lists, press release or digital contracts when the signatures are commercially sensitive or valuable to a competitor. Our scheme is unforgeable, signature-simulatable and coalition-resistant. The confirmation and denial protocols are also zero-knowledge. Furthermore, the time, space and communication complexity are independent of the group size.
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.
Similar content being viewed by others
References
M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. 1st ACM Conference on Computer and Communications Security, pages 62–73, 1993. 49
J. Boyar, D. Chaum, I. Damgård, and T. Pedersen. Convertible undeniable signatures. In Advances in Cryptology-CRYPTO’ 90, pages 189–205, 1990. 48, 49
J. Camenisch and M. Stadler. Efficient group signature schemes for large groups (extended abstract). In Advances in Cryptology-CRYPTO’ 97, pages 410–424, 1997. 49
D. Chaum. Zero-knowledge undeniable signatures (extended abstract). In Advances in Cryptology-EUROCRYPT 90, pages 458–464, 1990. 49, 56, 57
D. Chaum and H. van Antwerpen. Undeniable signatures. In Advances in Cryptology-CRYPTO’ 89, pages 212–216, 1989. 48
D. Chaum and E. van Heyst. Group signatures. In Advances in Cryptology-EUROCRYPT 91, pages 257–265, 1991. 49
I. Damgård and T. Pedersen. New convertible undeniable signature schemes. In Advances in Cryptology-EUROCRYPT 96, pages 372–386, 1996. 49
S. J. Kim, S. J. Park and D. H. Won. Convertible group signatures. In Advances in Cryptology-ASIACRYPT 96, pages 311–321, 1996.
M. Michels and M. Stadler. Efficient convertible undeniable signature schemes. In Proc. 4th Workshop on Selected Areas in Cryptography (SAC’ 97), pages 231–244, 1997. 49
D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361–396, 2000. 54
K.H. Rosen. Elementary Number Theory and its Applications (Third Edition). Addison Wesley, 1993. 51
H. N. Shapiro. Introduction to the Theory of Numbers. John Wiley & Sons, 1983. 51
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lyuu, YD., Wu, ML. (2003). Convertible Group Undeniable Signatures. In: Lee, P.J., Lim, C.H. (eds) Information Security and Cryptology — ICISC 2002. ICISC 2002. Lecture Notes in Computer Science, vol 2587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36552-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-36552-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00716-6
Online ISBN: 978-3-540-36552-5
eBook Packages: Springer Book Archive