The following pages link to Theory of Cryptography (Q5898370):
Displaying 15 items.
- Secret-sharing matroids need not be algebraic (Q284751) (← links)
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid (Q533769) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- On secret-sharing matroids (Q1204471) (← links)
- Generalized ideal secret-sharing schemes and matroids (Q1271430) (← links)
- Secret sharing and duality (Q2033511) (← links)
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
- On an infinite family of graphs with information ratio \(2 - 1/k\) (Q2390949) (← links)
- How to share a secret (Q3050283) (← links)
- A note on duality in linear secret sharing schemes (Q3126447) (← links)
- On Secret Sharing Schemes, Matroids and Polymatroids (Q3596383) (← links)
- Introduction to Secret-Sharing (Q5213649) (← links)
- Matroids Can Be Far from Ideal Secret Sharing (Q5445507) (← links)
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes (Q5451034) (← links)
- Bipartite secret sharing and staircases (Q6124455) (← links)