Tight bounds on the information rate of secret sharing schemes
From MaRDI portal
Publication:1358672
DOI10.1023/A:1008216403325zbMath0878.94050OpenAlexW1995726850MaRDI QIDQ1358672
Carlo Blundo, Ugo Vaccaro, Alfredo De Santis, Roberto De Simone
Publication date: 18 December 1997
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008216403325
Related Items
Ideal secret sharing schemes on graph-based $3$-homogeneous access structures, Secret-sharing schemes for very dense graphs, On secret sharing schemes, Robust vector space secret sharing schemes, Optimal linear secret sharing schemes for graph access structures on six participants, Secret sharing on large girth graphs, A note on secret sharing schemes with three homogeneous access structure, Improving the linear programming technique in the search for lower bounds in secret sharing, On an infinite family of graphs with information ratio \(2 - 1/k\), Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures, The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs, Approximation and decomposition in lattices of clutters, Secret Sharing Schemes for (k, n)-Consecutive Access Structures, Complexity of universal access structures, Bipartite secret sharing and staircases, Sharing one secret vs. sharing many secrets., Visual cryptography on graphs, The complexity of the graph access structures on six participants, Privacy-preserving outsourcing of image feature extraction in cloud computing, Finding lower bounds on the complexity of secret sharing schemes by linear programming, Recursive constructions for perfect secret sharing schemes, On Linear Secret Sharing for Connectivity in Directed Graphs, Optimal information ratio of secret sharing schemes on Dutch windmill graphs, On-line secret sharing, Probabilistic secret sharing, Secret-Sharing Schemes: A Survey, Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, Fully dynamic secret sharing schemes, 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, Exact information ratios for secret sharing on small graphs with girth at least 5, Secret sharing on the \(d\)-dimensional cube, Secret sharing schemes with three or four minimal qualified subsets, Secret sharing schemes on access structures with intersection number equal to one, Optimal complexity of secret sharing schemes with four minimal qualified subsets, On secret sharing schemes, matroids and polymatroids, Reduced access structures with four minimal qualified subsets on six participants, Ideal secret sharing schemes whose minimal qualified subsets have at most three participants, Secret Sharing Schemes for Dense Forbidden Graphs, Hypergraph decomposition and secret sharing, On the optimization of bipartite secret sharing schemes, An impossibility result on graph secret sharing, Lower bounds on the information rate of secret sharing schemes with homogeneous access structure., Weighted decomposition construction for perfect secret sharing schemes
