Separating the Power of Monotone Span Programs over Different Fields
From MaRDI portal
Publication:5317192
DOI10.1137/S0097539704444038zbMath1079.68032MaRDI QIDQ5317192
Publication date: 16 September 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Combinatorics in computer science (68R05) Algebraic theory of languages and automata (68Q70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)
Related Items
Finding lower bounds on the complexity of secret sharing schemes by linear programming, On Linear Secret Sharing for Connectivity in Directed Graphs, Secret-Sharing Schemes: A Survey, Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, Extending Brickell-Davenport theorem to non-perfect secret sharing schemes, Optimal complexity of secret sharing schemes with four minimal qualified subsets, On secret sharing schemes, matroids and polymatroids, On abelian and homomorphic secret sharing schemes, On the optimization of bipartite secret sharing schemes, Unnamed Item, An impossibility result on graph secret sharing