Abstract
Gennaro, Krawczyk and Rabin gave the first undeniable signature scheme based on RSA signatures. However, their solution required the use of RSA moduli which are a product of safe primes. This paper gives techniques which allow RSA-based undeniable signatures for general moduli.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bellare, M. and Rogaway, P. The exact security of digital signatures-How to sign RSA and Rabin, in U. Maurer (ed.), EUROCRYPT’ 96, Springer LNCS 1070 (1996) 399–416.
Boyar, J., Chaum, C., Damgård, I. and Pedersen, T. Convertible undeniable signatures, in A.J. Menezes and S.A. Vanstone (eds.), CRYPTO’ 90, Springer LNCS 537, Springer (1991) 189–205.
Boyd, C. and Foo, E. Off-line fair payment protocols using convertible signatures, in K. Ohta et al (eds.), ASIACRYPT’ 98, Springer LNCS 1514 (1998) 271–285.
Camenisch J. and Michels, M. Proving in zero-knowledge that a number is the product of two safe primes, in J. Stern (ed.), EUROCRYPT’ 99, Springer LNCS 1592 (1999) 106–121.
Camenisch, J. and Michels, M. Confirmer signature schemes secure against adaptive adversaries, in B. Preneel (ed.), EUROCRYPT 2000, Springer LNCS 1870 (2000) 243–258.
Catalano, D., Gennaro, R. and Halevi, S. Computing inverses over a shared secret modulus, in B. Preneel (ed.), EUROCRYPT 2000, Springer LNCS 1807 (2000) 190–206.
Chaum, D. and van Antwerpen, H. Undeniable signatures, in G. Brassard (ed.), CRYPTO’ 89, Springer LNCS 435 (1990) 212–216.
Chaum, D. Zero-knowledge undeniable signatures, in I.B. Damgård (ed.), CRYPTO’ 90, Springer LNCS 473 (1991) 458–464.
Chaum, D., van Heijst, E., and Pfitzmann, B, Cryptographically strong undeniable signatures, unconditionally secure for the signer, in J. Feigenbaum (ed.), CRYPTO’ 91, Springer LNCS 576, (1992) 470–484.
Chaum, D. and Pedersen, T. P. Wallet databases with observers, in E. Brickell (ed.), CRYPTO’ 92, Springer LNCS 740 (1993) 89–105.
Chaum, D. Designated confirmer signatures, in A. de Santis (ed.), EUROCRYPT’ 94, Springer LNCS 950 (1995) 86–91.
Damgård, I. and Pedersen, T. New convertible undeniable signature schemes, in U. Maurer (ed.) EUROCRYPT’ 96, Springer LNCS 1070 (1996) 372–386.
Damgård, I. and Koprowski, M. Practical threshold RSA signatures without a trusted dealer, in B. Pfitzmann (ed.), EUROCRYPT 2001, Springer LNCS 2045 (2001) 152–165.
Desmedt, Y., Frankel Y. and Yung, M. Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback, INFOCOM’ 92 (1992) 2045–2054.
Fouque, P.-A., Stern, J. Fully distributed threshold RSA under standard assumptions, in C. Boyd (ed.), ASIACRYPT 2001, Springer (2001).
Gennaro, R., Jerecki, S., Krawczyk, H. and Rabin, T. Robust and efficient sharing of RSA functions, in N. Koblitz (ed.), CRYPTO’ 96, Springer LNCS 1109 (1996) 157–172.
Gennaro, R., Miccianicio, D. and Rabin, T. An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products, 5th ACM Conference on Computer and Communications Security, October 1998.
Gennaro, R., Krawczyk, H. and Rabin, T. RSA-based undeniable signatures, in W. Fumy (ed.), CRYPTO ’97, Springer LNCS 1294 (1997) 132–149. Full version Journal of Cryptology (2000) 13:397-416.
van de Graaf, J. and Peralta, R. A simple and secure way to show that validity of your public key, in C. Pomerance (ed.), CRYPTO’ 87, Springer LNCS 293 (1988) 128–134.
Jakobsson, M., Sako, K. and Impagliazzo, R. Designated verifier proofs and their applications, in U. Maurer (ed.) EUROCRYPT’ 96, Springer LNCS 1070 (1996) 143–154.
Jakobsson, M. Efficient oblivious proofs of correct exponentiation, in B. Preneel (ed.), Communications and multimedia security, Kluwer (1999) 71–84.
Menezes, A.J., van Oorschot, P.C. and Vanstone, S.A. Handbook of Applied Cryptography, CRC Press, 1997.
Michels, M. and Stadler, M. Generic constructions for secure and efficient confirmer signature schemes, in K. Nyberg (ed.) EUROCRYPT’ 98, Springer LNCS 1403 (1998) 406–421.
Miyazaki, T. An improved scheme of the Gennaro-Krawczyk-Rabin undeniable signature system based on RSA, in D. Won (ed.), ICISC 2000, Springer LNCS 2015 (2001) 135–149.
Poupard, G. and Stern, J. Short proofs of knowledge for factoring, in PKC 2000, Springer LNCS 1751 (2000) 147–166.
Rabin., T. A simplified approach to threshold and proactive RSA, in H. Krawczyk (ed.), CRYPTO’ 98, Springer LNCS 1462 (1998) 89–104.
Rivest, R.L., Shamir, A. and Adleman, L.M. A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM v.21, n.2, 1978, pages 120–126.
Shoup, V. Practical threshold signatures, in B. Preneel (ed.), EUROCRYPT 2000, Springer LNCS 1807 (2000) 207–220.
Silverman, R. D. Fast generation of random, strong RSA primes, CryptoBytes, 3, No. 1, 1997, pp. 9–13.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galbraith, S.D., Mao, W., Paterson, K.G. (2002). RSA-Based Undeniable Signatures for General Moduli. In: Preneel, B. (eds) Topics in Cryptology — CT-RSA 2002. CT-RSA 2002. Lecture Notes in Computer Science, vol 2271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45760-7_14
Download citation
DOI: https://doi.org/10.1007/3-540-45760-7_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43224-1
Online ISBN: 978-3-540-45760-2
eBook Packages: Springer Book Archive