The following pages link to (Q4318691):
Displayed 12 items.
- Ideal multipartite secret sharing schemes (Q434350) (← 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)
- Secret sharing schemes with three or four minimal qualified subsets (Q1766095) (← links)
- On the information rate of perfect secret sharing schemes (Q1894277) (← links)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) (Q2129013) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
- Randomness in distribution protocols (Q4632457) (← links)