Efficient RSA key generation and threshold Paillier in the two-party setting

Carmit Hazay; Gert Læssøe Mikkelsen; Tal Rabin; Tomas Toft

doi:10.1007/978-3-642-27954-6_20

Efficient RSA key generation and threshold Paillier in the two-party setting

Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

57 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Topics in Cryptology, CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, Proceedings
Pages	313-331
Number of pages	19
DOIs	https://doi.org/10.1007/978-3-642-27954-6_20
State	Published - 2012
Externally published	Yes
Event	12th Cryptographers' Track at the RSA Conference, CT-RSA 2012 - San Francisco, CA, United States Duration: 27 Feb 2012 → 2 Mar 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7178 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th Cryptographers' Track at the RSA Conference, CT-RSA 2012
Country/Territory	United States
City	San Francisco, CA
Period	27/02/12 → 2/03/12

Access to Document

10.1007/978-3-642-27954-6_20

Cite this

Hazay, C., Mikkelsen, G. L., Rabin, T., & Toft, T. (2012). Efficient RSA key generation and threshold Paillier in the two-party setting. In Topics in Cryptology, CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, Proceedings (pp. 313-331). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7178 LNCS). https://doi.org/10.1007/978-3-642-27954-6_20

Hazay, Carmit ; Mikkelsen, Gert Læssøe ; Rabin, Tal et al. / Efficient RSA key generation and threshold Paillier in the two-party setting. Topics in Cryptology, CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, Proceedings. 2012. pp. 313-331 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{edd80562af0c458badbe011f32275768,

title = "Efficient RSA key generation and threshold Paillier in the two-party setting",

abstract = "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.",

author = "Carmit Hazay and Mikkelsen, {Gert L{\ae}ss{\o}e} and Tal Rabin and Tomas Toft",

year = "2012",

doi = "10.1007/978-3-642-27954-6_20",

language = "אנגלית",

isbn = "9783642279539",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "313--331",

booktitle = "Topics in Cryptology, CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, Proceedings",

note = "12th Cryptographers' Track at the RSA Conference, CT-RSA 2012 ; Conference date: 27-02-2012 Through 02-03-2012",

}

Hazay, C, Mikkelsen, GL, Rabin, T & Toft, T 2012, Efficient RSA key generation and threshold Paillier in the two-party setting. in Topics in Cryptology, CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7178 LNCS, pp. 313-331, 12th Cryptographers' Track at the RSA Conference, CT-RSA 2012, San Francisco, CA, United States, 27/02/12. https://doi.org/10.1007/978-3-642-27954-6_20

Efficient RSA key generation and threshold Paillier in the two-party setting. / Hazay, Carmit; Mikkelsen, Gert Læssøe; Rabin, Tal et al.
Topics in Cryptology, CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, Proceedings. 2012. p. 313-331 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7178 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient RSA key generation and threshold Paillier in the two-party setting

AU - Hazay, Carmit

AU - Mikkelsen, Gert Læssøe

AU - Rabin, Tal

AU - Toft, Tomas

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84857707103&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-27954-6_20

DO - 10.1007/978-3-642-27954-6_20

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84857707103

SN - 9783642279539

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 313

EP - 331

BT - Topics in Cryptology, CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, Proceedings

T2 - 12th Cryptographers' Track at the RSA Conference, CT-RSA 2012

Y2 - 27 February 2012 through 2 March 2012

ER -

Hazay C, Mikkelsen GL, Rabin T, Toft T. Efficient RSA key generation and threshold Paillier in the two-party setting. In Topics in Cryptology, CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, Proceedings. 2012. p. 313-331. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-27954-6_20

Efficient RSA key generation and threshold Paillier in the two-party setting

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this