{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:53Z","timestamp":1759637873581},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T00:00:00Z","timestamp":1380240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10623-013-9879-3","type":"journal-article","created":{"date-parts":[[2013,9,26]],"date-time":"2013-09-26T15:41:26Z","timestamp":1380210086000},"page":"623-644","source":"Crossref","is-referenced-by-count":11,"title":["Optimal assignment schemes for general access structures based on linear programming"],"prefix":"10.1007","volume":"74","author":[{"given":"Qiang","family":"Li","sequence":"first","affiliation":[]},{"given":"Xiang Xue","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xue Jia","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Ke Fei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,27]]},"reference":[{"key":"9879_CR1","doi-asserted-by":"crossref","unstructured":"Shamir A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979).","DOI":"10.1145\/359168.359176"},{"key":"9879_CR2","doi-asserted-by":"crossref","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. In: AFIPS 1979. National Computer Conference, New York, vol. 48, pp. 137\u2013313 (1979).","DOI":"10.1109\/MARK.1979.8817296"},{"key":"9879_CR3","doi-asserted-by":"crossref","unstructured":"Brickell E.F., Stinson D.R.: Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptol. 5(3), 153\u2013166 (1992).","DOI":"10.1007\/BF02451112"},{"key":"9879_CR4","unstructured":"Blundo C.: Secret sharing schemes for access structures based on graphs (in Italian). Tesi di Laurea (1991)."},{"key":"9879_CR5","unstructured":"Martin K.M.: Discrete structures in the theory of secret sharing. Ph.D. thesis, Royal Holloway and Bedford New College, University of London, London (1991)."},{"key":"9879_CR6","unstructured":"Martin K.M.: New secret sharing schemes from old. J. Comb. Math. Comb. Comput. 14, 65\u201377 (1993)."},{"key":"9879_CR7","unstructured":"Karnin E.D., Greene J.W., Hellman M.E.: On secret sharing systems. IEEE Trans. Inf. Theory 29, 35\u201341 (1983)."},{"key":"9879_CR8","doi-asserted-by":"crossref","unstructured":"Capocelli R.M., Santis A.D., Gargano L., Vaccaro U.: On the size of shares for secret sharing schemes. J. Cryptol. 6(3), 157\u2013167 (1993).","DOI":"10.1007\/BF00198463"},{"key":"9879_CR9","doi-asserted-by":"crossref","unstructured":"Csirmaz L.: The size of a share must be large. J. Cryptol. 10, 223\u2013231 (1997).","DOI":"10.1007\/s001459900029"},{"key":"9879_CR10","unstructured":"Brickell E.F.: Some ideal secret sharing schemes. In: EUROCRYPT \u201989, Houthalen, vol. 434, pp. 468\u2013475 (1990)."},{"key":"9879_CR11","unstructured":"Blakley G.R., Meadows C.: Security of ramp schemes. In: CRYPTO\u201984, Santa Barbara, vol. 196, pp. 242\u2013268 (1985)."},{"key":"9879_CR12","unstructured":"Yamamoto Y.: On secret sharing systems using $$(k, L, n)$$ ( k , L , n ) -threshold scheme (in Japanese). Trans. IEICE J68-A(9), 945\u2013952 (1985)."},{"key":"9879_CR13","unstructured":"Ito M., Saito A., Nishizeki T.: Secret sharing scheme realizing any access structure. In: IEEE Globecom 1987, Tokyo, pp. 99\u2013102 (1987)."},{"key":"9879_CR14","unstructured":"Benaloh J., Leichter J.: Generalized secret sharing and monotone functions. In: CRYPTO\u201988, Santa Barbara, No. 403, pp. 25\u201335 (1988)."},{"key":"9879_CR15","doi-asserted-by":"crossref","unstructured":"Stinson D.R.: An explication of secret sharing schemes. Des. Codes Cryptogr. 2, 357\u2013390 (1992).","DOI":"10.1007\/BF00125203"},{"key":"9879_CR16","unstructured":"Stinson D.R.: New general lower bounds on the information rate of secret sharing schemes. In: CRYPTO\u201992, Santa Barbara, No. 740, pp. 168\u2013182 (1993)."},{"key":"9879_CR17","unstructured":"Stinson D.R.: Decomposition constructions for secret-sharing schemes. IEEE Trans. Inf. Theory 40, 118\u2013125 (1994)."},{"key":"9879_CR18","doi-asserted-by":"crossref","unstructured":"Blundo C., Santis A.D., Stinson D.R., Vaccaro U.: Graph decompositions and secret sharing schemes. J. Cryptol. 8, 39\u201364 (1995).","DOI":"10.1007\/BF00204801"},{"key":"9879_CR19","unstructured":"Blundo C., Santis A.D., Gaggia A.G., Vaccaro U.: New bounds on the information rate of secret sharing schemes. IEEE Trans. Inf. Theory 41(2), 549\u2013554 (1995)."},{"key":"9879_CR20","doi-asserted-by":"crossref","unstructured":"Dijk M.V.: On the information rate of perfect secret sharing schemes. Des. Codes Cryptogr. 6, 143\u2013169 (1995).","DOI":"10.1007\/BF01398012"},{"key":"9879_CR21","doi-asserted-by":"crossref","unstructured":"Jackson W.A., Martin K.M.: Perfect secret sharing schemes on five participants. Des. Codes Cryptogr. 9, 267\u2013286 (1996).","DOI":"10.1007\/BF00129769"},{"key":"9879_CR22","doi-asserted-by":"crossref","unstructured":"Dijk M.V., Jackson W.A., Martin K.M.: A general decomposition construction for incomplete secret sharing schemes. Des. Codes Cryptogr. 15, 301\u2013321 (1998).","DOI":"10.1023\/A:1008381427667"},{"key":"9879_CR23","unstructured":"Li Q., Yan H., Chen K.F.: A new method of using $$(k, n)$$ ( k , n ) -threshold scheme to realize any access structure (in Chinese). J. Shanghai Jiaotong Univ. 38(1), 103\u2013106 (2004)."},{"key":"9879_CR24","unstructured":"Iwamoto M., Yamamoto H., Ogawa H.: Optimal multiple assignments based on integer programming in secret sharing schemes. In: ISIT 2004, Chicago, pp. 16\u201316 (2004)."},{"key":"9879_CR25","unstructured":"Dijk M.V., Kevenaar T., Schrijen G., Tuyls P.: Improved constructions of secret sharing schemes by applying $$(\\lambda ,\\omega )$$ ( \u03bb , \u03c9 ) -decompositions. Inf. Process. Lett. 99(4), 154\u2013157 (2006)."},{"key":"9879_CR26","doi-asserted-by":"crossref","unstructured":"Iwamoto M., Yamamoto H., Ogawa H.: Optimal multiple assignments based on integer programming in secret sharing schemes with general access structure. Trans. IEICE E90-A(1), 101\u2013112 (2007).","DOI":"10.1093\/ietfec\/e90-a.1.101"},{"key":"9879_CR27","unstructured":"Chv\u00e1tal V.: Linearing Programming. W.H. Freeman, New York (1983)."},{"key":"9879_CR28","doi-asserted-by":"crossref","unstructured":"Karmarkar N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984).","DOI":"10.1007\/BF02579150"},{"key":"9879_CR29","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1990)."},{"key":"9879_CR30","doi-asserted-by":"crossref","unstructured":"Brickell E.F., Davenport D.M.: On the classification of ideal secret sharing schemes. J. Cryptol. 4(73), 123\u2013134 (1991).","DOI":"10.1007\/BF00196772"},{"key":"9879_CR31","unstructured":"Blundo C., De Santis A., Vaccaro U.: Efficient sharing of many secrets. In: STACS\u201993, W\u00fcrzburg, vol. 665, pp. 692\u2013703 (1993)."},{"key":"9879_CR32","unstructured":"Kurosawa K., Okada K., Sakano K., Ogata W., Tsujii T.: Nonperfect secret sharing schemes and matroids. In: EUROCRYPT\u201993, Lofthus, pp. 126\u2013141 (1993)."},{"key":"9879_CR33","unstructured":"Simmons G.J., Jackson W.A., Martin K.M.: The geometry of shared secret schemes. Bull. Inst. Comb. Appl. 1, 71\u201388 (1991)."},{"key":"9879_CR34","unstructured":"Li Q., Li X.X., Zheng D., Chen K.F.: Optimal multiple assignments with $$(m, m)$$ ( m , m ) -schemes for general access structures. Cryptology ePrint Archive, Report 2012\/007, http:\/\/eprint.iacr.org\/2012\/007.pdf ."},{"key":"9879_CR35","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)."},{"key":"9879_CR36","unstructured":"Ye Y.: Interior Point Algorithms, Theory and Analysis. Wiley, New York (1997)."},{"key":"9879_CR37","unstructured":"Jackson W.A., Martin K.M.: A combinatorial interpretation of ramp schemes. Australas. J. Comb. 14, 51\u201360 (1996)."},{"key":"9879_CR38","unstructured":"Beimel A., Chor B.: Universally ideal secret sharing schemes. IEEE Trans. Inf. Theory 40(3), 786\u2013794 (1994)."},{"key":"9879_CR39","unstructured":"Beimel A., Tassa T., Weinreb E.: Characterizing ideal weighted threshold secret sharing. In: TCC\u201905, Cambridge, vol. 3378, pp. 600\u2013619 (2005)."},{"key":"9879_CR40","unstructured":"Beimel A., Livne N., Padr\u00f3 C.: Matroids can be far from ideal secret sharing. In: TCC\u201908, New York, vol. 4948, pp. 194\u2013212 (2008)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9879-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9879-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9879-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T22:32:22Z","timestamp":1596580342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9879-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,27]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9879"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9879-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,27]]}}}