Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation
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 prools. 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 prools, and the modular design of efficient SFE prools.

The goal of the author's research is to use algorithm engineering methods to engineer efficient secure prools, 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 prools for privacy-preserving real-world applications.
1110907795
Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation
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 prools. 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 prools, and the modular design of efficient SFE prools.

The goal of the author's research is to use algorithm engineering methods to engineer efficient secure prools, 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 prools for privacy-preserving real-world applications.
129.99 In Stock
Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation

Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation

by Thomas Schneider
Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation

Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation

by Thomas Schneider

Overview

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 prools. 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 prools, and the modular design of efficient SFE prools.

The goal of the author's research is to use algorithm engineering methods to engineer efficient secure prools, 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 prools for privacy-preserving real-world applications.

Product Details

ISBN-13: 9783642300417
Publisher: Springer Berlin Heidelberg
Publication date: 08/04/2012
Edition description: 2012
Pages: 138
Product dimensions: 6.10(w) x 9.25(h) x 0.02(d)

About the Author

Dr.-Ing. Thomas Schneider heads the Engineering Cryptographic Prools group at the European Center for Security and Privacy by Design (EC-SPRIDE) at Technische Universität Darmstadt, Germany. He received his PhD from Ruhr-Universität Bochum, Germany. His research interests cover applied cryptography and information security, and in particular secure computation and related prools.

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 Prools.- Chap. 5, Modular Design of Efficient SFE Prools.- Chap. 6, Conclusions.- References.- Index.
From the B&N Reads Blog
Page 1 of

Related Subjects

Computers
Database Management
Database Administration & Management
Computers
Database Management
Database Administration & Management

Customer Reviews