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:2306.08863 · Advanced Quantum Technologies

Quantum Secret Reconstruction

Rui‐Hai Ma, Fei Gao, Bin‐Bin Cai, Song Lin

Published Dec 10, 2023• 7 citations
arXivHTMLPDF

Abstract

Abstract In addition to secret splitting, secret reconstruction is another important component of secret sharing. In this paper, the first quantum secret reconstruction protocol is proposed to protect the reconstruction process. Before the protocol, a classical secret is divided into multiple shares that are distributed to the shareholds, respectively. In the presented protocol, the dealer utilizes the secret to encrypt a privacy quantum state, and sends the encrypted state to a combiner who is chosen by the dealer within the shareholders. With the help of other shareholders, the combiner utilizes the properties of cluster states to recover the privacy quantum state. It is shown that the proposed protocol is secure against several common attacks, including external and internal attacks. Compared with classical secret reconstruction protocols, this protocol not only achieves information‐theoretic security of all shares, but is also more efficient due to the reduced distribution and computation cost. To demonstrate the feasibility of the protocol, a corresponding simulation quantum experiment is conducted on the IBM Q. Furthermore, in conjunction with quantum fingerprinting, it can be directly applied to achieve the task of quantum multiple secrets sharing, since the classical shares can be reused in the proposed protocol.

DOI
10.1002/qute.202300273

Related papers

Quantum ( t, n ) Threshold Multisecret Sharing Based on Cluster States

Rui-Hai Ma, Hui-Nan Chen, Bin-Bin Cai +2 more

Quantum secret sharing is an encryption technique based on quantum mechanics, which utilizes uncertainty principle to achieve security in transmission. Most protocols focus on the study of quantum (n,n) or (t,n) threshold single secret sharing. In this paper, the first quantum (t,n) threshold multi-secret sharing protocol based on Lagrangian interpolation and cluster states is proposed, which requires onlytinstead ofnparticipants to reconstruct multiple quantum secrets. The protocol exploits the security properties of the cluster state to transmit shared information in two parts, quantum and classical, where the shares remain private after reconstructing quantum secrets. Meanwhile, extending the new measurement basis in cluster states enables participants to transmit quantum information without preparing particles. In the presented protocol, the dealer can be offline after sending secrets. And required quantum operations are all common quantum operations, thus the protocol is practical under the current technical conditions. It is proven to be theoretically secure against external and internal attacks by analyzing the protocol under several common external attacks and internal attacks. In addition, experiments on IMB Q prove that the protocol satisfies correctness and feasibility.

IEEE Internet of Things Journal•Nov 10, 2025•0 citations

Dynamic Multi‐Party to Multi‐Party Quantum Secret Sharing based on Bell States

Yuan Tian, Jialong Wang, Genqing Bian +2 more

Abstract Quantum secret sharing as a privacy‐preserving scheme necessitating collaborative efforts from all participating users to collectively recover encrypted information. This paper introduces a novel dynamic multi‐party to multi‐party quantum secret sharing protocol based on Bell states, enabling secure sharing of secrets among dynamically changing multi‐party. The protocol innovatively employs Bell states combined with simplified local unitary operations, significantly reducing the complexity and enhancing the scalability of practical implementations in quantum communication systems. Particularly, through simulation using IBM's Qiskit framework, its correctness and practicality are confirmed. Security analysis demonstrates that the protocol effectively withstands common attack methods, providing reliability, and security in quantum communication. This research presents a more flexible and efficient solution in the field of quantum secret sharing.

Advanced Quantum Technologies•May 26, 2024•39 citations

Collusion-Secure Semi-Quantum Secret Sharing Scheme using a Quantum Third Party

Santanu Majhi, Nirupam Basak

The security of a secret sharing protocol is compromised if one or more dishonest participants can reconstruct the secret by deviating from the prescribed protocol, particularly when such malicious behavior remains undetected. Semi-Quantum Secret Sharing (SQSS) is a variant of secret sharing in which the participants possess only classical capabilities, such as preparing and measuring qubits in the computational ($Z$) basis, while a quantum-capable third party assists the dealer in generating and distributing quantum shares of a classical secret. The limited quantum capabilities of the participants in SQSS protocols may introduce vulnerabilities to collusion attacks, enabling an assisting quantum third party, in collaboration with a dishonest classical participant, to jointly recover the secret even without detection. In this work, we propose a novel SQSS protocol that eliminates this vulnerability and achieves information-theoretic security against collusion attacks. We further prove that the proposed protocol is secure against a broad class of external and internal attacks. Finally, a comparative analysis demonstrates that our construction advances existing SQSS protocols by simultaneously optimizing qubit efficiency, involves a classical dealer, and resilience against DCNA attacks using basic Bell states.

cs.CRCross-listedarXiv:2610.10176•Oct 8, 2026•0 citations

Security and Fairness in Multiparty Quantum Secret Sharing Protocol

