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

Carles Padró Leonor Vázquez

Published in: LATIN (2010)

Keyphrases

linear programming
lower bound
secret sharing scheme
objective function
np hard
upper bound
linear program
optimal solution
secret sharing
computational complexity
key management
dynamic programming
image sequences