Generating a product of three primes with an unknown factorization-Reference-Cited by-同舟云学术

Generating a product of three primes with an unknown factorization

Published:1998 Issue: Volume: Page:237-251
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Boneh Dan,Horwitz Jeremy

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0054866

Reference16 articles.

1. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 1–10. ACM Press, 1988.

2. D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In Proceedings of Advances in Cryptology: CRYPTO '97, pages 425–439. Lecture Notes in Computer Science, Springer-Verlag, New York, 1998.

3. M. Blum and S. Goldwasser. An efficient probabilistic public key encryption scheme that hides all partial information. In Proceedings of Advances in Cryptology: CRYPTO '84, pages 289–302. Lecture Notes in Computer Science, Springer-Verlag, New York, 1985.

4. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 11–19. ACM Press, 1988.

5. C. Cocks. Split knowledge generation of RSA parameters. Available from the author (cliff_cocks@cesg. gov.uk).

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Server-Supported RSA Signatures for Mobile Devices;Computer Security – ESORICS 2017;2017

2. On the Security of Distributed Multiprime RSA;Information Security and Cryptology - ICISC 2014;2015

3. Efficient, Robust and Constant-Round Distributed RSA Key Generation;Theory of Cryptography;2010

4. A New Distributed Primality Test for Shared RSA Keys Using Quadratic Fields;Information Security and Privacy;2002

5. Efficient generation of shared RSA keys;Journal of the ACM;2001-07