{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T11:43:04Z","timestamp":1786794184869,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030920746","type":"print"},{"value":"9783030920753","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92075-3_8","type":"book-chapter","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T19:21:35Z","timestamp":1638300095000},"page":"222-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improved Single-Round Secure Multiplication Using Regenerating Codes"],"prefix":"10.1007","author":[{"given":"Mark","family":"Abspoel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronald","family":"Cramer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Escudero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-030-36030-6_19","volume-title":"Theory of Cryptography","author":"M Abspoel","year":"2019","unstructured":"Abspoel, M., Cramer, R., Damg\u00e5rd, I., Escudero, D., Yuan, C.: Efficient information-theoretic secure multiparty computation over $$\\mathbb{Z}\/p^k\\mathbb{Z}$$ via\u00a0Galois rings. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 471\u2013501. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_19"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-21568-2_26","volume-title":"Applied Cryptography and Network Security","author":"A Ben-Efraim","year":"2019","unstructured":"Ben-Efraim, A., Nielsen, M., Omri, E.: Turbospeedz: double your online SPDZ! improving SPDZ using function dependent preprocessing. In: Deng, R.H., Gauthier-Uma\u00f1a, V., Ochoa, M., Yung, M. (eds.) ACNS 2019. LNCS, vol. 11464, pp. 530\u2013549. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_26"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09375-2","volume":"34","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. J. Cryptol. 34(2), 1\u201365 (2021)","journal-title":"J. Cryptol."},{"key":"8_CR4","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"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.46586\/tches.v2018.i1.118-141","volume":"2018","author":"H Chabanne","year":"2018","unstructured":"Chabanne, H., Maghrebi, H., Prouff, E.: Linear repairing codes and side-channel attacks. IACR Trans. Cryptographic Hardware Embedded Syst. 2018(1), 118\u2013141 (2018)","journal-title":"IACR Trans. Cryptographic Hardware Embedded Syst."},{"key":"8_CR6","unstructured":"Choudhuri, A.R., Goel, A., Green, M., Jain, A., Kaptchuk, G.: Fluid MPC: secure multiparty computation with dynamic participants. Cryptology ePrint Archive, Report 2020\/754 (2020). https:\/\/eprint.iacr.org\/2020\/754"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, Cambridge (2015). ISBN 9781107043053. www.cambridge.org\/de\/academic\/subjects\/computer-science\/cryptography-cryptology-and-coding\/secure-multiparty-computation-and-secret-sharing?format=HB&isbn=9781107043053","DOI":"10.1017\/CBO9781107337756"},{"key":"8_CR8","unstructured":"Cramer, R., Rambaud, M., Xing, C.: Asymptotically-good arithmetic secret sharing over $${Z}\/(p^\\ell {Z})$$ with strong multiplication and its applications to efficient MPC. Cryptology ePrint Archive, Report 2019\/832 (2019). https:\/\/eprint.iacr.org\/2019\/832"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-26951-7_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"I Damg\u00e5rd","year":"2019","unstructured":"Damg\u00e5rd, I., Larsen, K.G., Nielsen, J.B.: Communication lower bounds for statistically secure MPC, with or without preprocessing. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 61\u201384. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_3"},{"key":"8_CR11","unstructured":"Escudero, D., Dalskov, A.: Honest majority MPC with abort with minimal online communication. Cryptology ePrint Archive, Report 2020\/1556 (2020). https:\/\/eprint.iacr.org\/2020\/1556"},{"key":"8_CR12","unstructured":"Guruswami, V., Wootters, M.: Repairing Reed-Solomon codes. CoRR, abs\/1509.04764 (2015). Note, we specifically refer to the version published on arXiv"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Guruswami, V., Wootters, M.: Repairing Reed-Solomon codes. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 216\u2013226. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897525","DOI":"10.1145\/2897518.2897525"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-24676-3_26","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y Ishai","year":"2004","unstructured":"Ishai, Y., Kushilevitz, E.: On the hardness of information-theoretic multiparty computation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 439\u2013455. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_26"},{"issue":"9","key":"8_CR15","doi-asserted-by":"publisher","first-page":"5882","DOI":"10.1109\/TIT.2013.2264797","volume":"59","author":"G Quintin","year":"2013","unstructured":"Quintin, G., Barbier, M., Chabot, C.: On generalized Reed-Solomon codes over commutative and noncommutative rings. IEEE Trans. Inf. Theory 59(9), 5882\u20135897 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"8_CR16","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"KV Rashmi","year":"2011","unstructured":"Rashmi, K.V., Shah, N.B., Kumar, P.V.: Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans. Inf. Theory 57(8), 5227\u20135239 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Rashmi, K.V., Shah, N.B., Ramchandran, K., Kumar, P.V.: Regenerating codes for errors and erasures in distributed storage. In: 2012 IEEE International Symposium on Information Theory Proceedings, pp. 1202\u20131206. IEEE (2012)","DOI":"10.1109\/ISIT.2012.6283046"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Tamo, I., Ye, M., Barg, A.: Optimal repair of Reed-Solomon codes: achieving the cut-set bound. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 216\u2013227. IEEE (2017)","DOI":"10.1109\/FOCS.2017.28"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Wan, Z.-X.: Lectures on Finite Fields and Galois Rings. World Scientific Publishing Company (2003). ISBN 978-9812385048. https:\/\/doi.org\/10.1142\/5350","DOI":"10.1142\/5350"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Wigderson, A., Or, M.B., Goldwasser, S.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC 1988), pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92075-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:05:54Z","timestamp":1732925154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92075-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030920746","9783030920753"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92075-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"341","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":"95","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":"28% - 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":"3.21","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":"4.61","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":"The conference was held online due to the COVID-19 pandemic","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)"}}]}}