Efficient Secure Two-Party Protocols

Techniques and Constructions

  • Carmit Hazay
  • Yehuda Lindell

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

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Introduction and Definitions

    1. Front Matter
      Pages 1-2
    2. Carmit Hazay, Yehuda Lindell
      Pages 3-18
    3. Carmit Hazay, Yehuda Lindell
      Pages 19-49
  3. General Constructions

    1. Front Matter
      Pages 51-52
    2. Carmit Hazay, Yehuda Lindell
      Pages 53-80
    3. Carmit Hazay, Yehuda Lindell
      Pages 81-108
    4. Carmit Hazay, Yehuda Lindell
      Pages 109-143
  4. Specific Constructions

    1. Front Matter
      Pages 145-146
    2. Carmit Hazay, Yehuda Lindell
      Pages 147-175
    3. Carmit Hazay, Yehuda Lindell
      Pages 177-212
    4. Carmit Hazay, Yehuda Lindell
      Pages 213-226
    5. Carmit Hazay, Yehuda Lindell
      Pages 227-254
  5. Back Matter
    Pages 255-263

About this book

Introduction

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 practitioners and 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.

Keywords

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

Authors and affiliations

  • Carmit Hazay
    • 1
  • Yehuda Lindell
    • 2
  1. 1., Department of Computer ScienceWeizmann InstituteRehovotIsrael
  2. 2.Department of Computer ScienceBar Ilan UniversityRamat GanIsrael

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-14303-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-14302-1
  • Online ISBN 978-3-642-14303-8
  • Series Print ISSN 1619-7100
  • About this book