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

IEICE Technical Report; IEICE Tech. Rep.

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

Takashi Hisatome, Hiroki Koga

Published Feb 28, 2019• 0 citations
OpenAlex

Related papers

Optimal linear secret sharing schemes for graph access structures on six participants

Motahhareh Gharahi, Shahram Khazaei

Theoretical Computer Science•Nov 14, 2018•9 citations

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

Carlo Blundo, Alfredo De Santis, Luisa Gargano +1 more

International Cryptology Conference•Aug 16, 1992•25 citations

Secret sharing schemes with bipartite access structure

G. Sáez, Carles Padró

We study the information rate of secret sharing schemes whose access structure is bipartite. In a bipartite access structure there are two classes of participants and all participants in the same class play an equivalent role in the structure. We characterize completely the bipartite access structures that can be realized by an ideal secret sharing scheme. Both upper and lower bounds on the optimal information rate of bipartite access structures are given. These results are applied to the particular case of weighted threshold access structure with two weights.

IEEE Transactions on Information Theory•Jan 1, 2000•118 citations

New bounds on the information rate of secret sharing schemes

Carlo Blundo, Alfredo De Santis, Antonio Giorgio Gaggia +1 more

/spl acute/A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any nonqualified subset has absolutely no information on the secret. We derive new limitations on the information rate of secret sharing schemes, that measures how much information is being distributed as shares as compared to the size of the secret key, and the average information rate, that is the ratio between the secret size and the arithmetic mean of the size of the shares. By applying the substitution technique, we are able to construct many new examples of access structures where the information rate is bounded away from 1. The substitution technique is a method used to obtain a new access structure by replacing a participant in a previous structure with a new access structure.>

IEEE Transactions on Information Theory•Mar 1, 1995•30 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

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
We study the information rate of secret sharing schemes whose access structure is bipartite. In a bipartite access structure there are two classes of participants and all participants in the same class play an equivalent role in the structure. We characterize completely the bipartite access structures that can be realized by an ideal secret sharing scheme. Both upper and lower bounds on the optimal information rate of bipartite access structures are given. These results are applied to the particular case of weighted threshold access structure with two weights.
/spl acute/A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any nonqualified subset has absolutely no information on the secret. We derive new limitations on the information rate of secret sharing schemes, that measures how much information is being distributed as shares as compared to the size of the secret key, and the average information rate, that is the ratio between the secret size and the arithmetic mean of the size of the shares. By applying the substitution technique, we are able to construct many new examples of access structures where the information rate is bounded away from 1. The substitution technique is a method used to obtain a new access structure by replacing a participant in a previous structure with a new access structure.>