Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming

DOI10.1007/978-3-642-12200-2_31MaRDI QIDQ3557032zbMATH OpenOpenAlexFDO

Authors Carles Padró, Leonor Vázquez

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

zbMATH Keywords

secret sharingoptimization of secret sharing schemes for general access structures

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Combinatorial lower bounds for secret sharing schemes
• A linear construction of secret sharing schemes
• Lower bounds for robust secret sharing schemes
• The optimal linear secret sharing scheme for any given access structure
• The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures
• Error correcting and complexity aspects of linear secret sharing schemes
• scientific article; zbMATH DE number 1088900

Cited in

(7)

• Optimal information ratio of secret sharing schemes on Dutch windmill graphs
• Optimal complexity of secret sharing schemes with four minimal qualified subsets
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• On the optimization of bipartite secret sharing schemes
• Lower bounds for garbled circuits from Shannon-type information inequalities
• The complexity of the connected graph access structure on seven participants

This page was built for publication: Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming

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