The share size of secret-sharing schemes for almost all access structures and graphs

DOI10.1007/978-3-030-64381-2_18zbMath1485.94130OpenAlexW3116930874MaRDI QIDQ2119092

Oriol Farràs, Amos Beimel

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-64381-2_18

zbMATH Keywords

monotone Boolean functionsgraph secret-sharing schemes

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Density (toughness, etc.) (05C42) Boolean functions (94D10)

Related Items (2)

Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) ⋮ Quadratic secret sharing and conditional disclosure of secrets

This page was built for publication: The share size of secret-sharing schemes for almost all access structures and graphs