img Leseprobe Leseprobe

Efficient Secure Two-Party Protocols

Techniques and Constructions

Yehuda Lindell, Carmit Hazay

ca. 96,29
Amazon iTunes Hugendubel Bü kobo Osiander Google Books Barnes&Noble Legimi
* Affiliatelinks/Werbelinks
Hinweis: Affiliatelinks/Werbelinks
Links auf sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.

Springer Berlin img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Informatik


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.

Weitere Titel zum gleichen Preis



Search Problems, database, Introduction, Definitions, Oblivious Transfer and Applications, Covert Adversaries, References, Index, Malicious Adversaries, The k-th Ranked Element, data mining, Semi-honest Adversaries, Sigma Protocols and Efficient Zero-Knowledge