{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:46:43Z","timestamp":1787759203205,"version":"build-2784847793"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T00:00:00Z","timestamp":1668902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T00:00:00Z","timestamp":1668902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10623-022-01154-9","type":"journal-article","created":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T16:02:41Z","timestamp":1668960161000},"page":"1335-1349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Ideal hierarchical secret sharing and lattice path matroids"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-9375","authenticated-orcid":false,"given":"Songbao","family":"Mo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,20]]},"reference":[{"issue":"1","key":"1154_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0097-3165(03)00121-3","volume":"104","author":"F Ardila","year":"2003","unstructured":"Ardila F.: The catalan matroid. J. Comb. Theory Ser. A 104(1), 49\u201362 (2003).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1154_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A Beimel","year":"2011","unstructured":"Beimel A.: Secret-sharing schemes: a survey. In: Chee Y.M., Guo Z., Ling S., Shao F., Tang Y., Wang H., Xing C. (eds.) Coding and Cryptology, vol. 6639, pp. 11\u201346. Lecture Notes in Computer Science. Springer, Berlin (2011)."},{"key":"1154_CR3","first-page":"313","volume":"48","author":"GR Blakley","year":"1979","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. AFIPS Conf. Proc. 48, 313\u2013317 (1979).","journal-title":"AFIPS Conf. Proc."},{"issue":"5","key":"1154_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.ejc.2005.01.008","volume":"27","author":"J Bonin","year":"2006","unstructured":"Bonin J., de Mier A.: Lattice path matroids: structural properties. Eur. J. Comb. 27(5), 701\u2013738 (2006).","journal-title":"Eur. J. Comb."},{"issue":"2","key":"1154_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1017\/S0963548306007942","volume":"16","author":"J Bonin","year":"2007","unstructured":"Bonin J., Gim\u00e9nez O.: Multi-path matroids. Comb. Probab. Comput. 16(2), 193\u2013217 (2007).","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"1154_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0097-3165(03)00122-5","volume":"104","author":"J Bonin","year":"2003","unstructured":"Bonin J., de Mier A., Noy M.: Lattice path matroids: enumerative aspects and Tutte polynomials. J. Comb. Theory Ser. A 104(1), 63\u201394 (2003).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1154_CR7","first-page":"105","volume":"9","author":"E Brickell","year":"1989","unstructured":"Brickell E.: Some ideal secret sharing schemes. J. Comb. Math. Comb. Comput. 9, 105\u2013113 (1989).","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1154_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E Brickell","year":"1991","unstructured":"Brickell E., Davenport D.: On the classification of ideal secret sharing schemes. J. Cryptol. 4, 123\u2013134 (1991).","journal-title":"J. Cryptol."},{"key":"1154_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.6028\/jres.069B.003","volume":"69B","author":"H Crapo","year":"1965","unstructured":"Crapo H.: Single-element extensions of matroids. J. Res. Natl. Bureau Stand. B 69B, 55\u201365 (1965).","journal-title":"J. Res. Natl. Bureau Stand. B"},{"issue":"5","key":"1154_CR10","doi-asserted-by":"publisher","first-page":"3273","DOI":"10.1109\/TIT.2011.2182034","volume":"58","author":"O Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s O., Padr\u00f3 C.: Ideal hierarchical secret sharing schemes. IEEE Trans. Inf. Theory 58(5), 3273\u20133286 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1154_CR11","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/s00145-011-9101-6","volume":"25","author":"O Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s O., Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: Ideal multipartite secret sharing schemes. J. Cryptol. 25, 434\u2013463 (2012).","journal-title":"J. Cryptol."},{"issue":"3","key":"1154_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.mathsocsci.2012.11.007","volume":"65","author":"T Gvozdeva","year":"2013","unstructured":"Gvozdeva T., Hameed A., Slinko A.: Weightedness and structural characterization of hierarchical simple games. Math. Soc. Sci. 65(3), 181\u2013189 (2013).","journal-title":"Math. Soc. Sci."},{"issue":"4","key":"1154_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1515\/jmc-2015-0002","volume":"9","author":"A Hameed","year":"2015","unstructured":"Hameed A., Slinko A.: A characterisation of ideal weighted secret sharing schemes. J. Math. Cryptol. 9(4), 227\u2013244 (2015).","journal-title":"J. Math. Cryptol."},{"key":"1154_CR14","first-page":"99","volume":"87","author":"M Ito","year":"1987","unstructured":"Ito M., Saito A., Nishizeki T.: Secret sharing scheme realizing any access structure. Proc. IEEE Glob. 87, 99\u2013102 (1987).","journal-title":"Proc. IEEE Glob."},{"key":"1154_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"ED Karnin","year":"1983","unstructured":"Karnin E.D., Greene J.W., Hellman M.E.: On secret sharing systems. IEEE Trans. Inf. Theory 29, 35\u201341 (1983).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1154_CR16","unstructured":"Klivans C.: Combinatorial properties of shifted complexes. Doctoral dissertation, Massachusetts Institute of Technology (2003)."},{"key":"1154_CR17","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/0112059","volume":"12","author":"A Lehman","year":"1964","unstructured":"Lehman A.: A solution of the Shannon switching game. J. Soc. Ind. Appl. Math. 12, 687\u2013725 (1964).","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"1154_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1515\/jmc.2010.004","volume":"4","author":"J Mart\u00ed-Farr\u00e9","year":"2010","unstructured":"Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: On secret sharing schemes, matroids and polymatroids. J. Math. Cryptol. 4, 95\u2013120 (2010).","journal-title":"J. Math. Cryptol."},{"issue":"1\u20133","key":"1154_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0012-365X(99)00004-7","volume":"203","author":"F Mat\u00fa\u0161","year":"1999","unstructured":"Mat\u00fa\u0161 F.: Matroid representations by partitions. Discret. Math. 203(1\u20133), 169\u2013194 (1999).","journal-title":"Discret. Math."},{"key":"1154_CR20","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid Theory","author":"J Oxley","year":"2011","unstructured":"Oxley J.: Matroid Theory, 2. Oxford University Press, New York (2011).","edition":"2."},{"key":"1154_CR21","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1017\/S1446788700024939","volume":"32","author":"J Oxley","year":"1982","unstructured":"Oxley J., Prendergast K., Row D.: Matroids whose ground sets are domains of functions. J. Austral. Math. Soc. Ser. A 32, 380\u2013387 (1982).","journal-title":"J. Austral. Math. Soc. Ser. A"},{"issue":"7","key":"1154_CR22","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1109\/18.887867","volume":"46","author":"C Padr\u00f3","year":"2000","unstructured":"Padr\u00f3 C., S\u00e1ez G.: Secret sharing schemes with bipartite access structure. IEEE Trans. Inf. Theory 46(7), 2596\u20132604 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1154_CR23","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1109\/TIT.2004.828157","volume":"50","author":"C Padr\u00f3","year":"2004","unstructured":"Padr\u00f3 C., S\u00e1ez G.: Correction to \u201cSecret sharing schemes with bipartite access structure\u2019\u2019. IEEE Trans. Inf. Theory 50(6), 1373 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1154_CR24","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1112\/jlms\/s2-2.2.284","volume":"2","author":"MJ Piff","year":"1970","unstructured":"Piff M.J., Welsh D.J.A.: On the vector representation of matroids. J. Lond. Math. Soc. 2, 284\u2013288 (1970).","journal-title":"J. Lond. Math. Soc."},{"issue":"1","key":"1154_CR25","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0095-8956(92)90007-K","volume":"56","author":"PD Seymour","year":"1992","unstructured":"Seymour P.D.: On secret-sharing matroids. J. Comb. Theory Ser. B 56(1), 69\u201373 (1992).","journal-title":"J. Comb. Theory Ser. B"},{"key":"1154_CR26","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979).","journal-title":"Commun. ACM"},{"key":"1154_CR27","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008244215660","volume":"14","author":"J Simonis","year":"1998","unstructured":"Simonis J., Ashikhmin A.: Almost affine codes. Des. Codes Cryptogr. 14, 179\u2013197 (1998).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1154_CR28","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"DR Stinson","year":"1992","unstructured":"Stinson D.R.: An explication of secret sharing schemes. Des. Codes Cryptogr. 2(4), 357\u2013390 (1992).","journal-title":"Des. Codes Cryptogr."},{"key":"1154_CR29","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T Tassa","year":"2007","unstructured":"Tassa T.: Hierarchical threshold secret sharing. J. Cryptol. 20, 237\u2013264 (2007).","journal-title":"J. Cryptol."},{"key":"1154_CR30","volume-title":"Simple Games: Desirability Relations, Trading, Pseudoweightings","author":"AD Taylor","year":"1999","unstructured":"Taylor A.D., Zwicker W.S.: Simple Games: Desirability Relations, Trading, Pseudoweightings. Princeton University Press, Princeton (1999)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01154-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01154-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01154-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T07:01:52Z","timestamp":1680678112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01154-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,20]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1154"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01154-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,20]]},"assertion":[{"value":"9 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}