Advertisement

Designs, Codes and Cryptography

, Volume 74, Issue 2, pp 495–510 | Cite as

Extending Brickell–Davenport theorem to non-perfect secret sharing schemes

  • Oriol Farràs
  • Carles Padró
Article

Abstract

One important result in secret sharing is the Brickell–Davenport theorem: every ideal perfect secret sharing scheme defines a matroid that is uniquely determined by the access structure. We present a generalization of the Brickell–Davenport theorem to the general case, in which non-perfect schemes are also considered. After analyzing that result under a new point of view and identifying its combinatorial nature, we present a characterization of the (not necessarily perfect) secret sharing schemes that are associated with matroids. Some optimality properties of such schemes are discussed.

Keywords

Secret sharing Non-perfect secret sharing scheme Matroid Polymatroid 

Mathematics Subject Classification

94A62 05B35 

Notes

Acknowledgments

We thank the anonymous reviewers. Their valuable suggestions greatly improved the presentation of the paper. The first author’s work was partially supported by the EU through the project FP7-ICT-317731, by the Spanish Government through the projects Consolider Ingenio 2010 CSD2007-00004 and TIN2011/27076-C03-01, and by the Catalan Government through the Grant 2009 SGR 1135. The second author’s work was supported by the Singapore National Research Foundation under Research Grant NRF-CRP2-2007-03.

