Efficient, Robust and Constant-Round Distributed RSA Key Generation

By Ivan Bjerre Damgård, Gert Læssøe Mikkelsen. 2010

55 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

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

1. Li Xiong
2. Slawomir Goryczka
3. Vaidy S. Sunderam
4. Kouichi Sakurai
5. Takashi Nishide
6. Rasmus Pagh
7. Badih Ghazi
8. Atsuko Miyaji

In Information Systems

1. Kouichi Sakurai
2. Li Xiong
3. Takashi Nishide
4. Slawomir Goryczka

Citations in the corpus

• A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy (2015, methodology): “For settings where the TTP is not present, generation and distribution of public and private keys can be also securely performed, by running a separate SMC protocol [19], [43], e.”
• Distributed Paillier Cryptosystem without Trusted Dealer (2010, methodology): “There exists a VSS scheme over the integers based on a composite (RSA) number such as [16], but as pointed out in [2,20], we need a trusted setup to obtain such a shared composite number which is a product of two safe primes and we want to avoid the trusted setup.”
• Secure multiparty aggregation with differential privacy: a comparative study (2013, background): “The distributed private key can be also generated by running a separate SMC protocol [14, 34], e.”