The following pages link to (Q4204100):
Displayed 21 items.
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← 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)
- Multipartite secret sharing by bivariate interpolation (Q1015357) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- On the classification of ideal secret sharing schemes (Q1180513) (← links)
- Some improved bounds on the information rate of perfect secret sharing schemes (Q1202917) (← links)
- Strongly ideal secret sharing schemes (Q1202922) (← links)
- An explication of secret sharing schemes (Q1203951) (← links)
- Generation of key predistribution schemes using secret sharing schemes (Q1811107) (← links)
- Randomness in secret sharing and visual cryptography schemes (Q1826638) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- A note on optimal metering schemes. (Q1853163) (← links)
- Some democratic secret sharing schemes (Q1893162) (← links)
- On the information rate of perfect secret sharing schemes (Q1894277) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
- On ASGS framework: general requirements and an example of implementation (Q2644567) (← links)
- Ideal Hierarchical Secret Sharing Schemes (Q3408196) (← links)
- Dynamic vector space secret sharing based on certificates (Q3446017) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- Matroids Can Be Far from Ideal Secret Sharing (Q5445507) (← links)