Abstract
We propose a threshold RSA scheme which is as efficient as the fastest previous threshold RSA scheme (by Shoup), but where two assumptions needed in Shoup's and in previous schemes can be dropped, namely that the modulus must be a product of safe primes and that a trusted dealer generates the keys. The robustness (but not the unforgeability) of our scheme depends on a new intractability assumption, in addition to security of the underlying standard RSA scheme.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Basic Research in Computer Science, Centre of the Danish National Research Foundation.
Download to read the full chapter text
Chapter PDF
References
D. Boneh and M. Franklin Efficient generation of shared RSA keys, Proc. of Crypto'97, Springer-Verlag LNCS series, nr. 1233.
R. Canetti, Security and Composition of Multiparty Cryptographic Protocols, Journal of Cryptology, vol.13, 2000. On-line version at http://philby.ucsd.edu/cryptolib/1998/98-18.html.
R. Canetti, A unified framework for analyzing security of protocols, Cryptology Eprint archive 2000/67, http://eprint.iacr.org/2000/067.ps
Damgård and Jurik: A Generalization and some Applications of Paillier’s Probabilistic Public-key System, to appear in Public Key Cryptography 2001.
Yair Frankel, Peter Gemmell, Philip D. MacKenzie and Moti Yung Optimal-Resilience Proactive Public-Key Cryptosystems Proc. of FOCS 97.
Yair Frankel, Philip D. MacKenzie and Moti Yung Robust Efficient Distributed RSA-Key Generation, Proc. of STOC 98.
P. Fouque, G. Poupard, J. Stern: Sharing Decryption in the Context of Voting or Lotteries, Proceedings of Financial Crypto 2000.
Pierre-Alain Fouque and Jacques Stern: Fully Distributed Threshold RSA under Standard Assumptions, IACR Cryptology ePrint Archive: Report 2001/008, February 2001
Gennaro, Jarecki, Krawczyk and Rabin: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Proc. of EuroCrypt 99, Springer Verlag LNCS series, nr. 1592.
Gennaro, Rabin, Jarecki and Krawczyk: Robust and Efficient Sharing of RSA Functions, J.Crypt. vol.13, no.2.
Shingo Miyazaki, Kouichi Sakurai and Moti Yung On Threshold RSA-Signing with no Dealer, Proc. of ICISC 1999, Springer Verlag LNCS series, nr.1787.
P. Pallier: Public-Key Cryptosystems based on Composite Degree Residue Classes, Proceedings of EuroCrypt 99, Springer Verlag LNCS series, pp. 223–238.
Pedersen: A Threshold cryptosystem without a trusted third party, proc. of Euro-Crypt 91, Springer Verlag LNCS nr. 547.
T. Rabin: A Simplified Approach to Threshold and Proactive RSA, proc. of Crypto 98, Springer Verlag LNCS 1462.
J. B. Rosser and L. Schoenfeld: Approximate formulas for some functions of prime numbers, Ill. J. Math. 6 (1962), 64–94.
Victor Shoup Practical Threshold Signatures, Proceedings of EuroCrypt 2000, Springer Verlag LNCS series nr. 1807.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damgård, I., Koprowski, M. (2001). Practical Threshold RSA Signatures without a Trusted Dealer. In: Pfitzmann, B. (eds) Advances in Cryptology — EUROCRYPT 2001. EUROCRYPT 2001. Lecture Notes in Computer Science, vol 2045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44987-6_10
Download citation
DOI: https://doi.org/10.1007/3-540-44987-6_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42070-5
Online ISBN: 978-3-540-44987-4
eBook Packages: Springer Book Archive