Efficient Secure Two-Party Protocols
Techniques and Constructions
(Sprache: Englisch)
The authors present a comprehensive study of efficient protocols and techniques for secure two-party computation. They study both general constructions that can be used to securely compute any functionality, and protocols for specific problems of interest.
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
Fr. 201.00
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Efficient Secure Two-Party Protocols “
The authors present a comprehensive study of efficient protocols and techniques for secure two-party computation. They study both general constructions that can be used to securely compute any functionality, and protocols for specific problems of interest.
Klappentext zu „Efficient Secure Two-Party Protocols “
In the setting of multiparty computation, sets of two or more parties with p- vate inputs wish to jointly compute some (predetermined) function of their inputs. The computation should be such that the outputs received by the parties are correctly distributed, and furthermore, that the privacy of each party's input is preserved as much as possible, even in the presence of - versarial behavior. This encompasses any distributed computing task and includes computations as simple as coin-tossing and broadcast, and as c- plex as electronic voting, electronic auctions, electronic cash schemes and anonymous transactions. The feasibility (and infeasibility) of multiparty c- putation has been extensively studied, resulting in a rather comprehensive understanding of what can and cannot be securely computed, and under what assumptions. The theory of cryptography in general, and secure multiparty computation in particular, is rich and elegant. Indeed, the mere fact that it is possible to actually achieve the aforementioned task is both surprising and intriguing.
Inhaltsverzeichnis zu „Efficient Secure Two-Party Protocols “
Introduction.- Definitions.- Semi-honest Adversaries.- Malicious Adversaries.- Covert Adversaries.- Sigma Protocols and Efficient Zero-Knowledge.- Oblivious Transfer and Applications.- The k-th Ranked Element.- Search Problems.- References.- Index
Bibliographische Angaben
- Autoren: Carmit Hazay , Yehuda Lindell
- 2013, 2010, XIII, 263 Seiten, Masse: 15,6 x 23,4 cm, Kartoniert (TB), Englisch
- Verlag: Springer, Berlin
- ISBN-10: 3642265766
- ISBN-13: 9783642265761
Sprache:
Englisch
Pressezitat
"(T)he book is a pleasure to read, containing sufficient motivation, intuition, and informal discussion as well as detailed proofs of security. The book contains a superb treatment of both general secure two-party computation as well as several efficient protocols in this setting. The first three chapters of the book would serve as an accessible introduction to secure two-party computation for the interested graduate student; the rest of the book is an excellent starting point for the more specialized literature in the field. The book could also serve very nicely as a text for a graduate seminar in this area, or could even be used as a supplementary book at the end of a graduate 'Introduction to Cryptography' class. ... It belongs on the shelf of every researcher interested in this area." Jonathan Katz, SIGACT News Book Review Column 43(1) 2012
Kommentar zu "Efficient Secure Two-Party Protocols"
0 Gebrauchte Artikel zu „Efficient Secure Two-Party Protocols“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Efficient Secure Two-Party Protocols".
Kommentar verfassen