Skip to main content
SpringerLink
Log in
Book cover

Efficient Secure Two-Party Protocols

Techniques and Constructions

  • Book
  • © 2010

Overview

Authors:
  1. Carmit Hazay

    1. , Department of Computer Science, Weizmann Institute, Rehovot, Israel

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Yehuda Lindell

    1. Department of Computer Science, Bar Ilan University, Ramat Gan, Israel

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • 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

Part of the book series: Information Security and Cryptography (ISC)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (9 chapters)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Introduction and Definitions

    1. Front Matter

      Pages 1-2
      Download chapter PDF

    2. Introduction

      • Carmit Hazay, Yehuda Lindell
      Pages 3-18

    3. Definitions

      • Carmit Hazay, Yehuda Lindell
      Pages 19-49

  3. General Constructions

    1. Front Matter

      Pages 51-52
      Download chapter PDF

    2. Semi-honest Adversaries

      • Carmit Hazay, Yehuda Lindell
      Pages 53-80

    3. Malicious Adversaries

      • Carmit Hazay, Yehuda Lindell
      Pages 81-108

    4. Covert Adversaries

      • Carmit Hazay, Yehuda Lindell
      Pages 109-143

  4. Specific Constructions

    1. Front Matter

      Pages 145-146
      Download chapter PDF

    2. Sigma Protocols and Efficient Zero-Knowledge1

      • Carmit Hazay, Yehuda Lindell
      Pages 147-175

    3. Oblivious Transfer and Applications

      • Carmit Hazay, Yehuda Lindell
      Pages 177-212

    4. The kth-Ranked Element

      • Carmit Hazay, Yehuda Lindell
      Pages 213-226

    5. Search Problems

      • Carmit Hazay, Yehuda Lindell
      Pages 227-254

  5. Back Matter

    Pages 255-263
    Download chapter PDF
Back to top

Keywords

About this book

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.

Reviews

"(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

Authors and Affiliations

  • , Department of Computer Science, Weizmann Institute, Rehovot, Israel

    Carmit Hazay

  • Department of Computer Science, Bar Ilan University, Ramat Gan, Israel

    Yehuda Lindell

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation