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

Lecture notes in computer science

Statistical Layered MPC

Giovanni Deligios, Anders Konring, Chen-Da Liu-Zhang, Varun Narayanan

Published Dec 2, 2024• 9 citations
Publisher
DOI
10.1007/978-3-031-78023-3_12

Related papers

Perfect MPC over Layered Graphs

Bernardo David, Giovanni Deligios, Aarushi Goel +5 more

Lecture notes in computer science•Jan 1, 2023•21 citations

Network Agnostic MPC with Statistical Security

Ananya Appan, Ashish Choudhury

arXiv:2306.01401•Lecture notes in computer science•Jan 1, 2023•8 citations

Statistical MPC with a Constant Communication Overhead (Extended Abstract)

Ashish Choudhary, Ivan Damgård, Shravani Mahesh Patil +1 more

Lecture notes in computer science•Nov 5, 2026•0 citations

Secure Multiparty Computation with Dynamic Participants and Guaranteed Output

Giovanni Deligios

Secure Multiparty Computation (MPC) is an expression encompassing cryptographic techniques that allow mutually distrustful parties to jointly perform computations over private data, ensuring correctness and preserving privacy despite malicious behavior. Guaranteed output is the strongest security goal for MPC: protocols with this property always deliver results. This is in contrast with weaker notions that allow malicious aborts. The seminal works of Ben-Or, Goldwasser, and Wigderson (STOC’88) and Rabin and Ben-Or (STOC’89) showed interactive protocols to compute any function with guaranteed output and perfect security if fewer than one third of parties are corrupted, or with statistical security (with a small error probability) if fewer than half are corrupted. These results hold when the set of participants is fixed throughout the execution. Ostrovsky and Yung’s proactive model (PODC’91) relaxes this assumption by allowing the set of corrupted parties to evolve over time, better capturing the dynamics of long-lived computations, where machines may be periodically compromised and recovered. The recent YOSO (You Only Speak Once) and fluid MPC models (CRYPTO’21) push this ambitious modelling even further by allowing for fully dynamic participation, with parties joining and leaving the computation at will. In this setting, known protocols with guaranteed output fall short of optimal resilience or rely on non-standard communication and adversarial assumptions. Matching the classical BGW and Rabin–Ben-Or bounds in these settings remained an open problem. We resolve these questions within the Layered MPC abstraction of David et al. (CRYPTO’23), in which the interaction pattern of a protocol is restricted to be a layered graph, meaning parties are partitioned into a sequence of disjoint sets (layers) and can send private and broadcast messages to parties in immediately subsequent layers. We match the BGW and Rabin and Ben-Or bounds in this model, fully characterizing the feasibility landscape of Layered MPC with guaranteed output. As a stepping stone towards our statistically secure protocol, we construct a more efficient and conceptually simpler computationally secure protocol relying on linear non-interactive commitments. Our results yield optimally-resilient and maximally-proactive MPC protocols with guaranteed output for both perfect and statistical security.

•Jan 1, 2025•0 citations

A Unified View on MPC with Dynamic Committees

Chen-Da Liu-Zhang

Abstract Multi-Party Computation (MPC) enables a set of parties to jointly compute a function while preserving the privacy of their inputs. Although the problem has been studied for several decades, most prior work considers the classical setting in which the set of parties is fixed throughout the protocol execution. This assumption is poorly suited for modern applications that are long-lived and in which parties may join or leave the computation dynamically. Motivated by this limitation, a growing body of recent work has introduced models of MPC with dynamic committees, including YOSO MPC, Fluid MPC, Layered MPC, and SCALES, among others. The proliferation of such models raises natural questions: how do these approaches relate to each other, and can they be unified under a common framework? We show that MPC with dynamic committees can be reduced to the design of a classical MPC protocol with a static set of parties and a general adversary structure, but where the interaction pattern is constrained to follow a fixed layered acyclic graph. Each party corresponds to a node in the graph and can send secret messages along its outgoing edges. We further demonstrate that existing dynamic-committee MPC models can be recovered as specific instantiations of this layered-graph framework.

Journal of the Indian Institute of Science•May 11, 2026•1 citation

A Model Predictive Control-Inspired Quantum Algorithm

Dominic Messina, Alicia B. Magann, Mohan Sarovar +1 more

