TU Darmstadt / ULB / TUbiblio

ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation

Demmler, Daniel ; Schneider, Thomas ; Zohner, Michael (2015)
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation.
22nd Annual Network and Distributed System Security Symposium (NDSS'15). San Diego, USA (08.02.2015-11.02.2015)
doi: 10.14722/ndss.2015.23113
Konferenzveröffentlichung, Bibliographie

Kurzbeschreibung (Abstract)

Secure computation enables multiple mutually distrusting parties to jointly evaluate functions on their private inputs without revealing anything but the result. Generic secure computation protocols in the semi-honest model have been studied extensively and several best practices have evolved. In this work, we design and implement a mixed-protocol framework, called ABY, that efficiently combines secure computation schemes based on Arithmetic sharing, Boolean sharing, and Yao’s garbled circuits and that makes available best practice solutions in secure two-party computation. Our framework allows to pre-compute almost all cryptographic operations and provides novel highly efficient conversions between secure computation schemes based on pre-computed oblivious transfer extensions. ABY supports several standard operations and we perform benchmarks on a local network and in a public intercontinental cloud. From our benchmarks we deduce new insights on the efficient design of secure computation protocols, most prominently that oblivious transfer-based multiplications are much more efficient than using homomorphic encryption. We use our framework to construct mixed-protocols for three example applications, private set intersection, biometric matching, and modular exponentiation, and show that they are much more efficient than using a single protocol.

Typ des Eintrags: Konferenzveröffentlichung
Erschienen: 2015
Autor(en): Demmler, Daniel ; Schneider, Thomas ; Zohner, Michael
Art des Eintrags: Bibliographie
Titel: ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Sprache: Englisch
Publikationsjahr: 7 Februar 2015
Verlag: Internet Society
Veranstaltungstitel: 22nd Annual Network and Distributed System Security Symposium (NDSS'15)
Veranstaltungsort: San Diego, USA
Veranstaltungsdatum: 08.02.2015-11.02.2015
DOI: 10.14722/ndss.2015.23113
Kurzbeschreibung (Abstract):

Secure computation enables multiple mutually distrusting parties to jointly evaluate functions on their private inputs without revealing anything but the result. Generic secure computation protocols in the semi-honest model have been studied extensively and several best practices have evolved. In this work, we design and implement a mixed-protocol framework, called ABY, that efficiently combines secure computation schemes based on Arithmetic sharing, Boolean sharing, and Yao’s garbled circuits and that makes available best practice solutions in secure two-party computation. Our framework allows to pre-compute almost all cryptographic operations and provides novel highly efficient conversions between secure computation schemes based on pre-computed oblivious transfer extensions. ABY supports several standard operations and we perform benchmarks on a local network and in a public intercontinental cloud. From our benchmarks we deduce new insights on the efficient design of secure computation protocols, most prominently that oblivious transfer-based multiplications are much more efficient than using homomorphic encryption. We use our framework to construct mixed-protocols for three example applications, private set intersection, biometric matching, and modular exponentiation, and show that they are much more efficient than using a single protocol.

Freie Schlagworte: Secure Protocols;Secure Data;Engineering;E4
ID-Nummer: TUD-CS-2015-0001
Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik
20 Fachbereich Informatik > Kryptographische Protokolle
DFG-Sonderforschungsbereiche (inkl. Transregio)
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche
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)
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1119: CROSSING – Kryptographiebasierte Sicherheitslösungen als Grundlage für Vertrauen in heutigen und zukünftigen IT-Systemen
Hinterlegungsdatum: 05 Okt 2016 19:42
Letzte Änderung: 30 Jul 2024 11:25
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen