Efficient generation of shared RSA keys

Journal of the ACM

Volumn 48, Issue 4, 2001, Pages 702-722

  Boneh, Dan ^a,c   Franklin, Matthew ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Stanford University   (United States)

Author keywords

Multiparty computation; Primality testing; RSA; Threshold cryptography

Indexed keywords

MULTIPARITY COMPUTATION; PRIMALITY TESTING; RSA; THRESHOLD CRYPTOGRAPHY;

ALGORITHMS; COMPUTATIONAL METHODS; POLYNOMIALS; PROBABILITY; SET THEORY; THRESHOLD ELEMENTS;

CRYPTOGRAPHY;

EID: 4243114091     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/502090.502094     Document Type: Article

References (41)

1. ALON, N., GALIL, Z., AND YUNG, M. 1995. Dynamic-resharing verifiable secret sharing. In Proceedings of the 3rd Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 979. Springer-Verlag, New York, pp. 523-537.
2. BAR-ILAN, J., AND BEAVER, D. 1989. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing (Edmonton, Alb., Canada, Aug. 14-16). ACM, New York, pp. 201-209.
3. BEAVER, D. 1990. Security, fault tolerance, and communication complexity in distributed systems. Ph.D. dissertation. Harvard University, Cambridge, Mass.
4. BEN-OR, M., GOLDWASSER, S., AND WIGDERSON, A. 1988. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (Chicago, III, May 2-4). ACM, New York, pp. 1-10.
5. BENALOH (COHEN), J. 1987. Secret sharing homomorphisms: keeping shares of a secret secret. In Advances in Cryptology - Crypto '86. Lecture Notes in Computer Science, vol. 263. Springer-Verlag, New York, pp. 251-260.
6. BONEH, D., AND HORWITZ, J. 1998. Generating a product of three primes with an unknown factorization. In Proceedings of the 3rd Algorithmic Number Theory Symposium. Lecture Notes in Computer Science, vol. 1423. Springer-Verlag, New York, pp. 237-251.
7. CATALANO, D., GENNARO, R., AND HALEVI, S. 2000. Computing inverses over a shared secret modulus. In Advances in Cryptology - Eurocrypt 2000. Lecture Notes in Computer Science, vol. 1807. Springer-Verlag, New York, pp. 196-206.
8. CHAUM, D., CRÉPEAU, C., AND DAMGÅRD, I. 1988. Multiparty unconditionally secure protocols. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (Chicago, 111., May 2-4). ACM, New York, pp. 11-19.
9. COCKS, C. 1997. Split knowledge generation of RSA parameters. In Clyptography and Coding: 6th IMA Conference. Lecture Notes in Computer Science, vol. 1423. Springer-Verlag, New York, pp. 237-251.
10. DE BRUHN, N. 1950. On the number of uncanceled elements in the sieve of Eratosthenes. Proc. Neder. Akad. Wetensch. 53, pp. 803-812. (Reviewed in LeVeque Reviews in Number Theory, 4, N-28, p.221.)
11. DE BRUHN, N. 1950. On the number of uncanceled elements in the sieve of Eratosthenes. Proc. Neder. Akad. Wetensch. 53, pp. 803-812. (Reviewed in LeVeque Reviews in Number Theory, 4, N-28, p.221.)
12. DESANTIS, A., DESMEDT, Y., FRANKEL, Y., AND YUNG, M. 1994. How to share a function securely. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 522-533.
13. DESMEDT, Y. 1994. Threshold cryptography. Europ. Trans. Telecommun. Related Tech. 5, 4 (July-Aug.). 35-43.
14. DESMEDT, Y., AND FRANKEL, Y. 1992. Shared generation of authenticators and signatures. In Advances in Cryptology - Crypto '91. Lecture Notes in Computer Science, vol. 576. Springer-Verlag, New York, pp. 457-469.
15. ELGAMAL, T. 1985. A public key cryptosystem and a signature scheme based on the discrete logarithm. IEEE Trans. Inf. Theory 31, 4, 469-472.
16. FEIGE, U., FIAT, A., AND SHAMIR, A. 1988. Zero-knowledge proofs of identity. J. Crypt. 1, 77-94.
17. FIAT, A., AND SHAMIR, A. 1987. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology - Crypto '86. Lecture Notes in Computer Science, vol. 263. Springer-Verlag, New York, pp. 186-194.
18. FRANKEL, Y. 1990. A practical protocol for large group oriented networks. In Advances in Cryptology - Eurocrypt '89. Lecture Notes in Computer Science, vol. 434. Springer-Verlag, New York, pp. 56-61.
19. FRANKEL, Y., GEMMELL, P., MACKENZIE, P., AND YUNG, M. 1997. Optimal resilience proactive public key cryptosystems. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 384-393.
20. FRANKEL, Y., MACKENZIE, P., AND YUNG, M. 1998. Robust efficient distributed RSA-key generation. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (Dallas, Tex., May 23-26). ACM, New York, pp. 663-672.
21. FRANKLIN, M., AND HABER, S. 1996. Joint encryption and message-efficient secure computation. J. Crypt. 9, 217-232.
22. GEMMELL, P. 1997. An introduction to threshold cryptography. CryptoBytes, a technical newsletter of RSA Laboratories 2, 7.
23. GENNARO, R., JARECKI, S., KRAWCZYK, H., AND RABIN, T. 1996. Robust and efficient sharing of RSA functions. In Advances in Cryptology - Crypto '96. Lecture Notes in Computer Science, vol. 1109. pringer-Verlag, New York, pp. 157-172.
24. GENNARO, R., JARECKI, S., KRAWCZYK, H., AND RABIN, T. 1999. Secure distributed key generation for discrete-log based cryptosystems. In Advances in Cryptology - Eurocrypt '99. Lecture Notes in Computer Science, vol. 1592. Springer-Verlag, New York, pp. 295-310.
25. GILBOA, N. 1999. Two party RSA key generation. In Advances in Cryptology-Crypto '99. Lecture Notes in Computer Science, vol. 1666. Springer-Verlag, New York, pp. 116-129.
26. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. 1987. How to play any mental game. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (New York, N.Y., May 25-27). ACM, New York, pp. 218-229.
27. GOLDWASSER, S., MICALI, S., AND RACKOFF, C. 1989. The knowledge complexity of interactive proof systems. SIAM J. Comput. 18, 1, 186-208.
28. GORDON, J. 1985. Strong primes are easy to find. In Advances in Cryptology - Eurocrypt '84. Lecture Notes in Computer Science, vol. 209. Springer-Verlag, New York, pp. 216-223.
29. GUILLOU, L., AND QUISQUATER, J. 1988. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In Advances in Cryptology - Eurocrypt '88. Lecture Notes in Computer Science, vol. 330. Springer-Verlag, New York, pp. 123-128.
30. MALKIN, M., Wu, T., AND BONEH, D. 1999. Experimenting with shared RSA key generation. In proceedings of the Internet Society's 1999 Symposium on Network and Distributed System Security. Internet Society, Reston, Va., pp. 43-56.
31. MICALI, S., AND ROGAWAY, P. 1992. Secure computation. In Advances in Cryptology - Crypto '91. Lecture Notes in Computer Science, vol. 576. Springer-Verlag, New York, pp. 392-404.
32. OHTA, K., AND OKAMOTO, T. 1990. A modification of the Fiat-Shamir scheme. In Advances in Cryptology-Crypto '88. Lecture Notes in Computer Science, vol. 403. Springer-Verlag, New York, pp. 232-243.
33. ONG, H., AND SCHNORR, C. 1991. Fast signature generation with a Fiat-Shamir-like scheme. In Advances in Cryptology - Eurocrypt '90. Lecture Notes in Computer Science, vol. 473. Springer-Verlag, New York, pp. 432-440.
34. PEDERSON, T. 1991. A threshold cryptosystem without a trusted party. In Advances in Cryptology - Eurocrypt 91. Lecture Notes in Computer Science, vol. 547. Springer-Verlag, New York, pp. 522-526.
35. POUPARD, G., AND STERN, J. 1998. Generation of shared RSA keys by two parties. In Advances in Cryptology - AsiaCrypt '98. Lecture Notes in Computer Science, vol. 1514. Springer-Verlag, New York, pp. 11-24.
36. RABIN, M. 1980. Probabilistic algorithm for testing primality. J. Num. Theory 12, 128-138.
37. RABIN, T. 1998. A simplified approach to threshold and proactive RSA. In Advances in Cryptology - Crypto '98. Lecture Notes in Computer Science, vol. 1462. Springer-Verlag, New York, pp. 89-104.
38. SHAMIR, A. 1979. How to share a secret. Commun. ACM 22, 11 (Nov.), 612-613.
39. SHOUP, V. 2000. Practical threshold signatures. In Advances in Cryptology - Eurocrypt 2000. Lecture Notes in Computer Science, vol. 1807. Springer-Verlag, New York, pp. 207-220.
40. SOLOVAY, R., AND STRASSEN, V. 1977. A fast Monte Carlo test for primality. SIAM J. Comput. 6, 84-85.
41. YAO, A. 1986. How to generate and exchange secrets. In Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 162-167.