Abstract
We present a protocol for two parties to generate an RSA key in a distributed manner. At the end of the protocol the public key: a modulus N = PQ, and an encryption exponent e are known to both parties. Individually, neither party obtains information about the decryption key d and the prime factors of N: P and Q. However, d is shared among the parties so that threshold decryption is possible.
Chapter PDF
Similar content being viewed by others
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.
References
M. Ben-OR, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proc. of 20th STOC, pages 1–10, 1988.
J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, 1987.
J. Benaloh. Dense probabilstic encryption. In Proc. of the Workshop on Selected Areas of Cryptography, pages 120–128, May 1994.
D. Boneh and M. Franklin. Efficient generation of shared rsa keys. In Proc. of Crypto 97, pages 425–439. Springer-Verlag, 1997. THe full version appears on the web at theory.stanford.edu/dabo/pubs.html.
C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In Advances in Cryptology-EUROCRYPT’ 99, 1999.
D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols(extended abstracts). In Proc. of 20th STOC, pages 11–19, 1988.
B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. of 36th FOCS, pages 41–50, 1995.
C. Cocks. Split knowledge generation of rsa parameters. In M. Darnell, editor, Cryptography and Coding, 6th IMA international conference, pages 89–95, December 1997. Appears on the web at http://www.cesg.gov.uk/downlds/math/rsa.pdf.
C. Cocks. Split generation of rsa parameters with multiple participants, 1998. Appears on the web at http://www.cesg.gov.uk/downlds/math/rsa2.pdf.
N. DeBruijn. On the number of uncancelled elements in the sieve of eratosthenes. Proc. Neder. Akad., 53:803–812, 1950. Reviewed in Leveque Reviews in Number Theory, Vol. 4, Section N-28, p. 221.
A. DeSantis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securly. In Proc. of STOC, pages 522–533, 1994.
Y. Desmedt. Threshold cryptography. European Transactions on Telecommunications and Related Technologies, 5(4):35–43, July-August 1994.
Y. Frankel, P. D. MacKenzie, and M. Yung. Robust efficient distributed rsa-key generation. In Proc. of 30th STOC, pages 663–672, 1998.
M. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table in o(1) worst case access time. Journal of the ACM, 31:538–544, 1984.
Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. In Proc. of 30th STOC, 1998.
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game (extended abstract). In Proc. of 19th STOC, pages 218–229, 1987.
S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and systems science, 28:270–299, 1984.
E. Kushilevitz and R. Ostrovsky. Single-database computationally private information retrieval. In Proc. of 38th FOCS, pages 364–373, 1997.
M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In Proc. of 31st STOC, pages 245–254, 1999.
Guillaume Poupard and Jacques Stern. Generation of shared rsa keys by two parties. In ASIACRYPT’98, pages 11–24. Springer-Verlag LNCS 1514, 1998.
Julien P. Stern. A new and efficient all-or-nothing disclosure of secrets protocol. In ASIACRYPT’98, pages 357–371. Springer-Verlag, 1998.
A.C. Yao. How to generate and exchange secrets. In Proc. of 27th FOCS. IEEE Press, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilboa, N. (1999). Two Party RSA Key Generation. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_8
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive