{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T18:43:40Z","timestamp":1749494620181,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":36,"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_10","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:22:54Z","timestamp":1733941374000},"page":"299-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dishonest Majority Multiparty Computation over\u00a0Matrix Rings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2013-8725","authenticated-orcid":false,"given":"Hongqing","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1257-1033","authenticated-orcid":false,"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3730-8397","authenticated-orcid":false,"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7129-3036","authenticated-orcid":false,"given":"Taoxu","family":"Zou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"10_CR1","unstructured":"Lattigo v5. Online: https:\/\/github.com\/tuneinsight\/lattigo (Nov 2023), ePFL-LDS, Tune Insight SA"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Abspoel, M., Cramer, R., Damg\u00e5rd, I., Escudero, D., Rambaud, M., Xing, C., Yuan, C.: Asymptotically good multiplicative LSSS over galois rings and applications to MPC over $$\\mathbb{Z}\/p^{k}\\mathbb{Z}$$. In: ASIACRYPT 2020. LNCS, vol. 12493, pp. 151\u2013180. Springer (2020)","DOI":"10.1007\/978-3-030-64840-4_6"},{"key":"10_CR3","doi-asserted-by":"crossref","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 galois rings. In: TCC 2019. LNCS, vol. 11891, pp. 471\u2013501. Springer (2019)","DOI":"10.1007\/978-3-030-36030-6_19"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Damg\u00e5rd, I., Ishai, Y., Nielsen, M., Zichron, L.: Secure arithmetic computation with constant computational overhead. In: CRYPTO 2017. LNCS, vol. 10401, pp. 223\u2013254. Springer (2017)","DOI":"10.1007\/978-3-319-63688-7_8"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Konstantini, N.: Actively secure arithmetic computation and VOLE with constant computational overhead. In: EUROCRYPT 2023. LNCS, vol. 14005, pp. 190\u2013219. Springer (2023)","DOI":"10.1007\/978-3-031-30617-4_7"},{"key":"10_CR6","unstructured":"B.\u00a0Gladman, W.H., J.\u00a0Moxham, e.a.: MPIR: Multiple Precision Integers and Rationals (2015), version 2.7.0, http:\/\/mpir.org"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.3233\/JCS-200116","volume":"30","author":"C Baum","year":"2022","unstructured":"Baum, C., Escudero, D., Pedrouzo-Ulloa, A., Scholl, P., Troncoso-Pastoriza, J.R.: Efficient protocols for oblivious linear function evaluation from ring-lwe. J. Comput. Secur. 30(1), 39\u201378 (2022)","journal-title":"J. Comput. Secur."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: CRYPTO \u201991. LNCS, vol.\u00a0576, pp. 420\u2013432. Springer (1991)","DOI":"10.1007\/3-540-46766-1_34"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Efraim, A., Nielsen, M., Omri, E.: Turbospeedz: Double your online spdz! improving SPDZ using function dependent preprocessing. In: ACNS 2019. LNCS, vol. 11464, pp. 530\u2013549. Springer (2019)","DOI":"10.1007\/978-3-030-21568-2_26"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: ACM CCS 2018. pp. 896\u2013912. ACM (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N., Scholl, P.: Correlated pseudorandomness from expand-accumulate codes. In: CRYPTO 2022. LNCS, vol. 13508, pp. 603\u2013633. Springer (2022)","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"10_CR12","doi-asserted-by":"crossref","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. LNCS, vol. 11694, pp. 489\u2013518. Springer (2019)","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators from ring-lpn. In: CRYPTO 2020. LNCS, vol. 12171, pp. 387\u2013416. Springer (2020)","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical gapsvp. In: CRYPTO 2012. LNCS, vol.\u00a07417, pp. 868\u2013886. Springer (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"10_CR15","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":"10_CR16","doi-asserted-by":"crossref","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. LNCS, vol. 12493, pp. 31\u201359. Springer (2020)","DOI":"10.1007\/978-3-030-64840-4_2"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: Silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In: CRYPTO 2021. LNCS, vol. 12827, pp. 502\u2013534. Springer (2021)","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Escudero, D., Scholl, P., Xing, C.: Spd$$\\mathbb{Z}_{2^k}$$: Efficient MPC mod $$2^k$$ for dishonest majority. In: CRYPTO 2018. LNCS, vol. 10992, pp. 769\u2013798. Springer (2018)","DOI":"10.1007\/978-3-319-96881-0_26"},{"key":"10_CR19","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 - or: Breaking the SPDZ limits. In: ESORICS 2013. LNCS, vol.\u00a08134, pp. 1\u201318. Springer (2013)","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: CRYPTO 2012. LNCS, vol.\u00a07417, pp. 643\u2013662. Springer (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Escudero, D., Goyal, V., Polychroniadou, A., Song, Y., Weng, C.: Superpack: Dishonest majority MPC with constant online communication. In: EUROCRYPT 2023. LNCS, vol. 14005, pp. 220\u2013250. Springer (2023)","DOI":"10.1007\/978-3-031-30617-4_8"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Escudero, D., Soria-Vazquez, E.: Efficient information-theoretic multi-party computation over non-commutative rings. In: CRYPTO 2021. LNCS, vol. 12826, pp. 335\u2013364. Springer (2021)","DOI":"10.1007\/978-3-030-84245-1_12"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Escudero, D., Xing, C., Yuan, C.: More efficient dishonest majority secure computation over $$\\mathbb{Z}_{2^k}$$ via galois rings. In: CRYPTO 2022. LNCS, vol. 13507, pp. 383\u2013412. Springer (2022)","DOI":"10.1007\/978-3-031-15802-5_14"},{"key":"10_CR24","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. p.\u00a0144 (2012), http:\/\/eprint.iacr.org\/2012\/144"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Jiang, X., Kim, M., Lauter, K.E., Song, Y.: Secure outsourced matrix computation and application to neural networks. In: CCS 2018. pp. 1209\u20131222. ACM (2018)","DOI":"10.1145\/3243734.3243837"},{"key":"10_CR26","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: The hardness of LPN over any integer ring and field for PCG applications. IACR Cryptol. ePrint Arch. p.\u00a0712 (2022), https:\/\/eprint.iacr.org\/2022\/712"},{"key":"10_CR27","unstructured":"Liu, H., Xing, C., Yuan, C., Zou, T.: Dishonest majority multiparty computation over matrix rings. IACR Cryptol. ePrint Arch. p.\u00a01912 (2023), https:\/\/eprint.iacr.org\/2023\/1912"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Liu, J., Juuti, M., Lu, Y., Asokan, N.: Oblivious neural network predictions via minionn transformations. In: ACM CCS 2017. pp. 619\u2013631. ACM (2017)","DOI":"10.1145\/3133956.3134056"},{"key":"10_CR29","unstructured":"Mohassel, P., Rindal, P.: Aby$$ ^{\\text{3}}$$: A mixed protocol framework for machine learning. In: ACM CCS 2018. pp. 35\u201352. ACM (2018)"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Zhang, Y.: Secureml: A system for scalable privacy-preserving machine learning. In: 2017 IEEE Symposium on Security and Privacy (SP). pp. 19\u201338. IEEE Computer Society (2017)","DOI":"10.1109\/SP.2017.12"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Orsini, E., Smart, N.P., Vercauteren, F.: Overdrive2k: Efficient secure MPC over $$\\mathbb{Z}_{2^k}$$ from somewhat homomorphic encryption. In: CT-RSA 2020. LNCS, vol. 12006, pp. 254\u2013283. Springer (2020)","DOI":"10.1007\/978-3-030-40186-3_12"},{"key":"10_CR32","unstructured":"Peter\u00a0Rindal, L.R.: libOTe: an efficient, portable, and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Rachuri, R., Scholl, P.: Le mans: Dynamic and fluid MPC for dishonest majority. In: CRYPTO 2022. LNCS, vol. 13507, pp. 719\u2013749. Springer (2022)","DOI":"10.1007\/978-3-031-15802-5_25"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-convolute codes for pseudorandom correlation generators from LPN. In: CRYPTO 2023. LNCS, vol. 14084, pp. 602\u2013632. Springer (2023)","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-ole: Improved constructions and implementation. In: ACM CCS 2019. pp. 1055\u20131072. ACM (2019)","DOI":"10.1145\/3319535.3363228"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: Fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy (SP). pp. 1074\u20131091. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00056"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:30:48Z","timestamp":1733945448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0938-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609376","9789819609383"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0938-3_10","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"}}]}}