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

International Cryptology Conference

On the Information Rate of Secret Sharing Schemes (Extended Abstract)

Carlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro

Published Aug 16, 1992• 25 citations
OpenAlex

Related papers

On the classification of ideal secret sharing schemes (extended abstract)

Ernest F. Brickell, Daniel M. Davenport

International Cryptology Conference•Jul 1, 1989•7 citations

Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes

Ernest F. Brickell, Doug R. Stinson

Lecture notes in computer science•Jan 1, 1991•19 citations

Some improved bounds on the information rate of perfect secret sharing schemes

Ernest F. Brickell, Douglas R. Stinson

Journal of Cryptology•Oct 1, 1992•149 citations

On the Worst-Case Information Rates of Secret Sharing Schemes for Several Access Structures with Many Participants

Takashi Hisatome, Hiroki Koga

IEICE Technical Report; IEICE Tech. Rep.•Feb 28, 2019•0 citations

On the information rate of perfect secret sharing schemes

Marten van Dijk

We present a method to derive information theoretical upper bounds on the information rate and average information rate of perfect secret sharing schemes. One of the applications is that in perfect secret sharing schemes for some access structures the shares need to be impractically large.>

IEEE International Symposium on Information Theory (ISIT)•Dec 17, 2002•2 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
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.