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

arXiv:2604.27284

Quantum Anonymous Secret Sharing with Permutation Invariant Codes

Varin Sikand, Andrew Nemec

quant-phcs.CRcs.ITSubmitted Apr 30, 2026• Announced May 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an authorized set of shares present for decoding. In this work, we describe a protocol that enables sender-anonymity during the secret decoding process. By using permutation-invariant QEC codes along with a set of anonymous quantum transmission algorithms, we construct a quantum anonymous secret sharing scheme that achieves sender-anonymity. We quantify information leakage in ramp quantum secret sharing schemes via the quantum conditional min-entropy, justifying it as a valid measure of leaked information by relating it to the Knill-Laflamme quantum error correction conditions. Finally, we evaluate several permutation-invariant codes using this measure to make observations on the information leakage of intermediate shares for each quantum anonymous secret sharing scheme.

Comments
12 pages, 4 figures

Related papers

Enhanced quantum secret sharing protocol for anonymous secure communication utilizing W states

Guodong Li, Wen-Chuan Cheng, Qingle Wang +3 more

Quantum secret sharing (QSS) represents the fusion of quantum mechanics principles with secret information sharing, allowing a sender to distribute a secret among receivers for collective recovery. This paper introduces the concept of quantum anonymous secret sharing (QASS) to enhance the practicality of such protocols. We propose a QASS protocol leveraging W states, ensuring both recover-security and anonymity of shared secrets. Our protocol undergoes rigorous evaluation verifying their accuracy and fortifying their security against scenarios involving the active adversary. Additionally, acknowledging the imperfections inherent in real-world communication channels, we conduct a comprehensive analysis of protocol security and efficacy in noisy quantum networks. Our investigations reveal that W states exhibit good performance in mitigating noise interference, making them apt for practical applications.

iScience•Apr 29, 2024•14 citations

Quantum Secret Sharing Enhanced: Utilizing W States for Anonymous and Secure Communication

Guodong Li, Wen-Chuan Cheng, Qingle Wang +3 more

Quantum secret sharing (QSS) is the result of merging the principles of quantum mechanics with secret information sharing. It enables a sender to share a secret among receivers, and the receivers can then collectively recover the secret when the need arises. To enhance the practicality of these quantum protocols, an innovative concept of quantum anonymous secret sharing (QASS) is advanced. In this paper, we propose a QASS protocol via W states, which can share secrets while ensuring recover-ability, recover-security, and recover-anonymity. We have rigorously evaluated our protocols, verifying their accuracy and fortifying their security against scenarios involving the active adversary. This includes considerations for dishonest receivers and non-receivers. Moreover, acknowledging the imperfections inherent in real-world communication channels, we have also undertaken an exhaustive analysis of our protocol's security and effectiveness in a quantum network where some form of noise is present. Our investigations reveal that W states exhibit good performance in mitigating noise interference, making them apt for practical applications.

arXiv:2402.02413•Feb 4, 2024•0 citations

A secure dynamic quantum anonymous secret sharing protocol utilizing GHZ states

Qingle Wang, Ying-ying Wang, Yuancheng Li +3 more

Abstract Quantum secret sharing enables participants to share secrets grounded in the principles of quantum mechanics, ensuring the secrets recovery solely through collaborative efforts within an authorized subset of participants. Quantum anonymous secret sharing fulfills the fundamental requirements of quantum secret sharing while also ensuring the anonymity of the secret receivers. In order to address the turnover of personnel in practical scenarios, this paper propose a secure dynamic quantum anonymous secret sharing protocol utilizing Greenberger-Horne-Zeilinger states. In our scheme, on the premise of not reveal the identities of participants, the dynamic update of the participants can be realized, and the shared secret will not be altered. Furthermore, an identity authentication mechanism using single particles is introduced in this protocol, ensuring that only authenticated participants can engage in the sharing process. The proposed protocol is secure and can resist both internal and external attacks. Experimental validation conducted on the IBM quantum computing platform demonstrates the feasibility of our scheme.

Physica Scripta•Aug 30, 2024•8 citations

Entanglement sharing protocol via quantum error-correcting codes

Ran Hee Choi, Ben Fortescue, Gilad Gour +1 more

