Pages that link to "Item:Q672750"
From MaRDI portal
The following pages link to On the information rate of secret sharing schemes (Q672750):
Displaying 28 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- On secret sharing schemes (Q293172) (← links)
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216) (← 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)
- Tight bounds on the information rate of secret sharing schemes (Q1358672) (← 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)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095) (← links)
- On the information rate of perfect secret sharing schemes (Q1894277) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- Optimal assignment schemes for general access structures based on linear programming (Q2260793) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- Sharing multiple secrets: Models, schemes and analysis (Q2491290) (← links)
- The optimal information rate of a class of access structures based on hypergraphs on seven participants (Q2924077) (← links)
- A note on the optimal information rate of hypercycle access structures with three hyperedges (Q2993102) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes (Q3019920) (← links)
- Perfect secret sharing scheme based on vertex domination set (Q3451391) (← links)
- New bounds on the information rate of secret sharing schemes (Q4838690) (← links)
- On the Power of Amortization in Secret Sharing (Q5862286) (← links)
- Approximate Degree, Secret Sharing, and Concentration Phenomena (Q5875531) (← links)