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: Engineering Secure Two-Party Computation Protocols
    sub title: Design, Optimization, and Applications of Efficient Secure Function Evaluation
  name:
    name part: Schneider, Thomas.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2012
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVI, 138 p. 35 illus. online resource.
  abstract: Secure two-party computation, called secure function evaluation (SFE), enables two mutually mistrusting parties, the client and server, to evaluate an arbitrary function on their respective private inputs while revealing nothing but the result. Originally the technique was considered to be too inefficient for practical privacy-preserving applications, but in recent years rapid speed-up in computers and communication networks, algorithmic improvements, automatic generation, and optimizations have enabled their application in many scenarios. The author offers an extensive overview of the most practical and efficient modern techniques used in the design and implementation of secure computation and related protocols. After an introduction that sets secure computation in its larger context of other privacy-enhancing technologies such as secure channels and trusted computing, he covers the basics of practically efficient secure function evaluation, circuit optimizations and constructions, hardware-assisted garbled circuit protocols, and the modular design of efficient SFE protocols. The goal of the author's research is to use algorithm engineering methods to engineer efficient secure protocols, both as a generic tool and for solving practical applications, and he achieves an excellent balance between the theory and applicability. The book is essential for researchers, students and practitioners in the area of applied cryptography and information security who aim to construct practical cryptographic protocols for privacy-preserving real-world applications.
  table of contents: Chap. 1, Introduction -- Chap. 2, Basics of Practically Efficient Secure Function Evaluation -- Chap. 3, Circuit Optimizations and Constructions -- Chap. 4, Hardware-Assisted Garbled Circuit Protocols -- Chap. 5, Modular Design of Efficient SFE Protocols -- Chap. 6, Conclusions -- References -- Index.
  note: by Thomas Schneider.
  subject:
    topic: Computer science
  subject:
    topic: Computer organization
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Electrical engineering
  subject:
    topic: Computer Science
  subject:
    topic: Data Structures, Cryptology and Information Theory
  subject:
    topic: Computer Systems Organization and Communication Networks
  subject:
    topic: Communications Engineering, Networks
  classification: QA76.9.D35
  classification: 005.74
  related item:
    title info:
      title: Springer eBooks
  identifier: 9783642300424
  identifier: http://dx.doi.org/10.1007/978-3-642-30042-4
  record info:
    record creation date: 120803
    record change date: 20151103132313.0
    record identifier: 978-3-642-30042-4