Secret Sharing Schemes for (k, n)-Consecutive Access Structures
From MaRDI portal
Publication:6104673
Recommendations
Cites work
- A secret sharing scheme based on cellular automata
- Characterizing Ideal Weighted Threshold Secret Sharing
- Decomposition constructions for secret-sharing schemes
- Geometric secret sharing schemes and their duals
- Graph decompositions and secret sharing schemes
- Hierarchical threshold secret sharing
- How to share a secret
- Hypergraph decomposition and secret sharing
- Ideal Hierarchical Secret Sharing Schemes
- Ideal multipartite secret sharing schemes
- Improving the linear programming technique in the search for lower bounds in secret sharing
- On the classification of ideal secret sharing schemes
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Perfect secret sharing schemes on five participants
- Secret sharing schemes on access structures with intersection number equal to one
- Secret sharing schemes on sparse homogeneous access structures with rank three
- Secret sharing schemes with bipartite access structure
- Secret sharing schemes with three or four minimal qualified subsets
- Tight bounds on the information rate of secret sharing schemes
Cited in
(3)
This page was built for publication: Secret Sharing Schemes for (k, n)-Consecutive Access Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104673)