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

IEEE International Conference on Quantum Computing and Engineering (QCE)

Hybrid Quantum-Classical Multi-Party Computation

Videet Acharya, Prateek Talwar, Kunal Korgoankar

Published Aug 30, 2025• 0 citations
Publisher

Abstract

Multi-Party Computation allows multiple participants to jointly compute a function using their respective inputs while maintaining the confidentiality of those inputs and avoiding a single point of vulnerability or failure. This paper presents a framework (or architecture) for a hybrid Quantum-Classical Multi-Party Computation (QAMPC) protocol, which uses classical methods to generate player shares and shadow shares, while quantum techniques handle the masking of shares and the reconstruction process. Quantum masking enables the reuse of shadow shares even if an eavesdropper is present. The proposed architecture, incorporating quantum masking, enhances the performance and security of the MPC protocol. Overall, this study offers a pathway for developing practical quantum-classical hybrid protocols for MPC.

DOI
10.1109/qce65121.2025.10487

Related papers

Quantum-Augmented Multi-party Computation: Boosting Efficiency and Security Through Masking

Videet Acharya, Prateek Talwar, Kunal Korgoankar

Abstract Multi-party computation (MPC) allows several parties to jointly compute a function while preserving input confidentiality and avoiding single points of failure. The study presents a hybrid architecture for Quantum-Augmented MPC (QAMPC) that combines Shamir secret sharing (SSS) with a quantum masking and rebuild stage. The masking operation involves adding a random number to the shadow share. The protocol classically generates player shares and reusable shadow shares, and employs quantum processes such as entanglement with the Quantum Fourier Transform (QFT) or X gates for masking. The quantum masking step enables safe reuse of shadow shares even in the presence of an eavesdropper. In simulations, compared to an equivalent classical masking technique, the QAMPC protocol achieves 10.9× lower verification overhead to authenticate a 20-bit secret with 9 parties (as classical-only masking suffers from substantive message passing overheads); it also delivers up to 4.66× higher transaction throughput (since masking permits multiple authentication runs without re-executing the full 'classical MPC'). The security analysis of the QAMPC protocols shows that the eavesdropper’s effort to recover the secret grows exponentially with the secret size and the number of players. The protocols were also tested in a noisy environment. For instance, X gate-based masking holds well in the presence of noise, providing a \((99%)\) success rate with an error rate of \((0.1%)\). These results indicate that quantum masking can substantially reduce verification overhead and increase throughput in SSS-based MPC while strengthening resilience to eavesdropping.

•Oct 23, 2025•0 citations

Quantum Security Multi-Party Computation Based on Quantum Coherence

Jincheng Zhang

This paper explores the application of quantum coherence, specifically quantum coherence, to enhance the security of hardware multi-party computation (MPC). Traditional MPC protocols often rely on computational assumptions that are increasingly vulnerable to advancements in classical computing power. Quantum coherence presents a fundamentally different approach to security, leveraging the ephemeral nature of quantum states to mitigate information leakage. We propose a novel MPC protocol that utilizes quantum coherence to create a secure environment where participants can collaboratively compute a function without revealing their individual inputs. The core of the protocol lies in carefully designed quantum operations and measurement strategies that exploit the inherent fragility of quantum coherence. This approach offers a promising path towards building robust and secure MPC systems suitable for applications requiring high levels of confidentiality, particularly in scenarios where classical computational attacks are a significant concern. We detail the protocol's structure, outlining the key elements and providing a mathematical framework for analyzing its security properties. The paper concludes with a discussion of potential challenges and future research directions in this emerging area.

•Sep 2, 2026•0 citations

Quantum Network Security: A Multi-Party Computation Protocol Leveraging Quantum Key Distribution and Quantum State Secure Computation

Jincheng Zhang

This paper presents a novel protocol for secure multi-party computation (MPC) within a quantum network, integrating Quantum Key Distribution (QKD) and quantum state secure computation techniques. The core objective is to enable multiple parties to collaboratively perform computations without revealing their individual inputs. The proposed protocol establishes a secure communication channel using QKD, guaranteeing the exchange of secret keys. Subsequently, a quantum state secure multi-party computation algorithm is employed, ensuring the confidentiality and integrity of the computation process. The utilization of quantum key distribution significantly enhances the security of the entire system, mitigating vulnerabilities associated with traditional MPC schemes. The theoretical analysis demonstrates the protocol's resilience against various attacks, providing a foundation for building robust and secure quantum network applications. The protocol's effectiveness hinges on the ability to maintain quantum coherence during the computational steps and accurately manage the quantum key distribution process. This research contributes to the advancement of secure quantum computing and communication technologies.

