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

Lecture notes in computer science

On the Optimization of Bipartite Secret Sharing Schemes

Oriol Farràs, Jessica Ruth Metcalf-Burton, Carles Padró, Leonor Vázquez

Published Jan 1, 2010• 6 citations
Publisher
DOI
10.1007/978-3-642-14496-7_8

Related papers

Secret sharing schemes with bipartite access structure

Carles Padró, Germán Sáez

Lecture notes in computer science•Jan 1, 1998•13 citations

Optimal Non-perfect Uniform Secret Sharing Schemes

Oriol Farràs, Torben Brandt Hansen, Tarik Kaced +1 more

Lecture notes in computer science•Jan 1, 2014•22 citations

Local bounds for the optimal information ratio of secret sharing schemes

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

Designs Codes and Cryptography•Aug 9, 2018•3 citations

Near Optimal Non-malleable Codes and Leakage Resilient Secret Sharing Schemes

Sruthi Sekar

•Sep 13, 2021•0 citations

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

Motahhareh Gharahi, Shahram Khazaei

Theoretical Computer Science•Nov 14, 2018•9 citations

A New Bound on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based on Bipartite Graphs of Larger Girth

Hui-Chuan Lu

In a perfect secret-sharing scheme, a dealer distributes a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of the participants in any unqualified subset is statistically independent of the secret. The access structure of the scheme refers to the collection of all qualified subsets. In a graph-based access structures, each vertex of a graph G represents a participant and each edge of G represents a minimal qualified subset. The average information ratio of a perfect secret-sharing scheme realizing a given access structure is the ratio of the average length of the shares given to the participants to the length of the secret. The infimum of the average information ratio of all possible perfect secret-sharing schemes realizing an access structure is called the optimal average information ratio of that access structure. We study the optimal average information ratio of the access structures based on bipartite graphs. Based on some previous results, we give a bound on the optimal average information ratio for all bipartite graphs of girth at least six. This bound is the best possible for some classes of bipartite graphs using our approach.

•Jul 5, 2014•0 citations
In a perfect secret-sharing scheme, a dealer distributes a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of the participants in any unqualified subset is statistically independent of the secret. The access structure of the scheme refers to the collection of all qualified subsets. In a graph-based access structures, each vertex of a graph G represents a participant and each edge of G represents a minimal qualified subset. The average information ratio of a perfect secret-sharing scheme realizing a given access structure is the ratio of the average length of the shares given to the participants to the length of the secret. The infimum of the average information ratio of all possible perfect secret-sharing schemes realizing an access structure is called the optimal average information ratio of that access structure. We study the optimal average information ratio of the access structures based on bipartite graphs. Based on some previous results, we give a bound on the optimal average information ratio for all bipartite graphs of girth at least six. This bound is the best possible for some classes of bipartite graphs using our approach.