Efficient RSA Key Generation Protocol in the Two-Party Setting: and its Application into the Secure Multiparty Computation Environment - Couverture souple

Nicolosi, Angelo Agatino

 
9783659174674: Efficient RSA Key Generation Protocol in the Two-Party Setting: and its Application into the Secure Multiparty Computation Environment
Couverture souple
ISBN 10 : 365917467X ISBN 13 : 9783659174674
Editeur : LAP LAMBERT Academic Publishing, 2012

Synopsis

The goal of this thesis is the implementation of a fully distributed multiparty computation protocol in a Two-Party setting, secure in the semi-honest model. For each single step in the protocol is expected the participation of two and only two parties. This is among the first implementations of a complete distributed protocol for RSA Composite generation in this setting, on top of which several Secure Multiparty Computation protocols have also been implemented. In this paper it has been shown that using standards approaches the problem turns to be intractable. From this first result, the research moves in several directions, adopting Elliptic Curve-based solutions, avoiding where possible the use of expensive cryptographic operations, and using different cheaper approaches. This has brought to the implementation of the last version of the protocol, which permits to the two parties to securely compute an RSA Composite of at least 2048 bits in 15 minutes in average. Thus, it has practically been demonstrated that many of the different applications of the SMPC model that have been studied in the rich literature on the argument have a chance of being used in real-world environment.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

The goal of this thesis is the implementation of a fully distributed multiparty computation protocol in a Two-Party setting, secure in the semi-honest model. For each single step in the protocol is expected the participation of two and only two parties. This is among the first implementations of a complete distributed protocol for RSA Composite generation in this setting, on top of which several Secure Multiparty Computation protocols have also been implemented. In this paper it has been shown that using standards approaches the problem turns to be intractable. From this first result, the research moves in several directions, adopting Elliptic Curve-based solutions, avoiding where possible the use of expensive cryptographic operations, and using different cheaper approaches. This has brought to the implementation of the last version of the protocol, which permits to the two parties to securely compute an RSA Composite of at least 2048 bits in 15 minutes in average. Thus, it has practically been demonstrated that many of the different applications of the SMPC model that have been studied in the rich literature on the argument have a chance of being used in real-world environment.

Biographie de l'auteur

Angelo is an original Sicilian guy, who had his very first computer when he turned 14. That slow and noisy machine was the door to a completely new and great world. It is also thanks to that machine that he got a Bachelor and a Master Degree in Computer Science respectively from the University of Pisa(2008) and from the University of Århus (2012).

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2012
Langue
anglais
ISBN 10 
365917467X
ISBN 13 
9783659174674
Reliure
Broché
Nombre de pages
60
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne