The following pages link to (Q3202940):
Displayed 33 items.
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- All inequalities for the relative entropy (Q883003) (← links)
- Rearrangements of access structures and their realizations in secret sharing schemes (Q947807) (← links)
- Secret sharing schemes for graph-based prohibited structures (Q1125037) (← 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)
- Ideal homomorphic secret sharing schemes over cyclic groups (Q1286658) (← links)
- On the size of shares for secret sharing schemes (Q1310452) (← links)
- Geometric secret sharing schemes and their duals (Q1321560) (← links)
- Anonymous secret sharing schemes (Q1364776) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Probability of shares in secret sharing schemes (Q1607017) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
- Randomness in secret sharing and visual cryptography schemes (Q1826638) (← links)
- Shared generation of pseudo-random functions (Q1827581) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095) (← links)
- An efficient construction of perfect secret sharing schemes for graph-based structures (Q1912864) (← links)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- Secret sharing based on a hard-on-average problem (Q2369061) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- A scheme for threshold multi-secret sharing (Q2485603) (← links)
- Sharing multiple secrets: Models, schemes and analysis (Q2491290) (← links)
- How to share a secret (Q3050283) (← links)
- An efficient and secure multi-secret sharing scheme with general access structures (Q3443247) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- Matroids Can Be Far from Ideal Secret Sharing (Q5445507) (← links)
- Escrow-free encryption supporting cryptographic workflow (Q5492129) (← links)