Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
From MaRDI portal
Publication:3557032
DOI10.1007/978-3-642-12200-2_31zbMath1283.94100OpenAlexW1690694664MaRDI QIDQ3557032
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/105967
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 ⋮ Optimal information ratio of secret sharing schemes on Dutch windmill graphs ⋮ The complexity of the connected graph access structure on seven participants ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ On the optimization of bipartite secret sharing schemes