Optimal complexity of secret sharing schemes with four minimal qualified subsets
From MaRDI portal
Publication:717150
DOI10.1007/S10623-010-9446-0zbMath1236.94079OpenAlexW2053888052MaRDI QIDQ717150
Jaume Martí-Farré, Carles Padró, Leonor Vázquez
Publication date: 27 September 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9446-0
Related Items (7)
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 ⋮ Complexity of universal access structures ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Exact information ratios for secret sharing on small graphs with girth at least 5 ⋮ 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
- Unnamed Item
- Perfect secret sharing schemes on five participants
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- An impossibility result on graph secret sharing
- 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 the size of shares for secret sharing schemes
- Geometric secret sharing schemes and their duals
- Tight bounds on the information rate of secret sharing schemes
- A linear construction of secret sharing schemes
- The size of a share must be large
- Secret sharing schemes with three or four minimal qualified subsets
- Graph decompositions and secret sharing schemes
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- On the information rate of perfect secret sharing schemes
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- Adhesivity of polymatroids
- Secret sharing schemes on access structures with intersection number equal to one
- Secret sharing schemes with bipartite access structure
- How to share a secret
- On secret sharing schemes, matroids and polymatroids
- Ideal Hierarchical Secret Sharing Schemes
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Characterizing Ideal Weighted Threshold Secret Sharing
- Polymatroidal dependence structure of a set of random variables
- Decomposition constructions for secret-sharing schemes
- On secret sharing systems
- On the Optimization of Bipartite Secret Sharing Schemes
- Separating the Power of Monotone Span Programs over Different Fields
- Ideal Multipartite Secret Sharing Schemes
- Matroids Can Be Far from Ideal Secret Sharing
This page was built for publication: Optimal complexity of secret sharing schemes with four minimal qualified subsets
