Improving the linear programming technique in the search for lower bounds in secret sharing

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

scientific article; zbMATH DE number 420868 (Why is no real title available?)
scientific article; zbMATH DE number 3908323 (Why is no real title available?)
scientific article; zbMATH DE number 3497786 (Why is no real title available?)
scientific article; zbMATH DE number 3575467 (Why is no real title available?)
scientific article; zbMATH DE number 1101416 (Why is no real title available?)
scientific article; zbMATH DE number 3351601 (Why is no real title available?)
A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
A new class of non-Shannon-type inequalities for entropies
An explication of secret sharing schemes
An impossibility result on graph secret sharing
Appendix: On Common Information and Related Characteristics of Correlated Information Sources
Average complexities of access structures on five participants
Capacity Bounds for Networks With Correlated Sources and Characterisation of Distributions by Entropies
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
Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
Inequalities for Shannon entropy and Kolmogorov complexity
Information theory and network coding
Lifting Nullstellensatz to monotone span programs over any field
Lower bounds for monotone span programs
Matroids Can Be Far from Ideal Secret Sharing
More information theoretical inequalities to be used in secret sharing?
New inequalities for subspace arrangements
Note on Independence Functions
On a new non-Shannon type information inequality
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 size of shares for secret sharing schemes
Optimal Information Rate of Secret Sharing Schemes on Trees
Optimal assignment schemes for general access structures based on linear programming
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Optimal linear secret sharing schemes for graph access structures on six participants
Perfect secret sharing schemes for graph access structures on six participants
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, Rank Inequalities, and Information Inequalities
Secret sharing on the \(d\)-dimensional cube
Secret sharing schemes with bipartite access structure
Secret sharing schemes with three or four minimal qualified subsets
Secret-Sharing Schemes: A Survey
Secret-sharing schemes for very dense graphs
Superpolynomial lower bounds for monotone span programs
The complexity of the graph access structures on six participants
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

(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)