An impossibility result on graph secret sharing
From MaRDI portal
Publication:1039271
DOI10.1007/s10623-009-9304-0zbMath1180.94051OpenAlexW2151779345MaRDI QIDQ1039271
Publication date: 27 November 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9304-0
Linear programming (90C05) Cryptography (94A60) Combinatorial aspects of matroids and geometric lattices (05B35) Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (14)
Secret-sharing schemes for very dense graphs ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs ⋮ Complexity of universal access structures ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Secret sharing on regular bipartite access structures ⋮ Optimal information ratio of secret sharing schemes on Dutch windmill graphs ⋮ 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 ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ Reduced access structures with four minimal qualified subsets on six participants ⋮ On the optimization of bipartite secret sharing schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- Secret sharing over infinite domains
- Matroid representations by partitions
- On the size of shares for secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- The size of a share must be large
- Secret sharing schemes with three or four minimal qualified subsets
- On the information rate of perfect secret sharing schemes
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- Adhesivity of polymatroids
- How to share a secret
- On Secret Sharing Schemes, Matroids and Polymatroids
- Decomposition constructions for secret-sharing schemes
- On characterization of entropy function via information inequalities
- Separating the Power of Monotone Span Programs over Different Fields
- On the Power of Nonlinear Secret-Sharing
- Ideal Multipartite Secret Sharing Schemes
- Matroids Can Be Far from Ideal Secret Sharing
- Theory of Cryptography
This page was built for publication: An impossibility result on graph secret sharing
