Reduced access structures with four minimal qualified subsets on six participants
From MaRDI portal
Publication:1783720
DOI10.3934/amc.2018014zbMath1414.94921OpenAlexW2791789808WikidataQ130002424 ScholiaQ130002424MaRDI QIDQ1783720
Shahram Khazaei, Motahhareh Gharahi
Publication date: 21 September 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2018014
Related Items (1)
Cites Work
- Unnamed Item
- Perfect secret sharing schemes on five participants
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- On the optimization of bipartite secret sharing schemes
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- An impossibility result on graph secret sharing
- Some improved bounds on the information rate of perfect secret sharing schemes
- An explication of secret sharing schemes
- A general decomposition construction for incomplete 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
- Weighted decomposition construction for perfect secret sharing schemes
- 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
- The complexity of the graph access structures on six participants
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Secret sharing on the \(d\)-dimensional cube
- Secret sharing schemes on access structures with intersection number equal to one
- Secret sharing schemes with bipartite access structure
- Perfect secret sharing schemes for graph access structures on six participants
- Optimal Non-perfect Uniform Secret Sharing Schemes
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Decomposition constructions for secret-sharing schemes
- On secret sharing systems
- Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time
- Multi-linear Secret-Sharing Schemes
This page was built for publication: Reduced access structures with four minimal qualified subsets on six participants
