Advertisement
Published in:
2012 | OriginalPaper | Chapter
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
Authors : Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft
Published in: Topics in Cryptology – CT-RSA 2012
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 in the two party setting. Our second contribution is a
complete
Paillier [37] threshold encryption scheme in the two-party setting with security against malicious behavior. Our RSA key generation is comprised of the following: (
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 as public key and is comprised of: (
i
) a distributed generation of the corresponding secret-key shares and, (
ii
) a distributed decryption protocol for decrypting according to Paillier.