Abstract
Traditionally, the strongest notion of security for undeniable and confirmer signatures is invisibility under adaptive attacks. This security property was promoted by Camenisch and Michels and they provided schemes with this property. Gennaro, Krawczyk and Rabin (GKR) developed an RSA-based scheme which is much more efficient than the schemes of Camenisch and Michels, but it does not have invisibility. We give an RSA-based scheme which is as efficient as the GKR scheme, and which has invisibility.
We suggest that anonymity is the most relevant security property for undeniable and confirmer signatures. We give a precise definition of anonymity for undeniable and confirmer signatures in the multi-user setting and show that anonymity and invisibility are closely related. Finally, we show that anonymity can be achieved even when the parties use completely different cryptographic primitives.
This author thanks Hewlett-Packard Laboratories, Bristol and the EPSRC for support.
This author’s research is partially funded by the EU Fifth Framework Project IST- 2001-324467 “CASENET”.
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, The exact security of digital signatures-how to sign with RSA and Rabin, in U. Maurer (ed.), EUROCRYPT’ 96, Springer LNCS 1070, (1996) 399–416. 88, 89
M. Bellare, A. Boldyreva, A. Desai and D. Pointcheval, Key-privacy in public key encryption, in C. Boyd (ed.) ASIACRYPT 2001, Springer LNCS 2248 (2001) 566–582. 81, 88
J. Camenisch and M. Michels, Confirmer signature schemes secure against adaptive adversaries, in B. Preneel (ed.), EUROCRYPT 2000, Springer LNCS 1870 (2000) 243–258. 81, 82, 84, 86, 93
D. Chaum and H. van Antwerpen, Undeniable signatures, in G. Brassard (ed.), CRYPTO’ 89, Springer LNCS 435 (1990) 212–216. 80, 82
D. Chaum, Zero-knowledge undeniable signatures, in I.B. Damgaard (ed.), CRYPTO’ 90, Springer LNCS 473 (1991) 458–464. 80, 82
D. Chaum, E. van Heijst and B. Pfitzmann, Cryptographically strong undeniable signatures, unconditionally secure for the signer, in J. Feigenbaum (ed.), CRYPTO’ 91, Springer LNCS 576 (1992) 470–484. 81
D. Chaum, Designated confirmer signatures, in A. de Santis (ed.), EUROCRYPT 94, Springer LNCS 950 (1995) 86–91. 80, 82
Y. Desmedt, Securing traceability of ciphertexts: Towards a secure software escrow scheme, in Guillou et al. (eds.), EUROCRYPT’ 95, Springer LNCS 921 (1995) 147–157. 88
S.D. Galbraith, W. Mao, and K.G. Paterson, RSA-based undeniable signatures for general moduli, in B. Preneel (ed.), Topics in Cryptology-CT-RSA 2002, Springer LNCS 2271 (2002) 200–217. 81, 82, 87, 89, 97
R. Gennaro, H. Krawczyk and T. Rabin, RSA-based undeniable signatures, in W. Fumy (ed.), CRYPTO’ 97, Springer LNCS 1294 (1997) 132–149. 81, 82, 87, 97 Also in Journal of Cryptology (2000)13:397–416.
M. Jakobsson, K. Sako and R. Impagliazzo, Designated verifier proofs and their applications, in U. Maurer (ed.) EUROCRYPT’ 96, Springer LNCS 1070 (1996) 143–154. 82, 90
M. Jakobsson, Efficient oblivious proofs of correct exponentiation, in B. Preneel (ed.), Communications and multimedia security, Kluwer (1999) 71–84. 90
M. Michels and M. Stadler, Generic constructions for secure and efficient confirmer signature schemes, in K. Nyberg (ed.) EUROCRYPT’ 98, Springer LNCS 1403 (1998) 406–421. 82
T. Okamoto, Designated confirmer signatures and public key encryption are equivalent, in Y. G. Desmedt (ed.), CRYPTO’ 94, Springer LNCS 839 (1994) 61–74. 81
T. Okamoto and D. Pointcheval, The Gap-problems: a new class of problems for the security of cryptographic schemes, in K. Kim (ed.) PKC’ 2001, Springer LNCS 1992( 2001) 104–118. 96
K. Sakurai and S. Miyazaki, A bulletin-board based digital auction scheme with bidding down strategy-towards anonymous electronic bidding without anonymous channels nor trusted centers, In Proc. International Workshop on Cryptographic Techniques and E-Commerce, City University of Hong Kong Press, (1999) 180–187. 80
K. Sakurai and S. Miyazaki, An anonymous electronic bidding protocol based on a new convertible group signature scheme, in E. Dawson et al. (eds.), ACISP 2000, Springer LNCS 1841 (2000) 385–399. 80
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
Galbraith, S.D., Mao, W. (2003). Invisibility and Anonymity of Undeniable and Confirmer Signatures. In: Joye, M. (eds) Topics in Cryptology — CT-RSA 2003. CT-RSA 2003. Lecture Notes in Computer Science, vol 2612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36563-X_6
Download citation
DOI: https://doi.org/10.1007/3-540-36563-X_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00847-7
Online ISBN: 978-3-540-36563-1
eBook Packages: Springer Book Archive