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

Information Sciences

The quantum secret sharing schemes based on hyperstar access structures

Lei Li, Zhi Li

Published Jan 26, 2024• 7 citations
Publisher
DOI
10.1016/j.ins.2024.120202

Related papers

An efficient quantum secret sharing scheme for general access structure based on a novel partitioning technique

Suchandan Ghosh, Avishek Adhikari

Quantum Information Processing•Oct 6, 2025•3 citations

Quantum secret sharing for a general quantum access structure

Chen‐Ming Bai, Zhihui Li, Meng-Meng Si +1 more

The European Physical Journal D•Oct 1, 2017•16 citations

Hybrid Quantum Secret‐Sharing Subprotocols for a Class of Non‐Maximal Quantum Access Structures

Lei Li, Zhi Zhou Li

ABSTRACT Quantum secret sharing (QSS) over non‐maximal quantum access structures (QASs) remains challenging because direct constructions may require complex quantum resources. This paper investigates a class of non‐maximal QASs, particularly hyperstar QASs containing three hyperedges. We give information‐theoretic definitions of authorized, forbidden, and intermediate sets and introduce a representative‐element QAS as a reduced substructure of the original hyperstar QAS. For each minimal authorized set of the representative‐element structure, we construct an entangled‐state‐based quantum secret‐sharing component. By incorporating a corresponding classical secret‐sharing scheme as an auxiliary component, we obtain a family of classical–quantum hybrid secret‐sharing subprotocols for the minimal authorized sets of the considered class of non‐maximal hyperstar QAS and prove exact correctness and information‐theoretic perfect secrecy under the stated security model. In particular, the joint classical–quantum reduced state available to every subset unauthorized with respect to the corresponding subprotocol is completely independent of the quantum secret. The representative‐element reduction restricts the quantum part of each authorized‐set‐specific subprotocol to a smaller auxiliary access structure. A complete resource comparison with global QSS schemes under a unified operational model is left for future research.

Advanced Quantum Technologies•Nov 1, 2026•0 citations

An Efficient and Perfect Secret Sharing Scheme on a Class of Non-Maximal Quantum Access Structure

Lei Li, Zhi Li

Quantum secret sharing is one of the core security technologies in the field of quantum communication. Aiming at the problems of high quantum resource consumption and the difficulty in balancing security and efficiency existing in current quantum secret sharing schemes under non-maximal quantum access structure(QAS), this paper focuses on the judgment criteria of non-maximal QAS and the construction methods of efficient and perfect quantum secret sharing schemes on a kind of non-maximal QAS, i.e. hyperstar with three hyperedges. Firstly, we characterizes the forbidden sets and intermediate sets within this non-maximal QAS, and provides a characterization for non-maximal QAS realizable by pure-state encoding. Secondly, the representative element QAS of hyperstar with three hyperedges is defined, which serves as a substructure of this hyperstar QAS, and belongs to non-maximal QAS. Furthermore, we propose a universal, efficient, and perfect quantum secret sharing scheme based on this hyperstar QAS using corresponding classical secret sharing scheme as an auxiliary. By deploying lightweight quantum resources to representative element access structures, the proposed scheme reduces the difficulty in quantum state preparation and distribution, and enhances its security and resource utilization efficiency.

quant-pharXiv:2606.23082•Jun 23, 2026•1 citation

Quantum secret sharing for a class of special hypergraph access structures

Chen‐Ming Bai, Sujuan Zhang, Lu Liu

Quantum Information Processing•Mar 1, 2022•20 citations

Quantum Secret Sharing Scheme on Hypercyclic Quantum Structures

Lei Li, Zhi Li

This paper investigates the construction of efficient quantum secret sharing schemes for quantum access structures based on hypergraphs with three hyperedges. We prove that hypercycles with three hyperedges are quantum access structures if and only if they can be classified into 12 non-isomorphic types under hypergraph isomorphism, and these hypercyclic quantum access structures encompass all four hyperstars with three hyperedges.In prior work, efficient and perfect quantum secret sharing schemes were constructed for hyperstar access structures with three hyperedges using single photons in d -dimensional quantum systems. These schemes correspond to classical perfect secret sharing schemes with optimal information rates. However, for hypercyclic access structures with three hyperedges, the method described above fails to yield classical perfect secret sharing schemes with optimal information rates. In this work, we explicitly construct classical perfect secret sharing schemes with optimal information rates for these access structures by combining Simmons' geometric method with Shamir's threshold scheme. Subsequently, we employ single photons in d-dimensional quantum systems to build perfect QSS schemes upon these classical constructions.We introduce the concept of idealized information rate for minimal access structures in perfect QSS schemes. By extending the notion of efficiency proposed by Cabello [Phys. Rev. Lett., vol. 85, no. 26, p. 5635, 2000] for quantum key distribution protocols to QSS, we define the efficiency of minimally authorized subsets. Furthermore, we establish the relationship between the efficiency of minimally authorized subsets and the idealized information rate of minimal access structures. Finally, we rigorously prove that the QSS schemes constructed in this work achieve the highest efficiency among existing solutions.

