Finding lower bounds on the complexity of secret sharing schemes by linear programming
From MaRDI portal
Recommendations
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing
- Improving the linear programming technique in the search for lower bounds in secret sharing
- Combinatorial lower bounds for secret sharing schemes
- A linear construction of secret sharing schemes
- Lower bounds for robust secret sharing schemes
- The optimal linear secret sharing scheme for any given access structure
- The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures
- Error correcting and complexity aspects of linear secret sharing schemes
- scientific article; zbMATH DE number 1088900
Cites work
- Adhesivity of polymatroids
- An explication of secret sharing schemes
- An impossibility result on graph secret sharing
- Decomposition constructions for secret-sharing schemes
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Geometric secret sharing schemes and their duals
- How to share a secret
- scientific article; zbMATH DE number 994583 (Why is no real title available?)
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 3351601 (Why is no real title available?)
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- Matroid representations by partitions
- Matroids Can Be Far from Ideal Secret Sharing
- More information theoretical inequalities to be used in secret sharing?
- Networks, Matroids, and Non-Shannon Information Inequalities
- On characterization of entropy function via information inequalities
- On secret sharing schemes, matroids and polymatroids
- On secret sharing systems
- On secret-sharing matroids
- On the classification of ideal secret sharing schemes
- On the information rate of perfect secret sharing schemes
- On the optimization of bipartite secret sharing schemes
- On the Power of Nonlinear Secret-Sharing
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Perfect secret sharing schemes on five participants
- Polymatroidal dependence structure of a set of random variables
- Secret Sharing and Non-Shannon Information Inequalities
- Secret-Sharing Schemes: A Survey
- Separating the Power of Monotone Span Programs over Different Fields
- The complexity of the graph access structures on six participants
- The Minimal Set of Ingleton Inequalities
- The size of a share must be large
- Tight bounds on the information rate of secret sharing schemes
- Weighted decomposition construction for perfect secret sharing schemes
Cited in
(16)- Improving the linear programming technique in the search for lower bounds in secret sharing
- On the information ratio of non-perfect secret sharing schemes
- Reduced access structures with four minimal qualified subsets on six participants
- Common information, matroid representation, and secret sharing for matroid ports
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
- Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem
- Local bounds for the optimal information ratio of secret sharing schemes
- Optimal linear secret sharing schemes for graph access structures on six participants
- Secret sharing, rank inequalities and information inequalities
- How to share a secret
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- The lower bound and exact value of the information rate of some developed graph access structures
- A note on extension properties and representations of matroids
- Bounds on guessing numbers and secret sharing combining information theory methods.
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- On the optimization of bipartite secret sharing schemes
This page was built for publication: Finding lower bounds on the complexity of secret sharing schemes by linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949113)
