Round-Efficient Protocols for Secure Multiparty Fixed-Point Arithmetic
Octavian Catrina · 2018 International Conference on Communications (COMM) · 2018
Secure multiparty computation provides specially designed cryptographic protocols for collaborative applications with private inputs and outputs. Computing with private data has been successfully demonstrated for some real-life applications. However, meeting the application requirements still requires major improvements of the protocols' performance and functionality. In this paper, we present improved building blocks and protocols for secure fixed-point arithmetic based on the framework introduced in [1], [2]. We show that the number of interaction rounds can be substantially reduced with respect to the initial solutions (e.g., multiplication in 1 round, instead of 2 rounds, division in 14 rounds, instead of 43 rounds). The new building blocks used in these protocols are of independent interest, e.g., they can provide much needed improvements for secure floating-point arithmetic.