Efficient generation of shared RSA Keys

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1294, Issue , 1997, Pages 425-439

  Boneh, Dan ^a   Franklin, Matthew ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Multiparty computation; Primality testing; RSA; Threshold cryptography

Indexed keywords

FACTORIZATION;

MULTIPARTY COMPUTATION; PRIMALITY TESTING; RSA MODULI; THRESHOLD CRYPTOGRAPHY; THRESHOLD DECRYPTION;

CRYPTOGRAPHY;

EID: 84958639277     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052253     Document Type: Conference Paper

References (26)

1. N. Alon, Z. Galil and M. Yung, "Dynamic-resharing verifiable secret sharing," ESA 1995.
2. D. Beaver, "Security, fault tolerance, and communication complexity in distributed systems," Ph.D. thesis, Harvard University, May 1990.
3. M. Ben-Or, S. Goldwasser, A. Wigderson, "Completeness theorems for non-cryptographic fault tolerant distributed computation", STOC 1988, pp. 1-10.
4. J. Benaloh (Cohen), "Secret sharing homomorphisms: keeping shares of a secret secret," Crypto '86, 251-260.
5. J. Carter and M. Wegman, "Universal classes of hash functions", J. Comput. Syst. Set. 18 (1979), 143-154.
6. D. Chaum, C. Crepeau, and I. Damgird, "Multiparty unconditionally secure protocols," ACM STOC 1988, 11-19.
7. N. De Biuijn, "On the numbei of uncanceled elements in the sieve of Eratosthenes", Proc. Neder. Akad. Wetensch, vol. 53, 1950, pp. 803-812. Reviewed in LeVeque Reviews in Number Theory, Vol. 4, Section N-28, p. 221.
8. A. DeSantis, Y. Desmedt, Y. Frankel, M. Yung, "How to share a function securely", STOC 1994, pp. 522-533.
9. Y. Desmedt, "Threshold cryptography," European Transactions on Telecommunications and Related Technologies, Vol. 5, No. 4, July-August 1994, pp. 35-43.
10. Y. Desmedt and Y. Frankel, "Shared generation of authenticators and signatures", Crypto '91, 457-469.
11. U. Feige, A. Fiat, and A. Shamir, "Zero-knowledge proofs of identity," Journal of Cryptology 1 (1988), 77-94.
12. A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems," Crypto '86, 186-194.
13. Y. Frankel, "A practical protocol for large group oriented networks", Eurocrypt 89, pp. 56-61.
14. M. Franklin and S. Haber, "Joint encryption and message-efficient secure computation," Journal of Cryptology, 9 (1996), 217-232.
15. R. Fagin, M. Naor, P. Winkler, "Comparing information without leaking it", CACM, Vol 39, No. 5, May 1996, pp. 77-85.
16. R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, "Robust and efficient sharing of RSA functions", Crypto 96, pp. 157-172.
17. O. Goldreich, S. Micali, A. Wigderson, "How to play any mental game", STOC 1987, pp. 218-229.
18. J. Gordon, "Strong primes are easy to find", Eurocrypt 84, pp. 216-223
19. L. Guillou and J. Quisquater, "A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory," Eurocrypt '88, 123-128.
20. K. Ohta and T. Okamoto, "A modification of the Fiat-Shamir scheme," Crpto '88, 232-243.
21. H. Ong and C. Schnorr, "Fast signature generation with a Fiat Shamir-like scheme," Eurocrypt '90, 432-440.
22. T. Pederson, "A threshold cryptosystem without a trusted party," Proceedings of Eurocrypt 91, pp. 522-526.
23. M. Rabin, "Probabilistic algorithm for testing primality", J. of Number Theory, vol. 12, pp. 128-138, 1980.
24. R. Solovay, V. Strassen, "A fast monte carlo test for primality", SIAM journal of computing, vol. 6, pp. 84-85, 1977.
25. M. Wegman and J. Carter, "New hash functions and their use in authentication and set equality", J. Comput. Syst. Sci. 22 (1981), 265-279.
26. A. Yao, "How to generate and exchange secrets", FOCS 1986, pp. 162-167.