{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:00:50Z","timestamp":1725858050204},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319401881"},{"type":"electronic","value":"9783319401898"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40189-8_7","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T11:34:07Z","timestamp":1465817647000},"page":"68-77","source":"Crossref","is-referenced-by-count":1,"title":["Secret Sharing Schemes with Algebraic Properties and Applications"],"prefix":"10.1007","author":[{"given":"Ignacio","family":"Cascudo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of STOC 1988, pp. 1\u201310. ACM Press (1988)","DOI":"10.1145\/62212.62213"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1007\/978-3-642-03356-8_28","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Cascudo","year":"2009","unstructured":"Cascudo, I., Chen, H., Cramer, R., Xing, C.: Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 466\u2013486. Springer, Heidelberg (2009)"},{"issue":"3","key":"7_CR3","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1109\/TIT.2015.2393251","volume":"61","author":"I Cascudo","year":"2015","unstructured":"Cascudo, I., Cramer, R., Mirandola, D., Zemor, G.: Squares of random linear codes. IEEE Trans. Inf. Theor. 61(3), 1159\u20131173 (2015)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/978-3-642-22792-9_39","volume-title":"advances in cryptology \u2013 crypto 2011","author":"I Cascudo","year":"2011","unstructured":"Cascudo, I., Cramer, R., Xing, C.: The torsion-limit for algebraic function fields and its application to arithmetic secret sharing. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 685\u2013705. Springer, Heidelberg (2011)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Cascudo, I., Cramer, R., Xing, C.: The arithmetic codex. In: Proceedings of IEEE Information Theory Workshop (ITW 2012), pp. 75\u201379 (2012)","DOI":"10.1109\/ITW.2012.6404767"},{"issue":"9","key":"7_CR6","doi-asserted-by":"crossref","first-page":"5600","DOI":"10.1109\/TIT.2013.2264504","volume":"59","author":"I Cascudo","year":"2013","unstructured":"Cascudo, I., Cramer, R., Xing, C.: Bounds on the threshold gap in secret sharing and its applications. IEEE Trans. Inf. Theor. 59(9), 5600\u20135612 (2013)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"7","key":"7_CR7","doi-asserted-by":"crossref","first-page":"3871","DOI":"10.1109\/TIT.2014.2314099","volume":"60","author":"I Cascudo","year":"2014","unstructured":"Cascudo, I., Cramer, R., Xing, C.: Torsion limits and Riemann-Roch systems for function fields and applications. IEEE Trans. Inf. Theor. 60(7), 3871\u20133888 (2014)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/978-3-662-46447-2_22","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"I Cascudo","year":"2015","unstructured":"Cascudo, I., Damg\u00e5rd, I., David, B., Giacomelli, I., Nielsen, J.B., Trifiletti, R.: Additively homomorphic UC commitments with optimal amortized overhead. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 495\u2013515. Springer, Heidelberg (2015)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multi-party unconditionally secure protocols. In: Proceedings of STOC 1988, pp. 11\u201319. ACM Press (1988)","DOI":"10.1145\/62212.62214"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/11818175_31","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"H Chen","year":"2006","unstructured":"Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 521\u2013536. Springer, Heidelberg (2006)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"H Chen","year":"2007","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure computation from random error correcting codes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 291\u2013310. Springer, Heidelberg (2007)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 1807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"7_CR13","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing - An Information Theoretic Approach. Cambridge University Press"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-642-32284-6_4","volume-title":"Information Theoretic Security","author":"R Cramer","year":"2012","unstructured":"Cramer, R., Damg\u00e5rd, I., Pastro, V.: On the amortized complexity of zero knowledge protocols for multiplicative relations. In: Smith, A. (ed.) ICITS 2012. LNCS, vol. 7412, pp. 62\u201379. Springer, Heidelberg (2012)"},{"key":"7_CR15","unstructured":"Cramer, R., Xing, C., Yuan, C.: On Multi-point Local Decoding of Reed-Muller Codes. Manuscript (2016). http:\/\/arxiv.org\/abs\/1604.01925"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-662-45608-8_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"I Damg\u00e5rd","year":"2014","unstructured":"Damg\u00e5rd, I., David, B., Giacomelli, I., Nielsen, J.B.: Compact VSS and efficient homomorphic UC commitments. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part II. LNCS, vol. 8874, pp. 213\u2013232. Springer, Heidelberg (2014)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1007\/978-3-642-36594-2_35","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Zakarias, S.: Constant-overhead secure computation of Boolean circuits using preprocessing. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 621\u2013641. Springer, Heidelberg (2013)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-662-49096-9_23","volume-title":"Theory of Cryptography","author":"TK Frederiksen","year":"2016","unstructured":"Frederiksen, T.K., Jakobsen, T.P., Nielsen, J.B., Trifiletti, R.: On the complexity of additively homomorphic UC commitments. In: Kushilevitz, E., et al. (eds.) TCC 2016-A. LNCS, vol. 9562, pp. 542\u2013565. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49096-9_23"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01884295","volume":"121","author":"A Garcia","year":"1995","unstructured":"Garcia, A., Stichtenoth, H.: A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vl\u01cedu\u0163 bound. Inventiones Math. 121, 211\u2013222 (1995)","journal-title":"Inventiones Math."},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/978-3-540-78524-8_22","volume-title":"Theory of Cryptography","author":"D Harnik","year":"2008","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: OT-combiners via secure computation. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 393\u2013411. Springer, Heidelberg (2008)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/978-3-642-22792-9_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Y Ishai","year":"2011","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A., Wullschleger, J.: Constant-rate oblivious transfer from noisy channels. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 667\u2013684. Springer, Heidelberg (2011)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Proceedings of 39th STOC, San Diego, CA, USA, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Extracting correlations. In: Proceedings of 50th IEEE FOCS, pp. 261\u2013270 (2009)","DOI":"10.1109\/FOCS.2009.56"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"7_CR25","unstructured":"Massey., J.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory (1993)"},{"issue":"11","key":"7_CR26","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(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Pursuit of the Universal"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40189-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T13:45:04Z","timestamp":1568036704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}