Finding lower bounds on the complexity of secret sharing schemes by linear programming

DOI10.1016/j.dam.2012.10.020zbMath1262.68049MaRDI QIDQ1949113

Carles Padró, Leonor Vázquez, An Yang

Publication date: 25 April 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.020

zbMATH Keywords

linear programming; secret sharing; polymatroid; non-Shannon information inequalities

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C05: Linear programming

94A62: Authentication, digital signatures and secret sharing

Related Items

How to share a secret