Distributed Paillier Cryptosystem without Trusted Dealer

By Takashi Nishide, Kouichi Sakurai. 2010

61 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications

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. Weiqi Luo
5. Jian Weng
6. Tal Rabin
7. Anne-Marie Kermarrec
8. Tomas Toft

In Computational Theory and Mathematics

1. Weiqi Luo
2. Jian Weng
3. Li Xiong
4. Tal Rabin
5. Vaidy S. Sunderam
6. Anne-Marie Kermarrec
7. Tomas Toft
8. Sébastien Gambs

In Computer Networks and Communications

1. Li Xiong
2. Slawomir Goryczka
3. Weiqi Luo
4. Jian Weng
5. Tal Rabin
6. Anne-Marie Kermarrec
7. Tomas Toft
8. Sébastien Gambs

Citations in the corpus

• A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy (2015, methodology): “distribution of public and private keys can be also securely performed, by running a separate SMC protocol [19], [43], e.”
• Efficient and Quasi-accurate Multiparty Private Set Union (2018, methodology): “In addition, Paillier encryption can be used in (n, n)-threshold distributed decryption without trusted dealers [9].”
• Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (2012, background): “Two follow-up papers [32,54] strengthened this result and obtained security against malicious adversaries (where a malicious adversary follows an arbitrary polynomial-time strategy).”
• DeepChain: Auditable and Privacy-Preserving Deep Learning with Blockchain-Based Incentive (2019, methodology): “trusted component, we can accomplish the setup phase by using a distributed method such as the one in [47].”
• 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.”
• Private Similarity Computation in Distributed Systems: From Cryptography to Differential Privacy (2011, methodology): “As a preprocessing step to this protocol, the two nodes engage in the setup phase of a distributed key generation protocol of a threshold affine homomorphic cryptosystem [7] (see for instance [24] for a detailed description of a distributed key generation protocol without a trusted third party for t”