1. Beimel A., Weinreb E.: Separating the power of monotone span programs over different fields. SIAM J. Comput. 34, 1196–1215 (2005)
2. Beimel A., Livne N., Padró C.: Matroids can be far from ideal secret sharing. Fifth Theory of Cryptography Conference, TCC 2008. Lecture Notes in Computer Science, vol. 4948, pp. 194–212 (2008).
3. Beimel A., Tassa T., Weinreb E.: Characterizing ideal weighted threshold secret sharing. SIAM J. Discrete Math. 22, 360–397 (2008)
4. Benaloh J., Leichter J.: Generalized secret sharing and monotone functions. Advances in Cryptology, CRYPTO’88. Lecture Notes in Computer Science, vol. 403, pp. 27–35 (1990).
5. Blakley G.R.: Safeguarding cryptographic keys. AFIPS Conference Proceedings, vol. 48, pp. 313–317 (1979).