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

Peer-to-Peer Networking and Applications

High-throughput secure multiparty multiplication protocol via bipartite graph partitioning

Yi Xu, Changgen Peng, Weijie Tan, Youliang Tian, Minyao Ma, Hongfa Ding

Published Jan 8, 2021• 1 citation
Publisher
DOI
10.1007/s12083-020-01035-9

Related papers

A (k, n)-threshold dynamic quantum secure multiparty multiplication protocol

Fulin Li, Hang Hu, Shixin Zhu

Quantum Information Processing•Nov 24, 2022•7 citations

Efficient Secure Multiparty Computation Protocol in Asynchronous Network

Zheng Huang, Weidong Qiu, Qiang Li +1 more

Lecture notes in computer science•Jan 1, 2009•2 citations

High-Throughput Secure Multiparty Computation with an Honest Majority in Various Network Settings

Christopher Harth-Kitzerow, Ajith Suresh, Yongqin Wang +3 more

In this work, we present novel protocols over rings for semi-honest secure three-party computation (3PC) and malicious four-party computation (4PC) with one corruption. While most existing works focus on improving total communication complexity, challenges such as network heterogeneity and computational complexity, which impact MPC performance in practice, remain underexplored. Our protocols address these issues by tolerating multiple arbitrarily weak network links between parties without any substantial decrease in performance. Additionally, they significantly reduce computational complexity by requiring up to half the number of basic instructions per gate compared to related work. These improvements lead to up to twice the throughput of state-of-the-art protocols in homogeneous network settings and up to eight times higher throughput in real-world heterogeneous settings. These advantages come at no additional cost: Our protocols maintain the best-known total communication complexity per multiplication, requiring 3 elements for 3PC and 5 elements for 4PC.We implemented our protocols alongside several state-of-the-art protocols (Replicated 3PC, ASTRA, Fantastic Four, Tetrad) in a novel open-source C++ framework optimized for high throughput. Five out of six implemented 3PC and 4PC protocols achieve more than one billion 32-bit multiplications or over 32 billion AND gates per second using our implementation in a 25 Gbit/s LAN environment. This represents the highest throughput achieved in 3PC and 4PC so far, outperforming existing frameworks like MP-SPDZ, ABY3, MPyC, and MOTION by two to three orders of magnitude.

arXiv:2206.03776•Proceedings on Privacy Enhancing Technologies•Nov 10, 2024•11 citations

Quantum secure multiparty multiplication based on d-level single particles

Xiuli Song, Jie Yan, You-Sheng Zhou +1 more

The quantum secure multiparty multiplication (QSMM) protocol aims to leverage the advantages of quantum computing to ensure data privacy and security in multiparty computation, preventing information from being leaked and protecting privacy against malicious attacks. However, current QSMM protocols suffer from high resource consumption and computation complexity in particle preparation and participant computation stages. In view of this, a QSMM protocol based on single particles is proposed in this paper. The proposed protocol utilizes high-dimensional single particles as information carriers, and the optimized quantum multiplication circuit is employed to embed the participants’ secret message and perform the multiplication. All participants collaboratively generate a blind matrix, and each column product of the blind matrix acts as the participant’s private key for the blinding of the secret value. Unlike other protocols that use decoy particles for eavesdropping detection, the proposed protocol leverages the properties of mutually unbiased basis particles to ensure its security, while reducing quantum resource consumption and the quantum capabilities required from the participants. Security analysis demonstrates that the proposed protocol can effectively resist attacks from external eavesdroppers and internal participants, and performance analysis shows that the proposed protocol achieves superior execution efficiency compared to other similar protocols.

EPJ Quantum Technology•Dec 31, 2025•1 citation

Scalable Secure Multiparty Computation

Ivan Damgård, Yuval Ishai

Lecture notes in computer science•Jan 1, 2006•143 citations

Quantum secure protocols for multiparty computations

Tapaswini Mohanty, Vikas Srivastava, Sumit Kumar Debnath +1 more

arXiv:2312.16318•Journal of Information Security and Applications•Mar 20, 2025•3 citations
In this work, we present novel protocols over rings for semi-honest secure three-party computation (3PC) and malicious four-party computation (4PC) with one corruption. While most existing works focus on improving total communication complexity, challenges such as network heterogeneity and computational complexity, which impact MPC performance in practice, remain underexplored. Our protocols address these issues by tolerating multiple arbitrarily weak network links between parties without any substantial decrease in performance. Additionally, they significantly reduce computational complexity by requiring up to half the number of basic instructions per gate compared to related work. These improvements lead to up to twice the throughput of state-of-the-art protocols in homogeneous network settings and up to eight times higher throughput in real-world heterogeneous settings. These advantages come at no additional cost: Our protocols maintain the best-known total communication complexity per multiplication, requiring 3 elements for 3PC and 5 elements for 4PC.We implemented our protocols alongside several state-of-the-art protocols (Replicated 3PC, ASTRA, Fantastic Four, Tetrad) in a novel open-source C++ framework optimized for high throughput. Five out of six implemented 3PC and 4PC protocols achieve more than one billion 32-bit multiplications or over 32 billion AND gates per second using our implementation in a 25 Gbit/s LAN environment. This represents the highest throughput achieved in 3PC and 4PC so far, outperforming existing frameworks like MP-SPDZ, ABY3, MPyC, and MOTION by two to three orders of magnitude.
The quantum secure multiparty multiplication (QSMM) protocol aims to leverage the advantages of quantum computing to ensure data privacy and security in multiparty computation, preventing information from being leaked and protecting privacy against malicious attacks. However, current QSMM protocols suffer from high resource consumption and computation complexity in particle preparation and participant computation stages. In view of this, a QSMM protocol based on single particles is proposed in this paper. The proposed protocol utilizes high-dimensional single particles as information carriers, and the optimized quantum multiplication circuit is employed to embed the participants’ secret message and perform the multiplication. All participants collaboratively generate a blind matrix, and each column product of the blind matrix acts as the participant’s private key for the blinding of the secret value. Unlike other protocols that use decoy particles for eavesdropping detection, the proposed protocol leverages the properties of mutually unbiased basis particles to ensure its security, while reducing quantum resource consumption and the quantum capabilities required from the participants. Security analysis demonstrates that the proposed protocol can effectively resist attacks from external eavesdroppers and internal participants, and performance analysis shows that the proposed protocol achieves superior execution efficiency compared to other similar protocols.