Finding lower bounds on the complexity of secret sharing schemes by linear programming
From MaRDI portal
Publication:1949113
DOI10.1016/j.dam.2012.10.020zbMath1262.68049OpenAlexW2152896621MaRDI QIDQ1949113
An Yang, Leonor Vázquez, Carles Padró
Publication date: 25 April 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.020
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Authentication, digital signatures and secret sharing (94A62)
Related Items (10)
Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ On the information ratio of non-perfect secret sharing schemes ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ The lower bound and exact value of the information rate of some developed graph access structures ⋮ Extending Brickell-Davenport theorem to non-perfect secret sharing schemes ⋮ How to share a secret ⋮ Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem ⋮ Reduced access structures with four minimal qualified subsets on six participants
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More information theoretical inequalities to be used in secret sharing?
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- Perfect secret sharing schemes on five participants
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- On the optimization of bipartite secret sharing schemes
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- An impossibility result on graph secret sharing
- On the classification of ideal secret sharing schemes
- An explication of secret sharing schemes
- On secret-sharing matroids
- Matroid representations by partitions
- Geometric secret sharing schemes and their duals
- Tight bounds on the information rate of secret sharing schemes
- The size of a share must be large
- Weighted decomposition construction for perfect secret sharing schemes
- On the information rate of perfect secret sharing schemes
- The complexity of the graph access structures on six participants
- Adhesivity of polymatroids
- Secret-Sharing Schemes: A Survey
- How to share a secret
- On secret sharing schemes, matroids and polymatroids
- Networks, Matroids, and Non-Shannon Information Inequalities
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Secret Sharing and Non-Shannon Information Inequalities
- Polymatroidal dependence structure of a set of random variables
- Decomposition constructions for secret-sharing schemes
- On characterization of entropy function via information inequalities
- On secret sharing systems
- The Minimal Set of Ingleton Inequalities
- Separating the Power of Monotone Span Programs over Different Fields
- On the Power of Nonlinear Secret-Sharing
- Matroids Can Be Far from Ideal Secret Sharing
This page was built for publication: Finding lower bounds on the complexity of secret sharing schemes by linear programming
