{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:55:04Z","timestamp":1764996904129},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,11,4]],"date-time":"2010-11-04T00:00:00Z","timestamp":1288828800000},"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":[[2011,11]]},"DOI":"10.1007\/s10623-010-9446-0","type":"journal-article","created":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T09:19:26Z","timestamp":1288775966000},"page":"167-186","source":"Crossref","is-referenced-by-count":7,"title":["Optimal complexity of secret sharing schemes with four minimal qualified subsets"],"prefix":"10.1007","volume":"61","author":[{"given":"Jaume","family":"Mart\u00ed-Farr\u00e9","sequence":"first","affiliation":[]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[]},{"given":"Leonor","family":"V\u00e1zquez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,4]]},"reference":[{"key":"9446_CR1","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S0097539704444038","volume":"34","author":"A. Beimel","year":"2005","unstructured":"Beimel A., Weinreb E.: Separating the power of monotone span programs over different fields. SIAM J. Comput. 34, 1196\u20131215 (2005)","journal-title":"SIAM J. Comput."},{"key":"9446_CR2","unstructured":"Beimel A., Livne N., Padr\u00f3 C.: Matroids can be far from ideal secret sharing. Fifth Theory of Cryptography Conference, TCC 2008. Lecture Notes in Computer Science, vol. 4948, pp. 194\u2013212 (2008)."},{"key":"9446_CR3","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. 22, 360\u2013397 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"9446_CR4","unstructured":"Benaloh J., Leichter J.: Generalized secret sharing and monotone functions. Advances in Cryptology, CRYPTO\u201988. Lecture Notes in Computer Science, vol. 403, pp. 27\u201335 (1990)."},{"key":"9446_CR5","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. AFIPS Conference Proceedings, vol. 48, pp. 313\u2013317 (1979)."},{"key":"9446_CR6","unstructured":"Blundo C., De Santis A., Gargano L., Vaccaro U.: On the information rate of secret sharing schemes. Advances in Cryptology\u2014CRYPTO\u201992, Lecture Notes in Computer Science, vol. 740, pp. 148\u2013167 (1993)."},{"key":"9446_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C. Blundo","year":"1995","unstructured":"Blundo C., De Santis A., Stinson D.R., Vaccaro U.: Graph decompositions and secret sharing schemes. J. Cryptology 8, 39\u201364 (1995)","journal-title":"J. Cryptology"},{"key":"9446_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1008216403325","volume":"11","author":"C. Blundo","year":"1997","unstructured":"Blundo C., De Santis A., De Simone R., Vaccaro U.: Tight bounds on the information rate of secret sharing schemes. Des. Codes Cryptogr. 11, 107\u2013122 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"9446_CR9","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. Cryptology 4, 123\u2013134 (1991)","journal-title":"J. Cryptology"},{"key":"9446_CR10","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. J. Cryptology 5, 153\u2013166 (1992)","journal-title":"J. Cryptology"},{"key":"9446_CR11","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. J. Cryptology 6, 157\u2013168 (1993)","journal-title":"J. Cryptology"},{"key":"9446_CR12","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. Cryptology 10, 223\u2013231 (1997)","journal-title":"J. Cryptology"},{"key":"9446_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10623-009-9304-0","volume":"53","author":"L. Csirmaz","year":"2009","unstructured":"Csirmaz L.: An impossibility result on graph secret sharing. Des. Codes Cryptogr. 53, 195\u2013209 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"9446_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s00607-009-0039-6","volume":"85","author":"L. Csirmaz","year":"2009","unstructured":"Csirmaz L., Ligeti P.: On an infinite family of graphs with information ratio 2 \u2212 1\/k. Computing 85, 127\u2013136 (2009)","journal-title":"Computing"},{"key":"9446_CR15","unstructured":"Csirmaz L., Tardos G.: Secret sharing on trees: problem solved. Manuscript (2009). Available at Cryptology ePrint Archive, http:\/\/eprint.iacr.org\/2009\/071 ."},{"key":"9446_CR16","unstructured":"Farr\u00e0s O., Padr\u00f3 C.: Ideal hierarchical secret sharing schemes. Seventh IACR Theory of Cryptography Conference, TCC 2010, Lecture Notes in Computer Science, vol. 5978, pp. 219\u2013236 (2010)."},{"key":"9446_CR17","unstructured":"Farr\u00e0s O., Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: Ideal multipartite secret sharing schemes. Advances in Cryptology, Eurocrypt 2007, Lecture Notes in Computer Science, vol. 4515, pp. 448\u2013465 (2007)."},{"key":"9446_CR18","unstructured":"Farr\u00e0s O., Metcalf-Burton J.R., Padr\u00f3 C., V\u00e1zquez L.: On the optimization of bipartite secret sharing schemes. Fourth International Conference on Information Theoretic Security ICITS 2009, Lecture Notes in Computer Science, vol. 5973, pp. 93\u2013109 (2010)."},{"key":"9446_CR19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0019-9958(78)91063-X","volume":"39","author":"S. Fujishige","year":"1978","unstructured":"Fujishige S.: Polymatroidal dependence structure of a set of random variables. Inform. Control 39, 55\u201372 (1978)","journal-title":"Inform. Control"},{"key":"9446_CR20","unstructured":"Ito M., Saito A., Nishizeki T.: Secret sharing scheme realizing any access structure. In: Proc. IEEE Globecom\u201987, pp. 99\u2013102 (1987)."},{"key":"9446_CR21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01388562","volume":"4","author":"W.-A. Jackson","year":"1994","unstructured":"Jackson W.-A., Martin K.M.: Geometric secret sharing schemes and their duals. Des. Codes Cryptogr. 4, 83\u201395 (1994)","journal-title":"Des. Codes Cryptogr."},{"key":"9446_CR22","first-page":"267","volume":"9","author":"W.-A. Jackson","year":"1996","unstructured":"Jackson W.-A., Martin K.M.: Perfect secret sharing schemes on five participants. Des. Codes Cryptogr. 9, 267\u2013286 (1996)","journal-title":"Des. Codes Cryptogr."},{"key":"9446_CR23","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 29, 35\u201341 (1983)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9446_CR24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10623-003-4192-1","volume":"34","author":"J. Mart\u00ed-Farr\u00e9","year":"2005","unstructured":"Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: Secret sharing schemes with three or four minimal qualified subsets. Des. Codes Cryptogr. 34, 17\u201334 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"9446_CR25","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.dam.2005.09.003","volume":"154","author":"J. Mart\u00ed-Farr\u00e9","year":"2006","unstructured":"Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: Secret sharing schemes on access structures with intersection number equal to one. Discrete Appl. Math. 154, 552\u2013563 (2006)","journal-title":"Discrete Appl. Math."},{"key":"9446_CR26","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., Padr\u00f3 C.: On secret sharing schemes, matroids and polymatroids. J. Math. Cryptol. 4, 95\u2013120 (2010)","journal-title":"J. Math. Cryptol."},{"key":"9446_CR27","doi-asserted-by":"crossref","first-page":"2464","DOI":"10.1016\/j.disc.2006.11.013","volume":"307","author":"F. Mat\u00fa\u0161","year":"2007","unstructured":"Mat\u00fa\u0161 F.: Adhesivity of polymatroids. Discrete Math. 307, 2464\u20132477 (2007)","journal-title":"Discrete Math."},{"key":"9446_CR28","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 46, 2596\u20132604 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9446_CR29","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0020-0190(02)00213-2","volume":"83","author":"C. Padr\u00f3","year":"2002","unstructured":"Padr\u00f3 C., S\u00e1ez G.: Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. Inform. Process. Lett. 83, 345\u2013351 (2002)","journal-title":"Inform. Process. Lett."},{"key":"9446_CR30","unstructured":"Padr\u00f3 C., V\u00e1zquez L.: Finding lower bounds on the complexity of secret sharing schemes by linear programming. Ninth Latin American Theoretical Informatics Symposium, LATIN 2010, Lecture Notes in Computer Science, vol. 6034, pp. 344\u2013355 (2010)."},{"key":"9446_CR31","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 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9446_CR32","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. 2, 357\u2013390 (1992)","journal-title":"Des. Codes Cryptogr."},{"key":"9446_CR33","unstructured":"Stinson D.R.: New general lower bounds on the information rate of secret sharing schemes. Advances in Cryptology\u2014CRYPTO\u201992. Lecture Notes in Computer Science, vol. 740, pp. 168\u2013182 (1993)."},{"key":"9446_CR34","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"D.R. Stinson","year":"1994","unstructured":"Stinson D.R.: Decomposition constructions for secret-sharing schemes. IEEE Trans. Inform. Theory 40, 118\u2013125 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9446_CR35","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. Des. Codes Cryptogr. 6, 143\u2013169 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"9446_CR36","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1008259214236","volume":"12","author":"M. Dijk van","year":"1997","unstructured":"van Dijk M.: A linear construction of secret sharing schemes. Des. Codes Cryptogr. 12, 161\u2013201 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"9446_CR37","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.ipl.2006.01.016","volume":"99","author":"M. Dijk van","year":"2006","unstructured":"van Dijk M., Kevenaar T., Schrijen G., Tuyls P.: Improved constructions of secret sharing schemes by applying (\u03bb, \u03c9)-decompositions. Inform. Process. Lett. 99, 154\u2013157 (2006)","journal-title":"Inform. Process. Lett."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9446-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9446-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9446-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T13:34:09Z","timestamp":1592055249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9446-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,4]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9446"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9446-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,4]]}}}