Experimental performance of shared RSA modulus generation

Algorithmica (New York)

Volumn 33, Issue 1, 2002, Pages 89-103

  Wright, R N ^a   Spalding, S ^b  

^a AT AND T LABS RESEARCH   (United States)

^b INDIANA UNIVERSITY   (United States)

Author keywords

Distributed computation; Public key cryptography; Secure multiparty computation

Indexed keywords

COMPUTATIONAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION DISSEMINATION; NETWORK PROTOCOLS;

DISTRIBUTED COMPUTATION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0141922685     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0106-7     Document Type: Article

References (21)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computing. In Proc. 20th ACM Symposium on the Theory of Computing, 1988.
2. D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In Advances in Cryptology - CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 424-439. Springer-Verlag, Berlin, 1997.
3. D. Boneh and M. Franklin. Private conversation, 1997.
4. N. De Bruijn. On the number of uncanceled elements in the sieve of Eratosthenes. Proc. Nederl. Akad. Wetensch., 53:803-812, 1950.
5. C. Cocks. Split knowledge generation of RSA parameters. In Proc. Cryptography and Coding: 6th IMA Conference, volume 1355 of Lecture Notes in Computer Science, pages 89-95. Springer-Verlag, Berlin, December 1997.
6. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1989.
7. A. DeSantis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proc. 23rd ACM Symposium on the Theory of Computing, pages 522-533, May 1994.
8. Y. Desmedt. Threshold cryptography. European Trans. Telecomm. Related Technol., 5(4):35-13, July-August 1994.
9. U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. J. Cryptology, 1:77-94, 1988.
10. A. Fiat and A. Shamir. How to prove yourself: practical schemes to identification and signature problems. In Advances in Cryptology - CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186-189. Springer-Verlag, Berlin, 1987.
11. Y. Frankel, P. MacKenzie, and M. Yung. Robust efficient distributed RSA key generation. In Proc. 30th ACM Symposium on the Theory of Computing, pages 663-672, May 1998.
12. M. Franklin and S. Haber. Joint encryption and message-efficient secure computation. J. Cryptology, 9:217-232, 1996.
13. N. Gilboa. Two party RSA key generation. In Advances in Cryptology - CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 116-129. Springer-Verlag, Berlin, 1999.
14. L. Guillou and J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In Advances in Cryptology - EUROCRYPT '88, pages 123-128. Springer-Verlag, Berlin, 1988.
15. J. B. Lacy, D. P. Mitchell, and W. M. Schell. Cryptolib: cryptography in software. In Proc. 4th USENIX Security Workshop, pages 208-221, Oct. 1993.
16. M. Malkin, T. Wu, and D. Boneh. Experimenting with shared generation of RSA keys. In Proc. Internet Society's 1999 Symposium on Network and Distributed System Security (SNDSS), pages 43-56, 1999.
17. C. C. McGeoch. Analyzing algorithms by simulation: variance reduction techniques and simulation speedups. Comput. Surveys, 24(2): 195-212, June 1992.
18. K. Ohta and T. Okamoto. A modification of the Fiat-Shamir scheme. In Advances in Cryptology -CRYPTO '88, volume 403 of Lecture Notes in Computer Science, pages 232-243. Springer-Verlag, Berlin, 1990.
19. H. Ong and C. Schnorr. Fast signature generation with a Fiat-Shamir-like scheme. In Advances in Cryptology - EUROCRYPT '90, pages 432-440. Springer-Verlag, Berlin, 1991.
20. G. Poupard and J. Stern. Generation of shared RSA keys by two parties. In Advances in Cryptology - AISACRYPT '98, volume 1514 of Lecture Notes in Computer Science, pages 11-24. Springer-Verlag, Berlin, 1998.
21. R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Comm. ACM, 21:120-126, Feb. 1978.