We introduce a multiparty cryptographic protocol, which we call entanglement sharing schemes, wherein a dealer retains half of a maximally entangled bipartite state and encodes the other half into a multipartite state that is distributed among multiple players. In a close analog to quantum secret sharing, some subsets of players can recover maximal entanglement with the dealer whereas other subsets can recover no entanglement (though they may retain classical correlations with the dealer). We find a lower bound on the share size for such schemes and construct two nontrivial examples based on Shor's $[[9,1,3]]$ and the $[[4,2,2]]$ stabilizer code; we further demonstrate how other examples may be obtained from quantum error correcting codes through classical encryption. Finally, we demonstrate that entanglement sharing schemes can be applied to characterize leaked information in quantum ramp secret sharing.

arXiv:1212.4217•Physical Review A•Mar 15, 2013•6 citations

Construction of a Class of Communication-Efficient Quantum Secret Sharing Schemes

Chenhao Li, Zhihui Li, Jiansheng Guo +2 more

Quantum secret sharing is a fundamental technique in quantum cryptography. However, in practical quantum networks, it still faces several bottlenecks, such as high quantum communication cost and low transmission efficiency. To reduce the communication cost, ramp quantum secret sharing schemes have been proposed in existing studies. Nevertheless, intermediate sets in such schemes may leak partial information about the secret. To address this problem, this paper presents a method for detecting intermediate sets. Based on this method, we further propose a communication-efficient perfect quantum secret sharing scheme with eavesdropping detection capability.We analyze the communication cost under different numbers of participating parties and determine the range of participants that minimizes the reconstruction communication cost. The results verify the communication efficiency and security of the proposed scheme.

quant-pharXiv:2607.19891•Entropy•Jul 23, 2026•0 citations

A Novel Authenticated Quantum Anonymous Secret Sharing for Classical and Quantum Information

Qingle Wang, Yixi Xu, Guodong Li +4 more

Abstract Anonymous secret sharing (ASS) is an essential cryptographic concept that facilitates the sharing and reconstruction of secret information while safeguarding the identity of the involved secret receivers, which has broad applications in key management, data backup, and distributed systems. In this study, a novel authenticated quantum anonymous secret sharing (QASS) protocol that emphasizes information privacy and identity anonymity protection is proposed. Employing ‐level multipartite GHZ states as a quantum resource, one‐sided anonymous entanglement (AE) is innovatively established between the dealer and anonymous receivers, enabling the dealer to distribute a random share of secret information. Additionally, by establishing a one‐sided AE between anonymous receivers and restorer, the restorer can securely collect and reconstruct the secret information using quantum teleportation (QT). Rigorous security analysis demonstrates that protocol can resist attacks from active adversaries and potentially dishonest users. Quantum experiments on IBM Qiskit validate the correctness and feasibility of the proposed QASS protocol. This work contributes to the advancement of quantum anonymous communication, addressing the requirements for information privacy and identity anonymity in practical application environments.

