{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:17:48Z","timestamp":1649143068240},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,2,7]],"date-time":"2015-02-07T00:00:00Z","timestamp":1423267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s11432-015-5286-x","type":"journal-article","created":{"date-parts":[[2015,2,9]],"date-time":"2015-02-09T08:46:56Z","timestamp":1423471616000},"page":"1-13","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Further ideal multipartite access structures from integer polymatroids"],"prefix":"10.1007","volume":"58","author":[{"given":"YuJue","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"QianHong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duncan S.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JianWei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,7]]},"reference":[{"key":"5286_CR1","first-page":"313","volume-title":"Proceedings of the 1979 AFIPS National Computer Conference","author":"G. R. Blakley","year":"1979","unstructured":"Blakley G R. Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, Monval, 1979. 313\u2013317"},{"key":"5286_CR2","doi-asserted-by":"crossref","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, 1979, 22: 612\u2013613","journal-title":"Commun ACM"},{"key":"5286_CR3","first-page":"307","volume-title":"Proceedings of the Cryptographer\u2019s Track at the RSA Conference","author":"Y. J. Wang","year":"2014","unstructured":"Wang Y J, Wong D S, Wu Q H, et al. Practical distributed signatures in the standard model. In: Proceedings of the Cryptographer\u2019s Track at the RSA Conference, San Francisco, 2014. 307\u2013326"},{"key":"5286_CR4","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.ins.2014.01.035","volume":"275","author":"H. Deng","year":"2014","unstructured":"Deng H, Wu Q H, Qin B, et al. Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts. Inform Sci, 2014, 275: 370\u2013384","journal-title":"Inform Sci"},{"key":"5286_CR5","first-page":"362","volume-title":"Proceedings of the 19th European Symposium on Research in Computer Security, Part I","author":"H. Deng","year":"2014","unstructured":"Deng H, Wu Q H, Qin B, et al. Who is touching my cloud. In: Proceedings of the 19th European Symposium on Research in Computer Security, Part I, Wroclaw, 2014. 362\u2013379"},{"key":"5286_CR6","first-page":"91","volume-title":"Proceedings of the 19th European Symposium on Research in Computer Security, Part II","author":"W. R. Liu","year":"2014","unstructured":"Liu W R, Liu J W, Wu Q H, et al. Practical direct chosen ciphertext secure key-policy attribute-based encryption with public ciphertext test. In: Proceedings of the 19th European Symposium on Research in Computer Security, Part II, Wroclaw, 2014. 91\u2013108"},{"key":"5286_CR7","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1007\/s11432-011-4480-8","volume":"55","author":"C. M. Tang","year":"2012","unstructured":"Tang C M, Gao S H. Leakproof secret sharing protocols with applications to group identification scheme. Sci China Inf Sci, 2012, 55: 1172\u20131185","journal-title":"Sci China Inf Sci"},{"key":"5286_CR8","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"McEliece R J, Sarwate D V. On sharing secrets and Reed-Solomon codes. Commun ACM, 1981, 24: 583\u2013584","journal-title":"Commun ACM"},{"key":"5286_CR9","first-page":"30","volume-title":"Proceedings of 42nd Annual Allerton Conference on Communication, Control, and Computing","author":"J. Feldman","year":"2004","unstructured":"Feldman J, Malkin T, Servedio R A, et al. Secure network coding via filtered secret sharing. In: Proceedings of 42nd Annual Allerton Conference on Communication, Control, and Computing, Illinois, 2004. 30\u201339"},{"key":"5286_CR10","volume-title":"Sci China Inf Sci","author":"L. H. Ding","year":"2013","unstructured":"Ding L H, Wu P, Wang H, et al. Lifetime maximization routing with network coding in wireless multihop networks. Sci China Inf Sci, 2013, 56: 022303"},{"key":"5286_CR11","doi-asserted-by":"crossref","unstructured":"Zheng J, Li J D, Liu Q, et al. Performance analysis of three multi-radio access control policies in heterogeneous wireless networks. Sci China Inf Sci, 2013, 56: 122305","DOI":"10.1007\/s11432-013-4819-4"},{"key":"5286_CR12","doi-asserted-by":"crossref","unstructured":"Zhang Z F, Liu M L. Rational secret sharing as extensive games. Sci China Inf Sci, 2013, 56: 032107","DOI":"10.1007\/s11432-011-4382-9"},{"key":"5286_CR13","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Proceedings of the 3rd International Workshop on Coding and Cryptology","author":"A. Beimel","year":"2011","unstructured":"Beimel A. Secret-sharing schemes: a survey. In: Proceedings of the 3rd International Workshop on Coding and Cryptology, Qingdao, 2011. 11\u201346"},{"key":"5286_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E. D. Karnin","year":"1983","unstructured":"Karnin E D, Greene J W, Hellman M E. On secret sharing systems. IEEE Trans Inform Theory, 1983, 29: 35\u201341","journal-title":"IEEE Trans Inform Theory"},{"key":"5286_CR15","first-page":"27","volume-title":"Proceedings of Advances in Cryptology\u2014CRYPTO\u201988","author":"J. Benaloh","year":"1988","unstructured":"Benaloh J, Leichter J. Generalized secret sharing and monotone functions. In: Proceedings of Advances in Cryptology\u2014CRYPTO\u201988, Santa Barbara, 1988. 27\u201335"},{"key":"5286_CR16","first-page":"468","volume-title":"Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques on Advances in Cryptology","author":"E. F. Brickell","year":"1989","unstructured":"Brickell E F. Some ideal secret sharing schemes. In: Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques on Advances in Cryptology, Houthalen, 1989. 468\u2013475"},{"key":"5286_CR17","first-page":"99","volume-title":"IEEE\/IEICE Global Telecommunications Conference","author":"M. Ito","year":"1987","unstructured":"Ito M, Saito A, Nishizeki T. Secret sharing scheme realizing general access structure. In: IEEE\/IEICE Global Telecommunications Conference, Tokyo, 1987. 99\u2013102"},{"key":"5286_CR18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R. M. Capocelli","year":"1993","unstructured":"Capocelli R M, de Santis A, Gargano L, et al. On the size of shares of secret sharing schemes. J Cryptol, 1993, 6: 157\u2013168","journal-title":"J Cryptol"},{"key":"5286_CR19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L. Csirmaz","year":"1997","unstructured":"Csirmaz L. The size of a share must be large. J Cryptol, 1997, 10: 223\u2013231","journal-title":"J Cryptol"},{"key":"5286_CR20","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10623-011-9552-7","volume":"63","author":"O. Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s O, Metcalf-Burton J R, Padrr\u00f3 C, et al. On the optimization of bipartite secret sharing schemes. Des Codes Cryptogr, 2012, 63: 255\u2013271","journal-title":"Des Codes Cryptogr"},{"key":"5286_CR21","doi-asserted-by":"crossref","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, Padrr\u00f3 C. On secret sharing schemes, matroids and polymatroids. J Math Cryptol, 2010, 4: 95\u2013120","journal-title":"J Math Cryptol"},{"key":"5286_CR22","doi-asserted-by":"crossref","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 Inform Theory, 2000, 46: 2596\u20132604","journal-title":"IEEE Trans Inform Theory"},{"key":"5286_CR23","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1016\/j.dam.2012.10.020","volume":"161","author":"C. Padr\u00f3","year":"2013","unstructured":"Padr\u00f3 C, V\u00e1zquez L, Yang A. Finding lower bounds on the complexity of secret sharing schemes by linear programming. Discrete Appl Math, 2013, 161: 1072\u20131084","journal-title":"Discrete Appl Math"},{"key":"5286_CR24","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/TIT.2008.921708","volume":"54","author":"A. Beimel","year":"2008","unstructured":"Beimel A, Livne N. On matroids and non-ideal secret sharing. IEEE Trans Inform Theory, 2008, 54: 482\u2013501","journal-title":"IEEE Trans Inform Theory"},{"key":"5286_CR25","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/978-3-540-78524-8_12","volume-title":"Proceedings of the 5th Conference on Theory of Cryptography","author":"A. Beimel","year":"2008","unstructured":"Beimel A, Livne N, Padr\u00f3 C. Matroids can be far from ideal secret sharing. In: Proceedings of the 5th Conference on Theory of Cryptography, New York, 2008. 194\u2013212"},{"key":"5286_CR26","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1109\/TIT.2011.2162183","volume":"57","author":"A. Beimel","year":"2011","unstructured":"Beimel A, Orlov I. Secret sharing and non-shannon information inequalities. IEEE Trans Inform Theory, 2011, 57: 539\u2013557","journal-title":"IEEE Trans Inform Theory"},{"key":"5286_CR27","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"Stinson D R. An explication of secret sharing schemes. Des Codes Cryptogr, 1992, 2: 357\u2013390","journal-title":"Des Codes Cryptogr"},{"key":"5286_CR28","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.ipl.2005.09.008","volume":"97","author":"A. Beimel","year":"2006","unstructured":"Beimel A, Weinreb E. Monotone circuits for monotone weighted threshold functions. Inf Process Lett, 2006, 97: 12\u201318","journal-title":"Inf Process Lett"},{"key":"5286_CR29","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0020-0190(99)00070-8","volume":"70","author":"P. Morillo","year":"1999","unstructured":"Morillo P, Padr\u00f3 C, S\u00e1ez G, et al. Weighted threshold secret sharing schemes. Inf Process Lett, 1999, 70: 211\u2013216","journal-title":"Inf Process Lett"},{"key":"5286_CR30","doi-asserted-by":"crossref","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 Discrete Math, 2008, 22: 360\u2013397","journal-title":"SIAM J Discrete Math"},{"key":"5286_CR31","doi-asserted-by":"crossref","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 Inform Theory, 2012, 58: 3273\u20133286","journal-title":"IEEE Trans Inform Theory"},{"key":"5286_CR32","first-page":"390","volume-title":"Proceedings of Advances in Cryptology\u2014CRYPTO\u201988","author":"G. J. Simmons","year":"1988","unstructured":"Simmons G J. How to (really) share a secret. In: Proceedings of Advances in Cryptology\u2014CRYPTO\u201988, Santa Barbara, 1988. 390\u2013448"},{"key":"5286_CR33","doi-asserted-by":"crossref","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, 2009, 22: 227\u2013258","journal-title":"J Cryptol"},{"key":"5286_CR34","doi-asserted-by":"crossref","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, et al. Natural generalizations of threshold secret sharing. IEEE Trans Inform Theory, 2014, 60: 1652\u20131664","journal-title":"IEEE Trans Inform Theory"},{"key":"5286_CR35","doi-asserted-by":"crossref","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, 2006, 153: 153\u2013162","journal-title":"IEE Proc Inf Secur"},{"key":"5286_CR36","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1049\/ip-com:20050073","volume":"153","author":"S. L. Ng","year":"2006","unstructured":"Ng S L. Ideal secret sharing schemes with multipartite access structures. IEE Proc Commun, 2006, 153: 165\u2013168","journal-title":"IEE Proc Commun"},{"key":"5286_CR37","doi-asserted-by":"crossref","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, 2007, 20: 237\u2013264","journal-title":"J Cryptol"},{"key":"5286_CR38","doi-asserted-by":"crossref","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, 1993, 3: 127\u2013134","journal-title":"Des Codes Cryptogr"},{"key":"5286_CR39","doi-asserted-by":"crossref","first-page":"3236","DOI":"10.1016\/j.disc.2009.11.040","volume":"310","author":"M. Giuletti","year":"2010","unstructured":"Giuletti M, Vincenti R. Three-level secret sharing schemes from the twisted cubic. Discrete Math, 2010, 310: 3236\u20133240","journal-title":"Discrete Math"},{"key":"5286_CR40","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/s00145-011-9101-6","volume":"25","author":"O. Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s O, Mart\u00b4i-Farrr\u00e9 J, Padr\u00f3 C. Ideal multipartite secret sharing schemes. J Cryptol, 2012, 25: 434\u2013463","journal-title":"J Cryptol"},{"key":"5286_CR41","doi-asserted-by":"crossref","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, 2002, 16: 239\u2013268","journal-title":"J Algebr Comb"},{"key":"5286_CR42","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E. F. Brickell","year":"1991","unstructured":"Brickell E F, Davenport D M. On the classification of ideal secret sharing schemes. J Cryptol, 1991, 4: 123\u2013134","journal-title":"J Cryptol"},{"key":"5286_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10623-008-9264-9","volume":"52","author":"J. Mart\u00ed-Farr\u00e9","year":"2009","unstructured":"Mart\u00ed-Farr\u00e9 J, Padr\u00f3 C. Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. Des Codes Cryptogr, 2009, 52: 1\u201314","journal-title":"Des Codes Cryptogr"},{"key":"5286_CR44","first-page":"238","volume-title":"Matroid Theory","author":"J. G. Oxley","year":"1992","unstructured":"Oxley J G. Matroid Theory. New York: Oxford University Press, 1992. 238\u2013270"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5286-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-015-5286-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5286-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T20:39:31Z","timestamp":1598733571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-015-5286-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,7]]},"references-count":44,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["5286"],"URL":"https:\/\/doi.org\/10.1007\/s11432-015-5286-x","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,7]]}}}