{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T16:41:45Z","timestamp":1776271305653,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T00:00:00Z","timestamp":1561161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T00:00:00Z","timestamp":1561161600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61772147"],"award-info":[{"award-number":["61772147"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2015A030308016"],"award-info":[{"award-number":["2015A030308016"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Ordinary University Innovation Team Construction of Guangdong Province","award":["2015KCXTD014"],"award-info":[{"award-number":["2015KCXTD014"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702124"],"award-info":[{"award-number":["61702124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10623-019-00657-2","type":"journal-article","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T10:02:26Z","timestamp":1561197746000},"page":"2913-2940","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient explicit constructions of compartmented secret sharing schemes"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7386-8706","authenticated-orcid":false,"given":"Qi","family":"Chen","sequence":"first","affiliation":[]},{"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Zhiqiang","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,22]]},"reference":[{"issue":"3","key":"657_CR1","doi-asserted-by":"publisher","first-page":"1482","DOI":"10.1137\/120886960","volume":"27","author":"S Ball","year":"2013","unstructured":"Ball S., Padr\u00f3 C., Weiner Z., Xing C.: On the representability of the biuniform matroid. SIAM J. Discret. Math. 27(3), 1482\u20131491 (2013).","journal-title":"SIAM J. Discret. Math."},{"key":"657_CR2","first-page":"11","volume-title":"Lecture Notes in Computer Science","author":"Amos 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.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011)."},{"issue":"3","key":"657_CR3","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/18.335890","volume":"40","author":"A Beimel","year":"1994","unstructured":"Beimel A., Chor B.: Universally ideal secret sharing schemes. IEEE Trans. Inf. Theory 40(3), 786\u2013794 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"657_CR4","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1137\/S0895480104445654","volume":"22","author":"A Beimel","year":"2008","unstructured":"Beimel A., Tassa T., Weinreb E.: Characterizing ideal weighted threshold secret sharing. SIAM J. Discret. Math. 22(1), 360\u2013397 (2008).","journal-title":"SIAM J. Discret. Math."},{"key":"657_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or M., Goldwasser S., Wigderson A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 1\u201310 (1988).","DOI":"10.1145\/62212.62213"},{"issue":"2","key":"657_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01388411","volume":"3","author":"A Beutelspacher","year":"1993","unstructured":"Beutelspacher A., Wettl F.: On 2-level secret sharing. Des. Codes Cryptogr. 3(2), 127\u2013134 (1993).","journal-title":"Des. Codes Cryptogr."},{"key":"657_CR7","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference\u201979, AFIPS Proceedings, vol. 48, pp. 313\u2013317 (1979)."},{"key":"657_CR8","first-page":"105","volume":"9","author":"EF Brickell","year":"1989","unstructured":"Brickell E.F.: Some ideal secret sharing schemes. J. Comb. Math. Comb. Comp. 9, 105\u2013113 (1989).","journal-title":"J. Comb. Math. Comb. Comp."},{"key":"657_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"EF Brickell","year":"1991","unstructured":"Brickell E.F., Davenport D.M.: On the classification of ideal secret sharing schemes. J. Cryptol. 4, 123\u2013134 (1991).","journal-title":"J. Cryptol."},{"key":"657_CR10","doi-asserted-by":"crossref","unstructured":"Chaum D., Cr\u00e9peau C., Damg\u00e5rd I.: Multiparty unconditionally secure protocols. In: Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 11\u201319 (1988).","DOI":"10.1145\/62212.62214"},{"issue":"2","key":"657_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02620136","volume":"6","author":"B Chor","year":"1993","unstructured":"Chor B., Kushilevitz E.: Secret sharing over infinite domains. J. Cryptol. 6(2), 87\u201396 (1993).","journal-title":"J. Cryptol."},{"key":"657_CR12","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"Ronald Cramer","year":"2000","unstructured":"Cramer R., Damg\u00e5rd I., Maurer U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000)."},{"key":"657_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/11535218_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"Ronald Cramer","year":"2005","unstructured":"Cramer R., Daza V., Gracia I., 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. In: Shoup V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 327\u2013343. Springer, Heidelberg (2005)."},{"key":"657_CR14","unstructured":"Desmedt Y., Frankel Y.: Threshold cryptosystems. In: Brassard G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, Heidelberg (1990)."},{"issue":"5","key":"657_CR15","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"},{"issue":"3","key":"657_CR16","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(3), 434\u2013463 (2012).","journal-title":"J. Cryptol."},{"issue":"3","key":"657_CR17","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TIT.2014.2300113","volume":"60","author":"O Farr\u00e0s","year":"2014","unstructured":"Farr\u00e0s O., Padr\u00f3 C., Xing C., Yang A.: Natural generalizations of threshold secret sharing. IEEE Trans. Inf. Theory 60(3), 1652\u20131664 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"657_CR18","unstructured":"Fehr S.: Efficient construction of the dual span program. Manuscript, May (1999)."},{"key":"657_CR19","first-page":"1","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 21, 1\u201312 (1985).","journal-title":"Probl. Inf. Transm."},{"issue":"22","key":"657_CR20","doi-asserted-by":"publisher","first-page":"3236","DOI":"10.1016\/j.disc.2009.11.040","volume":"310","author":"M Giulietti","year":"2010","unstructured":"Giulietti M., Vincenti R.: Three-level secret sharing schemes from the twisted cubic. Discret. Math. 310(22), 3236\u20133240 (2010).","journal-title":"Discret. Math."},{"key":"657_CR21","doi-asserted-by":"crossref","unstructured":"Goyal V., Pandey O., Sahai A., Waters B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 89\u201398 (2006).","DOI":"10.1145\/1180405.1180418"},{"issue":"4","key":"657_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1049\/ip-ifs:20060081","volume":"153","author":"J Herranz","year":"2006","unstructured":"Herranz J., S\u00e1ez G.: New results on multipartite access structures. IEE Proc. Inf. Secur. 153(4), 153\u2013162 (2006).","journal-title":"IEE Proc. Inf. Secur."},{"issue":"3","key":"657_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1023\/A:1021852421716","volume":"16","author":"J Herzog","year":"2002","unstructured":"Herzog J., Hibi T.: Discrete polymatroids. J. Algebr. Comb. 16(3), 239\u2013268 (2002).","journal-title":"J. Algebr. Comb."},{"key":"657_CR24","unstructured":"Ito M., Saito A., Nishizeki T.: Secret sharing schemes realizing general access structure. In: Proceedings of the IEEE Global Telecommunication Conference, Globecom 1987, pp. 99\u2013102 (1987)."},{"key":"657_CR25","unstructured":"Kothari S.C.: Generalized linear threshold scheme. In: Blakley G.R., Chaum D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 231\u2013241. Springer, Heidelberg (1985)."},{"key":"657_CR26","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997)."},{"key":"657_CR27","unstructured":"Massey J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian Workshop on Information Theory, pp. 276\u2013279 (1993)."},{"key":"657_CR28","first-page":"33","volume":"4","author":"JL Massey","year":"1995","unstructured":"Massey J.L.: Some applications of coding theory in cryptography. Codes Ciphers Cryptogr Coding 4, 33\u201347 (1995).","journal-title":"Codes Ciphers Cryptogr Coding"},{"key":"657_CR29","doi-asserted-by":"crossref","unstructured":"Naor M., Wool A.: Access control and signatures via quorum secret sharing. In: 3rd ACM Conference on Computer and Communications Security, pp. 157\u2013167 (1996).","DOI":"10.1145\/238168.238209"},{"key":"657_CR30","volume-title":"Matroid Theory","author":"JG Oxley","year":"1992","unstructured":"Oxley J.G.: Matroid Theory. Oxford University Press, New York (1992)."},{"issue":"7","key":"657_CR31","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"},{"key":"657_CR32","volume-title":"Combinatorial Optimization. Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A.: Combinatorial Optimization. Polyhedra and Efficiency. Springer, Berlin (2003)."},{"key":"657_CR33","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":"657_CR34","unstructured":"Simmons G.J.: How to (really) share a secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390\u2013448. Springer, Heidelberg (1990)."},{"key":"657_CR35","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":"657_CR36","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00145-008-9027-9","volume":"22","author":"T Tassa","year":"2009","unstructured":"Tassa T., Dyn N.: Multipartite secret sharing by bivariate interpolation. J. Cryptol. 22, 227\u2013258 (2009).","journal-title":"J. Cryptol."},{"key":"657_CR37","volume-title":"Matroid Theory","author":"DJA Welsh","year":"1976","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-019-00657-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00657-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00657-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T23:22:38Z","timestamp":1592695358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00657-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,22]]},"references-count":37,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["657"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00657-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,22]]},"assertion":[{"value":"27 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}