MOTION - A Framework for Mixed-Protocol Multi-Party Computation

被引:22
作者
Braun, Lennart [1 ]
Demmler, Daniel [2 ]
Schneider, Thomas [3 ]
Tkachenko, Oleksandr [3 ]
机构
[1] Aarhus Univ, Abogade 34, DK-8200 Aarhus N, Denmark
[2] Univ Hamburg, Vogt Kolln Str 30, D-22527 Hamburg, Germany
[3] Tech Univ Darmstadt, Pankratiusstr 2, D-64289 Darmstadt, Hesse, Germany
基金
欧洲研究理事会;
关键词
Secure multi-party computation; hybrid protocols; efficiency; outsourcing; PRIVACY;
D O I
10.1145/3490390
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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., 2x 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 16x 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 10x-18x faster than the previous best passively secure implementation from the MP-SPDZ framework, and 190x-586x faster than the actively secure SCALE-MAMBA framework. Finally, we show that our framework is highly efficient for privacy-preserving neural network inference.
引用
收藏
页数:35
相关论文
共 80 条
  • [1] Aly A., 2019, WAHC 19
  • [2] Aly Abdelrahaman, 2018, SMART TIM WOOD
  • [3] [Anonymous], 2012, USENIX SECURITY
  • [4] ArribasAbril Victor, 2019, BRISTOL FASHION
  • [5] Asharov Gilad, 2017, JOC
  • [6] Asharov Gilad, 2013, CCS 13
  • [7] Beaver D, 1995, LECT NOTES COMPUT SC, V963, P97
  • [8] BEAVER D, 1992, LECT NOTES COMPUT SC, V576, P420
  • [9] BEAVER D, 1990, PROCEEDINGS OF THE TWENTY SECOND ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, P503, DOI 10.1145/100216.100287
  • [10] Efficient Garbling from a Fixed-Key Blockcipher
    Bellare, Mihir
    Viet Tung Hoang
    Keelveedhi, Sriram
    Rogaway, Phillip
    [J]. 2013 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2013, : 478 - 492