{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:26:32Z","timestamp":1774121192338,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987207","type":"print"},{"value":"9789819987214","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8721-4_4","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T05:01:44Z","timestamp":1702789304000},"page":"106-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and\u00a0Applications"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Escudero","sequence":"first","affiliation":[]},{"given":"Cheng","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Hongqing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Abdalla, M., Bourse, F., De Caro, A., Pointcheval, D.: Simple functional encryption schemes for inner products. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 733\u2013751. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_33","DOI":"10.1007\/978-3-662-46447-2_33"},{"key":"4_CR2","doi-asserted-by":"publisher","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: 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","DOI":"10.1007\/978-3-030-36030-6_19"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., Boyle, E., Gilboa, N., Halevi, S., Ishai, Y., Nof, A.: Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 129\u2013161. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_5","DOI":"10.1007\/978-3-030-90453-1_5"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Block, A.R., Maji, H.K., Nguyen, H.H.: Secure computation based on leaky correlations: high resilience setting. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 3\u201332. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_1","DOI":"10.1007\/978-3-319-63715-0_1"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 67\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Practical fully secure three-party computation via sublinear distributed zero-knowledge proofs. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 869\u2013886 (2019)","DOI":"10.1145\/3319535.3363227"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Efficient fully secure computation via distributed zero-knowledge proofs. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 244\u2013276. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_9","DOI":"10.1007\/978-3-030-64840-4_9"},{"key":"4_CR9","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-319-96878-0_14"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Cascudo, I., Giunta, E.: On interactive oracle proofs for Boolean R1CS statements. In: Eyal, I., Garay, J. (eds.) Financial Cryptography and Data Security: 26th International Conference, FC 2022, Grenada, 2\u20136 May 2022, Revised Selected Papers, pp. 230\u2013247. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_11","DOI":"10.1007\/978-3-031-18283-9_11"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Cascudo, I., Gundersen, J.S.: A secret-sharing based MPC protocol for boolean circuits with good amortized complexity. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 652\u2013682. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_23","DOI":"10.1007\/978-3-030-64378-2_23"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Lee, K.: Limits of polynomial packings for $$\\mathbb{Z}_{p^k}$$ and $$\\mathbb{F}_{p^k}$$. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, 30 May\u2013 3 June 2022, Proceedings, Part I, pp. 521\u2013550. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_18","DOI":"10.1007\/978-3-031-06944-4_18"},{"key":"4_CR13","doi-asserted-by":"publisher","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: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 769\u2013798. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_26","DOI":"10.1007\/978-3-319-96881-0_26"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342\u2013362. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_19","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Cramer, R., Rambaud, M., Xing, C.: Asymptotically-good arithmetic secret sharing over $$\\mathbb{Z}\/p^{\\ell }\\mathbb{Z}$$ with strong multiplication and its applications to efficient MPC. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 656\u2013686. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_22","DOI":"10.1007\/978-3-030-84252-9_22"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Escudero, D., Frederiksen, T., Keller, M., Scholl, P., Volgushev, N.: New primitives for actively-secure MPC over rings with applications to private machine learning. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 1102\u20131120. IEEE (2019)","DOI":"10.1109\/SP.2019.00078"},{"key":"4_CR17","unstructured":"Demmler, D., Schneider, T., Zohner, M.: $$\\{$$Ad-Hoc$$\\}$$ secure $$\\{$$Two-Party$$\\}$$ computation on mobile devices using hardware tokens. In: 23rd USENIX Security Symposium (USENIX Security 14), pp. 893\u2013908 (2014)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6) (1976)","DOI":"10.1109\/TIT.1976.1055638"},{"key":"4_CR19","unstructured":"Escudero, D., Liu, H., Xing, C., Yuan, C.: Degree-$$d$$ reverse multiplication-friendly embeddings: constructions and applications. Cryptology ePrint Archive, Paper 2023\/173 (2023). https:\/\/eprint.iacr.org\/2023\/173"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Escudero, D., Soria-Vazquez, E.: Efficient information-theoretic multi-party computation over non-commutative rings. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 335\u2013364. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_12","DOI":"10.1007\/978-3-030-84245-1_12"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Escudero, D., Xing, C., Yuan, C.: More efficient dishonest majority secure computation over $$\\mathbb{Z}_{2^k}$$ via\u00a0Galois rings. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, 15\u201318 August 2022, Proceedings, Part I, pp. 383\u2013412. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_14","DOI":"10.1007\/978-3-031-15802-5_14"},{"key":"4_CR22","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-Vladut bound. Invent. Math. 121, 211\u2013222 (1995)","journal-title":"Invent. Math."},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Gilboa, N., Ishai, Y.: Compressing cryptographic resources. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 591\u2013608. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_37","DOI":"10.1007\/3-540-48405-1_37"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Gordon, S.D., Starin, D., Yerukhimovich, A.: The more the Merrier: reducing the cost of large scale MPC. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 694\u2013723. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_24","DOI":"10.1007\/978-3-030-77886-6_24"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Huang, Y.: Practical secure two-party computation (2012)","DOI":"10.1109\/APSCC.2012.13"},{"key":"4_CR26","unstructured":"Kales, D., Zaverucha, G.: Efficient lifting for shorter zero-knowledge proofs and post-quantum signatures. IACR Cryptol. ePrint Arch, p. 588 (2022)"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Polychroniadou, A., Song, Y.: Constant-overhead unconditionally secure multiparty computation over binary fields. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 812\u2013841. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_28","DOI":"10.1007\/978-3-030-77886-6_28"},{"issue":"2","key":"4_CR30","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Tanguy, T.: TAAS: commodity MPC via triples-as-a-service. In: Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, pp. 105\u2013116 (2019)","DOI":"10.1145\/3338466.3358918"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 420\u2013443. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_25","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Soria-Vazquez, E.: Doubly efficient interactive proofs over infinite and non-commutative rings. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-22318-1_18"},{"key":"4_CR34","volume-title":"Algebraic Function Fields and Codes","author":"H Stichtenoth","year":"1993","unstructured":"Stichtenoth, H.: Algebraic Function Fields and Codes. Universitext, Springer (1993)"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Wan, Z.-X.: Lectures on Finite Fields and Galois Rings. World Scientific Publishing Company (2003)","DOI":"10.1142\/5350"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8721-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:12Z","timestamp":1765933332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8721-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987207","9789819987214"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8721-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","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":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","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":"375","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":"106","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","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":"12","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}