Lower bounds for secret-sharing schemes for k-hypergraphs

DOI10.4230/LIPICS.ITC.2023.16MaRDI QIDQ6642402zbMATH OpenFDO

Authors Amos Beimel

Publication date 22 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITC.2023.16

zbMATH Keywords

lower boundsmonotone circuitssecret sharingshare size

Mathematics Subject Classification ID

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

Recommendations

• The share size of secret-sharing schemes for almost all access structures and graphs
• Secret-sharing schemes for very dense graphs
• Secret-Sharing Schemes: A Survey
• Breaking the circuit-size barrier in secret sharing
• Secret sharing schemes for very dense graphs

Cited in

(6)

• Disincentivize collusion in verifiable secret sharing
• (k, n)-consecutive access structures
• Low-degree security of the planted random subgraph problem
• Secret-sharing schemes for high slices
• New upper bounds for evolving secret sharing via infinite branching programs
• A comprehensive review of graph theory applications in secret sharing schemes

This page was built for publication: Lower bounds for secret-sharing schemes for \(k\)-hypergraphs

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