Generation of shared RSA keys by two parties

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

Volumn 1514, Issue , 1998, Pages 11-24

  Poupard, Guillaume ^a   Stern, Jacques ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

ALGEBRAIC EXPRESSION; OBLIVIOUS TRANSFER PROTOCOLS; RSA MODULI; THIRD PARTIES;

CRYPTOGRAPHY;

EID: 84947809931     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49649-1_2     Document Type: Conference Paper

References (26)

1. M. Bellare and S. Micali. Non-Interactive Oblivious Transfer and Application. In Crypto '89, LNCS 435, pages 547-557. Springer-Verlag, 1990.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In Proc. of the 20th STOC, pages 1-10. ACM Press, 1988.
3. C.H. Bennett, G. Brassard, C. Crépeau, and M.-H. Skubiszewska. Practical Quantum Oblivious Transfer. In Crypto '91, LNCS 576, pages 351-366. Springer-Verlag, 1992.
4. S. Blackburn, S. Blake-Wilson, M. Burmester, and S. Galbraith. Shared Generation of Shared RSA Keys. Technical Report CORR 98-19, University of Waterloo, 1998. Available at http://www.cacr.math.uwaterloo.ca.
5. D. Boneh and M. Franklin. Efficient Generation of Shared RSA Keys. In Crypto '97, LNCS 1294, pages 425-439. Springer-Verlag, 1997.
6. G. Brassard, C. Crépeau, and J-M. Robert. Information Theoretic Reductions among Disclosure Problems. In Proc. of the 27th FOCS, pages 168-173. IEEE, 1986.
7. G. Brassard, C. Crépeau, and J-M. Robert. All-or Nothing Disclosure of Secrets. In Crypto '86, LNCS 263, pages 234-238. Springer-Verlag, 1987.
8. D. Chaum, C. Crépeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In Proc. of the 20th STOC, pages 11-19. ACM Press, 1988.
9. B. Chor and E. Kushilevitz. A Zero-One Law for Boolean Privacy. In Proc. of the 21st STOC, pages 62-72. ACM Press, 1989.
10. C. Cocks. Split Knowledge Generation of RSA Parameters. In Cryptography and Coding: Proceedings of 6th IMA Conference, LNCS 1355, pages 89-95. Springer-Verlag, 1997.
11. C. Cocks. Split Generation of RSA Parameters with Multiple Participants. Technical report, 998. Available at http://www.cesg.gov.uk.
12. C. Crépeau and J. Kilian. Achieving Oblivious Transfer Using Weakened Security Assumptions. In Proc. of the 29th FOCS, pages 42-52. IEEE, 1988.
13. C. Crépeau, J. van de Graaf, and A. Tapp. Commited Oblivious Transfer and Private Multy-Party Computation. In Crypto '95, LNCS 963, pages 110-123. Springer-Verlag, 1995.
14. S. Even, O. Goldreich, and A. Lempel. A Randomized Protocol for Signing Contracts. Communications of the ACM, 28:637-647, 1985.
15. Y. Frankel, P. MacKenzie, and M. Yung. Robust Efficient Distributed RSA-Key Generation. In Proc. of the 30th STOC. ACM Press, 1998.
16. O. Goldreich, S. Micali, and A. Wigderson. How to Play any Mental Game. In Proc. of the 19th STOC, pages 218-229. ACM Press, 1987.
17. S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM journal of computing, 18(1):186-208, february 1989.
18. J. Kilian. Founding Cryptography on Oblivious Transfer. In Proc. of the 20thSTOC, pages 20-31. ACM Press, 1988.
19. D. Naccache and J. Stern. A New Public Key Cryptosystem Based on Higher Residues. In Proc. of the 5th CCCS. ACM press, 1998.
20. D Pointcheval, and J Stern. Security Proofs for Signature Schemes. In Eurocrypt 96, LNCS 1070, pages 387-398. Springer-Verlag, 1996.
21. M. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.
22. J.N. Rosser and L. Schoenfeld. Approximate Formulas for some Functions of Prime Numbers. Illinois Journal of Mathematics, 6(1):64-94, march 1962.
23. K. Sakurai and H. Shizuya. A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems. Journal of Cryptology, 11(1):29-43, 1998.
24. S. Spalding and R. Wright. Experimental Performance of Shared RSA Modulus Generation. In proc. of Algorithms and Experiments 98, pages 34-43, 1998.
25. J.P. Stern. A New and Efficient All-Or-Nothing Disclosure of Secrets Protocol. In Asiacrypt 98, LNCS. Springer-Verlag, 1998.
26. A. C. Yao. How to Generate and Exchange Secrets. In Proc. of the 27th FOCS, pages 162-167. IEEE, 1986.