Optimal complexity of secret sharing schemes with four minimal qualified subsets
From MaRDI portal
Publication:717150
DOI10.1007/S10623-010-9446-0zbMATH Open1236.94079OpenAlexW2053888052MaRDI QIDQ717150FDOQ717150
Authors: 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
Recommendations
- Secret sharing schemes with three or four minimal qualified subsets
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Complexity of universal access structures
- On secret sharing schemes, matroids and polymatroids
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
Cites Work
- How to share a secret
- On the classification of ideal secret sharing schemes
- On secret sharing schemes, matroids and polymatroids
- 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
- On the information rate of perfect secret sharing schemes
- Decomposition constructions for secret-sharing schemes
- Title not available (Why is that?)
- On secret sharing systems
- Perfect secret sharing schemes on five participants
- An impossibility result on graph secret sharing
- 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
- Graph decompositions and secret sharing schemes
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- Secret sharing schemes with bipartite access structure
- Title not available (Why is that?)
- Ideal hierarchical secret sharing schemes
- Ideal Multipartite Secret Sharing Schemes
- A linear construction of secret sharing schemes
- Polymatroidal dependence structure of a set of random variables
- Characterizing Ideal Weighted Threshold Secret Sharing
- Title not available (Why is that?)
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Matroids Can Be Far from Ideal Secret Sharing
- Geometric secret sharing schemes and their duals
- On the Optimization of Bipartite Secret Sharing Schemes
- Separating the Power of Monotone Span Programs over Different Fields
- 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
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
Cited In (9)
- Exact information ratios for secret sharing on small graphs with girth at least 5
- Complexity of universal access structures
- Improving the linear programming technique in the search for lower bounds in secret sharing
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Reduced access structures with four minimal qualified subsets on six participants
- Secret sharing schemes with three or four minimal qualified subsets
- On the optimization of bipartite secret sharing schemes
- Optimal linear secret sharing schemes for graph access structures on six participants
- The complexity of the connected graph access structure on seven participants
This page was built for publication: Optimal complexity of secret sharing schemes with four minimal qualified subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q717150)
