{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T18:40:43Z","timestamp":1775760043286,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540281146","type":"print"},{"value":"9783540318705","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535218_20","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T18:20:34Z","timestamp":1292869234000},"page":"327-343","source":"Crossref","is-referenced-by-count":20,"title":["On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vanesa","family":"Daza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio","family":"Gracia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge Jim\u00e9nez","family":"Urroz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregor","family":"Leander","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaume","family":"Mart\u00ed-Farr\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/S0895480199364148","volume":"15","author":"A. Barg","year":"2002","unstructured":"Barg, A.: On some polynomials related to weight enumerators of linear codes. SIAM J. Discrete Math.\u00a015, 155\u2013164 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-540-30576-7_32","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2005","unstructured":"Beimel, A., Tassa, T., Weinreb, E.: Characterizing Ideal Weighted Threshold Secret Sharing. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 600\u2013619. Springer, Heidelberg (2005)"},{"key":"20_CR3","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":"20_CR4","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":"20_CR5","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":"20_CR6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.37236\/1636","volume":"9","author":"T. Britz","year":"2002","unstructured":"Britz, T.: MacWilliams identities and matroid polynomials. Electron. J. Combin.\u00a09, 16 (2002), Research Paper 19","journal-title":"Electron. J. Combin."},{"key":"20_CR7","first-page":"10","volume":"9","author":"P.J. Cameron","year":"2002","unstructured":"Cameron, P.J.: Cycle index, weight enumerator, and Tutte polynomial. Electron. J. Combin.\u00a09, 10, Note 2 (2002)","journal-title":"Electron. J. Combin."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Proc. ACM STOC 1996. In: Proc. ACM STOC 1996, pp. 639\u2013648 (1996)","DOI":"10.1145\/237814.238015"},{"key":"20_CR9","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":"20_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)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, M., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proc. 19th ACM Symposium on the Theory of Computing STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/sapm1976552119","volume":"55","author":"C. Greene","year":"1976","unstructured":"Greene, C.: Weight enumeration and the geometry of linear codes. Studies in Appl. Math.\u00a055, 119\u2013128 (1976)","journal-title":"Studies in Appl. Math."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation. In: Proc. 16th Symposium on Principles of Distributed Computing PODC 1997, pp. 25\u201334 (1997)","DOI":"10.1145\/259380.259412"},{"key":"20_CR14","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing any access structure. In: Proc. IEEE Globecom, pp. 99\u2013102 (1987)"},{"key":"20_CR15","doi-asserted-by":"publisher","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.\u00a04, 83\u201395 (1994)","journal-title":"Des. Codes Cryptogr."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of the Eighth Annual Structure in Complexity Theory Conference, San Diego, CA, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"20_CR17","volume-title":"Introduction to Commutative Algebra and Algebraic Geometry","author":"E. Kunz","year":"1985","unstructured":"Kunz, E.: Introduction to Commutative Algebra and Algebraic Geometry. Birkh\u00e4user, Boston (1985)"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-36413-7_26","volume-title":"Security in Communication Networks","author":"J. Mart\u00ed-Farr\u00e9","year":"2003","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Secret sharing schemes on access structures with intersection number equal to one. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 354\u2013363. Springer, Heidelberg (2003)"},{"key":"20_CR19","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":"20_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1024741108241","volume":"30","author":"S.-L. Ng","year":"2003","unstructured":"Ng, S.-L.: A Representation of a Family of Secret Sharing Matroids. Des. Codes Cryptogr.\u00a030, 5\u201319 (2003)","journal-title":"Des. Codes Cryptogr."},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1011225330458","volume":"24","author":"S.-L. Ng","year":"2001","unstructured":"Ng, S.-L., Walker, M.: On the composition of matroids and ideal secret sharing schemes. Des. Codes Cryptogr.\u00a024, 49\u201367 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"20_CR22","volume-title":"Matroid theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid theory. Oxford Science Publications\/The Clarendon Press\/Oxford University Press, New York (1992)"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/BFb0054149","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"C. Padr\u00f3","year":"1998","unstructured":"Padr\u00f3, C., S\u00e1ez, G.: Secret sharing schemes with bipartite access structure. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 500\u2013511. Springer, Heidelberg (1998)"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0012-365X(92)90567-Y","volume":"106","author":"R. Pellikaan","year":"1992","unstructured":"Pellikaan, R.: On decoding by error location and dependent sets of error positions. Discrete Math.\u00a0106\/107, 369\u2013381 (1992)","journal-title":"Discrete Math."},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.4153\/CJM-2000-043-5","volume":"52","author":"Z. Reichstein","year":"2000","unstructured":"Reichstein, Z., Youssin, B.: Essential dimensions of algebraic groups and a resolution theorem for G-varieties. With an appendix by J\u00e1nos Koll\u00e1r and Endre Szab\u00f3. Canad. J. Math.\u00a052, 1018\u20131056 (2000)","journal-title":"Canad. J. Math."},{"key":"20_CR26","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":"20_CR27","first-page":"441","volume-title":"Contemporary Cryptology. The Science of Information Integrity","author":"G.J. Simmons","year":"1991","unstructured":"Simmons, G.J.: An introduction to shared secret and\/or shared control schemes and their application. In: Contemporary Cryptology. The Science of Information Integrity, pp. 441\u2013497. IEEE Press, Los Alamitos (1991)"},{"key":"20_CR28","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":"20_CR29","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":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-24638-1_26","volume-title":"Theory of Cryptography","author":"T. Tassa","year":"2004","unstructured":"Tassa, T.: Hierarchical Threshold Secret Sharing. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 473\u2013490. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535218_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T23:59:35Z","timestamp":1740787175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535218_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281146","9783540318705"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11535218_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}