Secret sharing schemes with three or four minimal qualified subsets
From MaRDI portal
(Redirected from Publication:1766095)
Recommendations
- A note on secret sharing schemes with three homogeneous access structure
- Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- On the size of shares for secret sharing schemes
- An explication of secret sharing schemes
Cites work
- An explication of secret sharing schemes
- Decomposition constructions for secret-sharing schemes
- Geometric secret sharing schemes and their duals
- Graph decompositions and secret sharing schemes
- How to share a secret
- scientific article; zbMATH DE number 708803 (Why is no real title available?)
- On the size of shares for secret sharing schemes
- Secret sharing schemes with bipartite access structure
- Some improved bounds on the information rate of perfect secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
Cited in
(22)- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Hypergraph decomposition and secret sharing
- An impossibility result on graph secret sharing
- Improving the linear programming technique in the search for lower bounds in secret sharing
- Secret sharing schemes on sparse homogeneous access structures with rank three
- Reduced access structures with four minimal qualified subsets on six participants
- Exact information ratios for secret sharing on small graphs with girth at least 5
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- Secret sharing schemes on access structures with intersection number equal to one
- Optimal linear secret sharing schemes for graph access structures on six participants
- Secret-sharing schemes for very dense graphs
- On secret sharing schemes, matroids and polymatroids
- Complexity of universal access structures
- Ideal multipartite secret sharing schemes
- Ideal secret sharing schemes on graph-based 3-homogeneous access structures
- A generalized information theoretical model for quantum secret sharing
- Matroids Can Be Far from Ideal Secret Sharing
- Approximation and decomposition in lattices of clutters
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures
- (k, n)-consecutive access structures
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- A note on secret sharing schemes with three homogeneous access structure
This page was built for publication: Secret sharing schemes with three or four minimal qualified subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1766095)
