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...
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Серии: | Lecture notes in computer science
2815 |
| Предметы: | |
| Online-ссылка: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Примечание: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Composition of secure multi-party protocols, a comprehensive study, Yehuda Lindell, Berlin, Springer, 2003, 1 vol. (XVI-192 p.), Lecture notes in computer science, 3-540-20105-X • Composition of Secure Multi-Party Protocols, Texte imprimé, 9783662186596 |
Оглавление:
- 1. Introduction
- 2. The Composition of Authenticated Byzantine Agreement
- 3. Secure Computation without Agreement
- 4. Universally Composable Multi-party Computation.