<p><P>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
Composition of Secure Multi-Party Protocols: A Comprehensive Study
โ Scribed by Yehuda Lindell (auth.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 2003
- Tongue
- English
- Leaves
- 202
- Series
- Lecture Notes in Computer Science 2815
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
โฆ Table of Contents
Front Matter....Pages -
1. Introduction....Pages 1-20
2. The Composition of Authenticated Byzantine Agreement....Pages 21-43
3. Secure Computation without Agreement....Pages 45-79
4. Universally Composable Multi-party Computation....Pages 81-184
Back Matter....Pages -
โฆ Subjects
Data Encryption; Computer Communication Networks; Operating Systems; Computers and Society; Management of Computing and Information Systems
๐ SIMILAR VOLUMES
<p><P>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
<p><P>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
<p><span>This book presents the state of the art for multi-party fair exchange protocols and provides insight details regarding multi-party applications for buying physical products. The authors tackle the fairness problem in e-commerce protocols for buying physical products in scenarios involving c
<P>The volume provides state-of-the-art in non-repudiation protocols and gives insight of its applicability to e-commerce applications. This professional book organizes the existing scant literature regarding non-repudiation protocols with multiple entities participation. It provides the reader with
<p><P>Research oriented non-repudiation protocols have been active since the beginning of this millennium. It is time to take a step forward and realize that in many applications there are more than two entities. <STRONG>Secure Multi-Party Non-Repudiation Protocols and Applications</STRONG> supports