Pages that link to "Item:Q1039271"
From MaRDI portal
The following pages link to An impossibility result on graph secret sharing (Q1039271):
Displaying 14 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Complexity of universal access structures (Q413265) (← links)
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216) (← links)
- The complexity of the connected graph access structure on seven participants (Q515397) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- On the information ratio of graphs without high-degree neighbors (Q2231745) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- Secret sharing on regular bipartite access structures (Q2701503) (← links)
