2009/06/30 by Qin Li, Wai Hong Chan, W. H. Chan +2
Computer Science · Physics and Astronomy · #Computer science #Computer security #Cryptography #Eavesdropping #Homomorphic secret sharing #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Secret sharing #Secure multi-party computation #quant-ph
paper · pdf · doi:10.1103/physreva.82.022303
6 pages, 1 figure, some changes
arxiv created 2009/09/06 · openalex publication_date 2010/08/04 · arxiv updated 2015/05/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be achieved when all the members are quantum. So what happens if not all the members are quantum? In this paper, we propose two semiquantum secret sharing protocols by using maximally entangled Greenberger-Horne-Zeilinger-type states in which quantum Alice shares a secret with two classical parties, Bob and Charlie, in a way that both parties are sufficient to obtain the secret, but one of them cannot. The presented protocols are also shown to be secure against eavesdropping.