The following pages link to (Q4318691):
Displaying 21 items.
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← 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)
- Anonymous secret sharing schemes (Q1364776) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Secret sharing schemes with three or four minimal qualified subsets (Q1766095) (← 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)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) (Q2129013) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
- On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes (Q3019920) (← links)
- Randomness in distribution protocols (Q4632457) (← 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)
