Taming adaptive security and new access structures in evolving secret sharing

DOI10.1007/978-981-95-5125-5_3MaRDI QIDQ7232828zbMATH OpenFDO

Authors Danilo Francati, Sara Giammusso, D. Venturi

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5125-5_3

zbMATH Keywords

adaptive securitycomputational securityevolving secret sharing

Mathematics Subject Classification ID

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

Cites work

• A lower bound on the share size in evolving secret sharing
• Be adaptive, avoid overcommitting
• Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing
• Evolving ramp secret sharing with a small gap
• Evolving ramp secret-sharing schemes
• Evolving secret sharing made short
• Evolving secret sharing: dynamic thresholds and robustness
• How to share a secret
• How to Share a Secret, Infinitely
• scientific article; zbMATH DE number 176869 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• New upper bounds for evolving secret sharing via infinite branching programs
• Reducing the share size of weighted threshold secret sharing schemes via Chow parameters approximation
• Secret sharing schemes for infinite sets of participants: a new design technique
• Secret-sharing for \(\mathbf {NP}\)
• Succinct computational secret sharing

This page was built for publication: Taming adaptive security and new access structures in evolving secret sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232828)