{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T14:52:03Z","timestamp":1784299923644,"version":"3.55.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030643805","type":"print"},{"value":"9783030643812","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64381-2_16","type":"book-chapter","created":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T18:04:25Z","timestamp":1607796265000},"page":"444-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Complexity of Arithmetic Secret Sharing"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"16_CR2","unstructured":"Alekhnovich, M.: Linear Diophantine equations over polynomials and soft decoding of Reed-Solomon codes. In: Proceedings of the FOCS 2002, Vancouver, BC, pp. 439-448 (2002)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/11818175_31"},{"issue":"7","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1073\/pnas.84.7.1739","volume":"84","author":"DV Chudnovsky","year":"1987","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Algebraic complexities and algebraic curves over finite fields. Proc. Nat. Acad. Sci. U.S.A. 84(7), 1739\u20131743 (1987)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_28"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-78967-3_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"H Chen","year":"2008","unstructured":"Chen, H., Cramer, R., de Haan, R., Pueyo, I.C.: Strongly multiplicative ramp schemes from high degree rational points on curves. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 451\u2013470. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_26"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1137\/130931886","volume":"29","author":"I Cascudo","year":"2015","unstructured":"Cascudo, I., Cramer, R., Mirandola, D., Padr\u00f3, C., Xing, C.: On secret sharing with nonlinear product reconstruction. SIAM J. Discrete Math. 29(2), 1114\u20131131 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1109\/TIT.2015.2393251","volume":"61","author":"I Cascudo","year":"2015","unstructured":"Cascudo, I., Cramer, R., Mirandola, D., Z\u00e9mor, G.: Squares of random linear codes. IEEE Trans. Inf. Theory 61(3), 1159\u20131173 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_39"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-319-96878-0_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"I Cascudo","year":"2018","unstructured":"Cascudo, I., Cramer, R., Xing, C., Yuan, C.: Amortized complexity of information-theoretically secure MPC revisited. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 395\u2013426. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_14"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S.: On the complexity of verifiable secret sharing and multi-party computation. In: STOC 2000, pp. 325\u2013334 (2000)","DOI":"10.1145\/335305.335343"},{"key":"16_CR12","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 \u2014 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. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_22"},{"key":"16_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damgard, I., Nielsen, J.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, Cambridge (2015)"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TIT.1966.1053873","volume":"12","author":"GD Forney","year":"1966","unstructured":"Forney, G.D.: Generalized minimum distance decoding. IEEE Trans. Inf. Theory 12(2), 125\u2013131 (1966)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR15","doi-asserted-by":"publisher","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. Invent. Math. 121, 211\u2013222 (1995)","journal-title":"Invent. Math."},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/jnth.1996.0147","volume":"61","author":"A Garcia","year":"1996","unstructured":"Garcia, A., Stichtenoth, H.: On the asymptotic behaviour of some towers of function fields over finite fields. J. Number Theory 61(2), 248\u2013273 (1996)","journal-title":"J. Number Theory"},{"key":"16_CR17","unstructured":"Guruswami, V., Rudra, A., Sudan, M.: Essential Coding Theory. https:\/\/cse.buffalo.edu\/faculty\/atri\/courses\/coding-theory\/book\/web-coding-book.pdf"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Xing, C.: Hitting sets for low-degree polynomials with optimal density. In: CCC, pp. 161\u2013168 (2014)","DOI":"10.1109\/CCC.2014.24"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"16_CR20","unstructured":"Massey, L., Farrell, P.G.: Some applications of coding theory in cryptography. In: Codes and Ciphers Cryptography and Coding IV, pp. 33\u201347. Formara Lt, Esses, England (1995)"},{"issue":"7","key":"16_CR21","doi-asserted-by":"publisher","first-page":"4928","DOI":"10.1109\/TIT.2015.2450207","volume":"61","author":"D Mirandola","year":"2015","unstructured":"Mirandola, D., Z\u00e9mor, G.: Critical pairs for the product singleton bound. IEEE Trans. Inf. Theory 61(7), 4928\u20134937 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"16_CR22","doi-asserted-by":"publisher","first-page":"6010","DOI":"10.1109\/TIT.2019.2930538","volume":"65","author":"AK Narayanan","year":"2019","unstructured":"Narayanan, A.K., Weidner, M.: Subquadratic time encodable codes beating the Gilbert-Varshamov bound. IEEE Trans. Inf. Theory 65(10), 6010\u20136021 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"16_CR23","doi-asserted-by":"publisher","first-page":"7936","DOI":"10.1109\/TIT.2013.2281145","volume":"59","author":"H Randriambololona","year":"2013","unstructured":"Randriambololona, H.: An upper bound of singleton type for componentwise products of linear codes. IEEE Trans. Inform. Theor. 59(12), 7936\u20137939 (2013)","journal-title":"IEEE Trans. Inform. Theor."},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Randriambololona, H.: On products and powers of linear codes under componentwise multiplication, In: Contemporary Mathematics, vol. 637. AMS, Providence (2015)","DOI":"10.1090\/conm\/637\/12749"},{"key":"16_CR25","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BFb0087999","volume-title":"Coding Theory and Algebraic Geometry","author":"IE Shparlinski","year":"1992","unstructured":"Shparlinski, I.E., Tsfasman, M.A., Vladut, S.G.: Curves with many points and multiplication in finite fileds. In: Stichtenoth, H., Tsfasman, M.A. (eds.) Coding Theory and Algebraic Geometry. LNM, vol. 1518, pp. 145\u2013169. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0087999"},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1109\/18.945244","volume":"47","author":"K Shum","year":"2001","unstructured":"Shum, K., Aleshnikov, I., Kumar, P.V., Stichtenoth, H., Deolalikar, V.: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. IEEE Trans. Inf. Theory 47, 2225\u20132241 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic Function Fields and Codes","author":"H Stichtenoth","year":"2009","unstructured":"Stichtenoth, H.: Algebraic Function Fields and Codes, 2nd edn. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-540-76878-4","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64381-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T01:09:21Z","timestamp":1702343361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64381-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643805","9783030643812"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64381-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}