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. This is less than a half compared with the previous work. Moreover, the number of communication bits is also
38.4% fewer. As a result, total online execution time is
56.1% 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.
Secure multi-party computation (MPC) enables mutually distrusting parties to jointly evaluate a function over their private inputs without revealing those inputs to any participant.Classical MPC constructions based on Boolean or arithmetic circuits incur significant computational overhead when deployed over large participant groups, and their security guarantees rest upon hardness assumptions that are vulnerable to quantum adversaries.This paper introduces an elliptic curve cryptography-based secure MPC framework that exploits the algebraic structure of elliptic curve groups over finite fields to construct efficient oblivious transfer extensions, Beaver triple generation, and verifiable secret sharing protocols.The framework models the computation as a directed acyclic graph over the elliptic curve group law, enabling algebraic optimizations that reduce the number of point multiplications required per gate evaluation.Pedersen commitments over the curve group provide unconditionally hiding and computationally binding commitment guarantees, while zeroknowledge proofs of knowledge of discrete logarithms authenticate each party's contribution without information leakage.Security is formalized in the universal composability (UC) framework under the decisional Diffie-Hellman (DDH) assumption in the standard model.Evaluation on benchmark circuits including AES key expansion, SHA-3 compression, and private set intersection demonstrates that the proposed EC-MPC protocol achieves 42.3 ms per gate for a four-party evaluation, outperforming BGW by 52.8% and GMW by 42.9% in identical configurations.The framework scales to 32-party computations with sub-quadratic communication overhead, confirming its practicality for cloud-based secure computation, privacy-preserving machine learning inference, and federated healthcare analytics.