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:1806.01456 · Quantum Information Processing

A verifiable framework of entanglement-free quantum secret sharing with information-theoretical security

Changbin Lu, Fuyou Miao, Junpeng Hou, Wenchao Huang, Yan Xiong

Published Nov 29, 2019• 31 citations
arXivHTMLPDF
DOI
10.1007/s11128-019-2509-x

Related papers

Verifiable quantum secret sharing protocol based on the privacy-preserving computation

Yu Tao Du, Xiang Wang, Wan Su Bao

The European Physical Journal Special Topics•Oct 16, 2025•1 citation

Quantum walk based quantum secret sharing in a verifiable framework

Changbin Lu, Fuyou Miao, Junpeng Hou +1 more

Secret sharing is a cryptographic primitive which plays a central role in various tasks including secure multi-party computation and key management. Quantum schemes for secret sharing commonly rely on multi-particle entangled quantum states, which remains challenging with current experimental technologies. Firstly, in this paper we present a (t,n) quantum secret sharing scheme based on quantum walks on a circle, which only involves two-particle product states as the initial quantum resource. When recovering the secrets, it requires at least t participants sequentially completing their operations on the communicated state, while less than t participants can not acquire any information about the secrets. Secondly, a verification mechanism is designed, which can detect cheats with an asymptotic probability 100%. Finally, we show that the scheme is perfectly correct and is secure against common attacks including collusion attack. In conclusion, the proposed scheme will be useful for quantum communication networks due to its inherent scalability, flexibility and information-theoretical security.

International Conference on Big Data & Artificial Intelligence & Software Engineering (ICBASE)•Sep 1, 2021•1 citation

Counterfactual Quantum Secret Sharing

Nomi Lae, Shehbaz Tariq, Saw Nang Paing +4 more

The emerging quantum technology has highlighted the necessity for secure and efficient secret sharing in quantum networks. In this paper, we introduce a verifiable multiparty counterfactual quantum secret sharing (QSS) protocol, enhancing security and efficiency. This QSS protocol utilizes a low-depth quantum circuit to encrypt and decrypt information, which comprises a unitary operator constructed using a preshared secret key. To ensure the robustness and verifiability of the shared secret key, the protocol imposes constraints on the participants with the Chinese remainder theorem. The most significant advantage of our proposed QSS protocol is incorporating counterfactual communication, which considerably enhances the scheme’s security by enabling exchange-free information sharing among participants, thereby minimizing the risk of eavesdropping or intercept-and-resend attacks. Furthermore, we incorporate a weighted-threshold mechanism that provides flexibility, enabling diverse use cases to design security protocols for quantum networks. The security analysis of the counterfactual QSS protocol and its implementation on IBM Quantum computers reveals strong resilience to internal and external attacks, along with high efficiency and robustness, making it effective for quantum encryption in the noisy intermediate-scale quantum era.

IEEE Transactions on Communications•Jun 5, 2025•1 citation

Verifiable Quantum Secret Sharing Protocols Based on Four-Qubit Entangled States

Weifeng Cao, Yu‐Guang Yang

International Journal of Theoretical Physics•Jan 31, 2019•21 citations

Quantum secret sharing for edge computing security using locally distinguishable eight-qudit entangled states

Feng Liu, Chunliu Cai, Xianmin Wang +2 more

Maintaining confidentiality and reliability in distributed quantum environments remains a significant challenge. To this end, we propose a quantum secret sharing (QSS) scheme based on the local distinguishability of orthogonal eight-qudit entangled states. Compared to the previous seven-particle model, this scheme significantly expands the quantum state space, enhances security, and improves flexibility. We systematically construct 22 types of eight-qudit entangled states, define their corresponding judgment spaces, and introduce a new distinction rule to simplify the local discrimination process. Based on this framework, we develop a general ( k , n )-threshold quantum synchronization sharing protocol and verify its effectiveness using a (7, 8)-threshold example on the IBM Qiskit platform. Results show that this scheme is resilient to multiple attack types and provides a scalable approach for secure quantum information sharing in future distributed quantum systems, with potential applications in fields such as quantum-enhanced edge computing.

Journal on Wireless Communications and Networking•Feb 8, 2026•0 citations

Quantum secret sharing without entanglement

Guo-Ping Guo, Guang-Can Guo

arXiv:quant-ph/0212056•Physics Letters A•Apr 1, 2003•358 citations
Secret sharing is a cryptographic primitive which plays a central role in various tasks including secure multi-party computation and key management. Quantum schemes for secret sharing commonly rely on multi-particle entangled quantum states, which remains challenging with current experimental technologies. Firstly, in this paper we present a (t,n) quantum secret sharing scheme based on quantum walks on a circle, which only involves two-particle product states as the initial quantum resource. When recovering the secrets, it requires at least t participants sequentially completing their operations on the communicated state, while less than t participants can not acquire any information about the secrets. Secondly, a verification mechanism is designed, which can detect cheats with an asymptotic probability 100%. Finally, we show that the scheme is perfectly correct and is secure against common attacks including collusion attack. In conclusion, the proposed scheme will be useful for quantum communication networks due to its inherent scalability, flexibility and information-theoretical security.
The emerging quantum technology has highlighted the necessity for secure and efficient secret sharing in quantum networks. In this paper, we introduce a verifiable multiparty counterfactual quantum secret sharing (QSS) protocol, enhancing security and efficiency. This QSS protocol utilizes a low-depth quantum circuit to encrypt and decrypt information, which comprises a unitary operator constructed using a preshared secret key. To ensure the robustness and verifiability of the shared secret key, the protocol imposes constraints on the participants with the Chinese remainder theorem. The most significant advantage of our proposed QSS protocol is incorporating counterfactual communication, which considerably enhances the scheme’s security by enabling exchange-free information sharing among participants, thereby minimizing the risk of eavesdropping or intercept-and-resend attacks. Furthermore, we incorporate a weighted-threshold mechanism that provides flexibility, enabling diverse use cases to design security protocols for quantum networks. The security analysis of the counterfactual QSS protocol and its implementation on IBM Quantum computers reveals strong resilience to internal and external attacks, along with high efficiency and robustness, making it effective for quantum encryption in the noisy intermediate-scale quantum era.
Maintaining confidentiality and reliability in distributed quantum environments remains a significant challenge. To this end, we propose a quantum secret sharing (QSS) scheme based on the local distinguishability of orthogonal eight-qudit entangled states. Compared to the previous seven-particle model, this scheme significantly expands the quantum state space, enhances security, and improves flexibility. We systematically construct 22 types of eight-qudit entangled states, define their corresponding judgment spaces, and introduce a new distinction rule to simplify the local discrimination process. Based on this framework, we develop a general ( k , n )-threshold quantum synchronization sharing protocol and verify its effectiveness using a (7, 8)-threshold example on the IBM Qiskit platform. Results show that this scheme is resilient to multiple attack types and provides a scalable approach for secure quantum information sharing in future distributed quantum systems, with potential applications in fields such as quantum-enhanced edge computing.