Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

ACM SIGSAC Conference on Computer and Communications Security (CCS)

Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case

Nishanth Chandran, Juan A. Garay, Payman Mohassel, Satyanarayana Vusirikala

Published Oct 27, 2017• 14 citations
Publisher

Abstract

While the feasibility of constant-round and actively secure MPC has been known for over two decades, the last few years have witnessed a flurry of designs and implementations that make its deployment a palpable reality. To our knowledge, however, existing concretely efficient MPC constructions are only for up to three parties.
DOI
10.1145/3133956.3134100

Related papers

Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input Size

Seung Hwan Lee, Jaesang Noh, Taejeong Kim +2 more

Lecture notes in computer science•Jan 1, 2025•1 citation

A New Paradigm for Practical Maliciously Secure Multi-Party Computation

Xiao Wang

Secure Multi-Party Computation (MPC) protocols allow a group of mutually distrusting users to compute a function jointly on their inputs without revealing any information beyond the output. For many years, implementations of MPC protocols have targeted security against semi-honest adversaries, i.e., attackers are assumed to execute the protocol honestly but try to learn private information after the fact. Protocols secure against stronger and more realistic malicious adversaries, who could behave arbitrarily during the protocol execution, were known to exist but were much less efficient. This thesis introduces a new paradigm to construct extremely efficient MPC protocols with malicious security. In particular, this thesis consists of three major contributions. 1. We introduce the authenticated garbling framework, and present an efficient concrete instantiation of the protocol. The resulting protocol partially closes the gap between semi-honest and malicious MPC protocols asymptotically; the implementation of the protocol represents the state-of-the-art system for malicious two-party computation. 2. We discuss how to apply authenticated garbling to the multi-party setting, where all-but-one parties can be corrupted by the adversary. The resulting protocol improves upon the best previous constant-round protocol by orders of magnitude. We also present a system that, for the first time, enables MPC executions among hundreds of parties, distributed globally. 3. We present a series of optimizations to two-party authenticated garbling by interpreting authenticated garbling in a new way. The improved malicious protocol has essentially the same concrete efficiency as the best semi-honest protocol in the preprocessing model. 4. We develop these protocols in EMP-toolkit, a practical and efficient MPC tool that can be used to build new protocols and to develop applications using our existing protocols.

•Jan 1, 2018•2 citations

Secure multiparty computation

Yehuda Lindell

MPC has moved from theoretical study to real-world usage. How is it doing?

Communications of the ACM•Dec 17, 2020•371 citations

WINK:A Semi-Honest Secure Multi-Party Computation Framework with Efficient Comparison Protocol

Yuanqing Feng, Tao Bai, Zhi Gang Lu +3 more

Secure multi-party computation (MPC) allows multiple parties to jointly compute a task while preserving the privacy of their individual inputs. In recent years, researchers have extensively studied various security protocols to improve the efficiency of MPC and reduce communication overhead. However, the efficiency of MPC in an$n$-party setting still remains a challenge. In this paper, we introduce WINK, a MPC framework designed for the semi-honest security model that accommodates an arbitrary number of participants. We design an$n$-party multiplication protocol in the$n$-out-of-$n$arithmetic secret sharing setting and, based on this, construct independent multiplication triples. We leverage a RLWE-based oblivious linear evaluation (OLE) technique to batch generate multiplication triples between any two parties, significantly reducing communication overhead. Furthermore, we design a constant-round n-party comparison protocol based on the properties of odd-sized rings and garbled circuits. This protocol completes in only three rounds of communication with the help of additional non-colluding semi-honest servers, marking a significant improvement over previous$n$-party comparison protocols. We prove that our framework achieves universally composable security. Moreover, experimental results demonstrate that our proposed comparison protocol outperforms existing comparison protocols in terms of efficiency.

IEEE Symposium on Reliable Distributed Systems (SRDS)•Sep 29, 2025•0 citations

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

Lecture notes in computer science•Jan 1, 2021•19 citations

Fast Actively Secure Five-Party Computation with Security Beyond Abort

Megha Byali, Carmit Hazay, Arpita Patra +1 more

