Matroids Can Be Far from Ideal Secret Sharing - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Amos Beimel, Noam Livne, Carles Padró. Matroids Can Be Far from Ideal Secret Sharing. In Ran Canetti, editor, Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Volume 4948 of Lecture Notes in Computer Science, pages 194-212, Springer, 2008. [doi]

The following publications are possibly variants of this publication:

On Matroids and Non-ideal Secret SharingAmos Beimel, Noam Livne. tcc 2006: 482-501 [doi]

On Matroids and Nonideal Secret SharingAmos Beimel, Noam Livne. TIT, 54(6):2626-2643, 2008. [doi]

On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing SchemesRonald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró. TIT, 54(6):2644-2657, 2008. [doi]

runs on WebDSL