Fast Three-Party Shared Generation of RSA Keys without Distributed Primality Tests

Fast Three-Party Shared Generation of RSA Keys without Distributed Primality Tests (2004)

Cached

Download Links

by Maged H. Ibrahim , I. I. Ibrahim , A. H. El-Sawy

Venue:	in Proceedings of the Information Systems: New Generations (ISNG’04
Citations:	4 - 4 self

BibTeX

@INPROCEEDINGS{Ibrahim04fastthree-party,
    author = {Maged H. Ibrahim and I. I. Ibrahim and A. H. El-Sawy},
    title = {Fast Three-Party Shared Generation of RSA Keys without Distributed Primality Tests},
    booktitle = {in Proceedings of the Information Systems: New Generations (ISNG’04},
    year = {2004},
    pages = {7--12}
}

Bookmark

OpenURL

Abstract

factors of the jointly generated RSA modulus were always considered as a nightmare due to the large amount of time required for this test to succeed. Enormous number of trials must be performed before a suitable RSA modulus is established. In this paper we propose a protocol to allow three parties to share the generation of a RSA modulus N and to share the secret key d. The protocol enjoys the following properties which do not exist in previous protocols: .

Citations

574	A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation - Ben-Or, Goldwasser, et al. - 1988
347	Private information retrieval - Chor, Goldreich, et al. - 1998
258	How to exchange secrets by oblivious transfer - Rabin - 1981
231	Threshold Cryptosystems - Desmedt, Frankel - 1989
187	Computationally private information retrieval with polylogarithmic communication - Cachin, Micali, et al. - 1999
174	Oblivious transfer and polynomial evaluation - Naor, Pinkas - 1999
113	Cryptanalysis of short RSA secret exponents - Wiener - 1990
112	Efficient generation of shared rsa keys - Boneh, Franklin
110	Robust threshold DSS signatures - Gennaro, Jarecki, et al. - 2010
108	The development of the number field sieve - Lenstra, Lenstra - 1993
93	Society and group oriented cryptography: A new concept - Desmedt - 1988
44	Robust Efficient Distributed RSA-Key Generation - Frankel, MacKenzie, et al. - 1998
37	A new efficient all-or-nothing disclosure of secrets protocol - Stern - 1998
28	Parallel Reliable Threshold Multi-signature - Frankel, Desmedt - 1992
26	Computing inverses over a shared secret modulus - Catalano, Gennaro, et al. - 2000
25	Threshold cryptography,” European Trans - Desmedt - 1994
25	Two party rsa key generation - Gilboa - 1999
20	Threshold DSS signatures without a trusted party - Langford - 1996
19	Generation of shared rsa keys by two parties - Poupard, Stern - 1998
18	Single-database computationally private information retrieval - Kushilevita, Ostrovsky - 1997
16	Theory and practice of verifiable secret sharing - Gennaro - 1995
12	Split knowledge generation of RSA parameters - Cocks - 1997
11	Split Generation of RSA Parameters with Multiple Participants - Cocks
7	Shared generation of shared RSA keys - Blackburn, Blake-Wilson, et al. - 1998
6	Generating a Product of Three Primes with an Unknown Factorization - Boneh, Horwitz - 1998
5	Protecting data privacy in information retrieval schemes - Gertner, Ishai, et al. - 1998
4	Efficient two party multi-prime rsa key generation - Straub
3	The Chinese Remainder Theorem and its Application in a High-Speed RSA Crypto Chip,in - Grobschadl
2	Fully Distributed and Robust Threshold RSA Function Sharing Efficient for Small Number of Players”, Embedded Cryptographic Hardware - Ibrahim, Ali, et al.