Publisher
Springer International Publishing
Reference21 articles.
1. Beimel, A., Livne, N., Padró, C.: Matroids can be far from ideal secret sharing. In: Canetti, R. (ed.) Theory of Cryptography, pp. 194–212. Springer, Berlin (2008)
2. Brickell, E.F., Davenport, D.M.: On the classification of ideal secret sharing schemes. J. Cryptology 4, 123–134 (1991)
3. Brylawski, T.: Appendix of matroid cryptomorphisms. In: [21], pp. 298–312
4. Brylawski, T.: Constructions. In: [21], Chapter 7, pp. 127–223
5. Dougherty, R., Freiling, C., Zeger, K.: Linear rank inequalities on five or more variables. http://arxiv.org/abs/0910.0284