References

• 1. 1)
     • 7. Beimel, A.: ‘Secret-sharing schemes: A survey’. Coding and Cryptology, Third Int. Workshop IWCC 2011, Qingdao, People's Republic of China, 2011 (LNCS, 6639), pp. 11–46.
  2. 2)
     • 14. Stinson, D.R.: ‘An explication of secret sharing schemes’, Des. Codes Cryptography, 1992, 2, pp. 357–390.
  3. 3)
     • 13. Seymour, P.: ‘A forbidden minor characterization of matroid ports’, Q. J. Math., 1976, 27, (4), pp. 407–413.
  4. 4)
     • 1. Shamir, A.: ‘How to share a secret’, Commun. ACM, 1979, 22, pp. 612–613.
  5. 5)
     • 20. Nikov, V., Nikova, S., Preneel, B.: ‘Multi-party computation from any linear secret sharing scheme unconditionally secure against adaptive adversary: the zeroerror case’. Int. Conf. on Applied Cryptography and Network Security, Kunming, People's Republic of China, 2003, pp. 1–15.
  6. 6)
     • 17. Martínez.Moro, E., Mozo.Fernández, J., Munuera, C.: ‘Compounding secret sharing schemes’, Aust. J. Comb., 2004, 30, pp. 277–290.
  7. 7)
     • 19. Maurer, U.: ‘Secure multi-party computation made simple’, Discrete Appl. Math., 2006, 154, (2), pp. 370–381.
  8. 8)
     • 10. Hameed, A., Slinko, A.: ‘A characterisation of ideal weighted secret sharing schemes’, J Math. Cryptology, 2015, 9, (4), pp. 227–244.
  9. 9)
     • 5. Brickell, E.F.: ‘Some ideal secret sharing schemes’. Advances in cryptology – EUROCRYPT ‘89, Berlin, Heidelberg, 1990, pp. 468–475.
  10. 10)
      • 16. Martin, K.M.: ‘New secret sharing schemes from old’, J. Comb. Math. Comb. Comput., 1993, 14, pp. 65–77.
  11. 11)
      • 8. Beimel, A., Tassa, T., Weinreb, E.: ‘Characterizing ideal weighted threshold secret sharing’, SIAM J. Discrete Math., 2008, 22, (1), pp. 360–397.
  12. 12)
      • 2. Blakley, G.R.: ‘Safeguarding cryptographic keys’. Proc. of the national computer Conf., New York, NY, USA, 1979, vol. 48, p. 313.
  13. 13)
      • 11. Farràs, O., Martí.Farré, J., Padró, C.: ‘Ideal multipartite secret sharing schemes’, J. Cryptol., 2012, 25, pp. 434–463.
  14. 14)
      • 12. Taylor, A.D., Zwicker, W.S.: ‘Simple games’ (Oxford University Press, Oxford, UK, 1999).
  15. 15)
      • 9. Farràs, O., Padró, C.: ‘Ideal hierarchical secret sharing schemes’. Theory of Cryptography, Springer Berlin/Heidelberg, 2010, (LNCS, 5978), pp. 219–236.
  16. 16)
      • 15. Shapley, L.S.: ‘Simple games: an outline of the descriptive theory’, Behav. Sci., 1962, 7, (1), pp. 59–66.
  17. 17)
      • 6. Karchmer, M., Wigderson, A.: ‘On span programs’. Proc. of the Eighth Annual Structure in Complexity Theory Conf. IEEE, San Diego, CA, USA, 1993, pp. 102–111.
  18. 18)
      • 18. Márquez.Corbella, I., Martínez.Moro, E., Suárez.Canedo, E.: ‘On the composition of secret sharing schemes related to codes’, Discrete Math., Algorithms Appl., 2014, 6, (1), p. 1450013.
  19. 19)
      • 4. Tassa, T.: ‘Hierarchical threshold secret sharing’, J. Cryptol., 2007, 20, pp. 237–264.
  20. 20)
      • 3. Simmons, G.J.: ‘How to (really) share a secret’. Proc. of the 8th Annual Int. Cryptology Conf. on Advances in Cryptology, Santa Barbara, CA, USA, 1990, pp. 390–448.