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

A Multi-Party Anonymous Quantum Secure Direct Communication Protocol Based on Weighted W States

zihao ye, Ri‐Gui Zhou, Lintao Du

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.2139/ssrn.7243573

Related papers

Multi-party semi-quantum secure direct communication protocol with cluster states

Liang-Chao Xu, Huaying Chen, Nanrun Zhou +1 more

International Journal of Theoretical Physics•May 26, 2020•11 citations

Quantum Secure Direct Communication Protocol Based on the Class of Three-Particle W States

Zhengwen Cao, Xiaoyi Feng, Jinye Peng +1 more

Communications in computer and information science•Jan 1, 2015•0 citations

Efficient Semi-Quantum Secure Multi-Party Summation Protocol Based on Cancelable Random Masks and Its Applications

Dan Wang, Yang Diedie, Haibin Wang

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.

Entropy•Jun 23, 2026•0 citations

Multi-participant quantum anonymous communication based on high-dimensional entangled states

Jiawei Liu, Qing-Xia Mu, Ronghua Che +3 more

Abstract Anonymous quantum communication (AQC) enables the secure transmission of quantum or classical messages between a sender and a receiver while ensuring the anonymity of their identities. Existing AQC protocols primarily address one-to-one anonymous communication. When there are multiple senders, they must send their messages sequentially to avoid collision problems. In this paper, we propose a multi-participant quantum anonymous communication (MQAC) by employing high-dimensional entangled states. In this protocol, multiple senders establish anonymous entanglement with multiple receivers of their choice and send quantum messages anonymously and simultaneously via quantum teleportation. To propose MQAC, we first present the toolbox we developed, which includes several sub-protocols such as the verification protocol, collision detection protocol, address distribution protocol, and notification protocol. These sub-protocols, which we propose, not only are important parts of MQAC but also serve as the foundation for solving many more complex tasks, such as anonymous commodity transaction. Additionally, the analysis of MQAC demonstrates that neither internal nor external attackers can steal the identities of the communication parties or the transmitted messages by employing any attack. Our work represents an original exploration of anonymous message transmission between multiple senders and receivers in quantum networks.

Physica Scripta•Jul 31, 2024•2 citations

QUANTUM COMMUNICATION BETWEEN ANONYMOUS SENDER AND ANONYMOUS RECEIVER IN THE PRESENCE OF STRONG ADVERSARY

Jan Bouda, Josef Šprojcar

While many scenarios of anonymous communication can be solved by various famous classical techniques including mix nets or dining cryptographers (DC), an abundant amount of anonymous tasks remains open. In this paper, we present a solution to one such task. Our protocol serves as a private communication channel for quantum messages while ensuring that both the sender and the receiver stay anonymous in a set of all parties. Our protocol is a continuation of our previous work on anonymous transmission of quantum information. The protocol does not require trusted parties, and is secure against an active adversary. It can also withstand denial of service attacks. The protocol exhibits an advantage of quantum resources over classical because no classical solution is known (in the same security settings). Entanglement swapping technique is used to create "symmetry" in the protocol, which makes it very transparent and easier to analyze. The security analysis we present is heavily based on our previous work on quantum anonymous communication. The task we implement is also a nice illustration of a cryptographic task where two parties in a multi-party protocol can be dishonest at the same time, but are not cooperating.

International Journal of Quantum Information•Mar 1, 2011•3 citations

A Novel Practical Quantum Secure Direct Communication Protocol

Lu Yin-Ju

International Journal of Theoretical Physics•Feb 21, 2021•8 citations
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.
Abstract Anonymous quantum communication (AQC) enables the secure transmission of quantum or classical messages between a sender and a receiver while ensuring the anonymity of their identities. Existing AQC protocols primarily address one-to-one anonymous communication. When there are multiple senders, they must send their messages sequentially to avoid collision problems. In this paper, we propose a multi-participant quantum anonymous communication (MQAC) by employing high-dimensional entangled states. In this protocol, multiple senders establish anonymous entanglement with multiple receivers of their choice and send quantum messages anonymously and simultaneously via quantum teleportation. To propose MQAC, we first present the toolbox we developed, which includes several sub-protocols such as the verification protocol, collision detection protocol, address distribution protocol, and notification protocol. These sub-protocols, which we propose, not only are important parts of MQAC but also serve as the foundation for solving many more complex tasks, such as anonymous commodity transaction. Additionally, the analysis of MQAC demonstrates that neither internal nor external attackers can steal the identities of the communication parties or the transmitted messages by employing any attack. Our work represents an original exploration of anonymous message transmission between multiple senders and receivers in quantum networks.
While many scenarios of anonymous communication can be solved by various famous classical techniques including mix nets or dining cryptographers (DC), an abundant amount of anonymous tasks remains open. In this paper, we present a solution to one such task. Our protocol serves as a private communication channel for quantum messages while ensuring that both the sender and the receiver stay anonymous in a set of all parties. Our protocol is a continuation of our previous work on anonymous transmission of quantum information. The protocol does not require trusted parties, and is secure against an active adversary. It can also withstand denial of service attacks. The protocol exhibits an advantage of quantum resources over classical because no classical solution is known (in the same security settings). Entanglement swapping technique is used to create "symmetry" in the protocol, which makes it very transparent and easier to analyze. The security analysis we present is heavily based on our previous work on quantum anonymous communication. The task we implement is also a nice illustration of a cryptographic task where two parties in a multi-party protocol can be dishonest at the same time, but are not cooperating.