Robust and efficient sharing of rsa functions

Journal of Cryptology

Volumn 13, Issue 2, 2000, Pages 273-300

  Gennaro, Rosario ^a   Rabin, Tal ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038425881     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/S001459910011     Document Type: Article

References (39)

1. [BCC] G. Brassard, D. Chaum, and C. Crepeau. Minimum disclosure proofs of knowledge. J. Comput. System Sei, 37(2) 156-189,1988.
2. [BCDP] J. Boyar, D. Chaum, I. Damgard, and T. Pedersen. Convertible undeniable signatures. In A. J. Menezes and S. Vanstone, editors, A avances in Cryptology -Crypto '90, pages 189-205. Springer-Verlag, Berlin, 1990. Lecture Notes in Computer Science No. 537.
3. [BF] D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In B. Kaliski, editor. Advances in Cryptology -Crypto '97, pages 425-439. Springer-Verlag, Berlin, 1997. Notes in Computer Science No. 1294.
4. [BGW] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic faulttolerant distributed computations. In Prvc. 20th Annual Symp. on the Theory of Computing, pages 1-10. ACM, New York, 1988.
5. [BK] M. Blum and S. Kannan. Program correctness checking and the design of programs that check their work. In Proc. 1\st Annual Symp. on the Theory of Computing, pages 86-97. ACM, New York, 1989.
6. [Bo] C. Boyd. Digital multisignatures. In H. Baker and F. Piper, editors. Cryptography and Coding, pages 241-246. Claredon Press, Oxford, 1989.
7. [BR] M. Bellare and P. Rogaway. Optimal asymmetric encryption. In A. De Santis, editor, Advances in Cryptology -Eurocrypt '94, pages 92-111. Springer-Verlag, Berlin, 1994. Lecture Notes in Computer Science No. 950.
8. [CA] D. Chaum and H. Van Antwerpen. Undeniable signatures. In G. Brassard, editor, Advances in Cryptology-Crypto '89, pages212-217. Springer- Verlag, Berlin, 1989. Lecture Notes in Computer Science No. 435.
9. [CCD] D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proc. 20th Annual Symp. on the Theory of Computing, pages 11-19. ACM, New York, 1988.
10. [CEG] D. Chaum, J.-H. Evertse, and J. van der Graaf. An improved protocol for demonstrating possession of a discrete logarithm and some generalizations. In D. Chaum, editor, Advances in Cryptology Eurocrypt '87, pages 127-141. Springer-Verlag, Berlin, 1987. Lecture Notes in Computer Science No. 304.
11. [Ch] D. Chaum. Zero-knowledge undeniable signatures. In I. Damgard, editor, Advances in Cryptology -Eurocrypt '90, pages 458-464. Springer-Verlag, Berlin, 1990. Lecture Notes in Computer Science No. 473.
12. [CH] R. A. Croft and S. P. Harris. Public-key cryptography and re-usable shared secrets. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 189-201. Claredon Press, Oxford, 1989.
13. [CMI] M. Cerecedo, T. Matsumoto, and H. Imai. Efficient and secure multiparty generation of digital signatures based on discrete logarithms. 1EICE Trans. Fundamentals, E76-A(4)532-545,1993.
14. [DDFY] A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proc. 26th Annual Symp. on the Theory of Computing, pages 522-533. ACM, New York, 1994.
15. [DeL] J. M. DeLaurentis. A further weakness in the common modulus protocol for RSA cryptosytems. Cryptologia, (8)253-259, 1984.
16. [Des1] Y. Desmedt. Society and group oriented cryptography a new concept. In C. Pomerance, editor, Advances in Cryptology -Crypto '87, pages 120-127. Springer-Verlag, Berlin, 1987. Lecture Notes in Computer Science No. 293.
17. [Des2] Y. G. Desmedt. ThrJsJinlffrypriSeniplqriimpgn Trans. Telecommun., 5(4)449-457, July 1994.
18. [DF1] Y. Desmedt and Y. Frankel. Threshold cryptoSystems. In G. Brassard, editor. Advances in Cryptology - Crypta '89, pages 307-315. Springer-Verlag, Berlin, 1989. Lecture Notes in Computer Science No. 435.
19. [DF2] Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor, Advances in Cryptology-Crypto '91, pages 457-469. Springer-Verlag, Berlin, 1991. Lecture Notes in Computer Science No. 576.
20. [FGMY] Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung, Optimal resilience proactive public-key cryptosystems. In Proc. 38//i Annual Symp. on Foundations of Computer Science, pages 384-393. IEEE, New York, 1997.
21. [FGY] Y. Frankel, P. Gemmell, and M. Yung. Witness-based cryptographic program checking and robust function sharing. In Proc. 28/ft Annual Symp. on the Tlieory of Computing, pages 499-508. ACM, New York,1996.
22. [GGJR] J. Garay, R. Gennaro, C. Jutla, and T. Rabin. Secure distributed storage and retrieval. In M. Mavronicolas and P. Tsigas, editors, Proc. 11 th International Workshop, WDAG '97, pages 275-289. Springer-Verlag, Berlin, 1997. Lecture Notes in Computer Science No. 1320.
23. [GJKR1] R. Gennaro, S. Jarecki, H. Krawczyk, andT. Rabin. Robust and efficient sharing of RSA functions. In N. Koblitz, editor, Advances in Cryptology-Crypto '96, pages 157-172. Springer-Verlag, Berlin, 1996. Lecture Notes in Computer Science No. 1109.
24. [GJKR2] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In U. Maurer, editor, Advances in Cryptology -Eurocrypt '96, pages 354-371. Springer-Verlag, Berlin, 1996. Lecture Notes in Computer Science No. 1070.
25. [GKR] R. Gennaro, H. Krawczyk, and T. Rabin. RSA-based undeniable signatures. In B. Kaliski, editor, Advances in Cryptology-Crypto '97, pages 132-149. Springer-Verlag, Berlin, 1997. Lecture Notes in Computer Science No. 1294.
26. [GM] S. Goldwasser and S. Micali. Probabilistic encryption. J. Comput. System Sei., 28(2)270-299, April 1984.
27. [GMR1] S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAMJ. Comput., 17(2)281-308, April 1988.
28. [GMR2] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. SIAM.J. Comput., 18(1)186-208, February 1989.
29. [GMR3] R. Gennaro, D. Micciancio, and T. Rabin. An efficient noninteractive statistical zero-knowledge proof system for quasi-safe prime products. To appear in the 1998 ACM Conference on Computer and Communication Security.
30. [GMW1] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. 19th Annual Symp. on the Theory of Computing, pages 218-229. ACM, New York, 1987.
31. [GMW2] O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. Assoc. Comput. Mach., 38(l)691-729,1991.
32. [Go] O. Goldreich. Foundation of Cryptography-Fragments of a Book. Electronic Colloquium on Computational Complexity, February 1995. Available online from http//www.eccc.uni-trier.de/ecccJ.
33. [Mi] S. Micali. Fair public-key cryptosystems. In E. Brickell, editor, Advances in Cryptology -Crypto '92, pages 113-138. Springer-Verlag, Berlin, 1992. Lecture Notes in Computer Science No. 740.
34. [MR] S. Micali and P. Rogaway. Secure computation. In J. Feigenbaum, editor, Advances in Cryptology - Crypto '91, pages 392-404. Springer-Verlag, Berlin, 1991. Lecture Notes in Computer Science No. 576.
35. [Pe] T. Pedersen. Noninteractive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Advances in Cryptology -Crypto '91, pages 129-140. Springer-Verlag, Berlin, 1991. Lecture Notes in Computer Science No. 576.
36. [Ra1] T. Rabin. Robust sharing of secrets when the dealer is honest or faulty. J. Assoc. Comput. Mach., 41(6)1089-1109,1994.
37. [Ra2] T. Rabin. A simplified approach to threshold and proactive RSA. In Proc. Crypto '98. Springer-Verlag, Berlin, 1998. Lecture Notes in Computer Science No. 1462.
38. [RB] T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 2\st Annual Symp. on the Theory of Computing, pages 73-85. ACM, New York, 1989.
39. [Wi] M. J. Wiener. Cryptanalysis of short RSA secret exponents. IEEE Trans. Inform. Theory, 36(3)553-558. May 1990.