TU Darmstadt / ULB / TUbiblio

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

Schneider, Thomas :
Engineering Secure Two-Party Computation Protocols — Advances in Design, Optimization, and Applications of Efficient Secure Function Evaluation.
[Online-Edition: http://thomaschneider.de/papers/S11Thesis.pdf]
Ruhr-University Bochum, Germany
[Ph.D. Thesis]

Official URL: http://thomaschneider.de/papers/S11Thesis.pdf

Abstract

Secure Function Evaluation (SFE) allows two mutually mistrusting parties to compute an arbitrary function on their inputs without revealing any information beyond the result. We give advances in the design, optimization and application of efficient SFE. We optimize SFE protocols by reducing the size of Boolean circuits with cheap XOR gates and give efficient circuits for standard functionalities. Secure hardware reduces the communication of SFE protocols and allows to evaluate arbitrary functions in a side-channel resistant way. Efficient SFE protocols can be modularly modeled as sequence of operations on encrypted data; TASTY (Tool for Automating Secure Two-partY computations) allows to describe, automatically generate, and execute them. As applications we improve protocols for secure auctions and face recognition, and give a hardware-assisted protocol to securely outsource data and arbitrary computations to an untrusted (cloud) provider.

Item Type: Ph.D. Thesis
Erschienen: 2011
Creators: Schneider, Thomas
Title: Engineering Secure Two-Party Computation Protocols — Advances in Design, Optimization, and Applications of Efficient Secure Function Evaluation
Language: English
Abstract:

Secure Function Evaluation (SFE) allows two mutually mistrusting parties to compute an arbitrary function on their inputs without revealing any information beyond the result. We give advances in the design, optimization and application of efficient SFE. We optimize SFE protocols by reducing the size of Boolean circuits with cheap XOR gates and give efficient circuits for standard functionalities. Secure hardware reduces the communication of SFE protocols and allows to evaluate arbitrary functions in a side-channel resistant way. Efficient SFE protocols can be modularly modeled as sequence of operations on encrypted data; TASTY (Tool for Automating Secure Two-partY computations) allows to describe, automatically generate, and execute them. As applications we improve protocols for secure auctions and face recognition, and give a hardware-assisted protocol to securely outsource data and arbitrary computations to an untrusted (cloud) provider.

Divisions: Department of Computer Science
Department of Computer Science > Cryptography and Privacy Engineering (ENCRYPTO)
Zentrale Einrichtungen
Department of Computer Science > EC SPRIDE
Department of Computer Science > EC SPRIDE > Engineering Cryptographic Protocols (am 01.03.2018 in Cryptography and Privacy Engineering)
Date Deposited: 25 Jun 2012 13:24
Official URL: http://thomaschneider.de/papers/S11Thesis.pdf
Export:

Optionen (nur für Redakteure)

View Item View Item