References

  1. 1.
    Beimel A.: Secret-sharing schemes: a survey. In: Coding and Cryptology. Third International Workshop, IWCC. Lecture Notes in Computer Science, vol. 6639, pp. 11–46 (2011).Google Scholar
  2. 2.
    Beimel A., Livne N., Padró C.: Matroids can be far from ideal secret sharing. In: Fifth theory of cryptography conference, TCC 2008. Lecture Notes in Computer Science, vol. 4948, pp. 194–212 (2008).Google Scholar
  3. 3.
    Beimel A., Orlov I.: Secret sharing and non-Shannon information inequalities. IEEE Trans. Inf. Theory 57, 5634–5649 (2011).Google Scholar
  4. 4.
    Beimel A., Weinreb E.: Separating the power of monotone span programs over different fields. SIAM J. Comput. 34, 1196–1215 (2005).Google Scholar
  5. 5.
    Blakley G.R., Meadows C.: Security of ramp schemes. In: Advances in Cryptology, Crypto 84. Lecture Notes in Computer Science, vol. 196, pp. 242–268 (1985).Google Scholar
  6. 6.
    Brickell E.F.: Some ideal secret sharing schemes. J. Comb. Math. Comb. Comput. 9, 105–113 (1989).Google Scholar
  7. 7.
    Brickell E.F., Davenport D.M.: On the classification of ideal secret sharing schemes. J. Cryptol. 4, 123–134 (1991).Google Scholar
  8. 8.
    Cover T.M., Thomas J.A.: Elements of information theory. Wiley, New York (1991).Google Scholar
  9. 9.
    Cramer R., Daza V., Gracia I., Jiménez Urroz J., Leander G., Martí-Farré J., Padró C.: On codes, matroids and secure multi-party computation from linear secret sharing schemes. IEEE Trans. Inf. Theory 54, 2644–2657 (2008).Google Scholar
  10. 10.
    Csirmaz L.: The size of a share must be large. J. Cryptol. 10, 223–231 (1997).Google Scholar
  11. 11.
    Dougherty R., Freiling C., Zeger K.: Linear rank inequalities on five or more variables. SIAM J. Discret. Math. (2009). arXiv:0910.0284v3.Google Scholar
  12. 12.
    Farràs O., Martí-Farré J., Padró C.: Ideal multipartite secret sharing schemes. J. Cryptol. 25, 434–463 (2012).Google Scholar
  13. 13.
    Farràs O., Padró C.: Ideal hierarchical secret sharing schemes. IEEE Trans. Inf. Theory 58, 3273–3286 (2012).Google Scholar
  14. 14.
    Farràs O., Padró C., Xing C., Yang A.: Natural generalizations of threshold secret sharing. In: Advances in Cryptology, Asiacrypt 2011. Lecture Notes in Computer Science, vol. 7073, pp. 610–627 (2011).Google Scholar
  15. 15.
    Fujishige S.: Polymatroidal dependence structure of a set of random variables. Inf. Control 39, 55–72 (1978).Google Scholar
  16. 16.
    Karnin E.D., Greene J.W., Hellman M.E.: On secret sharing systems. IEEE Trans. Inf. Theory 29, 35–41 (1983).Google Scholar
  17. 17.
    Kurosawa K., Okada K., Sakano K., Ogata W., Tsujii S.: Nonperfect secret sharing schemes and matroids. In: Advances in Cryptology, EUROCRYPT 1993. Lecture Notes in Computer Science, vol. 765, pp. 126–141 (1993).Google Scholar
  18. 18.
    Lehman A.: A solution of the Shannon switching game. J. Soc. Ind. Appl. Math. 12, 687–725 (1964).Google Scholar
  19. 19.
    Lehman A.: Matroids and ports. Notices Am. Math. Soc. 12, 356–360 (1976).Google Scholar
  20. 20.
    Martí-Farré J., Padró C.: On secret sharing schemes, matroids and polymatroids. J. Math. Cryptol. 4, 95–120 (2010).Google Scholar
  21. 21.
    Martin K.M.: Discrete structures in the theory of secret sharing. Ph.D. Thesis, University of London (1991).Google Scholar
  22. 22.
    Massey J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th joint Swedish–Russian workshop on information theory, Molle, Sweden, August 1993, pp. 269–279 (1993).Google Scholar
  23. 23.
    Matúš F.: Matroid representations by partitions. Discret. Math. 203, 169–194 (1999).Google Scholar
  24. 24.
    Matúš F.: Two constructions on limits of entropy functions. IEEE Trans. Inf. Theory 53, 320–330 (2007).Google Scholar
  25. 25.
    Ogata W., Kurosawa K., Tsujii S.: Nonperfect secret sharing schemes. In: Advances in Cryptology, Auscrypt 92. Lecture Notes in Computer Science, vol. 718, pp. 56–66 (1993).Google Scholar
  26. 26.
    Oxley J.G.: Matroid theory. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York (1992).Google Scholar
  27. 27.
    Padró C., Vázquez L., Yang A.: Finding lower bounds on the complexity of secret sharing schemes by linear programming. Discret. Appl. Math. 161, 1072–1084 (2013).Google Scholar
  28. 28.
    Paillier P.: On ideal non-perfect secret sharing schemes. In: Security protocols, 5th international workshop. Lecture Notes in Computer Science, vol. 1361, pp. 207–216 (1998).Google Scholar
  29. 29.
    Schrijver A.: Combinatorial optimization. Polyhedra and efficiency. Springer, Berlin (2003).Google Scholar
  30. 30.
    Seymour P.D.: A forbidden minor characterization of matroid ports. Q. J. Math. Oxf. Ser. 27, 407–413 (1976).Google Scholar
  31. 31.
    Seymour P.D.: On secret-sharing matroids. J. Comb. Theory B 56, 69–73 (1992).Google Scholar
  32. 32.
    Shamir A.: How to share a secret. Commun. ACM 22, 612–613 (1979).Google Scholar
  33. 33.
    Simonis J., Ashikhmin A.: Almost affine codes. Des. Codes Cryptogr. 14, 179–197 (1998).Google Scholar
  34. 34.
    Stinson D.R.: An explication of secret sharing schemes. Des. Codes Cryptogr. 2, 357–390 (1992).Google Scholar
  35. 35.
    Welsh D.J.A.: Matroid theory. Academic Press, London (1976).Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Universitat Rovira i VirgiliTarragonaSpain
  2. 2.Nanyang Technological UniversitySingaporeSingapore

Personalised recommendations