On Linear Secret Sharing for Connectivity in Directed Graphs

DOI10.1007/978-3-540-85855-3_12MaRDI QIDQ3540044zbMATH OpenOpenAlexFDO

Authors Amos Beimel, Anat Paskin

Publication date 20 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85855-3_12

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 very dense graphs
• Secret sharing schemes for very dense graphs
• Secret-Sharing Schemes: A Survey
• Linear multi-secret sharing schemes

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 176567 (Why is no real title available?)
• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• scientific article; zbMATH DE number 1088899 (Why is no real title available?)
• scientific article; zbMATH DE number 1101416 (Why is no real title available?)
• scientific article; zbMATH DE number 812038 (Why is no real title available?)
• A characterization of span program size and improved lower bounds for monotone span programs
• A linear construction of secret sharing schemes
• A note on monotone complexity and the rank of matrices
• Decomposition constructions for secret-sharing schemes
• General secure multi-party computation from any linear secret-sharing scheme
• How to share a secret
• Lower bounds for monotone span programs
• Monotone Circuits for Connectivity Require Super-Logarithmic Depth
• Multiple assignment scheme for sharing secret
• New bounds on the information rate of secret sharing schemes
• On arithmetic branching programs
• On secret sharing systems
• On the information rate of perfect secret sharing schemes
• On the number of zero-patterns of a sequence of polynomials
• On the size of shares for secret sharing schemes
• Reachability is harder for directed than for undirected finite graphs
• Secret sharing schemes with bipartite access structure
• Separating the Power of Monotone Span Programs over Different Fields
• Superpolynomial lower bounds for monotone span programs
• The gap between monotone and non-monotone circuit complexity is exponential
• Tight bounds on the information rate of secret sharing schemes
• Undirected ST-connectivity in log-space
• Universally ideal secret-sharing schemes

Cited in

(4)

• scientific article; zbMATH DE number 1788241 (Why is no real title available?)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• Linear secret-sharing schemes for forbidden graph access structures
• Secret-Sharing Schemes: A Survey

This page was built for publication: On Linear Secret Sharing for Connectivity in Directed Graphs

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