Efficient Secure Two-Party Protocols

Techniques and Constructions

By Carmit Hazay , Yehuda Lindell

Efficient Secure Two-Party Protocols Cover Image

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.

Full Description

  • ISBN13: 978-3-6421-4302-1
  • 280 Pages
  • User Level: Science
  • Publication Date: November 2, 2010
  • Available eBook Formats: PDF
  • eBook Price: $99.00
Buy eBook Buy Print Book Add to Wishlist

Related Titles

Full Description
The authors present a comprehensive study of efficient protocols and techniques for secure two-party computation – both general constructions that can be used to securely compute any functionality, and protocols for specific problems of interest. The book focuses on techniques for constructing efficient protocols and proving them secure. In addition, the authors study different definitional paradigms and compare the efficiency of protocols achieved under these different definitions.The book opens with a general introduction to secure computation and then presents definitions of security for a number of different adversary models and definitional paradigms. In the second part, the book shows how any functionality can be securely computed in an efficient way in the presence of semi-honest, malicious and covert adversaries. These general constructions provide a basis for understanding the feasibility of secure computation, and they are a good introduction to design paradigms and proof techniques for efficient protocols. In the final part, the book presents specific constructions of importance. The authors begin with an in-depth study of sigma protocols and zero knowledge, focusing on secure computation, and they then provide a comprehensive study of the fundamental oblivious transfer function. Starting from protocols that achieve privacy only, they show highly efficient constructions that achieve security in the presence of malicious adversaries for both a single and multiple batch executions. Oblivious pseudorandom function evaluation is then presented as an immediate application of oblivious transfer. Finally, the book concludes with two examples of high-level protocol problems that demonstrate how specific properties of a problem can be exploited to gain high efficiency: securely computing the kth-ranked element, and secure database and text search. This book is essential for practitionersand researchers in the field of secure protocols, particularly those with a focus on efficiency, and for researchers in the area of privacy-preserving data mining. This book can also be used as a textbook for an advanced course on secure protocols.
Table of Contents

Table of Contents

  1. Introduction.
  2. Definitions.
  3. Semi
  4. honest Adversaries.
  5. Malicious Adversaries.
  6. Covert Adversaries.
  7. Sigma Protocols and Efficient Zero
  8. Knowledge.
  9. Oblivious Transfer and Applications.
  10. The k
  11. th Ranked Element.
  12. Search Problems.
  13. References.
  14. Index
Errata

Please Login to submit errata.

No errata are currently published