Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
By Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft. 2012
142 citations recorded by the source corpus.
The problem of generating an RSA composite in a distributed manner without leaking its factorization is particularly challenging and useful in many cryptographic protocols. Our first contribution is the first non-generic fully simulatable protocol for distributively generating an RSA composite with security against malicious behavior. Our second contribution is a complete Paillier (in: EUROCRYPT, pp 223–238, 1999) threshold encryption scheme in the two-party setting with security against malicious attacks. We further describe how to extend our protocols to the multiparty setting with dishonest majority. Our RSA key generation protocol is comprised of the following subprotocols: (i) a distributed protocol for generation of an RSA composite and (ii) a biprimality test for verifying the validity of the generated composite. Our Paillier threshold encryption scheme uses the RSA composite for the public key and is comprised of the following subprotocols: (i) a distributed generation of the corresponding secret key shares and (ii) a distributed decryption protocol for decrypting according to Paillier.
Subfields: Artificial Intelligence, Computer Networks and Communications, 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
In Computer Networks and Communications
In Information Systems
Citations in the corpus
- A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy (2015, methodology): “Details of key generation, encryption and decryption algorithms can be found in [18], [33].”