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]
@inproceedings{BeimelLP08, title = {Matroids Can Be Far from Ideal Secret Sharing}, author = {Amos Beimel and Noam Livne and Carles PadrĂ³}, year = {2008}, doi = {10.1007/978-3-540-78524-8_12}, url = {http://dx.doi.org/10.1007/978-3-540-78524-8_12}, researchr = {https://researchr.org/publication/BeimelLP08}, cites = {0}, citedby = {0}, pages = {194-212}, booktitle = {Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008}, editor = {Ran Canetti}, volume = {4948}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-78523-1}, }