Secret sharing lower bound: either reconstruction is hard or shares are long
From MaRDI portal
Publication:2106669
Recommendations
Cited in
(8)- Succinct computational secret sharing
- On abelian and homomorphic secret sharing schemes
- Breaking the circuit-size barrier in secret sharing
- Towards breaking the exponential barrier for general secret sharing
- Bounded indistinguishability and the complexity of recovering secrets
- Csirmaz's duality conjecture and threshold secret sharing
- Quadratic secret sharing and conditional disclosure of secrets
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
This page was built for publication: Secret sharing lower bound: either reconstruction is hard or shares are long
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106669)