Linear secret-sharing schemes for forbidden graph access structures

DOI10.1007/978-3-319-70503-3_13zbMath1412.94221OpenAlexW2765972321MaRDI QIDQ1690278

Oriol Farràs, Yuval Mintz, Naty Peter, Amos Beimel

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_13

zbMATH Keywords

share sizesecret-sharingmonotone span programconditional disclosure of secrets

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Measuring, simulating and exploiting the head concavity phenomenon in BKZ ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ Optimal linear multiparty conditional disclosure of secrets protocols ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Unnamed Item ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ On abelian and homomorphic secret sharing schemes