Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Angelo Agatino Nicolosi

dblp:237/7269 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 62% Cryptographic primitives and cryptanalysis · 38%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key management › distributed key generation
distributed RSA key generation
0.412019
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting · J. Cryptol. 2019
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
threshold encryption
0.412019
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting · J. Cryptol. 2019
Cryptographic protocols and secure computation
malicious security
0.112019
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting · J. Cryptol. 2019
Cryptographic protocols and secure computation
secure multiparty computation
0.112019
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting · J. Cryptol. 2019

Methods — techniques the papers use, named apart from their topics

distributed key generation · 0.4distributed decryption · 0.4biprimality test · 0.4
YearPublicationVenuePosition
2019 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. 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.
Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft, Angelo Agatino Nicolosi
J. Cryptol.5