The complexity of the connected graph access structure on seven participants
From MaRDI portal
(Redirected from Publication:515397)
Recommendations
- Perfect secret sharing schemes for graph access structures on six participants
- The complexity of the graph access structures on six participants
- Complexity of universal access structures
- Average complexities of access structures on five participants
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
Cites work
- scientific article; zbMATH DE number 1095500 (Why is no real title available?)
- 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
- On the classification of ideal secret sharing schemes
- Perfect secret sharing schemes on five participants
- Some improved bounds on the information rate of perfect secret sharing schemes
- The complexity of the graph access structures on six participants
- Weighted decomposition construction for perfect secret sharing schemes
Cited in
(6)- Complexity of universal access structures
- Exact information ratios for secret sharing on small graphs with girth at least 5
- The complexity of the graph access structures on six participants
- Average complexities of access structures on five participants
- Perfect secret sharing schemes for graph access structures on six participants
- The quantum secret sharing schemes based on hyperstar access structures
This page was built for publication: The complexity of the connected graph access structure on seven participants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515397)
