Communication-efficient (client-aided) secure two-party protocols and its application

DOI10.1007/978-3-030-51280-4_20MaRDI QIDQ2226598zbMATH OpenOpenAlexFDO

Authors Satsuya Ohata, Koji Nuida

Publication date 8 February 2021

Full work available at URL https://arxiv.org/abs/1907.03415

zbMATH Keywords

beaver triple extensionsecure multi-party computation

Mathematics Subject Classification ID

Macroeconomic theory (monetary models, models of taxation) (91B64) Derivative securities (option pricing, hedging, etc.) (91G20) Cryptography (94A60)

Abstract: Secure multi-party computation (MPC) allows a set of parties to compute a function jointly while keeping their inputs private. Compared with the MPC based on garbled circuits,some recent research results show that MPC based on secret sharing (SS) works at a very high speed. Moreover, SS-based MPC can be easily vectorized and achieve higher throughput. In SS-based MPC, however, we need many communication rounds for computing concrete protocols like equality check, less-than comparison, etc. This property is not suited for large-latency environments like the Internet (or WAN). In this paper, we construct semi-honest secure communication-efficient two-party protocols. The core technique is Beaver triple extension, which is a new tool for treating multi-fan-in gates, and we also show how to use it efficiently. We mainly focus on reducing the number of communication rounds, and our protocols also succeed in reducing the number of communication bits (in most cases). As an example, we propose a less-than comparison protocol (under practical parameters) with three communication rounds. Moreover, the number of communication bits is also $38.4\mathrm{\%}$ fewer. As a result, total online execution time is $56.1\mathrm{\%}$ shorter than the previous work adopting the same settings. Although the computation costs of our protocols are more expensive than those of previous work, we confirm via experiments that such a disadvantage has small effects on the whole online performance in the typical WAN environments.

Recommendations

• Constant-round client-aided secure comparison protocol
• Secure equality and greater-than tests with sublinear online complexity
• Reducing communication channels in MPC
• Perfectly-Secure MPC with Linear Communication Complexity
• Batching multiple protocols to improve efficiency of multi-party computation

Cited in

(11)

• Efficiency and accuracy improvements of secure floating-point addition over secret sharing
• \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
• Constant-round client-aided secure comparison protocol
• An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
• Client-aided two-party secure interval test protocol
• Batching multiple protocols to improve efficiency of multi-party computation
• SecureBiNN: 3-party secure computation for binarized neural network inference
• MPClan: protocol suite for privacy-conscious computations
• Threshold fully homomorphic encryption over the torus
• Actively secure polynomial evaluation from shared polynomial encodings
• Pseudorandom correlation functions from Ring-LWR

This page was built for publication: Communication-efficient (client-aided) secure two-party protocols and its application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226598)