Graph decompositions and secret sharing schemes
From MaRDI portal
Publication:1842517
DOI10.1007/BF00204801zbMath0816.94013OpenAlexW2792527638MaRDI QIDQ1842517
Carlo Blundo, Alfredo De Santis, Ugo Vaccaro, Douglas R. Stinson
Publication date: 16 July 1995
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00204801
Applications of graph theory (05C90) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Measures of information, entropy (94A17)
Related Items (47)
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 ⋮ 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 ⋮ Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions ⋮ A note on secret sharing schemes with three homogeneous access structure ⋮ Secret sharing schemes with partial broadcast channels ⋮ Unnamed Item ⋮ On an infinite family of graphs with information ratio \(2 - 1/k\) ⋮ Anonymous secret sharing schemes ⋮ The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs ⋮ Quantum secret sharing using the \(d\)-dimensional GHZ state ⋮ Approximation and decomposition in lattices of clutters ⋮ Secret Sharing Schemes for (k, n)-Consecutive Access Structures ⋮ Visual cryptography on graphs ⋮ The complexity of the graph access structures on six participants ⋮ A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations ⋮ Balanced equi-\(n\)-squares ⋮ Secret sharing on regular bipartite access structures ⋮ Recursive constructions for perfect secret sharing schemes ⋮ The lower bound and exact value of the information rate of some developed graph access structures ⋮ On the information ratio of graphs without high-degree neighbors ⋮ New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures ⋮ The complexity of the connected graph access structure on seven participants ⋮ An explication of secret sharing schemes ⋮ 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 ⋮ 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 ⋮ ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK ⋮ Secret sharing schemes for ports of matroids of rank 3 ⋮ Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. ⋮ On the size of shares for secret sharing schemes ⋮ Weighted decomposition construction for perfect secret sharing schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to share a secret with cheaters
- On the classification of ideal secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- An explication of secret sharing schemes
- On secret-sharing matroids
- Multiple assignment scheme for sharing secret
- On the size of shares for secret sharing schemes
- How to share a secret
- The Detection of Cheaters in Thershold Schemes
- Decomposition constructions for secret-sharing schemes
- On secret sharing systems
This page was built for publication: Graph decompositions and secret sharing schemes
