Pages that link to "Item:Q1853095"
From MaRDI portal
The following pages link to Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095):
Displaying 11 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes (Q3019920) (← links)
- On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
- New bounds on the information rate of secret sharing schemes (Q4838690) (← links)
- Ideal secret sharing schemes on graph-based $3$-homogeneous access structures (Q4958087) (← links)
- On the Power of Amortization in Secret Sharing (Q5862286) (← links)
