{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:18:11Z","timestamp":1778278691908,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s11424-013-2131-4","type":"journal-article","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T23:47:48Z","timestamp":1376956068000},"page":"634-649","source":"Crossref","is-referenced-by-count":10,"title":["The optimal linear secret sharing scheme for any given access structure"],"prefix":"10.1007","volume":"26","author":[{"given":"Chunming","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengli","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,21]]},"reference":[{"key":"2131_CR1","first-page":"313","volume-title":"Proceedings of the AFIPS National Computer Conference","author":"G R Blakley","year":"1979","unstructured":"Blakley G R, Safeguarding cryptographic keys, Proceedings of the AFIPS National Computer Conference, 1979, 313\u2013317."},{"key":"2131_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, Communications of ACM, 1979, 22: 612\u2013613.","journal-title":"Communications of ACM"},{"key":"2131_CR3","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R J McEliece","year":"1981","unstructured":"McEliece R J and Sarwate D V, On sharing secrets and Reed-Solomon codes, Communications of ACM, 1981, 24: 583\u2013584.","journal-title":"Communications of ACM"},{"key":"2131_CR4","first-page":"276","volume-title":"Proceeding of 6th Joint Swedish-Russian Workshop on Information Theory","author":"J L Massey","year":"1993","unstructured":"Massey J L, Minimal codewords and secret sharing, Proceeding of 6th Joint Swedish-Russian Workshop on Information Theory, 1993, 276\u2013279."},{"key":"2131_CR5","first-page":"33","volume-title":"Codes and Ciphers: Cryptography and Coding IV","author":"J L Massey","year":"1995","unstructured":"Massey J L, Some applications of coding theory in cryptography, Codes and Ciphers: Cryptography and Coding IV, ed. Farrell P G, Essex, England: Formara Ltd., 1995, 33\u201347."},{"issue":"5","key":"2131_CR6","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"A Ashikhmin","year":"1998","unstructured":"Ashikhmin A and Barg A, Minimal vectors in linear codes, IEEE Transactions on Information Theory, 1998, 44(5): 2010\u20132017.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2131_CR7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-60114-7_7","volume-title":"Proceeding of Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes","author":"A Ashikhmin","year":"1995","unstructured":"Ashikhmin A, Barg A, Cohen G, and Huguet L, Variations on minimal codewords in linear codes, Proceeding of Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, eds. by Cohen G, Giusti M, and Mora T, Springer-verlag, Berlin, 1995, 96\u2013105."},{"issue":"2","key":"2131_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1026421315292","volume":"15","author":"R Anderson","year":"1998","unstructured":"Anderson R, Ding C, Helleseth T, and Klove T, How to build robust shared control systems, Design, Codes, and Cryptography, 1998, 15(2): 111\u2013124.","journal-title":"Design, Codes, and Cryptography"},{"issue":"1\u20132","key":"2131_CR9","first-page":"51","volume":"73","author":"C Ding","year":"2006","unstructured":"Ding C and Salomaa A, Secret Sharing Schemes with Nice Access Structure, Fundamenta Informaticae, 2006, 73(1\u20132): 51\u201363.","journal-title":"Fundamenta Informaticae"},{"key":"2131_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-45066-1_2","volume-title":"Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science","author":"C Ding","year":"2003","unstructured":"Ding C and Yuan J, Covering and secret sharing with linear codes, Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science, ed. Cristian S, Michael J, and Vincent V, 2003, 11\u201325."},{"key":"2131_CR11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BFb0023288","volume":"1172","author":"A Renvall","year":"1996","unstructured":"Renvall A and Ding C, The access structure of some secret sharing schemes, Information Security and Privacy, 1996, 1172: 67\u201378.","journal-title":"Information Security and Privacy"},{"key":"2131_CR12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S1571-0653(04)00592-X","volume":"15","author":"J Yuan","year":"2003","unstructured":"Yuan J and Ding C, Secret sharing schemes from two-weight codes, Electronic Notes in Discrete Mathematics, 2003, 15: 232\u2013238.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"2131_CR13","volume-title":"Three coding problems, Report in Trondhjemsgade 3, 2TH DK-2100 Copenhagen, Denmark","author":"J L Massey","year":"2009","unstructured":"Massey J L, Three coding problems, Report in Trondhjemsgade 3, 2TH DK-2100 Copenhagen, Denmark, 2009."},{"key":"2131_CR14","first-page":"102","volume-title":"Proceedings of the 8-th Annual Structure in Complexity Theory Conference","author":"M Karchmer","year":"1993","unstructured":"Karchmer M and Wigderson A, On Span Programes, Proceedings of the 8-th Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, 1993, 102\u2013111."},{"key":"2131_CR15","first-page":"516","volume-title":"Proceedings of the 26th Annual International Conference on Advances in Cryptology","author":"H Chen","year":"2006","unstructured":"Chen H and Cramer R, Algebraic geometric secret sharing schemes and secure multi-party computation over small fields, Proceedings of the 26th Annual International Conference on Advances in Cryptology, ed. by Dwork C, Springer-verlag, Berlin, 2006, 516\u2013531."},{"key":"2131_CR16","first-page":"291","volume-title":"Proceedings of the 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"R Cramer","year":"2007","unstructured":"Cramer R, Damgard I, and de Haan R, Atomic secure multiplication with low communication, Proceedings of the 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, ed. by Naor M, Springer-verlag, Berlin, 2007, 291\u2013310."},{"key":"2131_CR17","first-page":"316","volume-title":"Proceedings of the 19th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"R Cramer","year":"2000","unstructured":"Cramer R, Damgard I, and Maurer U, General secure multi-party computation from any linear secret-sharing scheme, Proceedings of the 19th Annual International Conference on the Theory and Applications of Cryptographic Techniques, ed. by Preneel B, Springer-verlag, Berlin, 2000, 316\u2013334."},{"key":"2131_CR18","first-page":"1","volume-title":"Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing","author":"S Goldwasser","year":"1997","unstructured":"Goldwasser S, Multi-party computations: Past and present, Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, ed. James B and Hagit A, 1997, 1\u20136."},{"issue":"1","key":"2131_CR19","first-page":"52","volume":"2","author":"J Xu","year":"2007","unstructured":"Xu J and Zha X, Secret sharing schemes with general access structure based on MSPs, Journal of Communications, 2007, 2(1): 52\u201355.","journal-title":"Journal of Communications"},{"issue":"9","key":"2131_CR20","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1002\/ecjc.4430720906","volume":"72","author":"M Ito","year":"1989","unstructured":"Ito M, Saito A, and Nishizeki T, Secret sharing scheme realizing any access structure, Electronics and Communications in Japan 1989, 72(9): 56\u201364.","journal-title":"Electronics and Communications in Japan"},{"key":"2131_CR21","volume-title":"Secret Sharing Schemes and Secure Multiparty Computation","author":"M Liu","year":"2008","unstructured":"Liu M and Zhang Z, Secret Sharing Schemes and Secure Multiparty Computation (in Chinese), Publishing House of Electronics Industry, 2008."},{"issue":"5","key":"2131_CR22","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1007\/s11432-011-4480-8","volume":"55","author":"C Tang","year":"2012","unstructured":"Tang C and Gao S, Leakproof secret sharing protocols with applications to group identification scheme, Science China: Information Sciences, 2012, 55(5): 1172\u20131185.","journal-title":"Science China: Information Sciences"},{"key":"2131_CR23","first-page":"466","volume-title":"Proceedings of the 29th Annual International Conference on Advances in Cryptology","author":"I Cascudo","year":"2009","unstructured":"Cascudo I, Chen H, Cramer R, and Xing C, Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field, Proceedings of the 29th Annual International Conference on Advances in Cryptology, ed. by Halevi S, Springer-verlag, Berlin, 2009, 466\u2013486."},{"key":"2131_CR24","first-page":"291","volume-title":"Proceedings of the 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"H Chen","year":"2007","unstructured":"Chen H, Cramer R, Goldwasser S, de Haan R, and Vaikuntanathan V, Secure computation from random error correcting codes, Proceedings of the 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, ed. by Naor M, Springer-verlag, Berlin, 2007, 291\u2013310."},{"issue":"423","key":"2131_CR25","first-page":"45","volume":"95","author":"W Ogata","year":"1995","unstructured":"Ogata W and Kurosawa K, Some new results on nonperfect secret sharing schemes, Technical report of IEICE, 1995, 95(423): 45\u201352.","journal-title":"Technical report of IEICE"},{"key":"2131_CR26","first-page":"56","volume-title":"Proceedings of the 3rd Workshop on the Theory and Application of Cryptographic Techniques","author":"W Ogata","year":"1993","unstructured":"Ogata W, Kurosawa K, and Tsujii S, Nonperfect secret sharing schemes, Proceedings of the 3rd Workshop on the Theory and Application of Cryptographic Techniques, ed. by Seberry J and Zheng Y, Springer-verlag, Berlin, 1993, 56\u201366."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-013-2131-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-013-2131-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-013-2131-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:54:05Z","timestamp":1559386445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-013-2131-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["2131"],"URL":"https:\/\/doi.org\/10.1007\/s11424-013-2131-4","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}