Alessio Di Santo, Walter Tiberti, Dajana Cassioli

Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS, the secret is encoded into quantum states and shared by a dealer such that only an authorized subsets of participants, i.e., the players, can reconstruct it. Several state-of-the-art studies aim to transpose classical secret sharing into the quantum realm, while maintaining their reliance on traditional network topologies (e.g., star, ring, and fully connected), and require that all the$n$players calculate the secret. These studies exploit the Greenberger–Horne–Zeilinger state, which is a type of maximally entangled quantum state involving three or more qubits. However, none of these works account for redundancy, enhanced security/privacy features, or authentication mechanisms able to fingerprint players. To address these gaps, in this article, we introduce a new concept of QSS, which leans on a generic distributed quantum network, based on a threshold scheme, where all the players collaborate also to the routing of quantum information among them. The dealer, by exploiting a custom flexible weighting system, takes advantage of a newly defined quantum Dijkstra algorithm to select the most suitable subset of$t$players, out of the entire set on$n$players, to involve in the computation. To fingerprint and authenticate users, CRYSTAL-Kyber primitives are adopted, while also protecting each player’s privacy by hiding their identities. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks, thereby improving the state-of-the-art security measures.

arXiv:2412.11667•IEEE Transactions on Quantum Engineering•Jan 1, 2025•8 citations

Multiparty Quantum Secret Sharing Protocol with Authentication

Xiaofen Liu, Xuanhui Yan, Zhiqiang Yao

Utilizing the advantage of Bell state,a multiparty quantum secret sharing protocol with authentication is put forward.In the protocol,the deal encodes two classical bits of secret message on the quantum carrier though performing local unitary operation.He splits the secret message into n shares and then distributes them to n agents via entanglement swapping.Each agent makes a Bell state measurement on the particles in his hand,and obtains his piece of secret according to the measurement result.In the process of reconstruction,these n agents declare respectively their pieces of secret,and recover the secret message if and only if they collaborate.At the same time,combining the technology of Hash function,the identities of the deal and the agents are authenticated.Hence,one main goal of designing the presented protocol,two-way authentication,is achieved.Moreover,we analyze the security and authentication of the presented protocol in detail.It is shown that this protocol can stand against the attacks of outside eavesdropper and inside participant,which means that it is secure in theory.In addition,since the Bell state was used at most,as compared with other quantum secret sharing protocols,the implementation of the presented protocol is more feasible in the current technical conditions.

Journal of Chinese Computer Systems•Jan 1, 2012•1 citation

Quantum secret sharing using GHZ state qubit positioning and selective qubits strategy for secret reconstruction

Farhan Musanna, Sanjeev Kumar

The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. The dealer, based on the classical information to be shared, toggles his qubit and shares the product state. The other parties make their Bell measurements and collude to reconstruct the secret. Unlike the other protocols, this protocol does not involve the entire initial state reconstruction, rather uses selective qubits to discard the redundant qubits at the time of reconstruction to decrypt the secret. The protocol also allows for security against malicious attacks by an adversary without affecting the integrity of the secret. The security of the protocol lies in the fact that each party's correct announcement of their measurement is required for reconstruction, failing which the reconstruction process is jeopardized, thereby ascertaining the $(3,3)$ scheme which can further be extended for a $(n,n)$ scheme.

