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

Carles Padró, Leonor Vázquez, an Yang. Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. IACR Cryptology ePrint Archive, 2012:464, 2012. [doi]

Abstract

Abstract is missing.