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

Designs Codes and Cryptography

Local bounds for the optimal information ratio of secret sharing schemes

Oriol Farràs, Jordi Ribes-González, Sara Ricci

Published Aug 9, 2018• 4 citations
Publisher
DOI
10.1007/s10623-018-0529-7

Related papers

Bounds on the Information Ratios of Secret Sharing Schemes for Close Access Structures.

Oriol Farràs, Jordi Ribes-González, Sara Ricci

•Jan 1, 2016•0 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•147 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•21 citations

New Bounds on the Local Leakage Resilience of Shamir’s Secret Sharing Scheme

Ohad Klein, Ilan Komargodski

Lecture notes in computer science•Jan 1, 2023•21 citations

An Improvement Upon the Bounds for the Local Leakage Resilience of Shamir’s Secret Sharing Scheme

Dustin Kasser

Lecture notes in computer science•Dec 2, 2024•7 citations

Optimal Linear Secret Sharing Schemes for Graph Access Structures on Six Participants.

Motahhareh Gharahi, Shahram Khazaei

Abstract The efficiency of a secret sharing scheme is measured via its information ratio. The optimal information ratio (OIR) of an access structure is the infimum of the information ratios of all secret sharing schemes realizing it. When the infimum is taken over all linear secret sharing schemes, it is called the optimal linear information ratio (OLIR). We review the problem of finding the OIRs and OLIRs of graph access structures on six participants. Study of such access structures was initiated by van Dijk et al. (1998) [43] . In a sequence of works, the OIRs of nine access structures, out of the 18 initially unsolved non-isomorphic ones, were determined. Very recently, the known lower bounds on the OLIRs of the other nine cases have been improved (Farras et al., 2018 [20] ), determining the OLIRs for another two cases. In this paper, for each of the remaining seven cases, we provide a new upper bound on the OIR which matches that of the recently found lower bound on the OLIR. Improved upper bounds are achieved by constructing a linear secret sharing scheme, using a suitable decomposition technique for each access structure. A new decomposition technique, called ( λ , ω ) -weighted decomposition, is also introduced which is a generalization of all known decomposition methods.

•Jan 1, 2017•0 citations
Abstract The efficiency of a secret sharing scheme is measured via its information ratio. The optimal information ratio (OIR) of an access structure is the infimum of the information ratios of all secret sharing schemes realizing it. When the infimum is taken over all linear secret sharing schemes, it is called the optimal linear information ratio (OLIR). We review the problem of finding the OIRs and OLIRs of graph access structures on six participants. Study of such access structures was initiated by van Dijk et al. (1998) [43] . In a sequence of works, the OIRs of nine access structures, out of the 18 initially unsolved non-isomorphic ones, were determined. Very recently, the known lower bounds on the OLIRs of the other nine cases have been improved (Farras et al., 2018 [20] ), determining the OLIRs for another two cases. In this paper, for each of the remaining seven cases, we provide a new upper bound on the OIR which matches that of the recently found lower bound on the OLIR. Improved upper bounds are achieved by constructing a linear secret sharing scheme, using a suitable decomposition technique for each access structure. A new decomposition technique, called ( λ , ω ) -weighted decomposition, is also introduced which is a generalization of all known decomposition methods.