Schneider, Thomas (2011)
Engineering Secure Two-Party Computation Protocols - Advances in Design, Optimization, and Applications of Efficient Secure Function Evaluation.
Ruhr-Universität Bochum
Dissertation, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Dissertation | ||||
|---|---|---|---|---|---|
| Erschienen: | 2011 | ||||
| Autor(en): | Schneider, Thomas | ||||
| Art des Eintrags: | Bibliographie | ||||
| Titel: | Engineering Secure Two-Party Computation Protocols - Advances in Design, Optimization, and Applications of Efficient Secure Function Evaluation | ||||
| Sprache: | Englisch | ||||
| Referenten: | Musch, Prof. Dr. Thomas ; Pinkas, Prof. Dr. Benny ; Sadeghi, Prof. Dr. Ahmad-Reza ; Schwenk, Prof. Dr. Jörg ; Tüchelmann, Prof. Dr. York | ||||
| Publikationsjahr: | 9 Februar 2011 | ||||
| Ort: | Bochum | ||||
| Zugehörige Links: | |||||
| Kurzbeschreibung (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. |
||||
| Alternatives oder übersetztes Abstract: |
|
||||
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Praktische Kryptographie und Privatheit Zentrale Einrichtungen 20 Fachbereich Informatik > EC SPRIDE 20 Fachbereich Informatik > EC SPRIDE > Engineering Cryptographic Protocols (am 01.03.18 aufgegangen in Praktische Kryptographie und Privatheit) |
||||
| Hinterlegungsdatum: | 25 Jun 2012 13:24 | ||||
| Letzte Änderung: | 08 Aug 2024 09:05 | ||||
| PPN: | |||||
| Referenten: | Musch, Prof. Dr. Thomas ; Pinkas, Prof. Dr. Benny ; Sadeghi, Prof. Dr. Ahmad-Reza ; Schwenk, Prof. Dr. Jörg ; Tüchelmann, Prof. Dr. York | ||||
| Export: | |||||
| Suche nach Titel in: | TUfind oder in Google | ||||
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum