Cryptology ePrint Archive: Report 2012/464
Available versions in chronological order
20120818:034243 (posted 18-Aug-2012 03:42:43 UTC)
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
Carles Padro and Leonor Vazquez and An Yang
Publication Info: A previous version of this paper appeared in the Proceedings of LATIN 2010.
[
Cryptology ePrint archive
]