Braun, Lennart ; Demmler, Daniel ; Schneider, Thomas ; Tkachenko, Oleksandr (2022)
MOTION - A Framework for Mixed-Protocol Multi-Party Computation.
In: ACM Transactions on Privacy and Security, 25 (2)
doi: 10.1145/3490390
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
We present MOTION, an efficient and generic open-source framework for mixed-protocol secure multi-party computation (MPC). MOTION is built in a user-friendly, modular, and extensible way, intended to be used as a tool in MPC research and to increase adoption of MPC protocols in practice. Our framework incorporates several important engineering decisions such as full communication serialization, which enables MPC over arbitrary messaging interfaces and removes the need of owning network sockets. MOTION also incorporates several performance optimizations that improve the communication complexity and latency, e.g., 2×
better online round complexity of precomputed correlated Oblivious Transfer (OT).
We instantiate our framework with protocols for N parties and security against up to N−1
passive corruptions: the MPC protocols of Goldreich-Micali-Wigderson (GMW) in its arithmetic and Boolean version and OT-based BMR (Ben-Efraim et al., CCS’16), as well as novel and highly efficient conversions between them, including a non-interactive conversion from BMR to arithmetic GMW.
MOTION is highly efficient, which we demonstrate in our experiments. Compared to secure evaluation of AES-128 with N=3 parties in a high-latency network with OT-based BMR, we achieve a 16× better throughput of 16 AES evaluations per second using BMR. With this, we show that BMR is much more competitive than previously assumed. For N=3 parties and full-threshold protocols in a LAN, MOTION is 10×–18× faster than the previous best passively secure implementation from the MP-SPDZ framework, and 190×–586× faster than the actively secure SCALE-MAMBA framework. Finally, we show that our framework is highly efficient for privacy-preserving neural network inference.
| Typ des Eintrags: | Artikel | ||||
|---|---|---|---|---|---|
| Erschienen: | 2022 | ||||
| Autor(en): | Braun, Lennart ; Demmler, Daniel ; Schneider, Thomas ; Tkachenko, Oleksandr | ||||
| Art des Eintrags: | Bibliographie | ||||
| Titel: | MOTION - A Framework for Mixed-Protocol Multi-Party Computation | ||||
| Sprache: | Englisch | ||||
| Publikationsjahr: | Mai 2022 | ||||
| Verlag: | ACM | ||||
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | ACM Transactions on Privacy and Security | ||||
| Jahrgang/Volume einer Zeitschrift: | 25 | ||||
| (Heft-)Nummer: | 2 | ||||
| DOI: | 10.1145/3490390 | ||||
| URL / URN: | https://dl.acm.org/journal/tops | ||||
| Kurzbeschreibung (Abstract): | We present MOTION, an efficient and generic open-source framework for mixed-protocol secure multi-party computation (MPC). MOTION is built in a user-friendly, modular, and extensible way, intended to be used as a tool in MPC research and to increase adoption of MPC protocols in practice. Our framework incorporates several important engineering decisions such as full communication serialization, which enables MPC over arbitrary messaging interfaces and removes the need of owning network sockets. MOTION also incorporates several performance optimizations that improve the communication complexity and latency, e.g., 2× better online round complexity of precomputed correlated Oblivious Transfer (OT). We instantiate our framework with protocols for N parties and security against up to N−1 passive corruptions: the MPC protocols of Goldreich-Micali-Wigderson (GMW) in its arithmetic and Boolean version and OT-based BMR (Ben-Efraim et al., CCS’16), as well as novel and highly efficient conversions between them, including a non-interactive conversion from BMR to arithmetic GMW. MOTION is highly efficient, which we demonstrate in our experiments. Compared to secure evaluation of AES-128 with N=3 parties in a high-latency network with OT-based BMR, we achieve a 16× better throughput of 16 AES evaluations per second using BMR. With this, we show that BMR is much more competitive than previously assumed. For N=3 parties and full-threshold protocols in a LAN, MOTION is 10×–18× faster than the previous best passively secure implementation from the MP-SPDZ framework, and 190×–586× faster than the actively secure SCALE-MAMBA framework. Finally, we show that our framework is highly efficient for privacy-preserving neural network inference. |
||||
| Freie Schlagworte: | Engineering, E4 | ||||
| Schlagworte: |
|
||||
| Zusätzliche Informationen: | Art.No.: 8 |
||||
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Praktische Kryptographie und Privatheit DFG-Sonderforschungsbereiche (inkl. Transregio) DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1119: CROSSING – Kryptographiebasierte Sicherheitslösungen als Grundlage für Vertrauen in heutigen und zukünftigen IT-Systemen |
||||
| Hinterlegungsdatum: | 22 Jun 2022 12:56 | ||||
| Letzte Änderung: | 13 Dez 2022 12:45 | ||||
| PPN: | 50211021X | ||||
| Schlagworte: |
|
||||
| Export: | |||||
| Suche nach Titel in: | TUfind oder in Google | ||||
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum