{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:37:54Z","timestamp":1780634274803,"version":"3.54.1"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306334","type":"print"},{"value":"9783031306341","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-3-031-30634-1_9","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T23:03:07Z","timestamp":1681513387000},"page":"255-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["From Farfalle to\u00a0Megafono via\u00a0Ciminion: The PRF Hydra for\u00a0MPC Applications"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Grassi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Morten","family":"\u00d8ygarden","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Schofnegger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roman","family":"Walch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-030-75539-3_3","volume-title":"Topics in Cryptology \u2013 CT-RSA 2021","author":"D Abram","year":"2021","unstructured":"Abram, D., Damg\u00e5rd, I., Scholl, P., Trieflinger, S.: Oblivious TLS via multi-party computation. In: Paterson, K.G. (ed.) CT-RSA 2021. LNCS, vol. 12704, pp. 51\u201374. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_3"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-29962-0_8","volume-title":"Computer Security \u2013 ESORICS 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., et al.: Feistel structures for MPC, and more. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11736, pp. 151\u2013171. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_8"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-53887-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 191\u2013219. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Aly, A., Ashur, T., Ben-Sasson, E., Dhooghe, S., Szepieniec, A.: Design of symmetric-key primitives for advanced cryptographic protocols. IACR Trans. Symm. Cryptol. 2020(3), 1\u201345 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i3.1-45","DOI":"10.13154\/tosc.v2020.i3.1-45"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-030-34621-8_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"E Andreeva","year":"2019","unstructured":"Andreeva, E., Lallemand, V., Purnal, A., Reyhanitabar, R., Roy, A., Viz\u00e1r, D.: Forkcipher: a new primitive for authenticated encryption of very short messages. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 153\u2013182. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_6"},{"key":"9_CR7","unstructured":"Bardet, M., Faug\u00e9re, J.C., Salvy, B., Yang, B.Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: Proceedings of MEGA, vol. 5 (2005)"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bariant, A., Bouvier, C., Leurent, G., Perrin, L.: Algebraic attacks against some arithmetization-oriented primitives. IACR Trans. Symmetric Cryptol. 2022(3), 73\u2013101 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.73-101","DOI":"10.46586\/tosc.v2022.i3.73-101"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Bertoni, G., Daemen, J., Hoffert, S., Peeters, M., Assche, G.V., Keer, R.V.: Farfalle: parallel permutation-based cryptography. IACR Trans. Symm. Cryptol. 2017(4), 1\u201338 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i4.1-38","DOI":"10.13154\/tosc.v2017.i4.1-38"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-78967-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G Bertoni","year":"2008","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 181\u2013197. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_11"},{"key":"9_CR12","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: The KECCAK reference (2011). https:\/\/keccak.team\/files\/Keccak-reference-3.0.pdf"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11889663_10","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2006","unstructured":"Bogetoft, P., Damg\u00e5rd, I., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A practical implementation of secure auctions based on multiparty integer computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 142\u2013147. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889663_10"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-030-84252-9_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"N Bordes","year":"2021","unstructured":"Bordes, N., Daemen, J., Kuijsters, D., Van Assche, G.: Thinking outside the superbox. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 337\u2013367. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_12"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Chaigneau, C., et al.: Key-recovery attacks on full Kravatte. IACR Trans. Symm. Cryptol. 2018(1), 5\u201328 (2018). https:\/\/doi.org\/10.13154\/tosc.v2018.i1.5-28","DOI":"10.13154\/tosc.v2018.i1.5-28"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Chase, M., et al.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1825\u20131842. ACM Press (Oct\/Nov 2017). https:\/\/doi.org\/10.1145\/3133956.3133997","DOI":"10.1145\/3133956.3133997"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Cid, C., Grassi, L., Gunsing, A., L\u00fcftenegger, R., Rechberger, C., Schofnegger, M.: Influence of the linear layer on the algebraic degree in sp-networks. IACR Trans. Symmetric Cryptol. 2022(1), 110\u2013137 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i1.110-137","DOI":"10.46586\/tosc.v2022.i1.110-137"},{"key":"9_CR18","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer Science & Business Media (2013)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-030-81652-0_7","volume-title":"Selected Areas in Cryptography","author":"T Cui","year":"2021","unstructured":"Cui, T., Grassi, L.: Algebraic key-recovery attacks on\u00a0reduced-round Xoofff. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 171\u2013197. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_7"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-57332-1_46","volume-title":"Advances in Cryptology \u2014 ASIACRYPT \u201991","author":"J Daemen","year":"1993","unstructured":"Daemen, J.: Limitations of the even-mansour construction. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 495\u2013498. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57332-1_46"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Daemen, J., Hoffert, S., Assche, G.V., Keer, R.V.: The design of Xoodoo and Xoofff. IACR Trans. Symm. Cryptol. 2018(4), 1\u201338 (2018). https:\/\/doi.org\/10.13154\/tosc.v2018.i4.1-38","DOI":"10.13154\/tosc.v2018.i4.1-38"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45325-3_20","volume-title":"Cryptography and Coding","author":"J Daemen","year":"2001","unstructured":"Daemen, J., Rijmen, V.: The wide trail design strategy. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 222\u2013238. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45325-3_20"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer Security \u2013 ESORICS 2013","author":"I Damg\u00e5rd","year":"2013","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: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 1\u201318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-030-84259-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"I Dinur","year":"2021","unstructured":"Dinur, I., et al.: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 517\u2013547. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_18"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-77886-6_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Dobraunig","year":"2021","unstructured":"Dobraunig, C., Grassi, L., Guinet, A., Kuijsters, D.: Ciminion: symmetric encryption based on toffoli-gates over large finite fields. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 3\u201334. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_1"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Dobraunig, C., Kales, D., Rechberger, C., Schofnegger, M., Zaverucha, G.: Shorter signatures based on tailor-made minimalist symmetric-key cryptom pp. 843\u2013857 (Nov 2022). https:\/\/doi.org\/10.1145\/3548606.3559353","DOI":"10.1145\/3548606.3559353"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-29011-4_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"O Dunkelman","year":"2012","unstructured":"Dunkelman, O., Keller, N., Shamir, A.: Minimalism in cryptography: the even-mansour scheme revisited. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 336\u2013354. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_21"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-57332-1_17","volume-title":"Advances in Cryptology \u2014 ASIACRYPT \u201991","author":"S Even","year":"1993","unstructured":"Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 210\u2013224. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57332-1_17"},{"issue":"1\u20133","key":"9_CR30","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e9re","year":"1999","unstructured":"Faug\u00e9re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F$$_4$$). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"9_CR31","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: A new hash function for zero-knowledge proof systems. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 519\u2013535. USENIX Association (Aug 2021)"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-030-45724-2_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"L Grassi","year":"2020","unstructured":"Grassi, L., L\u00fcftenegger, R., Rechberger, C., Rotaru, D., Schofnegger, M.: On a generalization of substitution-permutation networks: the HADES design strategy. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 674\u2013704. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_23"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Grassi, L., Onofri, S., Pedicini, M., Sozzi, L.: Invertible quadratic non-linear layers for mpc-\/fhe-\/zk-friendly schemes over fnp application to poseidon. IACR Trans. Symmetric Cryptol. 2022(3), 20\u201372 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.20-72","DOI":"10.46586\/tosc.v2022.i3.20-72"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Grassi, L., \u00d8ygarden, M., Schofnegger, M., Walch, R.: From farfalle to megafono via ciminion: The PRF hydra for MPC applications (2022). https:\/\/eprint.iacr.org\/2022\/342","DOI":"10.1007\/978-3-031-30634-1_9"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.P.: MPC-friendly symmetric key primitives. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 430\u2013443. ACM Press (Oct 2016). https:\/\/doi.org\/10.1145\/2976749.2978332","DOI":"10.1145\/2976749.2978332"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Grassi, L., Rechberger, C., Schofnegger, M.: Proving resistance against infinitely long subspace trails: How too choose the linear layer. IACR Trans. Symm. Cryptol. 2021(2), 314\u2013352 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i2.314-352","DOI":"10.46586\/tosc.v2021.i2.314-352"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Guo, C., Standaert, F.X., Wang, W., Wang, X., Yu, Y.: Provable security sp networks with partial non-linear layers. IACR Trans. Symm. Cryptol. 2021(2), 353\u2013388 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i2.353-388","DOI":"10.46586\/tosc.v2021.i2.353-388"},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-030-75539-3_22","volume-title":"Topics in Cryptology \u2013 CT-RSA 2021","author":"L Helminger","year":"2021","unstructured":"Helminger, L., Kales, D., Ramacher, S., Walch, R.: Multi-party revocation in Sovrin: performance through distributed trust. In: Paterson, K.G. (ed.) CT-RSA 2021. LNCS, vol. 12704, pp. 527\u2013551. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_22"},{"key":"9_CR39","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 21\u201330. ACM Press (Jun 2007). https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"9_CR40","unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., Weinert, C.: Mobile private contact discovery at scale. In: Heninger, N., Traynor, P. (eds.) USENIX Security 2019, pp. 1447\u20131464. USENIX Association (Aug 2019)"},{"key":"9_CR41","doi-asserted-by":"publisher","unstructured":"Keller, M.: MP-SPDZ: A versatile framework for multi-party computation. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1575\u20131590. ACM Press (Nov 2020). https:\/\/doi.org\/10.1145\/3372297.3417872","DOI":"10.1145\/3372297.3417872"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: Faster malicious arithmetic secure computation with oblivious transfer. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 830\u2013842. ACM Press (Oct 2016). https:\/\/doi.org\/10.1145\/2976749.2978357","DOI":"10.1145\/2976749.2978357"},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-46877-3_35","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201990","author":"X Lai","year":"1991","unstructured":"Lai, X., Massey, J.L.: A proposal for a new block encryption standard. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 389\u2013404. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46877-3_35"},{"key":"9_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-38980-1_6","volume-title":"Applied Cryptography and Network Security","author":"S Laur","year":"2013","unstructured":"Laur, S., Talviste, R., Willemson, J.: From oblivious AES to efficient and secure database join in the multiparty setting. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 84\u2013101. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_6"},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Mennink, B., Neves, S.: Optimal PRFs from blockcipher designs. IACR Trans. Symm. Cryptol. 2017(3), 228\u2013252 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i3.228-252","DOI":"10.13154\/tosc.v2017.i3.228-252"},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Zhang, Y.: SecureML: A system for scalable privacy-preserving machine learning. In: 2017 IEEE Symposium on Security and Privacy, pp. 19\u201338. IEEE Computer Society Press (May 2017). https:\/\/doi.org\/10.1109\/SP.2017.12","DOI":"10.1109\/SP.2017.12"},{"issue":"11","key":"9_CR47","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"9_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-48000-6_2","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"S Vaudenay","year":"1999","unstructured":"Vaudenay, S.: On the lai-massey scheme. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 8\u201319. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48000-6_2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30634-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:35Z","timestamp":1744754615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30634-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306334","9783031306341"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30634-1_9","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":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.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":"415","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":"109","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":"26% - 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":"16","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)"}}]}}