Advanced Quantum Technologies•Sep 6, 2024•4 citations
Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an authorized set of shares present for decoding. In this work, we describe a protocol that enables sender-anonymity during the secret decoding process. By using permutation-invariant QEC codes along with a set of anonymous quantum transmission algorithms, we construct a quantum anonymous secret sharing scheme that achieves sender-anonymity. We quantify information leakage in ramp quantum secret sharing schemes via the quantum conditional min-entropy, justifying it as a valid measure of leaked information by relating it to the Knill-Laflamme quantum error correction conditions. Finally, we evaluate several permutation-invariant codes using this measure to make observations on the information leakage of intermediate shares for each quantum anonymous secret sharing scheme.
Quantum secret sharing (QSS) represents the fusion of quantum mechanics principles with secret information sharing, allowing a sender to distribute a secret among receivers for collective recovery. This paper introduces the concept of quantum anonymous secret sharing (QASS) to enhance the practicality of such protocols. We propose a QASS protocol leveraging W states, ensuring both recover-security and anonymity of shared secrets. Our protocol undergoes rigorous evaluation verifying their accuracy and fortifying their security against scenarios involving the active adversary. Additionally, acknowledging the imperfections inherent in real-world communication channels, we conduct a comprehensive analysis of protocol security and efficacy in noisy quantum networks. Our investigations reveal that W states exhibit good performance in mitigating noise interference, making them apt for practical applications.
Quantum secret sharing (QSS) is the result of merging the principles of quantum mechanics with secret information sharing. It enables a sender to share a secret among receivers, and the receivers can then collectively recover the secret when the need arises. To enhance the practicality of these quantum protocols, an innovative concept of quantum anonymous secret sharing (QASS) is advanced. In this paper, we propose a QASS protocol via W states, which can share secrets while ensuring recover-ability, recover-security, and recover-anonymity. We have rigorously evaluated our protocols, verifying their accuracy and fortifying their security against scenarios involving the active adversary. This includes considerations for dishonest receivers and non-receivers. Moreover, acknowledging the imperfections inherent in real-world communication channels, we have also undertaken an exhaustive analysis of our protocol's security and effectiveness in a quantum network where some form of noise is present. Our investigations reveal that W states exhibit good performance in mitigating noise interference, making them apt for practical applications.
Abstract Quantum secret sharing enables participants to share secrets grounded in the principles of quantum mechanics, ensuring the secrets recovery solely through collaborative efforts within an authorized subset of participants. Quantum anonymous secret sharing fulfills the fundamental requirements of quantum secret sharing while also ensuring the anonymity of the secret receivers. In order to address the turnover of personnel in practical scenarios, this paper propose a secure dynamic quantum anonymous secret sharing protocol utilizing Greenberger-Horne-Zeilinger states. In our scheme, on the premise of not reveal the identities of participants, the dynamic update of the participants can be realized, and the shared secret will not be altered. Furthermore, an identity authentication mechanism using single particles is introduced in this protocol, ensuring that only authenticated participants can engage in the sharing process. The proposed protocol is secure and can resist both internal and external attacks. Experimental validation conducted on the IBM quantum computing platform demonstrates the feasibility of our scheme.
We introduce a multiparty cryptographic protocol, which we call entanglement sharing schemes, wherein a dealer retains half of a maximally entangled bipartite state and encodes the other half into a multipartite state that is distributed among multiple players. In a close analog to quantum secret sharing, some subsets of players can recover maximal entanglement with the dealer whereas other subsets can recover no entanglement (though they may retain classical correlations with the dealer). We find a lower bound on the share size for such schemes and construct two nontrivial examples based on Shor's [[9,1,3]][[9,1,3]][[9,1,3]] and the [[4,2,2]][[4,2,2]][[4,2,2]] stabilizer code; we further demonstrate how other examples may be obtained from quantum error correcting codes through classical encryption. Finally, we demonstrate that entanglement sharing schemes can be applied to characterize leaked information in quantum ramp secret sharing.
Quantum secret sharing is a fundamental technique in quantum cryptography. However, in practical quantum networks, it still faces several bottlenecks, such as high quantum communication cost and low transmission efficiency. To reduce the communication cost, ramp quantum secret sharing schemes have been proposed in existing studies. Nevertheless, intermediate sets in such schemes may leak partial information about the secret. To address this problem, this paper presents a method for detecting intermediate sets. Based on this method, we further propose a communication-efficient perfect quantum secret sharing scheme with eavesdropping detection capability.We analyze the communication cost under different numbers of participating parties and determine the range of participants that minimizes the reconstruction communication cost. The results verify the communication efficiency and security of the proposed scheme.
Abstract Anonymous secret sharing (ASS) is an essential cryptographic concept that facilitates the sharing and reconstruction of secret information while safeguarding the identity of the involved secret receivers, which has broad applications in key management, data backup, and distributed systems. In this study, a novel authenticated quantum anonymous secret sharing (QASS) protocol that emphasizes information privacy and identity anonymity protection is proposed. Employing ‐level multipartite GHZ states as a quantum resource, one‐sided anonymous entanglement (AE) is innovatively established between the dealer and anonymous receivers, enabling the dealer to distribute a random share of secret information. Additionally, by establishing a one‐sided AE between anonymous receivers and restorer, the restorer can securely collect and reconstruct the secret information using quantum teleportation (QT). Rigorous security analysis demonstrates that protocol can resist attacks from active adversaries and potentially dishonest users. Quantum experiments on IBM Qiskit validate the correctness and feasibility of the proposed QASS protocol. This work contributes to the advancement of quantum anonymous communication, addressing the requirements for information privacy and identity anonymity in practical application environments.