Finding lower bounds on the complexity of secret sharing schemes by linear programming - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Carles Padró, Leonor Vázquez, an Yang. Finding lower bounds on the complexity of secret sharing schemes by linear programming. Discrete Applied Mathematics, 161(7-8):1072-1084, 2013. [doi]

The following publications are possibly variants of this publication:

Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear ProgrammingCarles Padró, Leonor Vázquez. latin 2010: 344-355 [doi]

Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear ProgrammingCarles Padró, Leonor Vázquez, an Yang. iacr, 2012:464, 2012. [doi]

Lower Bounds on the Information Ratio of Linear Secret Sharing SchemesCarles Padró. iacr, 2013:47, 2013. [doi]

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret SharingOriol Farràs, Tarik Kaced, Sebastià Martín Molleví, Carles Padró. eurocrypt 2018: 597-621 [doi]

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret SharingOriol Farràs, Tarik Kaced, Sebastià Martín Molleví, Carles Padró. TIT, 66(11):7088-7100, 2020. [doi]

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret SharingOriol Farràs, Tarik Kaced, Sebastià Martín Molleví, Carles Padró. iacr, 2017:919, 2017. [doi]

runs on WebDSL