Linear secret-sharing schemes for forbidden graph access structures

DOI10.1007/978-3-319-70503-3_13MaRDI QIDQ1690278zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Linear Secret-Sharing Schemes for Forbidden Graph Access Structures
• Secret sharing schemes for dense forbidden graphs
• Linear secret sharing schemes and rearrangements of access structures
• On Linear Secret Sharing for Connectivity in Directed Graphs
• Secret sharing schemes for graph-based prohibited structures
• Linear secret sharing schemes with finer access structure
• The optimal linear secret sharing scheme for any given access structure
• Optimal linear secret sharing schemes for graph access structures on six participants
• Access structure in graphs in high dimension and application to secret sharing
• A linear construction of secret sharing schemes

Cited in

(19)

• Secret sharing schemes for very dense graphs
• On Linear Secret Sharing for Connectivity in Directed Graphs
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• The share size of secret-sharing schemes for almost all access structures and graphs
• Improved polynomial secret-sharing schemes
• scientific article; zbMATH DE number 7559047 (Why is no real title available?)
• On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
• Secret sharing schemes for graph-based prohibited structures
• Secret-sharing schemes for very dense graphs
• Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
• Measuring, simulating and exploiting the head concavity phenomenon in BKZ
• Secret sharing schemes for dense forbidden graphs
• Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
• Placing conditional disclosure of secrets in the communication complexity universe
• On abelian and homomorphic secret sharing schemes
• Linear secret sharing schemes and rearrangements of access structures
• Optimal linear secret sharing schemes for graph access structures on six participants
• Optimal linear multiparty conditional disclosure of secrets protocols
• Local bounds for the optimal information ratio of secret sharing schemes

This page was built for publication: Linear secret-sharing schemes for forbidden graph access structures

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