The following pages link to (Q4853712):
Displayed 12 items.
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- Fully dynamic secret sharing schemes (Q671527) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Incidence structures applied to cryptography (Q1199628) (← links)
- An explication of secret sharing schemes (Q1203951) (← links)
- Geometric secret sharing schemes and their duals (Q1321560) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
- Shared generation of pseudo-random functions (Q1827581) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes (Q1910425) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- Matroids Can Be Far from Ideal Secret Sharing (Q5445507) (← links)