Pages that link to "Item:Q672750"
From MaRDI portal
The following pages link to On the information rate of secret sharing schemes (Q672750):
Displaying 14 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- On secret sharing schemes (Q293172) (← links)
- On-line secret sharing (Q664393) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- General information dispersal algorithms (Q1274915) (← links)
- Covering a graph by complete bipartite graphs (Q1363672) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Sharing multiple secrets: Models, schemes and analysis (Q2491290) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- Perfect secret sharing scheme based on vertex domination set (Q3451391) (← links)
