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

Science in China. Series G, Physics, mechanics & astronomy/Science in China. Series G, Physics, Mechanics & Astronomy

An efficient quantum secret sharing protocol with orthogonal product states

Yu‐Guang Yang, Qiaoyan Wen, Fu-Chen Zhu

Published Jun 1, 2007• 31 citations
Publisher
DOI
10.1007/s11433-007-0028-8

Related papers

Verifiable dynamic multiparty quantum secret sharing protocol based on orthogonal product states

Hang Guo, Shuai Li, Jian Li

Quantum Information Processing•May 18, 2026•0 citations

Multi-party dynamic secret sharing protocol based on orthogonal product states

Yun Chen, Shuai Li, Jian Li +1 more

Quantum Information Processing•May 3, 2025•2 citations

Verifiable quantum secret sharing scheme based on orthogonal product states

Chen‐Ming Bai, Lu Liu, Sujuan Zhang

Abstract In the domain of quantum cryptography, the implementation of quantum secret sharing stands as a pivotal element. In this paper, we propose a novel verifiable quantum secret sharing protocol using the d-dimensional product state and Lagrange interpolation techniques. This protocol is initiated by the dealer Alice, who initially prepares a quantum product state, selected from a predefined set of orthogonal product states within the ℂ d ⊗ ℂ d framework. Subsequently, the participants execute unitary operations on this product state to recover the underlying secret. Furthermore, we subject the protocol to a rigorous security analysis, considering both eavesdropping attacks and potential dishonesty from the participants. Finally, we conduct a comparative analysis of our protocol against existing schemes. Our scheme exhibits economies of scale by exclusively employing quantum product states, thereby realizing significant cost-efficiency advantages. In terms of access structure, we adopt a (t,n)-threshold architecture, a strategic choice that augments the protocol’s practicality and suitability for diverse applications. Furthermore, our protocol includes a rigorous integrity verification mechanism to ensure the honesty and reliability of the participants throughout the execution of the protocol.

Chinese Physics B•Mar 15, 2024•8 citations

An efficient controlled semi-quantum secret sharing protocol with entangled state

Monireh Houshmand, Shima Hassanpour, Majid Haghparast

Optical and Quantum Electronics•Mar 25, 2024•6 citations

A new non-entangled quantum secret sharing protocol among different nodes in further quantum networks

Si-Jia Fu, Kejia Zhang, Long Zhang +1 more

As an important branch of quantum secure multi-party computation, quantum secret sharing (QSS) can distribute secret information among dishonest network nodes without revealing the secrets. In this study, a new four-party QSS protocol based on locally indistinguishable orthogonal product (LIOP) states is first proposed for quantum network communication. Then, the general multiparty QSS model based on LIOP states will be expanded. Combined with the property of LIOP states and obfuscating operation, the source node can send the secrets to different destination nodes in the quantum network. Accordingly, it is proven that the destination nodes have to work together to recover the shared secrets against some existing attacks. Furthermore, no entangled resources and complicated operations are required in the presented protocol. We hope the results could make positive effects to the development of quantum secure communication in the future.

Frontiers in Physics•Oct 24, 2022•4 citations

An efficient semi-quantum secret sharing protocol of specific bits

Yuan Tian, Jian Li, Xiu‐Bo Chen +2 more

Quantum Information Processing•Jun 1, 2021•68 citations
Abstract In the domain of quantum cryptography, the implementation of quantum secret sharing stands as a pivotal element. In this paper, we propose a novel verifiable quantum secret sharing protocol using the d-dimensional product state and Lagrange interpolation techniques. This protocol is initiated by the dealer Alice, who initially prepares a quantum product state, selected from a predefined set of orthogonal product states within the ℂ d ⊗ ℂ d framework. Subsequently, the participants execute unitary operations on this product state to recover the underlying secret. Furthermore, we subject the protocol to a rigorous security analysis, considering both eavesdropping attacks and potential dishonesty from the participants. Finally, we conduct a comparative analysis of our protocol against existing schemes. Our scheme exhibits economies of scale by exclusively employing quantum product states, thereby realizing significant cost-efficiency advantages. In terms of access structure, we adopt a (t,n)-threshold architecture, a strategic choice that augments the protocol’s practicality and suitability for diverse applications. Furthermore, our protocol includes a rigorous integrity verification mechanism to ensure the honesty and reliability of the participants throughout the execution of the protocol.
As an important branch of quantum secure multi-party computation, quantum secret sharing (QSS) can distribute secret information among dishonest network nodes without revealing the secrets. In this study, a new four-party QSS protocol based on locally indistinguishable orthogonal product (LIOP) states is first proposed for quantum network communication. Then, the general multiparty QSS model based on LIOP states will be expanded. Combined with the property of LIOP states and obfuscating operation, the source node can send the secrets to different destination nodes in the quantum network. Accordingly, it is proven that the destination nodes have to work together to recover the shared secrets against some existing attacks. Furthermore, no entangled resources and complicated operations are required in the presented protocol. We hope the results could make positive effects to the development of quantum secure communication in the future.