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

DOI10.1007/978-3-030-57990-6_28zbMATH Open1506.94082OpenAlexW3083444011MaRDI QIDQ2106669FDOQ2106669

Authors: 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

Recommendations

• Towards breaking the exponential barrier for general secret sharing
• Breaking the circuit-size barrier in secret sharing
• Secret-Sharing Schemes: A Survey
• scientific article; zbMATH DE number 176543
• Threshold secret sharing requires a linear-size alphabet

zbMATH Keywords

secret sharing schemeexponential share length

Mathematics Subject Classification ID

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

Cited In (8)

• Towards breaking the exponential barrier for general secret sharing
• Quadratic secret sharing and conditional disclosure of secrets
• Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
• On abelian and homomorphic secret sharing schemes
• Csirmaz's duality conjecture and threshold secret sharing
• Succinct computational secret sharing
• Bounded indistinguishability and the complexity of recovering secrets
• Breaking the circuit-size barrier in secret sharing

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)