Secure Multi-party Computation (MPC) with small population and honest majority has drawn focus specifically due to customization in techniques and resulting efficiency that the constructions can offer. In this work, we investigate a wide range of security notions in the five-party setting, tolerating two active corruptions. Being constant-round, our protocols are best suited for real-time, high latency networks such as the Internet. In a minimal setting of pairwise-private channels, we present efficient instantiations with unanimous abort (where either all honest parties obtain the output or none of them do) and fairness (where the adversary obtains its output only if all honest parties also receive it). With the presence of an additional broadcast channel (known to be necessary), we present a construction with guaranteed output delivery (where any adversarial behaviour cannot prevent the honest parties from receiving the output). The broadcast communication is minimal and independent of circuit size. In terms of performance (communication and run time), our protocols incur minimal overhead over the best known protocol of Chandran et al. (ACM CCS 2016) that achieves the least security of selective abort. Further, our protocols for fairness and unanimous abort can be extended to n-parties with at most √n corruptions, similar to Chandran et al. Going beyond the most popular honest-majority setting of three parties with one corruption, our results demonstrate feasibility of attaining stronger security notions for more than one active corruption at an expense not too far from the least desired security of selective abort.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 6, 2019•11 citations
Secure Multi-Party Computation (MPC) protocols allow a group of mutually distrusting users to compute a function jointly on their inputs without revealing any information beyond the output. For many years, implementations of MPC protocols have targeted security against semi-honest adversaries, i.e., attackers are assumed to execute the protocol honestly but try to learn private information after the fact. Protocols secure against stronger and more realistic malicious adversaries, who could behave arbitrarily during the protocol execution, were known to exist but were much less efficient. This thesis introduces a new paradigm to construct extremely efficient MPC protocols with malicious security. In particular, this thesis consists of three major contributions. 1. We introduce the authenticated garbling framework, and present an efficient concrete instantiation of the protocol. The resulting protocol partially closes the gap between semi-honest and malicious MPC protocols asymptotically; the implementation of the protocol represents the state-of-the-art system for malicious two-party computation. 2. We discuss how to apply authenticated garbling to the multi-party setting, where all-but-one parties can be corrupted by the adversary. The resulting protocol improves upon the best previous constant-round protocol by orders of magnitude. We also present a system that, for the first time, enables MPC executions among hundreds of parties, distributed globally. 3. We present a series of optimizations to two-party authenticated garbling by interpreting authenticated garbling in a new way. The improved malicious protocol has essentially the same concrete efficiency as the best semi-honest protocol in the preprocessing model. 4. We develop these protocols in EMP-toolkit, a practical and efficient MPC tool that can be used to build new protocols and to develop applications using our existing protocols.
Secure multi-party computation (MPC) allows multiple parties to jointly compute a task while preserving the privacy of their individual inputs. In recent years, researchers have extensively studied various security protocols to improve the efficiency of MPC and reduce communication overhead. However, the efficiency of MPC in annnn-party setting still remains a challenge. In this paper, we introduce WINK, a MPC framework designed for the semi-honest security model that accommodates an arbitrary number of participants. We design annnn-party multiplication protocol in thennn-out-of-nnnarithmetic secret sharing setting and, based on this, construct independent multiplication triples. We leverage a RLWE-based oblivious linear evaluation (OLE) technique to batch generate multiplication triples between any two parties, significantly reducing communication overhead. Furthermore, we design a constant-round n-party comparison protocol based on the properties of odd-sized rings and garbled circuits. This protocol completes in only three rounds of communication with the help of additional non-colluding semi-honest servers, marking a significant improvement over previousnnn-party comparison protocols. We prove that our framework achieves universally composable security. Moreover, experimental results demonstrate that our proposed comparison protocol outperforms existing comparison protocols in terms of efficiency.
Secure Multi-party Computation (MPC) with small population and honest majority has drawn focus specifically due to customization in techniques and resulting efficiency that the constructions can offer. In this work, we investigate a wide range of security notions in the five-party setting, tolerating two active corruptions. Being constant-round, our protocols are best suited for real-time, high latency networks such as the Internet. In a minimal setting of pairwise-private channels, we present efficient instantiations with unanimous abort (where either all honest parties obtain the output or none of them do) and fairness (where the adversary obtains its output only if all honest parties also receive it). With the presence of an additional broadcast channel (known to be necessary), we present a construction with guaranteed output delivery (where any adversarial behaviour cannot prevent the honest parties from receiving the output). The broadcast communication is minimal and independent of circuit size. In terms of performance (communication and run time), our protocols incur minimal overhead over the best known protocol of Chandran et al. (ACM CCS 2016) that achieves the least security of selective abort. Further, our protocols for fairness and unanimous abort can be extended to n-parties with at most √n corruptions, similar to Chandran et al. Going beyond the most popular honest-majority setting of three parties with one corruption, our results demonstrate feasibility of attaining stronger security notions for more than one active corruption at an expense not too far from the least desired security of selective abort.