{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,24]],"date-time":"2022-12-24T16:06:42Z","timestamp":1671898002884},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T00:00:00Z","timestamp":1378252800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10623-013-9858-8","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T06:53:47Z","timestamp":1378191227000},"page":"495-510","source":"Crossref","is-referenced-by-count":5,"title":["Extending Brickell\u2013Davenport theorem to non-perfect secret sharing schemes"],"prefix":"10.1007","volume":"74","author":[{"given":"Oriol","family":"Farr\u00e0s","sequence":"first","affiliation":[]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,4]]},"reference":[{"key":"9858_CR1","doi-asserted-by":"crossref","unstructured":"Beimel A.: Secret-sharing schemes: a survey. In: Coding and Cryptology. Third International Workshop, IWCC. Lecture Notes in Computer Science, vol. 6639, pp. 11\u201346 (2011).","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"9858_CR2","unstructured":"Beimel A., Livne N., Padr\u00f3 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\u2013212 (2008)."},{"key":"9858_CR3","unstructured":"Beimel A., Orlov I.: Secret sharing and non-Shannon information inequalities. IEEE Trans. Inf. Theory 57, 5634\u20135649 (2011)."},{"key":"9858_CR4","unstructured":"Beimel A., Weinreb E.: Separating the power of monotone span programs over different fields. SIAM J. Comput. 34, 1196\u20131215 (2005)."},{"key":"9858_CR5","doi-asserted-by":"crossref","unstructured":"Blakley G.R., Meadows C.: Security of ramp schemes. In: Advances in Cryptology, Crypto 84. Lecture Notes in Computer Science, vol. 196, pp. 242\u2013268 (1985).","DOI":"10.1007\/3-540-39568-7_20"},{"key":"9858_CR6","unstructured":"Brickell E.F.: Some ideal secret sharing schemes. J. Comb. Math. Comb. Comput. 9, 105\u2013113 (1989)."},{"key":"9858_CR7","doi-asserted-by":"crossref","unstructured":"Brickell E.F., Davenport D.M.: On the classification of ideal secret sharing schemes. J. Cryptol. 4, 123\u2013134 (1991).","DOI":"10.1007\/BF00196772"},{"key":"9858_CR8","doi-asserted-by":"crossref","unstructured":"Cover T.M., Thomas J.A.: Elements of information theory. Wiley, New York (1991).","DOI":"10.1002\/0471200611"},{"key":"9858_CR9","unstructured":"Cramer R., Daza V., Gracia I., Jim\u00e9nez Urroz J., Leander G., Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: On codes, matroids and secure multi-party computation from linear secret sharing schemes. IEEE Trans. Inf. Theory 54, 2644\u20132657 (2008)."},{"key":"9858_CR10","doi-asserted-by":"crossref","unstructured":"Csirmaz L.: The size of a share must be large. J. Cryptol. 10, 223\u2013231 (1997).","DOI":"10.1007\/s001459900029"},{"key":"9858_CR11","unstructured":"Dougherty R., Freiling C., Zeger K.: Linear rank inequalities on five or more variables. SIAM J. Discret. Math. (2009). arXiv:0910.0284v3."},{"key":"9858_CR12","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s O., Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: Ideal multipartite secret sharing schemes. J. Cryptol. 25, 434\u2013463 (2012).","DOI":"10.1007\/s00145-011-9101-6"},{"key":"9858_CR13","unstructured":"Farr\u00e0s O., Padr\u00f3 C.: Ideal hierarchical secret sharing schemes. IEEE Trans. Inf. Theory 58, 3273\u20133286 (2012)."},{"key":"9858_CR14","unstructured":"Farr\u00e0s O., Padr\u00f3 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\u2013627 (2011)."},{"key":"9858_CR15","doi-asserted-by":"crossref","unstructured":"Fujishige S.: Polymatroidal dependence structure of a set of random variables. Inf. Control 39, 55\u201372 (1978).","DOI":"10.1016\/S0019-9958(78)91063-X"},{"key":"9858_CR16","unstructured":"Karnin E.D., Greene J.W., Hellman M.E.: On secret sharing systems. IEEE Trans. Inf. Theory 29, 35\u201341 (1983)."},{"key":"9858_CR17","unstructured":"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\u2013141 (1993)."},{"key":"9858_CR18","doi-asserted-by":"crossref","unstructured":"Lehman A.: A solution of the Shannon switching game. J. Soc. Ind. Appl. Math. 12, 687\u2013725 (1964).","DOI":"10.1137\/0112059"},{"key":"9858_CR19","unstructured":"Lehman A.: Matroids and ports. Notices Am. Math. Soc. 12, 356\u2013360 (1976)."},{"key":"9858_CR20","unstructured":"Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: On secret sharing schemes, matroids and polymatroids. J. Math. Cryptol. 4, 95\u2013120 (2010)."},{"key":"9858_CR21","unstructured":"Martin K.M.: Discrete structures in the theory of secret sharing. Ph.D. Thesis, University of London (1991)."},{"key":"9858_CR22","unstructured":"Massey J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th joint Swedish\u2013Russian workshop on information theory, Molle, Sweden, August 1993, pp. 269\u2013279 (1993)."},{"key":"9858_CR23","doi-asserted-by":"crossref","unstructured":"Mat\u00fa\u0161 F.: Matroid representations by partitions. Discret. Math. 203, 169\u2013194 (1999).","DOI":"10.1016\/S0012-365X(99)00004-7"},{"key":"9858_CR24","unstructured":"Mat\u00fa\u0161 F.: Two constructions on limits of entropy functions. IEEE Trans. Inf. Theory 53, 320\u2013330 (2007)."},{"key":"9858_CR25","unstructured":"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\u201366 (1993)."},{"key":"9858_CR26","unstructured":"Oxley J.G.: Matroid theory. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York (1992)."},{"key":"9858_CR27","unstructured":"Padr\u00f3 C., V\u00e1zquez L., Yang A.: Finding lower bounds on the complexity of secret sharing schemes by linear programming. Discret. Appl. Math. 161, 1072\u20131084 (2013)."},{"key":"9858_CR28","doi-asserted-by":"crossref","unstructured":"Paillier P.: On ideal non-perfect secret sharing schemes. In: Security protocols, 5th international workshop. Lecture Notes in Computer Science, vol. 1361, pp. 207\u2013216 (1998).","DOI":"10.1007\/BFb0028171"},{"key":"9858_CR29","unstructured":"Schrijver A.: Combinatorial optimization. Polyhedra and efficiency. Springer, Berlin (2003)."},{"key":"9858_CR30","unstructured":"Seymour P.D.: A forbidden minor characterization of matroid ports. Q. J. Math. Oxf. Ser. 27, 407\u2013413 (1976)."},{"key":"9858_CR31","unstructured":"Seymour P.D.: On secret-sharing matroids. J. Comb. Theory B 56, 69\u201373 (1992)."},{"key":"9858_CR32","doi-asserted-by":"crossref","unstructured":"Shamir A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979).","DOI":"10.1145\/359168.359176"},{"key":"9858_CR33","doi-asserted-by":"crossref","unstructured":"Simonis J., Ashikhmin A.: Almost affine codes. Des. Codes Cryptogr. 14, 179\u2013197 (1998).","DOI":"10.1023\/A:1008244215660"},{"key":"9858_CR34","doi-asserted-by":"crossref","unstructured":"Stinson D.R.: An explication of secret sharing schemes. Des. Codes Cryptogr. 2, 357\u2013390 (1992).","DOI":"10.1007\/BF00125203"},{"key":"9858_CR35","unstructured":"Welsh D.J.A.: Matroid theory. Academic Press, London (1976)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9858-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9858-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9858-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T00:53:07Z","timestamp":1563843187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9858-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,4]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9858"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9858-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,4]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS10623-013-9858-8', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid884' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:884', '*');; return false;" style='text-decoration: none; '>Idea </a> <a style='color: white;' href='#diffid884'><sup>6</sup></a></div><div><a href='#diffid119' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:119', '*');; return false;" style='text-decoration: none; '>idea </a> <a style='color: white;' href='#diffid119'><sup>6</sup></a></div><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>2</sup></a></div><div><a href='#diffid878' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:878', '*');; return false;" style='text-decoration: none; '>Note </a> <a style='color: white;' href='#diffid878'><sup>7</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>