arXiv:2002.09182•Feb 21, 2020•1 citation
Abstract In addition to secret splitting, secret reconstruction is another important component of secret sharing. In this paper, the first quantum secret reconstruction protocol is proposed to protect the reconstruction process. Before the protocol, a classical secret is divided into multiple shares that are distributed to the shareholds, respectively. In the presented protocol, the dealer utilizes the secret to encrypt a privacy quantum state, and sends the encrypted state to a combiner who is chosen by the dealer within the shareholders. With the help of other shareholders, the combiner utilizes the properties of cluster states to recover the privacy quantum state. It is shown that the proposed protocol is secure against several common attacks, including external and internal attacks. Compared with classical secret reconstruction protocols, this protocol not only achieves information‐theoretic security of all shares, but is also more efficient due to the reduced distribution and computation cost. To demonstrate the feasibility of the protocol, a corresponding simulation quantum experiment is conducted on the IBM Q. Furthermore, in conjunction with quantum fingerprinting, it can be directly applied to achieve the task of quantum multiple secrets sharing, since the classical shares can be reused in the proposed protocol.
Quantum secret sharing is an encryption technique based on quantum mechanics, which utilizes uncertainty principle to achieve security in transmission. Most protocols focus on the study of quantum (n,n) or (t,n) threshold single secret sharing. In this paper, the first quantum (t,n) threshold multi-secret sharing protocol based on Lagrangian interpolation and cluster states is proposed, which requires onlytinstead ofnparticipants to reconstruct multiple quantum secrets. The protocol exploits the security properties of the cluster state to transmit shared information in two parts, quantum and classical, where the shares remain private after reconstructing quantum secrets. Meanwhile, extending the new measurement basis in cluster states enables participants to transmit quantum information without preparing particles. In the presented protocol, the dealer can be offline after sending secrets. And required quantum operations are all common quantum operations, thus the protocol is practical under the current technical conditions. It is proven to be theoretically secure against external and internal attacks by analyzing the protocol under several common external attacks and internal attacks. In addition, experiments on IMB Q prove that the protocol satisfies correctness and feasibility.
Abstract Quantum secret sharing as a privacy‐preserving scheme necessitating collaborative efforts from all participating users to collectively recover encrypted information. This paper introduces a novel dynamic multi‐party to multi‐party quantum secret sharing protocol based on Bell states, enabling secure sharing of secrets among dynamically changing multi‐party. The protocol innovatively employs Bell states combined with simplified local unitary operations, significantly reducing the complexity and enhancing the scalability of practical implementations in quantum communication systems. Particularly, through simulation using IBM's Qiskit framework, its correctness and practicality are confirmed. Security analysis demonstrates that the protocol effectively withstands common attack methods, providing reliability, and security in quantum communication. This research presents a more flexible and efficient solution in the field of quantum secret sharing.
The security of a secret sharing protocol is compromised if one or more dishonest participants can reconstruct the secret by deviating from the prescribed protocol, particularly when such malicious behavior remains undetected. Semi-Quantum Secret Sharing (SQSS) is a variant of secret sharing in which the participants possess only classical capabilities, such as preparing and measuring qubits in the computational (ZZZ) basis, while a quantum-capable third party assists the dealer in generating and distributing quantum shares of a classical secret. The limited quantum capabilities of the participants in SQSS protocols may introduce vulnerabilities to collusion attacks, enabling an assisting quantum third party, in collaboration with a dishonest classical participant, to jointly recover the secret even without detection. In this work, we propose a novel SQSS protocol that eliminates this vulnerability and achieves information-theoretic security against collusion attacks. We further prove that the proposed protocol is secure against a broad class of external and internal attacks. Finally, a comparative analysis demonstrates that our construction advances existing SQSS protocols by simultaneously optimizing qubit efficiency, involves a classical dealer, and resilience against DCNA attacks using basic Bell states.
Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS, the secret is encoded into quantum states and shared by a dealer such that only an authorized subsets of participants, i.e., the players, can reconstruct it. Several state-of-the-art studies aim to transpose classical secret sharing into the quantum realm, while maintaining their reliance on traditional network topologies (e.g., star, ring, and fully connected), and require that all thennnplayers calculate the secret. These studies exploit the Greenberger–Horne–Zeilinger state, which is a type of maximally entangled quantum state involving three or more qubits. However, none of these works account for redundancy, enhanced security/privacy features, or authentication mechanisms able to fingerprint players. To address these gaps, in this article, we introduce a new concept of QSS, which leans on a generic distributed quantum network, based on a threshold scheme, where all the players collaborate also to the routing of quantum information among them. The dealer, by exploiting a custom flexible weighting system, takes advantage of a newly defined quantum Dijkstra algorithm to select the most suitable subset oftttplayers, out of the entire set onnnnplayers, to involve in the computation. To fingerprint and authenticate users, CRYSTAL-Kyber primitives are adopted, while also protecting each player’s privacy by hiding their identities. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks, thereby improving the state-of-the-art security measures.
Utilizing the advantage of Bell state,a multiparty quantum secret sharing protocol with authentication is put forward.In the protocol,the deal encodes two classical bits of secret message on the quantum carrier though performing local unitary operation.He splits the secret message into n shares and then distributes them to n agents via entanglement swapping.Each agent makes a Bell state measurement on the particles in his hand,and obtains his piece of secret according to the measurement result.In the process of reconstruction,these n agents declare respectively their pieces of secret,and recover the secret message if and only if they collaborate.At the same time,combining the technology of Hash function,the identities of the deal and the agents are authenticated.Hence,one main goal of designing the presented protocol,two-way authentication,is achieved.Moreover,we analyze the security and authentication of the presented protocol in detail.It is shown that this protocol can stand against the attacks of outside eavesdropper and inside participant,which means that it is secure in theory.In addition,since the Bell state was used at most,as compared with other quantum secret sharing protocols,the implementation of the presented protocol is more feasible in the current technical conditions.
The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. The dealer, based on the classical information to be shared, toggles his qubit and shares the product state. The other parties make their Bell measurements and collude to reconstruct the secret. Unlike the other protocols, this protocol does not involve the entire initial state reconstruction, rather uses selective qubits to discard the redundant qubits at the time of reconstruction to decrypt the secret. The protocol also allows for security against malicious attacks by an adversary without affecting the integrity of the secret. The security of the protocol lies in the fact that each party's correct announcement of their measurement is required for reconstruction, failing which the reconstruction process is jeopardized, thereby ascertaining the (3,3)(3,3)(3,3) scheme which can further be extended for a (n,n)(n,n)(n,n) scheme.