KIT | KIT-Bibliothek | Impressum | Datenschutz

Hardening the Security of Server-Aided MPC Using Remotely Unhackable Hardware Modules

Doerner, Dominik; Mechler, Jeremias ORCID iD icon 1; Müller-Quade, Jörn 1
1 Institut für Informationssicherheit und Verlässlichkeit (KASTEL), Karlsruher Institut für Technologie (KIT)

Abstract:

Garbling schemes are useful building blocks for enabling secure multi-party computation (MPC), but require considerable computational resources both for the garbler and the evaluator. Thus, they cannot be easily used in a resource-restricted setting, e.g. on mobile devices. To circumvent this problem, server-aided MPC can be used, where circuit garbling and evaluation are performed by one or more servers. However, such a setting introduces additional points of failure: The servers, being accessible over the network, are susceptible to remote hacks. By hacking the servers, an adversary may learn all secrets, even if the parties participating in the MPC are honest. In this work, we investigate how the susceptibility for such remote hacks in the server-aided setting can be reduced. To this end, we modularize the servers performing the computationally intensive tasks. By using data diodes, air-gap switches and other simple remotely unhackable hardware modules, we can isolate individual components during large parts of the protocol execution, making remote hacks impossible at these times. Interestingly, this reduction of the attack surface comes without a loss of efficiency.


Verlagsausgabe §
DOI: 10.5445/IR/1000157950
Veröffentlicht am 20.04.2023
Originalveröffentlichung
DOI: 10.18420/sicherheit2022_05
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Informationssicherheit und Verlässlichkeit (KASTEL)
Publikationstyp Proceedingsbeitrag
Publikationsjahr 2022
Sprache Englisch
Identifikator ISBN: 978-3-88579-717-3
ISSN: 1617-5468
KITopen-ID: 1000157950
HGF-Programm 46.23.01 (POF IV, LK 01) Methods for Engineering Secure Systems
Erschienen in GI SICHERHEIT 2022, Ed.: C. Wressnegger
Veranstaltung 11th Sicherheit (2022), Karlsruhe, Deutschland, 05.04.2022 – 08.04.2022
Verlag Gesellschaft für Informatik (GI)
Seiten 83-99
Serie Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI) ; P-323
Schlagwörter multi-party computation, garbling schemes, universal composability, fortified universal composability
Nachgewiesen in Scopus
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page