Optimal linear secret sharing schemes for graph access structures on six participants

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
How to share a secret
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
On the information rate of perfect secret sharing schemes
Decomposition constructions for secret-sharing schemes
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
Superpolynomial lower bounds for monotone span programs
Secret sharing schemes with bipartite access structure
Secret-sharing schemes for very dense graphs
Security of Ramp Schemes
Optimal Information Rate of Secret Sharing Schemes on Trees
Secret-Sharing Schemes: A Survey
Lower bounds for monotone span programs
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Weighted decomposition construction for perfect secret sharing schemes
The complexity of the graph access structures on six participants
On the information ratio of non-perfect secret sharing schemes
Linear secret-sharing schemes for forbidden graph access structures
Secret sharing schemes on access structures with intersection number equal to one
Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
On the optimization of bipartite secret sharing schemes
A general decomposition construction for incomplete secret sharing schemes
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
Optimal assignment schemes for general access structures based on linear programming
Secret sharing on the \(d\)-dimensional cube
Perfect secret sharing schemes for graph access structures on six participants
Reduced access structures with four minimal qualified subsets on six participants
Weakly-Private Secret Sharing Schemes

Cited In (5)

On the information ratio of graphs without high-degree neighbors
On group-characterizability of homomorphic secret sharing schemes
Linear secret-sharing schemes for forbidden graph access structures
On ideal homomorphic secret sharing schemes and their decomposition
Improving the linear programming technique in the search for lower bounds in secret sharing

This page was built for publication: Optimal linear secret sharing schemes for graph access structures on six participants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632007)