We introduce a new hybrid quantum-classical algorithm inspired by an advanced control strategy known as model predictive control (MPC). This algorithm unifies the optimization-based design of variational quantum algorithms (VQAs) with the feedback-based design of feedback-based quantum algorithms (FQAs). Variational circuit parameters are optimized using a layer-wise receding horizon strategy, where observable measurements after every layer initialize a classically simulated dynamic model used to predict quantum state evolution and optimize over future parameterized gates. This hybrid algorithm can be used for applications such as ground state preparation and approximate combinatorial optimization, and presents an ideal use case for the integration of quantum computers with high-performance computing, where the latter resource can be used to increase the scale and efficiency of the predictions critical to MPC. We show through mathematical proof and numerical evidence that the MPC-based algorithm can be guaranteed to at least match the performance of FQAs. Through simulations on Max-Cut problems and a two-dimensional transverse-field Ising model, we demonstrate that relaxed implementations of the MPC-based algorithm can also provide improved performance in practice compared to an FQA.

quant-pharXiv:2607.24992•Jul 29, 2026•0 citations
Secure Multiparty Computation (MPC) is an expression encompassing cryptographic techniques that allow mutually distrustful parties to jointly perform computations over private data, ensuring correctness and preserving privacy despite malicious behavior. Guaranteed output is the strongest security goal for MPC: protocols with this property always deliver results. This is in contrast with weaker notions that allow malicious aborts. The seminal works of Ben-Or, Goldwasser, and Wigderson (STOC’88) and Rabin and Ben-Or (STOC’89) showed interactive protocols to compute any function with guaranteed output and perfect security if fewer than one third of parties are corrupted, or with statistical security (with a small error probability) if fewer than half are corrupted. These results hold when the set of participants is fixed throughout the execution. Ostrovsky and Yung’s proactive model (PODC’91) relaxes this assumption by allowing the set of corrupted parties to evolve over time, better capturing the dynamics of long-lived computations, where machines may be periodically compromised and recovered. The recent YOSO (You Only Speak Once) and fluid MPC models (CRYPTO’21) push this ambitious modelling even further by allowing for fully dynamic participation, with parties joining and leaving the computation at will. In this setting, known protocols with guaranteed output fall short of optimal resilience or rely on non-standard communication and adversarial assumptions. Matching the classical BGW and Rabin–Ben-Or bounds in these settings remained an open problem. We resolve these questions within the Layered MPC abstraction of David et al. (CRYPTO’23), in which the interaction pattern of a protocol is restricted to be a layered graph, meaning parties are partitioned into a sequence of disjoint sets (layers) and can send private and broadcast messages to parties in immediately subsequent layers. We match the BGW and Rabin and Ben-Or bounds in this model, fully characterizing the feasibility landscape of Layered MPC with guaranteed output. As a stepping stone towards our statistically secure protocol, we construct a more efficient and conceptually simpler computationally secure protocol relying on linear non-interactive commitments. Our results yield optimally-resilient and maximally-proactive MPC protocols with guaranteed output for both perfect and statistical security.
Abstract Multi-Party Computation (MPC) enables a set of parties to jointly compute a function while preserving the privacy of their inputs. Although the problem has been studied for several decades, most prior work considers the classical setting in which the set of parties is fixed throughout the protocol execution. This assumption is poorly suited for modern applications that are long-lived and in which parties may join or leave the computation dynamically. Motivated by this limitation, a growing body of recent work has introduced models of MPC with dynamic committees, including YOSO MPC, Fluid MPC, Layered MPC, and SCALES, among others. The proliferation of such models raises natural questions: how do these approaches relate to each other, and can they be unified under a common framework? We show that MPC with dynamic committees can be reduced to the design of a classical MPC protocol with a static set of parties and a general adversary structure, but where the interaction pattern is constrained to follow a fixed layered acyclic graph. Each party corresponds to a node in the graph and can send secret messages along its outgoing edges. We further demonstrate that existing dynamic-committee MPC models can be recovered as specific instantiations of this layered-graph framework.
We introduce a new hybrid quantum-classical algorithm inspired by an advanced control strategy known as model predictive control (MPC). This algorithm unifies the optimization-based design of variational quantum algorithms (VQAs) with the feedback-based design of feedback-based quantum algorithms (FQAs). Variational circuit parameters are optimized using a layer-wise receding horizon strategy, where observable measurements after every layer initialize a classically simulated dynamic model used to predict quantum state evolution and optimize over future parameterized gates. This hybrid algorithm can be used for applications such as ground state preparation and approximate combinatorial optimization, and presents an ideal use case for the integration of quantum computers with high-performance computing, where the latter resource can be used to increase the scale and efficiency of the predictions critical to MPC. We show through mathematical proof and numerical evidence that the MPC-based algorithm can be guaranteed to at least match the performance of FQAs. Through simulations on Max-Cut problems and a two-dimensional transverse-field Ising model, we demonstrate that relaxed implementations of the MPC-based algorithm can also provide improved performance in practice compared to an FQA.