{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:05:20Z","timestamp":1725584720354},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642209000"},{"type":"electronic","value":"9783642209017"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20901-7_6","type":"book-chapter","created":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T14:11:30Z","timestamp":1307196690000},"page":"99-108","source":"Crossref","is-referenced-by-count":3,"title":["Ideal Secret Sharing Schemes for Useful Multipartite Access Structures"],"prefix":"10.1007","author":[{"given":"Oriol","family":"Farr\u00e0s","sequence":"first","affiliation":[]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/18.335890","volume":"40","author":"A. Beimel","year":"1994","unstructured":"Beimel, A., Chor, B.: Universally ideal secret-sharing schemes. IEEE Trans. Inform. Theory\u00a040, 786\u2013794 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/S0895480102412868","volume":"19","author":"A. Beimel","year":"2005","unstructured":"Beimel, A., Ishai, Y.: On the power of nonlinear secret sharing schemes. SIAM J. Discrete Math.\u00a019, 258\u2013280 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-78524-8_12","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2008","unstructured":"Beimel, A., Livne, N., Padr\u00f3, C.: Matroids Can Be Far from Ideal Secret Sharing. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 194\u2013212. Springer, Heidelberg (2008)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-00457-5_32","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2009","unstructured":"Beimel, A., Orlov, I.: Secret Sharing and Non-Shannon Information Inequalities. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 539\u2013557. Springer, Heidelberg (2009)"},{"key":"6_CR5","doi-asserted-by":"publisher","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.\u00a022, 360\u2013397 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR6","doi-asserted-by":"publisher","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.\u00a034, 1196\u20131215 (2005)","journal-title":"SIAM J. Comput."},{"key":"6_CR7","unstructured":"Belenkiy, M.: Disjunctive Multi-Level Secret Sharing. Cryptology ePrint Archive, Report 2008\/018, http:\/\/eprint.iacr.org\/2008\/018"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J.C. Benaloh","year":"1990","unstructured":"Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201335. Springer, Heidelberg (1990)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. ACM STOC 1988, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01388411","volume":"3","author":"A. Beutelspacher","year":"1993","unstructured":"Beutelspacher, A., Wettl, F.: On 2-level secret sharing. Des. Codes Cryptogr.\u00a03, 127\u2013134 (1993)","journal-title":"Des. Codes Cryptogr."},{"key":"6_CR11","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":"6_CR12","first-page":"230","volume":"2","author":"J.R. Bloom","year":"1981","unstructured":"Bloom, J.R.: Threshold Schemes and Error Correcting Codes. Am. Math. Soc.\u00a02, 230 (1981)","journal-title":"Am. Math. Soc."},{"key":"6_CR13","doi-asserted-by":"publisher","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.\u00a011, 107\u2013122 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"6_CR14","first-page":"105","volume":"9","author":"E.F. Brickell","year":"1989","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comput.\u00a09, 105\u2013113 (1989)","journal-title":"J. Combin. Math. and Combin. Comput."},{"key":"6_CR15","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\u00a04, 123\u2013134 (1991)","journal-title":"J. Cryptology"},{"key":"6_CR16","doi-asserted-by":"publisher","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\u00a06, 157\u2013168 (1993)","journal-title":"J. Cryptology"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multi-party unconditionally secure protocols. In: Proc. ACM STOC 1988, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"6_CR18","unstructured":"Collins, M.J.: A Note on Ideal Tripartite Access Structures. Cryptology ePrint Archive, Report 2002\/193, http:\/\/eprint.iacr.org\/2002\/193"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Maurer, U.M.: General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"6_CR20","doi-asserted-by":"publisher","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\u00a010, 223\u2013231 (1997)","journal-title":"J. Cryptology"},{"key":"6_CR21","unstructured":"Farr\u00e0s, O.: Multipartite Secret Sharing Schemes. PhD Thesis, Universitat Polit\u00e8cnica de Catalunya (2010)"},{"key":"6_CR22","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), http:\/\/eprint.iacr.org\/2006\/292"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s, O., Metcalf-Burton, J.R., Padr\u00f3, C., V\u00e1zquez, L.: On the Optimization of Bipartite Secret Sharing Schemes. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol.\u00a05973, pp. 93\u2013109. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14496-7_8"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-11799-2_14","volume-title":"Theory of Cryptography","author":"O. Farr\u00e0s","year":"2010","unstructured":"Farr\u00e0s, O., Padr\u00f3, C.: Ideal hierarchical secret sharing schemes. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 219\u2013236. Springer, Heidelberg (2010); The full version of this paper is available at the Cryptology ePrint Archive, Report 2009\/141 (2010), http:\/\/eprint.iacr.org\/2009\/141"},{"key":"6_CR25","volume-title":"Submodular Functions and Optimization. Annals of Discrete Mathematics","author":"S. Fujishige","year":"1991","unstructured":"Fujishige, S.: Submodular Functions and Optimization. Annals of Discrete Mathematics, vol.\u00a047. North-Holland Elsevier, Amsterdam (1991)"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"G\u00e1l, A.: A characterization of span program size and improved lower bounds for monotone span programs. In: Proceedings of 30th ACM Symposium on the Theory of Computing, STOC 1998, pp. 429\u2013437 (1998)","DOI":"10.1145\/276698.276855"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"3236","DOI":"10.1016\/j.disc.2009.11.040","volume":"310","author":"M. Giuletti","year":"2010","unstructured":"Giuletti, M., Vincenti, R.: Three-level secret sharing schemes from the twisted cubic. Discrete Mathematics\u00a0310, 3236\u20133240 (2010)","journal-title":"Discrete Mathematics"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1006\/jcss.1999.1677","volume":"60","author":"D. Hammer","year":"2000","unstructured":"Hammer, D., Romashchenko, A.E., Shen, A., Vereshchagin, N.K.: Inequalities for Shannon Entropy and Kolmogorov Complexity. J. Comput. Syst. Sci.\u00a060, 442\u2013464 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1049\/ip-ifs:20060081","volume":"153","author":"J. Herranz","year":"2006","unstructured":"Herranz, J., S\u00e1ez, G.: New Results on Multipartite Access Structures. IEEE Proceedings on Information Security\u00a0153, 153\u2013162 (2006)","journal-title":"IEEE Proceedings on Information Security"},{"key":"6_CR30","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."},{"key":"6_CR31","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing any access structure. In: Proc. IEEE Globecom 1987, pp. 99\u2013102 (1987)"},{"key":"6_CR32","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.\u00a09, 267\u2013286 (1996)","journal-title":"Des. Codes Cryptogr."},{"key":"6_CR33","doi-asserted-by":"publisher","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\u00a029, 35\u201341 (1983)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-39568-7_19","volume-title":"Advances in Cryptology","author":"S.C. Kothari","year":"1985","unstructured":"Kothari, S.C.: Generalized Linear Threshold Scheme. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 231\u2013241. Springer, Heidelberg (1985)"},{"key":"6_CR35","doi-asserted-by":"publisher","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.\u00a04, 95\u2013120 (2010)","journal-title":"J. Math. Cryptol."},{"key":"6_CR36","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6-th Joint Swedish-Russian Workshop on Information Theory, Molle, Sweden, pp. 269\u2013279 (August 1993)"},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0012-365X(99)00004-7","volume":"203","author":"F. Mat\u00fa\u0161","year":"1999","unstructured":"Mat\u00fa\u0161, F.: Matroid representations by partitions. Discrete Math.\u00a0203, 169\u2013194 (1999)","journal-title":"Discrete Math."},{"key":"6_CR38","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0012-365X(00)00284-3","volume":"253","author":"F. Mat\u00fa\u0161","year":"2001","unstructured":"Mat\u00fa\u0161, F.: Excluded minors of Boolean polymatroids. Discrete Math.\u00a0253, 317\u2013321 (2001)","journal-title":"Discrete Math."},{"key":"6_CR39","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0020-0190(99)00070-8","volume":"70","author":"P. Morillo","year":"1999","unstructured":"Morillo, P., Padr\u00f3, C., S\u00e1ez, G., Villar, J.L.: Weighted Threshold Secret Sharing Schemes. Inf. Process. Lett.\u00a070, 211\u2013216 (1999)","journal-title":"Inf. Process. Lett."},{"key":"6_CR40","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718508","volume-title":"Discrete convex analysis","author":"K. Murota","year":"2003","unstructured":"Murota, K.: Discrete convex analysis. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2003)"},{"key":"6_CR41","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. IEEE Proc.-Commun.\u00a0153, 165\u2013168 (2006)","journal-title":"IEEE Proc.-Commun."},{"key":"6_CR42","doi-asserted-by":"publisher","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\u00a046, 2596\u20132604 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"6_CR43","volume-title":"Combinatorial optimization. Polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. Springer, Berlin (2003)"},{"key":"6_CR44","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":"6_CR45","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":"6_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"G.J. Simmons","year":"1990","unstructured":"Simmons, G.J.: How to (Really) Share a Secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 390\u2013448. Springer, Heidelberg (1990)"},{"key":"6_CR47","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008244215660","volume":"14","author":"J. Simonis","year":"1998","unstructured":"Simonis, J., Ashikhmin, A.: Almost affine codes. Des. Codes Cryptogr.\u00a014, 179\u2013197 (1998)","journal-title":"Des. Codes Cryptogr."},{"key":"6_CR48","doi-asserted-by":"publisher","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.\u00a02, 357\u2013390 (1992)","journal-title":"Des. Codes Cryptogr."},{"key":"6_CR49","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a040, 118\u2013125 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR50","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T. Tassa","year":"2007","unstructured":"Tassa, T.: Hierarchical Threshold Secret Sharing. J. Cryptology\u00a020, 237\u2013264 (2007)","journal-title":"J. Cryptology"},{"key":"6_CR51","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00145-008-9027-9","volume":"22","author":"T. Tassa","year":"2009","unstructured":"Tassa, T., Dyn, N.: Multipartite Secret Sharing by Bivariate Interpolation. J. Cryptology\u00a022, 227\u2013258 (2009)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20901-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T21:41:27Z","timestamp":1592602887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20901-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642209000","9783642209017"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20901-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}