Secret sharing lower bound: either reconstruction is hard or shares are long
From MaRDI portal
Publication:2106669
DOI10.1007/978-3-030-57990-6_28zbMath1506.94082OpenAlexW3083444011MaRDI QIDQ2106669
Kasper Green Larsen, Mark Simkin
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-57990-6_28
Related Items (2)
Quadratic secret sharing and conditional disclosure of secrets ⋮ On abelian and homomorphic secret sharing schemes
This page was built for publication: Secret sharing lower bound: either reconstruction is hard or shares are long