Efficient generation of shared RSA keys-Reference-Cited by-同舟云学术

Efficient generation of shared RSA keys

Published:2001-07 Issue:4 Volume:48 Page:702-722
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Boneh Dan¹,Franklin Matthew²

Affiliation:

1. Stanford University, Stanford, California

2. University of California, Davis, California

Abstract

We describe efficient techniques for a number of parties to jointly generate an RSA key. At the end of the protocol an RSA modulus N = pq is publicly known. None of the parties know the factorization of N . In addition a public encryption exponent is publicly known and each party holds a share of the private exponent that enables threshold decryption. Our protocols are efficient in computation and communication. All results are presented in the honest but curious scenario (passive adversary).

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/502090.502094

Reference40 articles.

1. Lecture Notes in Computer Science;ALON N.

2. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction

3. BEAVER D. 1990. Security fault tolerance and communication complexity in distributed systems. Ph.D. dissertation. Harvard University Cambridge Mass.]] BEAVER D. 1990. Security fault tolerance and communication complexity in distributed systems. Ph.D. dissertation. Harvard University Cambridge Mass.]]

4. Completeness theorems for non-cryptographic fault-tolerant distributed computation

5. Lecture Notes in Computer Science;BENALOH N), J

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

1. Time-Stamping;Encyclopedia of Cryptography, Security and Privacy;2024

2. Secure Multiparty Computation with Identifiable Abort via Vindicating Release;Lecture Notes in Computer Science;2024

3. Elevating ‘e’ in RSA: A Path to Improved Encryption Algorithms;2023 3rd International Conference on Technological Advancements in Computational Sciences (ICTACS);2023-11-01

4. Trusted Location Sharing on Enhanced Privacy-Protection IoT Without Trusted Center;IEEE Internet of Things Journal;2023

5. A New Class of Trapdoor Verifiable Delay Functions;Foundations and Practice of Security;2023