Pages that link to "Item:Q1766095"
From MaRDI portal
The following pages link to Secret sharing schemes with three or four minimal qualified subsets (Q1766095):
Displaying 19 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Complexity of universal access structures (Q413265) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- A generalized information theoretical model for quantum secret sharing (Q517681) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- A note on secret sharing schemes with three homogeneous access structure (Q845987) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- On an infinite family of graphs with information ratio \(2 - 1/k\) (Q2390949) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
- Ideal secret sharing schemes on graph-based $3$-homogeneous access structures (Q4958087) (← links)
- Matroids Can Be Far from Ideal Secret Sharing (Q5445507) (← links)
- Approximation and decomposition in lattices of clutters (Q6041563) (← links)