•Aug 31, 2026•0 citations

Quantum Network Secure Multi-Party Computation

Jincheng Zhang

This paper explores the design and implementation of a secure multi-party computation (MPC) protocol within a quantum network environment. The core aim is to facilitate computation among multiple parties while guaranteeing the confidentiality of their inputs and the overall computation results. This is achieved by leveraging the principles of Quantum Key Distribution (QKD) and the inherent security provided by the quantum state's properties. We present a protocol that utilizes QKD for secure key exchange among participants and employs quantum state manipulation to obscure intermediate values during computation. The protocol addresses the challenges posed by quantum eavesdropping and ensures the integrity of the final outcome. The key contributions of this work lie in the integration of established MPC techniques with the unique capabilities of a quantum network, offering a novel approach to secure distributed computation. The theoretical analysis demonstrates the protocol's security under specific assumptions, and outlines potential avenues for future research and optimization.

•Aug 28, 2026•0 citations

On secret sharing-based classical and quantum multi-party computation

J.G. Hölting

Secure multi-party computation (MPC) is a cryptographic primitive that lets a num- ber N of mutually distrustful parties compute a function f (x1, . . . , xN ) on their private inputs xi such that at the end of the MPC protocol, each honest party obtains the func- tion’s correct output and no adversary controlling a certain subset of parties learns any- thing about the honest parties’ inputs beyond what can be inferred from the function’s output value. In 2002, [Smi01] and [CGS02] introduced the notion of multi-party quan- tum computation (MPQC) in which arbitrary quantum circuits can be evaluated in a distributed manner, secure against a quantum adversary. Few protocols for MPQC are known. We present a fundamental study of the building blocks of MPC and MPQC in the information-theoretic setting with a focus on protocols built on top of (quantum) se- cret sharing schemes. In particular, we point out structural similarities and differences and compile an extensive list of theoretical feasibility results for the maximum number of corrupted parties within classical and quantum secret sharing and MPC protocols.

•Jan 1, 2020•0 citations

Secure Multi-Party Computation Protocol Based on Quantum Key Distribution

Jincheng Zhang

This paper presents a novel protocol for secure multi-party computation (MPC) leveraging the security of quantum key distribution (QKD). The core claim is to design a protocol that guarantees secure computation among multiple participants. The proposed mechanism utilizes the inherent security of QKD to construct a framework for secure multi-party computation. This approach addresses the limitations of traditional MPC protocols that often rely on computationally intensive assumptions, offering a potentially more robust solution in the face of evolving cryptographic threats. The protocol details the steps involved in generating a shared secret key through QKD, followed by the secure computation process based on the key. We outline the mathematical foundations and formalize the protocol's components, demonstrating its feasibility and potential advantages. The protocol is designed to be adaptable and scalable, offering a viable route toward secure distributed computing in quantum-enhanced environments.

