Kerschbaum, Florian ; Schneider, Thomas ; Schröpfer, Axel (2013)
Automatic Protocol Selection in Secure Two-Party Computations.
20th Network and Distributed System Security Symposium (NDSS'13). San Diego, USA (24.02.2013-27.02.2013)
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Performance of secure computation is still often an obstacle to its practical adoption. There are different protocols for secure computation that compete for the best performance. In this paper we propose automatic protocol selection which selects a protocol for each operation resulting in a mix with the best performance so far. Based on an elaborate performance model, we propose an optimization algorithm and an efficient heuristic for this selection problem. We show that our mixed protocols achieve the best performance on a set of use cases. Furthermore, our results underpin that the selection problem is so complicated, that a programmer is unlikely to manually make the optimal selection. Our proposed algorithms nevertheless can be integrated into a compiler in order to yield the best (ornear-optimal) performance.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2013 |
| Autor(en): | Kerschbaum, Florian ; Schneider, Thomas ; Schröpfer, Axel |
| Art des Eintrags: | Bibliographie |
| Titel: | Automatic Protocol Selection in Secure Two-Party Computations |
| Sprache: | Englisch |
| Publikationsjahr: | 23 April 2013 |
| Veranstaltungstitel: | 20th Network and Distributed System Security Symposium (NDSS'13) |
| Veranstaltungsort: | San Diego, USA |
| Veranstaltungsdatum: | 24.02.2013-27.02.2013 |
| Zugehörige Links: | |
| Kurzbeschreibung (Abstract): | Performance of secure computation is still often an obstacle to its practical adoption. There are different protocols for secure computation that compete for the best performance. In this paper we propose automatic protocol selection which selects a protocol for each operation resulting in a mix with the best performance so far. Based on an elaborate performance model, we propose an optimization algorithm and an efficient heuristic for this selection problem. We show that our mixed protocols achieve the best performance on a set of use cases. Furthermore, our results underpin that the selection problem is so complicated, that a programmer is unlikely to manually make the optimal selection. Our proposed algorithms nevertheless can be integrated into a compiler in order to yield the best (ornear-optimal) performance. |
| Freie Schlagworte: | Secure Protocols, Secure Data |
| Zusätzliche Informationen: | TUD-CS-2013-0360 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Kryptographische Protokolle Profilbereiche Profilbereiche > Cybersicherheit (CYSEC) LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt 20 Fachbereich Informatik > EC SPRIDE 20 Fachbereich Informatik > EC SPRIDE > Engineering Cryptographic Protocols (am 01.03.18 aufgegangen in Praktische Kryptographie und Privatheit) |
| Hinterlegungsdatum: | 05 Okt 2016 19:42 |
| Letzte Änderung: | 06 Aug 2024 08:20 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum