Kolesnikov, Vladimir ; Schneider, Thomas ; Strehl, Volker (2008)
Practical Secure Function Evaluation.
8. Kryptotag. Tübingen, Germany (11.04.2008)
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Since the first publication of Yao, Secure Function Evaluation (SFE) is a well-researched problem. Continuing advances in available computational power and communication have made secure computation of many useful functions affordable. Recent work like Fairplay demonstrate practicability of general SFE. This thesis focuses on several practical aspects of SFE. Our new improved SFE protocol allows free evaluation of XOR gates and is provably secure against semi-honest adversaries in the random oracle model - the same assumptions that Fairplay relies on. The protocol merges elements of the information-theoretic SFE protocol GESS with Fairplay. This results in substantial performance improvements of 50% for many important circuit structures like addition or number comparison. SFE is extended to allow the evaluated function to be secret and only known by one party, called SFE of private functions (PF-SFE). These settings occur naturally in applications like no-fly-list-, credit report-, or medical history checking. It is known that PF-SFE can easily be reduced to SFE of universal circuits (UC). We give a practical UC construction that is up to 50% smaller than the best UC of Valiant when used in today’s PF-SFE. FairplayPF was implemented as extension of Fairplay to demonstrate practicability of PF-SFE based on the new UC construction. Using the improved SFE protocol, UC-based PF-SFE can be improved by another factor of 4. Besides these circuit-based approaches for SFE and PF-SFE new protocols for SFE and PF-SFE of functions represented as Ordered Binary Decision Diagrams (OBDDs) are given that are based on. This SFE protocol for OBDDs is extended to the malicious model and shown how to obtain a PF-SFE protocol for OBDDs at the cost of a small overhead only. The results of this thesis substantially improve general SFE for many practical functions and demonstrate practicability of general PF-SFE for “small” functions.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2008 |
| Autor(en): | Kolesnikov, Vladimir ; Schneider, Thomas ; Strehl, Volker |
| Art des Eintrags: | Bibliographie |
| Titel: | Practical Secure Function Evaluation |
| Sprache: | Englisch |
| Publikationsjahr: | 12 April 2008 |
| Verlag: | Gesellschaft für Informatik e.V. |
| Reihe: | Berichte des Wilhelm-Schickard-Instituts für Informatik |
| Band einer Reihe: | WSI-2008-02 |
| Veranstaltungstitel: | 8. Kryptotag |
| Veranstaltungsort: | Tübingen, Germany |
| Veranstaltungsdatum: | 11.04.2008 |
| Kurzbeschreibung (Abstract): | Since the first publication of Yao, Secure Function Evaluation (SFE) is a well-researched problem. Continuing advances in available computational power and communication have made secure computation of many useful functions affordable. Recent work like Fairplay demonstrate practicability of general SFE. This thesis focuses on several practical aspects of SFE. Our new improved SFE protocol allows free evaluation of XOR gates and is provably secure against semi-honest adversaries in the random oracle model - the same assumptions that Fairplay relies on. The protocol merges elements of the information-theoretic SFE protocol GESS with Fairplay. This results in substantial performance improvements of 50% for many important circuit structures like addition or number comparison. SFE is extended to allow the evaluated function to be secret and only known by one party, called SFE of private functions (PF-SFE). These settings occur naturally in applications like no-fly-list-, credit report-, or medical history checking. It is known that PF-SFE can easily be reduced to SFE of universal circuits (UC). We give a practical UC construction that is up to 50% smaller than the best UC of Valiant when used in today’s PF-SFE. FairplayPF was implemented as extension of Fairplay to demonstrate practicability of PF-SFE based on the new UC construction. Using the improved SFE protocol, UC-based PF-SFE can be improved by another factor of 4. Besides these circuit-based approaches for SFE and PF-SFE new protocols for SFE and PF-SFE of functions represented as Ordered Binary Decision Diagrams (OBDDs) are given that are based on. This SFE protocol for OBDDs is extended to the malicious model and shown how to obtain a PF-SFE protocol for OBDDs at the cost of a small overhead only. The results of this thesis substantially improve general SFE for many practical functions and demonstrate practicability of general PF-SFE for “small” functions. |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 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:54 |
| Letzte Änderung: | 30 Jul 2024 09:36 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum