{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:34Z","timestamp":1765113034649,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":47,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609376"},{"type":"electronic","value":"9789819609383"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0938-3_1","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:21:30Z","timestamp":1733941290000},"page":"3-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Actively Secure Polynomial Evaluation from\u00a0Shared Polynomial Encodings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1808-6140","authenticated-orcid":false,"given":"Pascal","family":"Reisert","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8005-8365","authenticated-orcid":false,"given":"Marc","family":"Rivinius","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0981-3553","authenticated-orcid":false,"given":"Toomas","family":"Krips","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0300-8350","authenticated-orcid":false,"given":"Sebastian","family":"Hasler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9071-9312","authenticated-orcid":false,"given":"Ralf","family":"K\u00fcsters","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Brakerski, Z., Tsabary, R.: Perfect secure computation in two rounds. In: Theory of Cryptography. pp. 152\u2013174. Springer (2018)","DOI":"10.1007\/978-3-030-03807-6_6"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Brakerski, Z., Tsabary, R.: Degree 2 is complete for the round-complexity of malicious mpc. In: EUROCRYPT 2019. pp. 504\u2013531. Springer (2019)","DOI":"10.1007\/978-3-030-17656-3_18"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC$$^{\\circ }$$. SIAM Journal on Computing 36(4), 845\u2013888 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: PODC 1989. pp. 201\u2013209. ACM (1989)","DOI":"10.1145\/72981.72995"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Baum, C., Cozzo, D., Smart, N.P.: Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ. In: SAC 2019. pp. 274\u2013302. Springer (2020)","DOI":"10.1007\/978-3-030-38471-5_12"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: CRYPTO \u201991. pp. 420\u2013432. Springer (1992)","DOI":"10.1007\/3-540-46766-1_34"},{"key":"1_CR7","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: ACNS 2019. pp. 530\u2013549. Springer (2019)"},{"key":"1_CR8","first-page":"1024","volume":"2019","author":"D Bitan","year":"2019","unstructured":"Bitan, D., Dolev, S.: Optimal-Round Preprocessing-MPC via Polynomial Representation and Distributed Random Matrix (extended abstract). IACR Cryptol. ePrint Arch. 2019, \u00a01024 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Boura, C., Chillotti, I., Gama, N., Jetchev, D., Peceny, S., Petric, A.: High-precision privacy-preserving real-valued function evaluation. In: FC 2018. pp. 183\u2013202. Springer (2018)","DOI":"10.1007\/978-3-662-58387-6_10"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In: CRYPTO 2019. pp. 489\u2013518. Springer (2019)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) Fully Homomorphic Encryption Without Bootstrapping. In: ITCS 2012. pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: FOCS 2001. pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15317-4_13","volume-title":"Security and Cryptography for Networks","author":"O Catrina","year":"2010","unstructured":"Catrina, O., de\u00a0Hoogh, S.: Improved Primitives for Secure Multiparty Integer Computation. In: SCN 2010. pp. 182\u2013199. Springer (2010)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-030-64840-4_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"H Chen","year":"2020","unstructured":"Chen, H., Kim, M., Razenshteyn, I.P., Rotaru, D., Song, Y., Wagh, S.: Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning. In: ASIACRYPT 2020. pp. 31\u201359. Springer (2020)"},{"issue":"6","key":"1_CR15","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1038\/nbt.4108","volume":"36","author":"H Cho","year":"2018","unstructured":"Cho, H., Wu, D., Berger, B.: Secure genome-wide association analysis using multiparty computation, supplementary notes 3. Nat. Biotechnol. 36(6), 547\u2013551 (2018)","journal-title":"Nat. Biotechnol."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Couteau, G.: A note on the communication complexity of multiparty computation in the correlated randomness model. In: EUROCRYPT. pp. 473\u2013503. Springer (2019)","DOI":"10.1007\/978-3-030-17656-3_17"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44647-8_7","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.: Secure Distributed Linear Algebra in a Constant Number of Rounds. In: CRYPTO 2001. pp. 119\u2013136. Springer (2001)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient multi-party computation over rings. In: Biham, E. (ed.) Advances in Cryptology \u2014 EUROCRYPT 2003. pp. 596\u2013613. Springer Berlin Heidelberg, Berlin, Heidelberg (2003)","DOI":"10.1007\/3-540-39200-9_37"},{"key":"1_CR19","unstructured":"Dahl, M.: Cryptography and machine learning (2017), Blog on the SPDZ protocol - part 2"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In: TCC 2006. pp. 285\u2013304. Springer (2006)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority \u2013 or: Breaking the SPDZ limits. In: ESORICS 2013. pp. 1\u201318. Springer (2013)","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: CRYPTO. pp. 643\u2013662. Springer (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/978-3-030-56880-1_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Escudero","year":"2020","unstructured":"Escudero, D., Ghosh, S., Keller, M., Rachuri, R., Scholl, P.: Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. In: CRYPTO 2020. pp. 823\u2013852. Springer (2020)"},{"issue":"3","key":"1_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10623-011-9515-z","volume":"62","author":"H Ghodosi","year":"2012","unstructured":"Ghodosi, H., Pieprzyk, J., Steinfeld, R.: Multi-party computation with conversion of secret sharing. Des. Codes Cryptogr. 62(3), 259\u2013272 (2012)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.56553\/popets-2024-0038","volume":"2","author":"S Hasler","year":"2024","unstructured":"Hasler, S., Reisert, P., Rivinius, M., K\u00fcsters, R.: Multipars: Reduced-Communication MPC over Z2k. Proceedings on Privacy Enhancing Technologies (2), 5\u201328 (2024)","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: FOCS. pp. 294\u2013304 (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"key":"1_CR27","unstructured":"Ishai, Y.: Randomization techniques for secure computation. In: Secure Multi-Party Computation (2013)"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-36594-2_34","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2013","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the Power of Correlated Randomness in Secure Computation. In: TCC 2013. pp. 600\u2013620. Springer (2013)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Keller, M.: MP-SPDZ: A Versatile Framework for Multi-Party Computation. In: CCS \u201920. pp. 1575\u20131590. ACM (2020)","DOI":"10.1145\/3372297.3417872"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: Faster malicious arithmetic secure computation with oblivious transfer. In: CCS 2016. pp. 830\u2013842. ACM (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Keller, M., Pastro, V., Rotaru, D.: Overdrive: Making SPDZ great again. In: EUROCRYPT 2018. pp. 158\u2013189. Springer (2018)","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"1_CR32","unstructured":"Keller, M., Sun, K.: Secure Quantized Training for Deep Learning. CoRR abs\/2107.00501 (2021)"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V.: Gate evaluation secret sharing and secure one-round two-party computation. In: ASIACRYPT 2005. pp. 136\u2013155. Springer (2005)","DOI":"10.1007\/11593447_8"},{"issue":"11","key":"1_CR34","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proceedings of the IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proceedings of the IEEE"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Lin, H., Liu, T.: Two-Round MPC Without Round Collapsing Revisited \u2013 Towards Efficient Malicious Protocols. In: CRYPTO. pp. 353\u2013382. Springer (2022)","DOI":"10.1007\/978-3-031-15802-5_13"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Lin, H., Liu, T., Wee, H.: Information-theoretic 2-round MPC without round collapsing: adaptive security, and more. In: TCC 2020. pp. 502\u2013531. Springer (2020)","DOI":"10.1007\/978-3-030-64378-2_18"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Liu, J., Juuti, M., Lu, Y., Asokan, N.: Oblivious Neural Network Predictions via MiniONN Transformations. In: CCS 2017. pp. 619\u2013631. ACM (2017)","DOI":"10.1145\/3133956.3134056"},{"issue":"1","key":"1_CR38","first-page":"396","volume":"2022","author":"D Lu","year":"2022","unstructured":"Lu, D., Yu, A., Kate, A., Maji, H.K.: Polymath: Low-Latency MPC via Secure Polynomial Evaluations and Its Applications. PETS 2022 (1), 396\u2013416 (2022)","journal-title":"PETS"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Zhang, Y.: SecureML: A System for Scalable Privacy-Preserving Machine Learning. In: SP 2017. pp. 19\u201338. IEEE Computer Society (2017)","DOI":"10.1109\/SP.2017.12"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-030-51280-4_20","volume-title":"Financial Cryptography and Data Security","author":"S Ohata","year":"2020","unstructured":"Ohata, S., Nuida, K.: Communication-Efficient (Client-Aided) Secure Two-Party Protocols and Its Application. In: FC 2020. pp. 369\u2013385. Springer (2020)"},{"key":"1_CR41","unstructured":"Patra, A., Schneider, T., Suresh, A., Yalame, H.: ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation. In: USENIX Security 2021. pp. 2165\u20132182. USENIX Association (2021)"},{"key":"1_CR42","unstructured":"Reisert, P., Rivinius, M., Krips, T., Hasler, S., K\u00fcsters, R.: Actively Secure Polynomial Evaluation from Shared Polynomial Encodings (Full Version). Crypt. ePrint 2024\/1435 (2024)"},{"key":"1_CR43","unstructured":"Reisert, P., Rivinius, M., Krips, T., Hasler, S., K\u00fcsters, R.: Implementation to Actively Secure Polynomial Evaluation from Shared Polynomial Encodings (2024), Website of the Insitute of Information Security Stuttgart"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Reisert, P., Rivinius, M., Krips, T., K\u00fcsters, R.: Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice. In: ACM ASIA CCS 2023 (2023)","DOI":"10.1145\/3579856.3582809"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Riazi, M.S., Weinert, C., Tkachenko, O., Songhori, E.M., Schneider, T., Koushanfar, F.: Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications. In: AsiaCCS 2018. pp. 707\u2013721. ACM (2018)","DOI":"10.1145\/3196494.3196522"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Rivinius, M., Reisert, P., Hasler, S., K\u00fcsters, R.: Convolutions in Overdrive: Maliciously Secure Convolutions for MPC. In: PETS 2023 (2023)","DOI":"10.56553\/popets-2023-0084"},{"issue":"3","key":"1_CR47","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2478\/popets-2019-0035","volume":"2019","author":"S Wagh","year":"2019","unstructured":"Wagh, S., Gupta, D., Chandran, N.: SecureNN: 3-Party Secure Computation for Neural Network Training. Proc. Priv. Enhancing Technol. 2019(3), 26\u201349 (2019)","journal-title":"Proc. Priv. Enhancing Technol."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0938-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:29:14Z","timestamp":1733945354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0938-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609376","9789819609383"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0938-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}