arXiv:2510.27466•Oct 31, 2025•0 citations
ABSTRACT Quantum secret sharing (QSS) over non‐maximal quantum access structures (QASs) remains challenging because direct constructions may require complex quantum resources. This paper investigates a class of non‐maximal QASs, particularly hyperstar QASs containing three hyperedges. We give information‐theoretic definitions of authorized, forbidden, and intermediate sets and introduce a representative‐element QAS as a reduced substructure of the original hyperstar QAS. For each minimal authorized set of the representative‐element structure, we construct an entangled‐state‐based quantum secret‐sharing component. By incorporating a corresponding classical secret‐sharing scheme as an auxiliary component, we obtain a family of classical–quantum hybrid secret‐sharing subprotocols for the minimal authorized sets of the considered class of non‐maximal hyperstar QAS and prove exact correctness and information‐theoretic perfect secrecy under the stated security model. In particular, the joint classical–quantum reduced state available to every subset unauthorized with respect to the corresponding subprotocol is completely independent of the quantum secret. The representative‐element reduction restricts the quantum part of each authorized‐set‐specific subprotocol to a smaller auxiliary access structure. A complete resource comparison with global QSS schemes under a unified operational model is left for future research.
Quantum secret sharing is one of the core security technologies in the field of quantum communication. Aiming at the problems of high quantum resource consumption and the difficulty in balancing security and efficiency existing in current quantum secret sharing schemes under non-maximal quantum access structure(QAS), this paper focuses on the judgment criteria of non-maximal QAS and the construction methods of efficient and perfect quantum secret sharing schemes on a kind of non-maximal QAS, i.e. hyperstar with three hyperedges. Firstly, we characterizes the forbidden sets and intermediate sets within this non-maximal QAS, and provides a characterization for non-maximal QAS realizable by pure-state encoding. Secondly, the representative element QAS of hyperstar with three hyperedges is defined, which serves as a substructure of this hyperstar QAS, and belongs to non-maximal QAS. Furthermore, we propose a universal, efficient, and perfect quantum secret sharing scheme based on this hyperstar QAS using corresponding classical secret sharing scheme as an auxiliary. By deploying lightweight quantum resources to representative element access structures, the proposed scheme reduces the difficulty in quantum state preparation and distribution, and enhances its security and resource utilization efficiency.
This paper investigates the construction of efficient quantum secret sharing schemes for quantum access structures based on hypergraphs with three hyperedges. We prove that hypercycles with three hyperedges are quantum access structures if and only if they can be classified into 12 non-isomorphic types under hypergraph isomorphism, and these hypercyclic quantum access structures encompass all four hyperstars with three hyperedges.In prior work, efficient and perfect quantum secret sharing schemes were constructed for hyperstar access structures with three hyperedges using single photons in d -dimensional quantum systems. These schemes correspond to classical perfect secret sharing schemes with optimal information rates. However, for hypercyclic access structures with three hyperedges, the method described above fails to yield classical perfect secret sharing schemes with optimal information rates. In this work, we explicitly construct classical perfect secret sharing schemes with optimal information rates for these access structures by combining Simmons' geometric method with Shamir's threshold scheme. Subsequently, we employ single photons in d-dimensional quantum systems to build perfect QSS schemes upon these classical constructions.We introduce the concept of idealized information rate for minimal access structures in perfect QSS schemes. By extending the notion of efficiency proposed by Cabello [Phys. Rev. Lett., vol. 85, no. 26, p. 5635, 2000] for quantum key distribution protocols to QSS, we define the efficiency of minimally authorized subsets. Furthermore, we establish the relationship between the efficiency of minimally authorized subsets and the idealized information rate of minimal access structures. Finally, we rigorously prove that the QSS schemes constructed in this work achieve the highest efficiency among existing solutions.