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_22zbMATH Open1423.94127OpenAlexW2773609685MaRDI QIDQ1648816FDOQ1648816
Authors: Oriol Farràs, Tarik Kaced, Sebastià Martín, Carles Padró 
Publication date: 9 July 2018
Full work available at URL: http://hdl.handle.net/2117/338198
Recommendations
- Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- A linear construction of secret sharing schemes
- The optimal linear secret sharing scheme for any given access structure
- Lower bounds for robust secret sharing schemes
- Error correcting and complexity aspects of linear secret sharing schemes
- scientific article; zbMATH DE number 1088900
- Combinatorial lower bounds for secret sharing schemes
- Progress in Cryptology - INDOCRYPT 2003
Cites Work
- Title not available (Why is that?)
- How to share a secret
- Title not available (Why is that?)
- On the classification of ideal secret sharing schemes
- On secret-sharing matroids
- On secret sharing schemes, matroids and polymatroids
- On characterization of entropy function via information inequalities
- Title not available (Why is that?)
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- On the information rate of perfect secret sharing schemes
- More information theoretical inequalities to be used in secret sharing?
- Decomposition constructions for secret-sharing schemes
- On secret sharing systems
- Perfect secret sharing schemes on five participants
- An impossibility result on graph secret sharing
- Tight bounds on the information rate of secret sharing schemes
- The size of a share must be large
- Secret sharing schemes with three or four minimal qualified subsets
- Superpolynomial lower bounds for monotone span programs
- Secret sharing schemes with bipartite access structure
- Secret-sharing schemes for very dense graphs
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Secret-Sharing Schemes: A Survey
- Lower bounds for monotone span programs
- Information theory and network coding
- A new class of non-Shannon-type inequalities for entropies
- A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Polymatroidal dependence structure of a set of random variables
- Inequalities for Shannon entropy and Kolmogorov complexity
- Title not available (Why is that?)
- Weighted decomposition construction for perfect secret sharing schemes
- The complexity of the graph access structures on six participants
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- Matroids Can Be Far from Ideal Secret Sharing
- Geometric secret sharing schemes and their duals
- New inequalities for subspace arrangements
- Appendix: On Common Information and Related Characteristics of Correlated Information Sources
- On a new non-Shannon type information inequality
- Title not available (Why is that?)
- Secret Sharing and Non-Shannon Information Inequalities
- On the optimization of bipartite secret sharing schemes
- Note on Independence Functions
- Lifting Nullstellensatz to monotone span programs over any field
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Optimal assignment schemes for general access structures based on linear programming
- Secret sharing on the \(d\)-dimensional cube
- Average complexities of access structures on five participants
- Optimal linear secret sharing schemes for graph access structures on six participants
- Perfect secret sharing schemes for graph access structures on six participants
- Secret Sharing, Rank Inequalities, and Information Inequalities
- Title not available (Why is that?)
- Capacity Bounds for Networks With Correlated Sources and Characterisation of Distributions by Entropies
Cited In (11)
- Exact information ratios for secret sharing on small graphs with girth at least 5
- Improving variable orderings of approximate decision diagrams using reinforcement learning
- On group-characterizability of homomorphic secret sharing schemes
- Secret sharing schemes for ports of matroids of rank 3.
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Common information, matroid representation, and secret sharing for matroid ports
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Optimal linear secret sharing schemes for graph access structures on six participants
- Succinct computational secret sharing
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures
- Local bounds for the optimal information ratio of secret sharing schemes
This page was built for publication: Improving the linear programming technique in the search for lower bounds in secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648816)
