Tight bounds on the information rate of secret sharing schemes
Secret sharing schemes represent a useful tool to ensure that some secret value is available only as a result of collaborative effort of some qualified set of participants, while preventing other sets of participants to determine anything about the secret value. A secret sharing scheme requires that some shares are distributed among the set of participants in an appropriate way. In practice the information rate of the scheme, i.e. the ratio between the size of the secret and that of the largest share given to any participant, form an important parameter of the scheme. Previous results on upper bounds on the information rate have used rather ad hoc proof techniques. In the paper a general technique to derive upper bounds on the information rate of secret sharing schemes is given. It is also noted that the method cannot provide an upper bound better than \(({\log n}) / n\). Finally, a tight upper bound on the information rate for an infinite class of graph-based access structures is proved.
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Hypergraph decomposition and secret sharing
- An impossibility result on graph secret sharing
- Some improved bounds on the information rate of perfect secret sharing schemes
- Sharing one secret vs. sharing many secrets.
- Weighted decomposition construction for perfect secret sharing schemes
- Improving the linear programming technique in the search for lower bounds in secret sharing
- On the information ratio of non-perfect secret sharing schemes
- Privacy-preserving outsourcing of image feature extraction in cloud computing
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs
- Secret sharing schemes with three or four minimal qualified subsets
- Reduced access structures with four minimal qualified subsets on six participants
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- The complexity of the graph access structures on six participants
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Recursive constructions for perfect secret sharing schemes
- Exact information ratios for secret sharing on small graphs with girth at least 5
- Secret sharing on the \(d\)-dimensional cube
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
- Local bounds for the optimal information ratio of secret sharing schemes
- Secret sharing schemes on access structures with intersection number equal to one
- Optimal linear secret sharing schemes for graph access structures on six participants
- Secret sharing on large girth graphs
- Secret sharing schemes for dense forbidden graphs
- More information theoretical inequalities to be used in secret sharing?
- Secret-sharing schemes for very dense graphs
- On secret sharing schemes
- Robust vector space secret sharing schemes
- Secret-Sharing Schemes: A Survey
- Ideal secret sharing schemes for useful multipartite access structures
- On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes
- On secret sharing schemes, matroids and polymatroids
- On Linear Secret Sharing for Connectivity in Directed Graphs
- Secret Sharing and Non-Shannon Information Inequalities
- Secret sharing on infinite graphs
- scientific article; zbMATH DE number 176543 (Why is no real title available?)
- Complexity of universal access structures
- scientific article; zbMATH DE number 708803 (Why is no real title available?)
- scientific article; zbMATH DE number 708804 (Why is no real title available?)
- New bounds on the information rate of secret sharing schemes
- On the asymptotic tightness of the Shannon lower bound
- Ideal secret sharing schemes on graph-based 3-homogeneous access structures
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
- Erdős-Pyber theorem for hypergraphs and secret sharing
- Probabilistic secret sharing
- The lower bound and exact value of the information rate of some developed graph access structures
- Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- On the Power of Amortization in Secret Sharing
- Approximate Degree, Secret Sharing, and Concentration Phenomena
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
- Approximation and decomposition in lattices of clutters
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures
- Bipartite secret sharing and staircases
- Visual cryptography on graphs
- Succinct computational secret sharing
- On-line secret sharing
- Fully dynamic secret sharing schemes
- On the information rate of secret sharing schemes
- (k, n)-consecutive access structures
- New upper bounds for evolving secret sharing via infinite branching programs
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- On the optimization of bipartite secret sharing schemes
- A note on secret sharing schemes with three homogeneous access structure
This page was built for publication: Tight bounds on the information rate of secret sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1358672)
