New Primitives for Actively-Secure MPC mod $2^k$ with Applications to Private Machine Learning presented at IEEESymposium 2019

by Ivan Damgård, Tore Kasper Frederiksen, Peter Scholl, Marcel Keller, Daniel Escudero, Nikolaj Volgushev,

URL : https://www.youtube.com/watch?v=ljtyYAAyIKQ

Summary : At CRYPTO 2018 Cramer et al. presented SPDZ2k , a new secret-sharing based protocol for actively secure multi-party computation against a dishonest majority, that works over rings instead of fields. Their protocol uses slightly more communication than competitive schemes working over fields. However, implementation-wise, their approach allows for arithmetic to be carried out using native 32 or 64-bit CPU operations rather than modulo a large prime. The authors thus conjectured that the increased communication would be more than made up for by the increased efficiency of implementations. In this work we answer their conjecture in the affirmative. We do so by implementing their scheme, and designing and implementing new efficient protocols for equality test, comparison, and truncation over rings. We further show that these operations find application in the machine learning domain, and indeed significantly outperform their field-based competitors. In particular, we implement and benchmark oblivious algorithms for decision tree and support vector machine (SVM) evaluation.