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\times \) 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\( \times \) 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\times \)–\( 18\times \) faster than the previous best passively secure implementation from the MP-SPDZ framework, and \( 190\times \)–\( 586\times \) faster than the actively secure SCALE-MAMBA framework. Finally, we show that our framework is highly efficient for privacy-preserving neural network inference.
- [1] . 2019. “Bristol Fashion” MPC Circuits. https://homes.esat.kuleuven.be/nsmart/MPC/.Google Scholar
- [2] . 2018. SCALE-MAMBA. https://homes.esat.kuleuven.be/nsmart/SCALE/.Google Scholar
- [3] . 2019. Zaphod: Efficiently Combing LSSS and Garbled Circuits in SCALE. In Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC’19). ACM.Google Scholar
- [4] . 2013. More efficient oblivious transfer and extensions for faster secure computation. In CCS’13. ACM.Google Scholar
- [5] . 2017. More efficient oblivious transfer extensions. JoC (2017).Google Scholar
- [6] . 1991. Efficient multiparty protocols using circuit randomization. In CRYPTO’91. Springer.Google Scholar
Digital Library
- [7] . 1995. Precomputing oblivious transfer. In CRYPTO’95. Springer.Google Scholar
- [8] . 1990. The round complexity of secure protocols. In STOC’90. ACM.Google Scholar
- [9] . 2013. Efficient garbling from a fixed-key blockcipher. In S&P’13. IEEE.Google Scholar
- [10] . 2008. FairplayMP: A system for secure multi-party computation. In CCS’08. ACM.Google Scholar
- [11] . 2016. Optimizing semi-honest secure multiparty computation for the internet. In CCS’16. ACM.Google Scholar
- [12] . 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In STOC’88. ACM.Google Scholar
- [13] . 2011. Secure and efficient protocols for iris and fingerprint identification. In ESORICS’11, and (Eds.).Google Scholar
- [14] . 2008. Sharemind: A framework for fast privacy-preserving computations. In ESORICS’08 (LNCS). Springer.Google Scholar
- [15] . 2009. Secure multiparty computation goes live. In FC’09. Springer.Google Scholar
- [16] . 2019. Efficient two-round OT extension and silent non-interactive secure computation. In CCS’19. ACM.Google Scholar
- [17] . 2019. Efficient pseudorandom correlation generators: Silent OT extension and more. In CRYPTO’19. Springer.Google Scholar
- [18] . 2019. Optimizing transport layer for secure computation. IACR Cryptology ePrint Archive, Report 2019/836 (2019). https://ia.cr/2019/836.Google Scholar
- [19] . 2018. HyCC: Compilation of hybrid protocols for practical secure computation. In CCS’18. ACM.Google Scholar
- [20] . 2016. Compiling low depth circuits for practical secure computation. In ESORICS’16. Springer.Google Scholar
- [21] . 2019. EzPC: Programmable and efficient secure two-party computation for machine learning. In EuroS&P’19. IEEE.Google Scholar
- [22] . 2019. ASTRA: High throughput 3PC over rings with application to secure prediction. In CCSW’19. ACM.Google Scholar
- [23] . 2019. A hybrid approach to secure function evaluation using SGX. In ASIACCS’19. ACM.Google Scholar
- [24] . 2012. Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces. In CT-RSA’12. Springer.Google Scholar
- [25] . 2015. The simplest protocol for oblivious transfer. In LATINCRYPT. Springer.Google Scholar
- [26] . 2018. SPD\( \mathbb {Z}_{2^k} \): Efficient MPC mod \( 2^k \) for Dishonest Majority. In CRYPTO’18. Springer.Google Scholar
- [27] . 2009. Asynchronous multiparty computation: Theory and implementation. In CRYPTO’09. Springer.Google Scholar
- [28] . 2013. Practical covertly secure MPC for dishonest majority - or: Breaking the SPDZ limits. In ESORICS’13. Springer.Google Scholar
- [29] . [n. d.]. Multiparty computation from somewhat homomorphic encryption. In CRYPTO’12. Springer.Google Scholar
- [30] . 2019. New primitives for actively-secure MPC over rings with applications to private machine learning. In S&P’19. IEEE.Google Scholar
- [31] . 2015. Automated synthesis of optimized circuits for secure computation. In CCS’15. ACM.Google Scholar
- [32] . 2015. ABY – A framework for efficient mixed-protocol secure two-party computation. In NDSS’15. Internet Society. https://encrypto.de/papers/DSZ15.pdf.Google Scholar
- [33] . 2016. Secure stable matching at scale. In CCS’16. ACM.Google Scholar
- [34] . 2020. Improved primitives for MPC over mixed arithmetic-binary circuits. In CRYPTO’20. Springer.Google Scholar
- [35] . 2015. A unified approach to MPC with preprocessing using OT. In ASIACRYPT’15, and (Eds.). Springer.Google Scholar
- [36] . 2016. CryptoNets: Applying neural networks to encrypted data with high throughput and accuracy. In International Conference on Machine Learning (ICML’16).Google Scholar
- [37] . 1987. How to play any mental game or a completeness theorem for protocols with honest majority. In STOC’87. ACM.Google Scholar
- [38] . 2020. Efficient and secure multiparty computation from fixed-key block ciphers. In S&P’20. IEEE.Google Scholar
- [39] . 2018. Advanced cryptography: Promise and challenges. In CCS’18. ACM.Google Scholar
- [40] . 2019. SoK: General purpose compilers for secure multi-party computation. In S&P’19. IEEE.Google Scholar
- [41] . 2017. Efficient and universally composable protocols for oblivious transfer from the CDH assumption. IACR Cryptology ePrint Archive, Report 2017/1011 (2017). https://ia.cr/2017/1011.Google Scholar
- [42] . 2017. Low cost constant round MPC combining BMR and oblivious transfer. In ASIACRYPT’17. Springer.Google Scholar
- [43] . 2019. PrivC—A framework for efficient secure two-party computation. In Security and Privacy in Communication Networks. Springer.Google Scholar
Cross Ref
- [44] . 2010. TASTY: Tool for automating secure two-party computations. In CCS’10. ACM.Google Scholar
- [45] . 2012. Private set intersection: Are garbled circuits better than custom protocols?. In NDSS’12. Internet Society.Google Scholar
- [46] . 1989. Limits on the provable consequences of one-way permutations. In STOC’89. ACM.Google Scholar
- [47] . 2003. Extending oblivious transfers efficiently. In CRYPTO’03.Google Scholar
- [48] . 2019. Efficient MPC via program analysis: A framework for efficient optimal mixing. In CCS’19. ACM.Google Scholar
- [49] . 2011. Outsourcing multi-party computation. IACR Cryptology ePrint Archive, Report 2011/272 (2011). https://ia.cr/2011/272.Google Scholar
- [50] . 2020. MP-SPDZ: A versatile framework for multi-party computation. In CCS’20. ACM.Google Scholar
- [51] . 2016. MASCOT: Faster malicious arithmetic secure computation with oblivious transfer. In CCS’16. ACM.Google Scholar
- [52] . 2009. Improved garbled circuit building blocks and applications to auctions and computing minima. In CANS’09. Springer.Google Scholar
- [53] . 2013. PCF: A portable circuit format for scalable two-party secure computation. In USENIX Security’12. USENIX Association.Google Scholar
- [54] . 2012. Billion-gate secure computation with malicious adversaries. In USENIX Security’12. USENIX Association.Google Scholar
- [55] . 2015. ObliVM: A programming framework for secure computation. In S&P’15. IEEE.Google Scholar
- [56] . 2017. Oblivious neural network predictions via MiniONN transformations. In CCS’17. ACM.Google Scholar
Digital Library
- [57] . 2004. Fairplay – A secure two-party computation system. In USENIX Security’04. USENIX Association.Google Scholar
Digital Library
- [58] . 2019. Systematizing genome privacy research: A privacy-enhancing technologies perspective. PETS’19 (2019).Google Scholar
- [59] . 2018. \( {ABY}^3 \): A mixed protocol framework for machine learning. In CCS’18. ACM.Google Scholar
- [60] . 2017. SecureML: A system for scalable privacy-preserving machine learning. In S&P’17. IEEE.Google Scholar
- [61] . 2016. Frigate: A validated, extensible, and efficient compiler and interpreter for secure computation. In EuroS&P’16. IEEE.Google Scholar
- [62] . 2017. Constant round maliciously secure 2PC with function-independent preprocessing using LEGO. In NDSS’17.Google Scholar
- [63] . 2020. BLAZE: Blazing fast privacy-preserving machine learning. In NDSS’20. Internet Society.Google Scholar
- [64] . 1981. How To Exchange Secrets with Oblivious Transfer.
Technical Report . Harvard Aiken Computation Laboratory.Google Scholar - [65] . 2020. Trident: Efficient 4PC framework for privacy preserving machine learning. In NDSS’20. Internet Society.Google Scholar
- [66] . 2014. Wysteria: A programming language for generic, mixed-mode multiparty computations. In S&P’14. IEEE.Google Scholar
- [67] . 2018. Chameleon: A hybrid secure computation framework for machine learning applications. In ASIACCS’17. ACM.Google Scholar
- [68] . [n. d.]. libOTe: An Efficient, Portable, and Easy to Use Oblivious Transfer Library. https://github.com/osu-crypto/libOTe.Google Scholar
- [69] . 2019. MArBled circuits: Mixing arithmetic and boolean circuits with active security. In INDOCRYPT’19. Springer.Google Scholar
- [70] . 2013. GMW vs. Yao? Efficient secure two-party computation with low depth circuits. In FC’13. Springer.Google Scholar
- [71] . 2018. Removing the bottleneck for practical 2PC (Poster). In CCS’18. ACM.Google Scholar
- [72] . 2015. TinyGarble: Highly compressed and scalable sequential garbled circuits. In S&P’15. IEEE.Google Scholar
- [73] . 2018. A New Paradigm for Practical Maliciously Secure Multi-Party Computation. Ph. D. Dissertation. University of Maryland (College Park, Md.).
PhD thesis .Google Scholar - [74] . 2016. EMP-toolkit: Efficient multiparty computation toolkit. https://github.com/emp-toolkit.Google Scholar
- [75] . 2017. Global-scale secure multiparty computation. In CCS’17. ACM.Google Scholar
- [76] . 2020. Ferret: Fast extension for correlated oT with small communication. In CCS’20. ACM.Google Scholar
- [77] . 1986. How to generate and exchange secrets. In FOCS’86. IEEE.Google Scholar
- [78] . 2015. Obliv-C: A language for extensible data-oblivious computation. IACR Cryptology ePrint Archive, Report 2015/1153 (2015). https://ia.cr/2015/1153.Google Scholar
- [79] . 2013. PICCO: A general-purpose compiler for private distributed computation. In CCS’13. ACM.Google Scholar
- [80] . 2019. Helen: Maliciously secure coopetitive learning for linear models. In S&P’19. IEEE.Google Scholar
Index Terms
MOTION – A Framework for Mixed-Protocol Multi-Party Computation
Recommendations
An efficient fair UC-secure protocol for two-party computation
With the development of modern Internet and mobile networks, there is an increasing need for collaborative privacy-preserving applications. Secure multi-party computation SMPC gives a general solution to these applications and has become a hot topic. ...
Round-Optimal Secure Multi-Party Computation
Advances in Cryptology – CRYPTO 2018AbstractSecure multi-party computation (MPC) is a central cryptographic task that allows a set of mutually distrustful parties to jointly compute some function of their private inputs where security should hold in the presence of a malicious adversary ...
Secure Multi-Party Computation without Agreement
It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of ...






Comments