New upper bounds for evolving secret sharing via infinite branching programs

DOI10.1007/978-3-031-78023-3_18MaRDI QIDQ6955253zbMATH OpenFDO

Authors Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-78023-3_18

zbMATH Keywords

dynamic-threshold access structureslayered infinite branching programs

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
• Better secret sharing via robust conditional disclosure of secrets
• Breaking the circuit-size barrier in secret sharing
• Conditional disclosure of secrets via non-linear reconstruction
• Covering a graph by complete bipartite graphs
• Evolving homomorphic secret sharing for hierarchical access structures
• 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 schemes based on polynomial evaluations and algebraic geometry codes
• Evolving secret sharing: dynamic thresholds and robustness
• How to share a secret
• How to Share a Secret, Infinitely
• How to Share a Secret, Infinitely
• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 1101416 (Why is no real title available?)
• scientific article; zbMATH DE number 1775399 (Why is no real title available?)
• Lifting Nullstellensatz to monotone span programs over any field
• Lower bounds for secret-sharing schemes for \(k\)-hypergraphs
• New upper bounds for evolving secret sharing via infinite branching programs
• On the Cryptographic Complexity of the Worst Functions
• On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
• On-line secret sharing
• On-line secret sharing
• Probabilistic secret sharing
• Secret sharing schemes for infinite sets of participants: a new design technique
• Secret-sharing schemes for general and uniform access structures
• The complexity of multiparty PSM protocols and related models
• The size of a share must be large
• Tight bounds on the information rate of secret sharing schemes
• Towards breaking the exponential barrier for general secret sharing
• Upslices, downslices, and secret-sharing with complexity of 1.5ⁿ

Cited in

(5)

• Evolving secret sharing revisited: computational security and succinctness
• New upper bounds for evolving secret sharing via infinite branching programs
• A construction of evolving k-threshold secret sharing scheme over a polynomial ring
• Taming adaptive security and new access structures in evolving secret sharing
• A construction of evolving 3-threshold secret sharing scheme with perfect security and smaller share size

This page was built for publication: New upper bounds for evolving secret sharing via infinite branching programs

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