Decomposition constructions for secret-sharing schemes
From MaRDI portal
Publication:4307278
DOI10.1109/18.272461zbMath0803.94017OpenAlexW2131278486MaRDI QIDQ4307278
Publication date: 4 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7d0dd39ca633a5263163a608ab9c08bd4a873e19
Related Items (65)
Ideal secret sharing schemes on graph-based $3$-homogeneous access structures ⋮ Lower bounds for robust secret sharing schemes ⋮ Secret-sharing schemes for very dense graphs ⋮ On secret sharing schemes ⋮ Robust vector space secret sharing schemes ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ 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 ⋮ 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\) ⋮ Anonymous secret sharing schemes ⋮ Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures ⋮ 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 ⋮ Approximation and decomposition in lattices of clutters ⋮ Secret Sharing Schemes for (k, n)-Consecutive Access Structures ⋮ Complexity of universal access structures ⋮ Sharing one secret vs. sharing many secrets. ⋮ On identification secret sharing schemes. ⋮ Visual cryptography on graphs ⋮ Rational quantum secret sharing scheme based on GHZ state ⋮ Strong security of linear ramp secret sharing schemes with general access structures ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Recursive constructions for perfect secret sharing schemes ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ On Linear Secret Sharing for Connectivity in Directed Graphs ⋮ A New (k,n)-Threshold Secret Sharing Scheme and Its Extension ⋮ Optimal information ratio of secret sharing schemes on Dutch windmill graphs ⋮ On-line secret sharing ⋮ On the information ratio of graphs without high-degree neighbors ⋮ 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 ⋮ On ideal homomorphic secret sharing schemes and their decomposition ⋮ 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 exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures ⋮ A perfect threshold secret sharing scheme to identify cheaters ⋮ On abelian and homomorphic secret sharing schemes ⋮ General information dispersal algorithms ⋮ Secret Sharing Schemes for Dense Forbidden Graphs ⋮ Hypergraph decomposition and secret sharing ⋮ On the optimization of bipartite secret sharing schemes ⋮ Randomness in secret sharing and visual cryptography schemes ⋮ An impossibility result on graph secret sharing ⋮ 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. ⋮ Randomness in distribution protocols ⋮ Weighted decomposition construction for perfect secret sharing schemes
This page was built for publication: Decomposition constructions for secret-sharing schemes