Composition of secure multi-party protocols

A comprehensive study - Series: Lecture Notes in Computer Science , Vol. 2815

Yehuda Lindell

208 pages, parution le 13/11/2003

Ajouter à une liste

Indisponible

Résumé

In the setting of multi-party computation, sets of two or more parties with private inputs wish to jointly compute some (predetermined) function of their inputs. General results concerning secure two-party or multi-party computation were first announced in the 1980s. Put briefly, these results assert that under certain assumptions one can construct protocols for securely computing any desired multi-party functionality.

However, this research relates only to a setting where a single protocol execution is carried out. In contrast, in modern networks, many different protocol executions are run at the same time. This book is devoted to the general and systematic study of secure multi-party computation under composition. Despite its emphasis on a theoretically well-founded treatment of the subject, general techniques for designing secure protocols are developed that may even result in schemes or modules to be incorporated in practical systems.

The book clarifies fundamental issues regarding security in a multi-execution environment and gives a comprehensive and unique treatment of the composition of secure multi-party protocols.

Introduction
The composition of authenticated byzantine agreement
Secure computation without agreement
Universally composable multi-party computation
References
Index

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Yehuda Lindell
Parution	13/11/2003
Nb. de pages	208
Format	15,5 x 23,5
Couverture	Broché
Poids	320g
Intérieur	Noir et Blanc
EAN13	9783540201052