Efficient generation of shared RSA keys

By Dan Boneh, M. Franklin. JACM, 2001

439 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/7cc83842ad45c1b55ac759d5b31758aeb0d1ac71

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Information Systems

Citations in the corpus

Two Party RSA Key Generation (1999, methodology): “Boneh and Franklin show in [4] how to generate the keys without a dealer’s help.”
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (2012, methodology): “We present the first fully simulatable protocol for securely computing a Blum integer composite as a product of two primes without leaking information about its factorization (in the sense of [5]).”
Privacy Preserving Data Mining (2000, background): “Supported by an Eshkol grant of the Israel Ministry of Science. key utility of large databases today is research, whether it be scientific, or economic and market oriented.”
Distributed Paillier Cryptosystem without Trusted Dealer (2010, background): “The trial division protocol in [6,1] is non-robust because it is in the honest-butcurious model.”
Efficient Identity Based Signature Schemes Based on Pairings (2002, background): “Protocols exist for this problem, see for example [1], [2] and [6].”
Efficient Verifiable Delay Functions (2019, background): “It is also possible to generate a modulus by a secure multiparty execution of the RSA key generation procedure among independent parties, each contributing some secret random seeds (as done in [7]).”
Efficient, Robust and Constant-Round Distributed RSA Key Generation (2010, methodology): “In this paper we do this by combining the two methods from [1,4] to get, in a sense, the best of both worlds.”
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes (1998, background): “Let us further mention the work of Boneh and Franklin [2], who provide a proof that a distributively generated number n indeed consists of two primes (without further showing that these primes are of special form).”
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation (2001, neutral): “See [9, 12, 15, 31] for just a few examples.”
Efficient and Quasi-accurate Multiparty Private Set Union (2018, methodology): “( ∑n i=1 pi)( ∑n i=1 qi) where pi ∈ Fp and qi ∈ Fp are chosen by each party Pi, (1 ≤ i ≤ n), the Distributed Key Generation (DKG) protocol [12] can be used in this phase.”