{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:55:10Z","timestamp":1725530110322},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642008429"},{"type":"electronic","value":"9783642008436"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00843-6_12","type":"book-chapter","created":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T14:42:08Z","timestamp":1238596928000},"page":"124-135","source":"Crossref","is-referenced-by-count":2,"title":["On Non-representable Secret Sharing Matroids"],"prefix":"10.1007","author":[{"given":"Qi","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching-Fang","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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. of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Commun. of the ACM"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS Conference Proceedings, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0012-365X(99)00004-7","volume":"203","author":"F. Matus","year":"1999","unstructured":"Matus, F.: Matroid representations by partitions. Discrete Math.\u00a0203, 169\u2013194 (1999)","journal-title":"Discrete Math."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0095-8956(92)90007-K","volume":"56","author":"P.D. Seymour","year":"1992","unstructured":"Seymour, P.D.: On secret-sharing matroids. J. Combin. Theory Ser. B\u00a056, 69\u201373 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"key":"12_CR5","unstructured":"Marti-Farre, J., Padro, C.: On Secret Sharing Schemes, Matroids and Polymatroids. Cryptology ePrint Archive, Report 2006\/077, http:\/\/eprint.iacr.org\/2006\/077"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-24638-1_26","volume-title":"Theory of Cryptography","author":"T. Tassa","year":"2004","unstructured":"Tassa, T.: Hierarchical threshold secret sharing. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 473\u2013490. Springer, Heidelberg (2004)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1011225330458","volume":"24","author":"S.-L. Ng","year":"2001","unstructured":"Ng, S.-L., Walker, M.: On the composition of matroids and ideal secret sharing schemes. Des. Codes Cryptogr.\u00a024, 49\u201367 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"12_CR8","unstructured":"Collins, M.J.: A Note on Ideal Tripartite Access Structures. Cryptology ePrint Archive, Report 2002\/193, http:\/\/eprint.iacr.org\/2002\/193"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-72540-4_26","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"O. Farr\u00e0s","year":"2007","unstructured":"Farr\u00e0s, O., Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Ideal multipartite secret sharing schemes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 448\u2013465. Springer, Heidelberg (2007)"},{"key":"12_CR10","unstructured":"Oxley, J.G.: Matroid theory. Oxford Science Publications\/ The Clarendon Press\/ Oxford University Press, New York (1992)"},{"key":"12_CR11","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"Welsh, D.J.A.: Matroid Theory. Academic Press, London (1976)"},{"key":"12_CR12","doi-asserted-by":"publisher","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.\u00a0153, 165\u2013168 (2006)","journal-title":"IEE Proc.-Commun."},{"key":"12_CR13","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. Algebraic Combin.\u00a016, 239\u2013268 (2002)","journal-title":"J. Algebraic Combin."}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00843-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:57:00Z","timestamp":1589698620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00843-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642008429","9783642008436"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00843-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}