Some improved bounds on the information rate of perfect secret sharing schemes
From MaRDI portal
Publication:1202917
DOI10.1007/BF02451112zbMath0763.94008OpenAlexW2093673286MaRDI QIDQ1202917
Ernest F. Brickell, Douglas R. Stinson
Publication date: 22 April 1993
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02451112
Related Items (43)
More information theoretical inequalities to be used in secret sharing? ⋮ On secret sharing schemes ⋮ Perfect secret sharing scheme based on vertex domination set ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Secret sharing on large girth graphs ⋮ Some democratic secret sharing schemes ⋮ On the information rate of perfect secret sharing schemes ⋮ Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions ⋮ A note on secret sharing schemes with three homogeneous access structure ⋮ Unnamed Item ⋮ Anonymous secret sharing schemes ⋮ Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes ⋮ An efficient construction of perfect secret sharing schemes for graph-based structures ⋮ Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures ⋮ Constructions for anonymous secret sharing schemes using combinatorial designs ⋮ Secret sharing schemes for graph-based prohibited structures ⋮ The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs ⋮ Recursive constructions for perfect secret sharing schemes ⋮ The lower bound and exact value of the information rate of some developed graph 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 ⋮ Generalized threshold secret sharing and finite geometry ⋮ On the information rate of secret sharing schemes ⋮ The complexity of the connected graph access structure on seven participants ⋮ Exact information ratios for secret sharing on small graphs with girth at least 5 ⋮ Optimal assignment schemes for general access structures based on linear programming ⋮ 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 ⋮ Sharing multiple secrets: Models, schemes and analysis ⋮ 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 ⋮ The combinatorics of generalised cumulative arrays ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ On the optimization of bipartite secret sharing schemes ⋮ Randomness in secret sharing and visual cryptography schemes ⋮ Graph decompositions and secret sharing schemes ⋮ ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK ⋮ Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. ⋮ Probability of shares in secret sharing schemes ⋮ Geometric secret sharing schemes and their duals ⋮ Weighted decomposition construction for perfect secret sharing schemes
Cites Work
This page was built for publication: Some improved bounds on the information rate of perfect secret sharing schemes
