{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:38:38Z","timestamp":1778085518294,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642542411","type":"print"},{"value":"9783642542428","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54242-8_17","type":"book-chapter","created":{"date-parts":[[2014,2,3]],"date-time":"2014-02-03T02:42:54Z","timestamp":1391395374000},"page":"394-418","source":"Crossref","is-referenced-by-count":21,"title":["Multi-linear Secret-Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aner","family":"Ben-Efraim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya","family":"Tyomkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930050058","volume":"19","author":"L. Babai","year":"1999","unstructured":"Babai, L., G\u00e1l, A., Wigderson, A.: Superpolynomial lower bounds for monotone span programs. Combinatorica\u00a019(3), 301\u2013319 (1999)","journal-title":"Combinatorica"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"17_CR3","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. Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201335. Springer, Heidelberg (1990)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-57220-1_53","volume-title":"Advances in Cryptology - AUSCRYPT \u201992","author":"M. Bertilsson","year":"1993","unstructured":"Bertilsson, M., Ingemarsson, I.: A construction of practical secret sharing schemes using linear block codes. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 67\u201379. Springer, Heidelberg (1993)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Merwin, R.E., Zanca, J.T., Smith, M. (eds.) Proc. of the 1979 AFIPS National Computer Conference. AFIPS Conference proceedings, vol.\u00a048, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","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\u00a08(1), 39\u201364 (1995)","journal-title":"J. Cryptology"},{"key":"17_CR7","first-page":"105","volume":"6","author":"E.F. Brickell","year":"1989","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combin. Math. and Combin. Comput.\u00a06, 105\u2013113 (1989)","journal-title":"Journal of Combin. Math. and Combin. Comput."},{"issue":"73","key":"17_CR8","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. of Cryptology\u00a04(73), 123\u2013134 (1991)","journal-title":"J. of Cryptology"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"17_CR10","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., Maurer, U.: 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)"},{"issue":"4","key":"17_CR11","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. of Cryptology\u00a010(4), 223\u2013231 (1997)","journal-title":"J. of Cryptology"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-46766-1_37","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"Y. Desmedt","year":"1992","unstructured":"Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 457\u2013469. Springer, Heidelberg (1992)"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","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. Designs, Codes and Cryptography\u00a012(2), 161\u2013201 (1997)","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0095-8956(73)80007-3","volume":"14","author":"T.A. Dowling","year":"1973","unstructured":"Dowling, T.A.: A class of geometric lattices based on finite groups. J. Comb. Theory, Ser. B\u00a014(1), 61\u201386 (1973)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Dowling, T.A.: A q-analog of the partition lattice. A Survey of Combinatorial Theory, 101\u2013115 (1973)","DOI":"10.1016\/B978-0-7204-2262-7.50016-8"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s000370100001","volume":"10","author":"A. G\u00e1l","year":"2001","unstructured":"G\u00e1l, A.: A characterization of span program size and improved lower bounds for monotone span programs. Computational Complexity\u00a010(4), 277\u2013296 (2001)","journal-title":"Computational Complexity"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0020-0190(03)00334-X","volume":"87","author":"A. G\u00e1l","year":"2003","unstructured":"G\u00e1l, A., Pudl\u00e1k, P.: A note on monotone complexity and the rank of matrices. Inform. Process. Lett.\u00a087, 321\u2013326 (2003)","journal-title":"Inform. Process. Lett."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Proc. of the 13th ACM Conference on Computer and Communications Security, pp. 89\u201398 (2006)","DOI":"10.1145\/1180405.1180418"},{"key":"#cr-split#-17_CR19.1","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proc. of the IEEE Global Telecommunication Conf., Globecom 1987, pp. 99-102 (1987)"},{"key":"#cr-split#-17_CR19.2","doi-asserted-by":"crossref","unstructured":"Journal version: Multiple assignment scheme for sharing secret. J. of Cryptology\u00a06(1), 15-20 (1993)","DOI":"10.1007\/BF02620229"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proc. of the 8th IEEE Structure in Complexity Theory, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"issue":"1","key":"17_CR21","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. on Information Theory\u00a029(1), 35\u201341 (1983)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"57","key":"17_CR22","first-page":"139","volume":"15","author":"Y.V. Linnik","year":"1944","unstructured":"Linnik, Y.V.: On the least prime in an arithmetic progression I. the basic theorem. Rec. Math (Mat. Sbornik) N.S.\u00a015(57), 139\u2013178 (1944)","journal-title":"Rec. Math (Mat. Sbornik) N.S."},{"issue":"57","key":"17_CR23","first-page":"347","volume":"15","author":"Y.V. Linnik","year":"1944","unstructured":"Linnik, Y.V.: On the least prime in an arithmetic progression II. the deuring-heilbronn phenomenon. Rec. Math (Mat. Sbornik) N.S.\u00a015(57), 347\u2013368 (1944)","journal-title":"Rec. Math (Mat. Sbornik) N.S."},{"issue":"2","key":"17_CR24","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. Journal of Mathematical Cryptology\u00a04(2), 95\u2013120 (2010)","journal-title":"Journal of Mathematical Cryptology"},{"key":"17_CR25","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 Mathematics\u00a0203, 169\u2013194 (1999)","journal-title":"Discrete Mathematics"},{"key":"17_CR26","unstructured":"Milne, J.S.: Group theory, v3.12 (2012), http:\/\/www.jmilne.org\/math\/"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Naor, M., Wool, A.: Access control and signatures via quorum secret sharing. In: 3rd ACM Conf. on Computer and Communications Security, pp. 157\u2013167 (1996)","DOI":"10.1145\/238168.238209"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Oxley, J.G.: Matroid Theory, 2nd edn. Oxford University Press (2011)","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001"},{"issue":"1","key":"17_CR29","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.aam.2011.08.003","volume":"50","author":"R.A. Pendavingh","year":"2013","unstructured":"Pendavingh, R.A., van Zwam, S.H.M.: Skew partial fields, multilinear representations of matroids, and a matrix tree theorem. Advances in Applied Mathematics\u00a050(1), 201\u2013227 (2013)","journal-title":"Advances in Applied Mathematics"},{"issue":"2","key":"17_CR30","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/aama.1996.0010","volume":"17","author":"C. Semple","year":"1996","unstructured":"Semple, C., Whittle, G.: Partial fields and matroid representation. Advances in Applied Mathematics\u00a017(2), 184\u2013208 (1996)","journal-title":"Advances in Applied Mathematics"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Serre, J.-P.: Linear Representations of Finite Groups. Springer (1977)","DOI":"10.1007\/978-1-4684-9458-7"},{"key":"17_CR32","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. of Combinatorial Theory, Series B\u00a056, 69\u201373 (1992)","journal-title":"J. of Combinatorial Theory, Series B"},{"key":"17_CR33","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. Communications of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-540-77444-0_31","volume-title":"Distributed Computing and Networking","author":"B. Shankar","year":"2008","unstructured":"Shankar, B., Srinathan, K., Rangan, C.P.: Alternative protocols for generalized oblivious transfer. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol.\u00a04904, pp. 304\u2013309. Springer, Heidelberg (2008)"},{"issue":"2","key":"17_CR35","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. Designs, Codes and Cryptography\u00a014(2), 179\u2013197 (1998)","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"17_CR36","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 construction for secret sharing schemes. IEEE Trans. on Information Theory\u00a040(1), 118\u2013125 (1994)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1","key":"17_CR37","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10623-010-9378-8","volume":"58","author":"T. Tassa","year":"2011","unstructured":"Tassa, T.: Generalized oblivious transfer by secret sharing. Des. Codes Cryptography\u00a058(1), 11\u201321 (2011)","journal-title":"Des. Codes Cryptography"},{"issue":"3","key":"17_CR38","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1008381427667","volume":"15","author":"M. Dijk van","year":"1998","unstructured":"van Dijk, M., Jackson, W.-A., Martin, K.M.: A general decomposition construction for incomplete secret sharing schemes. Des. Codes Cryptography\u00a015(3), 301\u2013321 (1998)","journal-title":"Des. Codes Cryptography"},{"issue":"4","key":"17_CR39","doi-asserted-by":"publisher","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.A.M., Schrijen, G.J., Tuyls, P.: Improved constructions of secret sharing schemes by applying (lambda, omega)-decompositions. Inform. Process. Lett.\u00a099(4), 154\u2013157 (2006)","journal-title":"Inform. Process. Lett."},{"key":"17_CR40","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02568125","volume":"20","author":"G. Vincent","year":"1947","unstructured":"Vincent, G.: Les groupes lineaires finis sans point fixes. Commentarii Mathematici Helvetici\u00a020, 117\u2013171 (1947)","journal-title":"Commentarii Mathematici Helvetici"},{"key":"17_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-19379-8_4","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"B. Waters","year":"2011","unstructured":"Waters, B.: Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol.\u00a06571, pp. 53\u201370. Springer, Heidelberg (2011)"},{"key":"17_CR42","unstructured":"Wolf, J.A.: Spaces of Constant Curvature, 5th edn. Publish or Perish, Inc. (1984)"},{"issue":"1","key":"17_CR43","doi-asserted-by":"publisher","first-page":"65","DOI":"10.4064\/aa150-1-4","volume":"150","author":"T. Xylouris","year":"2011","unstructured":"Xylouris, T.: On the least prime in an arithmetic progression and estimates for the zeros of Dirichlet L-functions. Acta Arith.\u00a0150(1), 65\u201391 (2011)","journal-title":"Acta Arith."},{"key":"17_CR44","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02940723","volume":"11","author":"H. Zassenhaus","year":"1935","unstructured":"Zassenhaus, H.: Uber endliche faskorper. Abhandlungen aus dem Mathematischen Seminar der Hamburgischen Universitat\u00a011, 187\u2013220 (1935)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Hamburgischen Universitat"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54242-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T19:09:03Z","timestamp":1746126543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54242-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642542411","9783642542428"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54242-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}