Composition of Secure Multi-Party Protocols A Comprehensive Study /
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 asser...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2003.
|
| Edition: | 1st ed. 2003. |
| Series: | Lecture Notes in Computer Science,
2815 |
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Table of Contents:
- 1. Introduction
- 2. The Composition of Authenticated Byzantine Agreement
- 3. Secure Computation without Agreement
- 4. Universally Composable Multi-party Computation.