Secret sharing lower bound: either reconstruction is hard or shares are long

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

zbMATH Keywords

secret sharing schemeexponential share length

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

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