•Aug 28, 2026•0 citations
Multi-Party Computation allows multiple participants to jointly compute a function using their respective inputs while maintaining the confidentiality of those inputs and avoiding a single point of vulnerability or failure. This paper presents a framework (or architecture) for a hybrid Quantum-Classical Multi-Party Computation (QAMPC) protocol, which uses classical methods to generate player shares and shadow shares, while quantum techniques handle the masking of shares and the reconstruction process. Quantum masking enables the reuse of shadow shares even if an eavesdropper is present. The proposed architecture, incorporating quantum masking, enhances the performance and security of the MPC protocol. Overall, this study offers a pathway for developing practical quantum-classical hybrid protocols for MPC.
Abstract Multi-party computation (MPC) allows several parties to jointly compute a function while preserving input confidentiality and avoiding single points of failure. The study presents a hybrid architecture for Quantum-Augmented MPC (QAMPC) that combines Shamir secret sharing (SSS) with a quantum masking and rebuild stage. The masking operation involves adding a random number to the shadow share. The protocol classically generates player shares and reusable shadow shares, and employs quantum processes such as entanglement with the Quantum Fourier Transform (QFT) or X gates for masking. The quantum masking step enables safe reuse of shadow shares even in the presence of an eavesdropper. In simulations, compared to an equivalent classical masking technique, the QAMPC protocol achieves 10.9× lower verification overhead to authenticate a 20-bit secret with 9 parties (as classical-only masking suffers from substantive message passing overheads); it also delivers up to 4.66× higher transaction throughput (since masking permits multiple authentication runs without re-executing the full 'classical MPC'). The security analysis of the QAMPC protocols shows that the eavesdropper’s effort to recover the secret grows exponentially with the secret size and the number of players. The protocols were also tested in a noisy environment. For instance, X gate-based masking holds well in the presence of noise, providing a (99(99%)(99 success rate with an error rate of (0.1(0.1%)(0.1. These results indicate that quantum masking can substantially reduce verification overhead and increase throughput in SSS-based MPC while strengthening resilience to eavesdropping.
This paper explores the application of quantum coherence, specifically quantum coherence, to enhance the security of hardware multi-party computation (MPC). Traditional MPC protocols often rely on computational assumptions that are increasingly vulnerable to advancements in classical computing power. Quantum coherence presents a fundamentally different approach to security, leveraging the ephemeral nature of quantum states to mitigate information leakage. We propose a novel MPC protocol that utilizes quantum coherence to create a secure environment where participants can collaboratively compute a function without revealing their individual inputs. The core of the protocol lies in carefully designed quantum operations and measurement strategies that exploit the inherent fragility of quantum coherence. This approach offers a promising path towards building robust and secure MPC systems suitable for applications requiring high levels of confidentiality, particularly in scenarios where classical computational attacks are a significant concern. We detail the protocol's structure, outlining the key elements and providing a mathematical framework for analyzing its security properties. The paper concludes with a discussion of potential challenges and future research directions in this emerging area.
This paper presents a novel protocol for secure multi-party computation (MPC) within a quantum network, integrating Quantum Key Distribution (QKD) and quantum state secure computation techniques. The core objective is to enable multiple parties to collaboratively perform computations without revealing their individual inputs. The proposed protocol establishes a secure communication channel using QKD, guaranteeing the exchange of secret keys. Subsequently, a quantum state secure multi-party computation algorithm is employed, ensuring the confidentiality and integrity of the computation process. The utilization of quantum key distribution significantly enhances the security of the entire system, mitigating vulnerabilities associated with traditional MPC schemes. The theoretical analysis demonstrates the protocol's resilience against various attacks, providing a foundation for building robust and secure quantum network applications. The protocol's effectiveness hinges on the ability to maintain quantum coherence during the computational steps and accurately manage the quantum key distribution process. This research contributes to the advancement of secure quantum computing and communication technologies.
This paper explores the design and implementation of a secure multi-party computation (MPC) protocol within a quantum network environment. The core aim is to facilitate computation among multiple parties while guaranteeing the confidentiality of their inputs and the overall computation results. This is achieved by leveraging the principles of Quantum Key Distribution (QKD) and the inherent security provided by the quantum state's properties. We present a protocol that utilizes QKD for secure key exchange among participants and employs quantum state manipulation to obscure intermediate values during computation. The protocol addresses the challenges posed by quantum eavesdropping and ensures the integrity of the final outcome. The key contributions of this work lie in the integration of established MPC techniques with the unique capabilities of a quantum network, offering a novel approach to secure distributed computation. The theoretical analysis demonstrates the protocol's security under specific assumptions, and outlines potential avenues for future research and optimization.
Secure multi-party computation (MPC) is a cryptographic primitive that lets a num- ber N of mutually distrustful parties compute a function f (x1, . . . , xN ) on their private inputs xi such that at the end of the MPC protocol, each honest party obtains the func- tion’s correct output and no adversary controlling a certain subset of parties learns any- thing about the honest parties’ inputs beyond what can be inferred from the function’s output value. In 2002, [Smi01] and [CGS02] introduced the notion of multi-party quan- tum computation (MPQC) in which arbitrary quantum circuits can be evaluated in a distributed manner, secure against a quantum adversary. Few protocols for MPQC are known. We present a fundamental study of the building blocks of MPC and MPQC in the information-theoretic setting with a focus on protocols built on top of (quantum) se- cret sharing schemes. In particular, we point out structural similarities and differences and compile an extensive list of theoretical feasibility results for the maximum number of corrupted parties within classical and quantum secret sharing and MPC protocols.
This paper presents a novel protocol for secure multi-party computation (MPC) leveraging the security of quantum key distribution (QKD). The core claim is to design a protocol that guarantees secure computation among multiple participants. The proposed mechanism utilizes the inherent security of QKD to construct a framework for secure multi-party computation. This approach addresses the limitations of traditional MPC protocols that often rely on computationally intensive assumptions, offering a potentially more robust solution in the face of evolving cryptographic threats. The protocol details the steps involved in generating a shared secret key through QKD, followed by the secure computation process based on the key. We outline the mathematical foundations and formalize the protocol's components, demonstrating its feasibility and potential advantages. The protocol is designed to be adaptable and scalable, offering a viable route toward secure distributed computing in quantum-enhanced environments.