Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input Size
Seunghwan Lee, Jaesang Noh, Taejeong Kim, Dohyuk Kim, Dong-Joon Shin
Abstract
SPDZ-style and BMR-style protocols are widely known as practical MPC protocols that achieve active security in the dishonest majority setting. However, to date, SPDZ-style protocols have not achieved constant rounds, and BMR-style protocols have struggled to achieve scalable communication or computation. Additionally, there exists fully homomorphic encryption (FHE)-based MPC protocols that achieve both constant rounds and scalable communication, but they face challenges in achieving active security in the dishonest majority setting and are considered impractical due to computational inefficiencies.
In this work, we propose an MPC framework that constructs an efficient and scalable FHE-based MPC protocol by integrating a linear secret sharing scheme (LSSS)-based MPC and FHE. The resulting FHE-based MPC protocol achieves active security in the dishonest majority setting and constant complexity in online communication, computation per gate, rounds, and private input size. Notably, when instantiated with the SPDZ protocol and gate FHE for the framework, the resulting FHE-based MPC protocol efficiently achieves active security in the dishonest majority setting by using SPDZ-style MAC and ensures the computation per gate time within 3 ms. Moreover, its offline phase achieves scalable communication and computation, both of which grow linearly with the number of parties . In other words, the proposed FHE-based MPC preserves the key advantages of existing FHE-based MPCs and simultaneously overcomes the weaknesses of them. As a result, the proposed FHE-based MPC is a highly practical and secure like SPDZ-style and BMR-style protocols.
For the first time, we introduce the concept of circuit-privacy, which ensures that external adversaries who eavesdrop on communications do not obtain information about the circuit. We rigorously prove that our construction inherently satisfy circuit- privacy, thereby establishing a novel security option for MPC.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get b7614bb0-01f9-40ae-b120-c675a76ba968Cited by top-tier papers1
Ask how each one uses itRelated papers
- Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round CollapsingVipul Goyal, Junru Li, Rafail Ostrovsky, Yifan SongCRYPTO 2025 · 3 citations
- SuperPack: Dishonest Majority MPC with Constant Online CommunicationDaniel Escudero, Vipul Goyal, Antigoni Polychroniadou, Yifan Song et al.EUROCRYPT 2023 · 15 citations
- Multiparty Garbling from OT with Linear Scaling and RAM SupportDavid Heath, Vladimir Kolesnikov, Varun Narayanan, Rafail Ostrovsky et al.CRYPTO 2025 · 4 citations
- The Price of Active Security in Cryptographic ProtocolsCarmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor WeissEUROCRYPT 2020 · 17 citations
- Actively Secure MPC with O(|C|) Computation and Communication via CRTAlexander Bienstock, Daniel Escudero, Antigoni PolychroniadouCRYPTO 2026
