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

DOI10.1007/978-3-030-57990-6_28MaRDI QIDQ2106669zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

exponential share lengthsecret sharing scheme

Mathematics Subject Classification ID

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

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

Cited in

(13)

• Towards breaking the exponential barrier for general secret sharing
• On abelian and homomorphic secret sharing schemes
• Upslices, downslices, and secret-sharing with complexity of 1.5ⁿ
• Quadratic secret sharing and conditional disclosure of secrets
• Bounded indistinguishability and the complexity of recovering secrets
• Secret sharing with binary shares
• Breaking the circuit-size barrier in secret sharing
• Succinct computational secret sharing
• Csirmaz's duality conjecture and threshold secret sharing
• Fully anonymous secret sharing
• Evolving secret sharing revisited: computational security and succinctness
• Secret-sharing schemes for high slices
• Time/space tradeoffs for generic attacks on delay functions

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)