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

Recommendations

scientific article; zbMATH DE number 503323
Exact information ratios for secret sharing on small graphs with girth at least 5
Graph decompositions and secret sharing schemes
scientific article; zbMATH DE number 708803
scientific article; zbMATH DE number 1107673

Cites work

scientific article; zbMATH DE number 708804 (Why is no real title available?)
scientific article; zbMATH DE number 1955808 (Why is no real title available?)
scientific article; zbMATH DE number 1394291 (Why is no real title available?)
A general decomposition construction for incomplete secret sharing schemes
An explication of secret sharing schemes
An impossibility result on graph secret sharing
Decomposition constructions for secret-sharing schemes
Finding lower bounds on the complexity of secret sharing schemes by linear programming
Graph decompositions and secret sharing schemes
How to share a secret
Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
Improving the linear programming technique in the search for lower bounds in secret sharing
Linear secret-sharing schemes for forbidden graph access structures
Lower bounds for monotone span programs
On secret sharing systems
On the classification of ideal secret sharing schemes
On the information rate of perfect secret sharing schemes
On the information ratio of non-perfect secret sharing schemes
On the optimization of bipartite secret sharing schemes
On the size of shares for secret sharing schemes
Optimal Information Rate of Secret Sharing Schemes on Trees
Optimal assignment schemes for general access structures based on linear programming
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Perfect secret sharing schemes for graph access structures on six participants
Perfect secret sharing schemes on five participants
Reduced access structures with four minimal qualified subsets on six participants
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
Secret sharing schemes with three or four minimal qualified subsets
Secret-Sharing Schemes: A Survey
Secret-sharing schemes for very dense graphs
Security of Ramp Schemes
Some improved bounds on the information rate of perfect secret sharing schemes
Superpolynomial lower bounds for monotone span programs
The complexity of the graph access structures on six participants
The size of a share must be large
Tight bounds on the information rate of secret sharing schemes
Weakly-Private Secret Sharing Schemes
Weighted decomposition construction for perfect secret sharing schemes

Cited in

(7)

The complexity of the graph access structures on six participants
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
Reduced access structures with four minimal qualified subsets on six participants

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)