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.
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.
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.
Quantum Secure Multi-party Summation (QSMS) is a fundamental primitive of Quantum Secure Multi-party Computation (QSMC), enabling multiple participants to jointly compute the sum of their private inputs without disclosing individual data. However, most existing QSMS protocols require all participants to possess full quantum capabilities and often rely on pre-shared keys, auxiliary mask transmission, or multiple trusted third parties, resulting in high communication overhead and limited practicality. To address these limitations, we propose an efficient Semi-Quantum Secure Multi-party Summation (SQSMS) protocol based on d-dimensional n-particle entangled states. By exploiting the global correlation properties of high-dimensional entangled states, the proposed protocol generates correlated random masks directly from quantum measurement outcomes. These masks cancel automatically during the aggregation process, eliminating the need for additional mask distribution and transmission. Compared with existing QSMS schemes, the proposed protocol reduces communication overhead, improves quantum efficiency, and avoids reliance on pre-shared keys or multiple trusted third parties. Moreover, only simple measurement operations are required from classical participants, making the protocol more practical for semi-quantum environments. We further provide formal correctness and security analyses of the proposed protocol and conduct quantum circuit simulations using the IBM Qiskit platform to demonstrate its feasibility. Moreover, based on the proposed summation protocol, we design several extended application protocols, including anonymous voting, anonymous auction, and anonymous ranking, which further illustrate the scalability and practical applicability of the proposed scheme.
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.
Abstract Secure Multiparty Computation (MPC) is a cryptography technique that allows multiple parties to securely perform operations on their private inputs without revealing them. It is used in various applications, such as data aggregation in the cloud, IoT, etc., where data privacy is the prime concern. Many researchers have explored ways to develop secure protocols with minimal risk of data leakage. Many of these classical secure MPC protocols depend on classical random number generators. However, advances in quantum information processing are putting classical key distribution methods at risk. Traditional summation protocols adopt an ((n,n)) threshold approach, requiring the participation of all (n) players to compute the sum securely. However, the proposed quantum secure multiparty computation based on secure summation and QKD (QSMPC-SSQKD) introduces a generalised quantum secure multiparty summation protocol. The proposed protocol utilises entanglement, a fundamental property of quantum mechanics, to facilitate safe key exchange, thereby ensuring robust security measures. We use a quantum random number generator (QRNG) to generate true random numbers, ensuring privacy preservation. The protocol achieves a per-bit entropy level of 0.708 through QRNG, which provides strong randomness. The security of the proposed protocol is validated using the CHSCH test ((B≈2.8)), ensuring that any attempt to eavesdrop on the system can be detected, and the complete process will be rescheduled. Compared to some similar protocols, the proposed QSMPC-SSQKD protocol provides higher randomness and lower quantum circuit cost without using any trusted third party (TTP). This improvement enhances the protocol’s efficiency and practicality in preventing data leakage during computation.
Quantum Secret Sharing (QSS) employs the principles of quantum entanglement to securely distribute confidential information among multiple participants, such that the original secret can only be recovered through collaboration among an authorized subset of users. While QSS offers information-theoretic security independent of computational assumptions, its practical deployment on Noisy Intermediate-Scale Quantum (NISQ) hardware remains challenging. The presence of device imperfections, including gate errors, decoherence, and measurement inaccuracies, adversely affects quantum state fidelity and reduces the reliability of secret reconstruction during protocol execution. This paper presents a noise-resilient multiparty QSS framework integrating a (2,3)- threshold Shamir Secret Sharing scheme over Galois Field GF (8) with nine-qubit Greenberger–Horne–Zeilinger (GHZ) entanglement circuits, fully implemented on the IBM ibm_kingston 156-qubit Heron r2 quantum processor. A three-phase experimental methodology is adopted: noiseless simulation via Qiskit Aer, authentic hardware execution with 1024 measurement shots, and a combined Local Readout Error Mitigation (LRE) and Zero Noise Extrapolation (ZNE) pipeline. Across 24 participants in eight secret-sharing sessions, hardware noise introduced a 6.0% accuracy degradation relative to the ideal baseline, which the LRE+ZNE pipeline substantially recovered. The (2,3)-threshold security invariant was preserved throughout all phases, with singleplayer reconstruction rates held at exactly 0.000, well below the 12.5% random-guess baseline. Security is further reinforced through CRYSTALS-Kyber512 (NIST FIPS 203) post-quantum authentication, SHA-256 share commitments, SHA3-256 fairness verification, and bulletin board consensus, with verified resistance against seven attack categories. Results confirm that reliable hardware-validated QSS on current NISQ devices is achievable through systematic multi-technique error mitigation.
The summation and multiplication are two basic operations for secure multiparty quantum computation. The existing secure multiparty quantum summation and multiplication protocols have (n, n) threshold approach and their computation type is bit-by-bit, where n is total number of players. In this paper, we propose two hybrid (t, n) threshold quantum protocols for secure multiparty summation and multiplication based on the Shamir's secret sharing, SUM gate, quantum fourier transform, and generalized Pauli operator, where t is a threshold number of players that can perform the summation and multiplication. Their computation type is secret-by-secret with modulo d, where d, n ≤ d ≤ 2n, is a prime. The proposed protocols can resist the intercept-resend, entangle-measure, collusion, collective, and coherent quantum attacks. They have better computation as well as communication costs and no player can get other player's private input.