On Linear Secret Sharing for Connectivity in Directed Graphs
From MaRDI portal
Publication:3540044
DOI10.1007/978-3-540-85855-3_12zbMath1180.94068OpenAlexW1599494302MaRDI QIDQ3540044
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
Related Items (2)
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Secret-Sharing Schemes: A Survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for monotone span programs
- A note on monotone complexity and the rank of matrices
- Multiple assignment scheme for sharing secret
- On the size of shares for secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- A linear construction of secret sharing schemes
- A characterization of span program size and improved lower bounds for monotone span programs
- The gap between monotone and non-monotone circuit complexity is exponential
- On the information rate of perfect secret sharing schemes
- On arithmetic branching programs
- Superpolynomial lower bounds for monotone span programs
- Secret sharing schemes with bipartite access structure
- On the number of zero-patterns of a sequence of polynomials
- How to share a secret
- Monotone Circuits for Connectivity Require Super-Logarithmic Depth
- Reachability is harder for directed than for undirected finite graphs
- Undirected ST-connectivity in log-space
- Decomposition constructions for secret-sharing schemes
- On secret sharing systems
- Universally ideal secret-sharing schemes
- New bounds on the information rate of secret sharing schemes
- Separating the Power of Monotone Span Programs over Different Fields
This page was built for publication: On Linear Secret Sharing for Connectivity in Directed Graphs
