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)
Conference or Workshop Item, Bibliographie
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.
| Item Type: | Conference or Workshop Item |
|---|---|
| Erschienen: | 2013 |
| Creators: | Kerschbaum, Florian ; Schneider, Thomas ; Schröpfer, Axel |
| Type of entry: | Bibliographie |
| Title: | Automatic Protocol Selection in Secure Two-Party Computations |
| Language: | English |
| Date: | 23 April 2013 |
| Event Title: | 20th Network and Distributed System Security Symposium (NDSS'13) |
| Event Location: | San Diego, USA |
| Event Dates: | 24.02.2013-27.02.2013 |
| Corresponding Links: | |
| 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. |
| Uncontrolled Keywords: | Secure Protocols, Secure Data |
| Additional Information: | TUD-CS-2013-0360 |
| Divisions: | 20 Department of Computer Science 20 Department of Computer Science > Kryptographische Protokolle Profile Areas Profile Areas > Cybersecurity (CYSEC) LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt 20 Department of Computer Science > EC SPRIDE 20 Department of Computer Science > EC SPRIDE > Engineering Cryptographic Protocols (am 01.03.2018 in Cryptography and Privacy Engineering) |
| Date Deposited: | 05 Oct 2016 19:42 |
| Last Modified: | 06 Aug 2024 08:20 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Send an inquiry |
Options (only for editors)
 |
Show editorial Details |
Drucken
Impressum