{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T08:42:20Z","timestamp":1772008940997,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11704-015-3255-6","type":"journal-article","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T09:15:44Z","timestamp":1428484544000},"page":"778-787","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The optimal information rate for graph access structures of nine participants"],"prefix":"10.1007","volume":"9","author":[{"given":"Yun","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,9]]},"reference":[{"key":"3255_CR1","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"24","author":"A Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Communications of the ACM, 1979, 24: 612\u2013613","journal-title":"Communications of the ACM"},{"key":"3255_CR2","first-page":"313","volume":"48","author":"G R Blakley","year":"1979","unstructured":"Blakley G R. Safeguarding cryptographic keys. Proceedings of AFIPS National Computer Conference. 1979, 48: 313\u2013317","journal-title":"Proceedings of AFIPS National Computer Conference"},{"issue":"1","key":"3255_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.ins.2013.08.012","volume":"254","author":"H D Yuan","year":"2014","unstructured":"Yuan H D. Secret sharing with multi-cover adaptive steganography. Information Sciences, 2014, 254(1): 197\u2013212","journal-title":"Information Sciences"},{"issue":"7","key":"3255_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.jss.2014.01.001","volume":"92","author":"C C Chen","year":"2014","unstructured":"Chen C C, Wu W J. A secure Boolean-based multi-secret image sharing scheme. Journal of Systems and Software, 2014, 92(7): 107\u2013114","journal-title":"Journal of Systems and Software"},{"issue":"3","key":"3255_CR5","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.patrec.2012.10.017","volume":"34","author":"G Ulutas","year":"2013","unstructured":"Ulutas G, Ulutas M, Nabiyev V V. Secret image sharing scheme with adaptive authentication strength. Pattern Recognition Letters, 2013, 34(3): 283\u2013291","journal-title":"Pattern Recognition Letters"},{"issue":"9","key":"3255_CR6","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.ipl.2014.04.006","volume":"114","author":"H Lein","year":"2014","unstructured":"Lein H, Miao F Y. Multilevel threshold secret sharing based on the Chinese Remainder Theorem. Information Processing Letters, 2014, 114(9): 504\u2013509","journal-title":"Information Processing Letters"},{"issue":"3","key":"3255_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02451112","volume":"5","author":"E F Brickell","year":"1992","unstructured":"Brickell E F, Stinson D R. Some improved bounds on the information rate of perfect secret sharing schemes. Journal of Cryptology, 1992, 5(3): 153\u2013166","journal-title":"Journal of Cryptology"},{"issue":"10","key":"3255_CR8","first-page":"83","volume":"240","author":"H C Lu","year":"2013","unstructured":"Lu H C, Fu H L. New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access tructures. Information Sciences, 2013, 240(10): 83\u201394","journal-title":"Information Sciences"},{"issue":"3","key":"3255_CR9","first-page":"267","volume":"9","author":"W Jackson","year":"1996","unstructured":"Jackson W, Martin K M. Perfect secret sharing schemes on five participants. Designs, Codes and Cryptography, 1996, 9(3): 267\u2013286","journal-title":"Designs, Codes and Cryptography"},{"issue":"2","key":"3255_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01398012","volume":"6","author":"M Dijk van","year":"1995","unstructured":"van Dijk M. On the information rate of perfect secret sharing schemes. Designs, Codes and Cryptography, 1995, 6(2): 143\u2013169","journal-title":"Designs, Codes and Cryptography"},{"key":"3255_CR11","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/978-3-642-25769-8_90","volume":"127","author":"Y Song","year":"2012","unstructured":"Song Y, Li ZH, Wang WC. The information rate of secret sharing schemes based on seven participants by connect graphs. Lecture Notes in Electrical Engineering, 2012, 127: 637\u2013645","journal-title":"Lecture Notes in Electrical Engineering"},{"key":"3255_CR12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/ICBMEI.2011.5917883","volume-title":"Proceedings of the 2011 International Conference on Business Management and Electronic Information","author":"W C Wang","year":"2011","unstructured":"Wang W C, Li Z H, Song Y. The optional information rate of perfect secret sharing schemes. In: Proceedings of the 2011 International Conference on Business Management and Electronic Information. 2011, 207\u2013212"},{"issue":"6","key":"3255_CR13","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/S0898-1221(01)00328-5","volume":"43","author":"H M Sun","year":"2002","unstructured":"Sun H M, Chen B L. Weighted decomposition construction for perfect secret sharing schemes. Computers & Mathematics with Applications, 2002, 43(6): 877\u2013887","journal-title":"Computers & Mathematics with Applications"},{"issue":"2","key":"3255_CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10623-011-9592-z","volume":"67","author":"M Gharahi","year":"2013","unstructured":"Gharahi M, Dehkordi M H. The complexity of the graph access structures on six participants. Designs, Codes and Cryptography, 2013, 67(2): 169\u2013173","journal-title":"Designs, Codes and Cryptography"},{"key":"3255_CR15","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/978-3-642-12200-2_31","volume":"6034","author":"C Padr\u00ed\u0151","year":"2010","unstructured":"Padr\u00ed\u0151 C, V\u00ed\u0107zquez L. Finding lower bounds on the complexity of secret sharing schemes by linear prog ramming. Lecture Notes in Computer Science, 2010, 6034: 344\u2013355","journal-title":"Lecture Notes in Computer Science"},{"issue":"3","key":"3255_CR16","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, Vaccaro U. On the size of shares of secret sharing schemes. Journal of Cryptology, 1993, 6(3): 157\u2013168","journal-title":"Journal of Cryptology"},{"key":"3255_CR17","volume-title":"Elements of Information Theory","author":"T M Cover","year":"2006","unstructured":"Cover T M, Thomas J A. Elements of Information Theory. 2nd ed. Wiley: New York, 2006","edition":"2nd ed"},{"key":"3255_CR18","volume-title":"Cryptography theory and practice","author":"D R Stinson","year":"2009","unstructured":"Stinson D R. Cryptography theory and practice. 3rd ed. CRC\/C&H, 2009","edition":"3rd ed."}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-015-3255-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-015-3255-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-015-3255-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T21:01:21Z","timestamp":1559422881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-015-3255-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["3255"],"URL":"https:\/\/doi.org\/10.1007\/s11704-015-3255-6","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}