Improving the linear programming technique in the search for lower bounds in secret sharing
From MaRDI portal
Publication:1648816
DOI10.1007/978-3-319-78381-9_22zbMath1423.94127OpenAlexW2773609685MaRDI QIDQ1648816
Sebastià Martín, Tarik Kaced, Oriol Farràs, Carles Padró
Publication date: 9 July 2018
Full work available at URL: http://hdl.handle.net/2117/338198
Related Items (8)
Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ Secret Sharing Schemes for (k, n)-Consecutive Access Structures ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ On group-characterizability of homomorphic secret sharing schemes ⋮ Exact information ratios for secret sharing on small graphs with girth at least 5 ⋮ Secret sharing schemes for ports of matroids of rank 3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More information theoretical inequalities to be used in secret sharing?
- Secret-sharing schemes for very dense graphs
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- New inequalities for subspace arrangements
- Perfect secret sharing schemes on five participants
- Lower bounds for monotone span programs
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- On the optimization of bipartite secret sharing schemes
- 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
- On the size of shares for secret sharing schemes
- 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
- Inequalities for Shannon entropy and Kolmogorov complexity
- Weighted decomposition construction for perfect secret sharing schemes
- Secret sharing schemes with three or four minimal qualified subsets
- On the information rate of perfect secret sharing schemes
- The complexity of the graph access structures on six participants
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Superpolynomial lower bounds for monotone span programs
- Optimal assignment schemes for general access structures based on linear programming
- Secret sharing on the \(d\)-dimensional cube
- On a new non-Shannon type information inequality
- Average complexities of access structures on five participants
- A new class of non-Shannon-type inequalities for entropies
- Optimal linear secret sharing schemes for graph access structures on six participants
- Secret sharing schemes with bipartite access structure
- Perfect secret sharing schemes for graph access structures on six participants
- Secret Sharing, Rank Inequalities, and Information Inequalities
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Secret-Sharing Schemes: A Survey
- How to share a secret
- On secret sharing schemes, matroids and polymatroids
- Note on Independence Functions
- A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
- 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
- Lifting Nullstellensatz to monotone span programs over any field
- Secret Sharing and Non-Shannon Information Inequalities
- Capacity Bounds for Networks With Correlated Sources and Characterisation of Distributions by Entropies
- Matroids Can Be Far from Ideal Secret Sharing
- Appendix: On Common Information and Related Characteristics of Correlated Information Sources
This page was built for publication: Improving the linear programming technique in the search for lower bounds in secret sharing
