rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Efficient Secure Two-Party Protocols
    sub title: Techniques and Constructions
  name:
    name part: Hazay, Carmit.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Lindell, Yehuda.
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2010
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIII, 263 p. online resource.
  abstract: 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 …
  table of contents: 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.
  note: by Carmit Hazay, Yehuda Lindell.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Computer programming
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Data mining
  subject:
    topic: Computer Science
  subject:
    topic: Programming Techniques
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Data Mining and Knowledge Discovery
  subject:
    topic: Data Structures, Cryptology and Information Theory
  classification: QA76.6-76.66
  classification: 005.11
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Information Security and Cryptography
  identifier: 9783642143038
  identifier: http://dx.doi.org/10.1007/978-3-642-14303-8
  record info:
    record creation date: 101109
    record change date: 20151204173120.0
    record identifier: 978-3-642-14303-8