Optimal linear secret sharing schemes for graph access structures on six participants
From MaRDI portal
Publication:2632007
DOI10.1016/j.tcs.2018.11.007zbMath1439.94083OpenAlexW2795291456WikidataQ128930798 ScholiaQ128930798MaRDI QIDQ2632007
Motahhareh Gharahi, Shahram Khazaei
Publication date: 17 May 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.11.007
Related Items (4)
Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ On the information ratio of graphs without high-degree neighbors ⋮ On group-characterizability of homomorphic secret sharing schemes ⋮ On ideal homomorphic secret sharing schemes and their decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secret-sharing schemes for very dense graphs
- Perfect secret sharing schemes on five participants
- Lower bounds for monotone span programs
- 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
- 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
- A general decomposition construction for incomplete secret sharing schemes
- 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
- Weighted decomposition construction for perfect secret sharing schemes
- Improving the linear programming technique in the search for lower bounds in secret sharing
- On the information ratio of non-perfect secret sharing schemes
- Linear secret-sharing schemes for forbidden graph access structures
- Secret sharing schemes with three or four minimal qualified subsets
- Reduced access structures with four minimal qualified subsets on six participants
- Graph decompositions and secret sharing schemes
- 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
- Superpolynomial lower bounds for monotone span programs
- Optimal assignment schemes for general access structures based on 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
- Security of Ramp Schemes
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Weakly-Private Secret Sharing Schemes
- Decomposition constructions for secret-sharing schemes
- On secret sharing systems
This page was built for publication: Optimal linear secret sharing schemes for graph access structures on six participants
