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

Discrete Applied Mathematics

Finding lower bounds on the complexity of secret sharing schemes by linear programming

Carles Padró, Leonor Vázquez, Yang An

Published Nov 9, 2012• 29 citations
Publisher
DOI
10.1016/j.dam.2012.10.020

Related papers

Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming

Carles Padró, Leonor Vázquez

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

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

Oriol Farràs, Tarik Kaced, Sebastià Martín +1 more

Lecture notes in computer science•Jan 1, 2018•20 citations

Lower bounds for robust secret sharing schemes

Carlo Blundo, Alfredo De Santis

Information Processing Letters•Sep 1, 1997•22 citations

A Lower Bound on the Share Size of Leakage-Resilient Secret-Sharing Schemes

Sabyasachi Dutta, Shaoquan Jiang, Reihaneh Safavi–Naini

Fields Institute communications•Nov 16, 2023•0 citations

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

Oriol Farràs, Tarik Kaced, Sebastià Martín Mollevi +1 more

We present a new improvement in the linear programming technique to derive lower bounds on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds without using information inequalities explicitly. Our new technique makes it possible to determine the optimal information ratio of linear secret sharing schemes for all access structures on 5 participants and all graph-based access structures on 6 participants. In addition, new lower bounds are presented also for some small matroid ports and, in particular, the optimal information ratios of the linear secret sharing schemes for the ports of the Vamos matroid are determined.

IEEE Transactions on Information Theory•Jun 29, 2020•23 citations

On the Optimization of Bipartite Secret Sharing Schemes

Oriol Farràs, Jessica Ruth Metcalf-Burton, Carles Padró +1 more

Lecture notes in computer science•Jan 1, 2010•6 citations
We present a new improvement in the linear programming technique to derive lower bounds on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds without using information inequalities explicitly. Our new technique makes it possible to determine the optimal information ratio of linear secret sharing schemes for all access structures on 5 participants and all graph-based access structures on 6 participants. In addition, new lower bounds are presented also for some small matroid ports and, in particular, the optimal information ratios of the linear secret sharing schemes for the ports of the Vamos matroid are determined.