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.

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.

Essential reading for researchers in the area of secure protocols The authors compare the efficiencies of different protocols Essential reading for researchers in the area of privacy-preserving data mining Includes supplementary material: sn.pub/extras

Inhalt
and Definitions.- Definitions.- General Constructions.- Semi-honest Adversaries.- Malicious Adversaries.- Covert Adversaries.- Specific Constructions.- Sigma Protocols and Efficient Zero-Knowledge1.- Oblivious Transfer and Applications.- The kth-Ranked Element.- Search Problems.