{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T12:00:43Z","timestamp":1765108843806,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":54,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550173","type":"print"},{"value":"9789819550180","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5018-0_18","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:57:05Z","timestamp":1765108625000},"page":"546-579","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Number of\u00a0Restricted Solutions to\u00a0Constrained Systems and\u00a0Their Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6445-2514","authenticated-orcid":false,"given":"Beno\u00eet","family":"Cogliati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5957-2837","authenticated-orcid":false,"given":"Ashwin","family":"Jha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0495-6939","authenticated-orcid":false,"given":"Jordan","family":"Naccache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1029-6576","authenticated-orcid":false,"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9178-1679","authenticated-orcid":false,"given":"Abishanka","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-662-48116-5_18","volume-title":"Fast Software Encryption","author":"E Andreeva","year":"2015","unstructured":"Andreeva, E., Daemen, J., Mennink, B., Van Assche, G.: Security of keyed sponge constructions using a modular proof approach. In: Leander, G. (ed.) FSE 2015. LNCS, vol. 9054, pp. 364\u2013384. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48116-5_18"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-642-34931-7_28","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"J-P Aumasson","year":"2012","unstructured":"Aumasson, J.-P., Bernstein, D.J.: SipHash: a fast short-input PRF. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 489\u2013508. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_28"},{"key":"18_CR3","unstructured":"Bellare, M., Impagliazzo, R.: A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion. IACR Cryptology ePrint Archive, p.\u00a024 (1999)"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1006\/JCSS.1999.1694","volume":"61","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of the cipher block chaining message authentication code. J. Comput. Syst. Sci. 61(3), 362\u2013399 (2000). https:\/\/doi.org\/10.1006\/JCSS.1999.1694","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Bhaumik, R., Chailloux, A., Frixons, P., Mennink, B., Naya-Plasencia, M.: Block cipher doubling for a post-quantum world. IACR Commun. Cryptol. 1(3), 4 (2024). https:\/\/doi.org\/10.62056\/AV4FVUA5V","DOI":"10.62056\/AV4FVUA5V"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-46035-7_25","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"J Black","year":"2002","unstructured":"Black, J., Rogaway, P.: A block-cipher mode of operation for parallelizable message authentication. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 384\u2013397. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_25"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Chakraborti, A., Nandi, M., Talnikar, S., Yasuda, K.: On the composition of single-keyed tweakable even-mansour for achieving BBB security. IACR Trans. Symmetric Cryptol. 2020(2), 1\u201339 (2020). https:\/\/doi.org\/10.13154\/TOSC.V2020.I2.1-39","DOI":"10.13154\/TOSC.V2020.I2.1-39"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Chakraborty, B., Jha, A., Nandi, M.: On the security of sponge-type authenticated encryption modes. IACR Trans. Symmetric Cryptol. 2020(2), 93\u2013119 (2020). https:\/\/doi.org\/10.13154\/TOSC.V2020.I2.93-119","DOI":"10.13154\/TOSC.V2020.I2.93-119"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-030-92078-4_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"S Chattopadhyay","year":"2021","unstructured":"Chattopadhyay, S., Jha, A., Nandi, M.: Fine-tuning the\u00a0ISO\/IEC standard LightMAC. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 490\u2013519. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_17"},{"key":"18_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-031-22963-3_12","volume-title":"ASIACRYPT 2022","author":"S Chattopadhyay","year":"2022","unstructured":"Chattopadhyay, S., Jha, A., Nandi, M.: Towards tight security bounds for omac, XCBC and TMAC. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13791, pp. 348\u2013378. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_12"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-031-22963-3_13","volume-title":"ASIACRYPT 2022","author":"YL Chen","year":"2022","unstructured":"Chen, Y.L.: A modular approach to the security analysis of two-permutation constructions. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. Lecture Notes in Computer Science, vol. 13791, pp. 379\u2013409. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_13"},{"issue":"5","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1007\/S12095-022-00571-W","volume":"14","author":"YL Chen","year":"2022","unstructured":"Chen, Y.L., Dutta, A., Nandi, M.: Multi-user BBB security of public permutations based MAC. Cryptogr. Commun. 14(5), 1145\u20131177 (2022). https:\/\/doi.org\/10.1007\/S12095-022-00571-W","journal-title":"Cryptogr. Commun."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-26948-7_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"YL Chen","year":"2019","unstructured":"Chen, Y.L., Lambooij, E., Mennink, B.: How to build pseudorandom functions from public random permutations. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 266\u2013293. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_10"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"Choi, W., Lee, J., Lee, Y.: Building PRFs from TPRPs: beyond the block and the tweak length bounds. IACR Trans. Symmetric Cryptol. 2024(1), 35\u201370 (2024). https:\/\/doi.org\/10.46586\/TOSC.V2024.I1.35-70","DOI":"10.46586\/TOSC.V2024.I1.35-70"},{"key":"18_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-031-30634-1_16","volume-title":"EUROCRYPT 2023","author":"B Cogliati","year":"2023","unstructured":"Cogliati, B., Dutta, A., Nandi, M., Patarin, J., Saha, A.: Proof of mirror theory for a wide range of $$\\xi _{\\rm max}$$. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14007, pp. 470\u2013501. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_16"},{"key":"18_CR16","unstructured":"Cogliati, B., Ethan, J., Jha, A., Nandi, M., Saha, A.: On the number of restricted solutions to constrained systems and their applications. IACR Cryptology ePrint Archive, p.\u00a01163 (2024). https:\/\/eprint.iacr.org\/2024\/1163"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/978-3-030-64837-4_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"B Cogliati","year":"2020","unstructured":"Cogliati, B., Jha, A., Nandi, M.: How to build optimally secure PRFs using block ciphers. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 754\u2013784. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_25"},{"key":"18_CR18","unstructured":"Cogliati, B., Patarin, J.: Mirror theory: a simple proof of the Pi+Pj theorem with $$\\xi _{\\rm max}=2$$. IACR Cryptology ePrint Archive, p.\u00a0734 (2020). https:\/\/eprint.iacr.org\/2020\/734"},{"issue":"12","key":"18_CR19","doi-asserted-by":"publisher","first-page":"2703","DOI":"10.1007\/S10623-018-0470-9","volume":"86","author":"B Cogliati","year":"2018","unstructured":"Cogliati, B., Seurin, Y.: Analysis of the single-permutation encrypted Davies-Meyer construction. Des. Codes Cryptogr. 86(12), 2703\u20132723 (2018). https:\/\/doi.org\/10.1007\/S10623-018-0470-9","journal-title":"Des. Codes Cryptogr."},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-319-63697-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"W Dai","year":"2017","unstructured":"Dai, W., Hoang, V.T., Tessaro, S.: Information-theoretic indistinguishability via the chi-squared method. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 497\u2013523. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_17"},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Datta, N., Dutta, A., Nandi, M., Paul, G.: Double-block hash-then-sum: a paradigm for constructing BBB secure PRF. IACR Trans. Symmetric Cryptol. 2018(3), 36\u201392 (2018). https:\/\/doi.org\/10.13154\/TOSC.V2018.I3.36-92","DOI":"10.13154\/TOSC.V2018.I3.36-92"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Datta, N., Dutta, A., Nandi, M., Paul, G., Zhang, L.: Single key variant of pmac_plus. IACR Trans. Symmetric Cryptol. 2017(4), 268\u2013305 (2017). https:\/\/doi.org\/10.13154\/TOSC.V2017.I4.268-305","DOI":"10.13154\/TOSC.V2017.I4.268-305"},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Datta, N., Dutta, A., Nandi, M., Talnikar, S.: Tight multi-user security bound of DbHtS. IACR Trans. Symmetric Cryptol. 2023(1), 192\u2013223 (2023). https:\/\/doi.org\/10.46586\/TOSC.V2023.I1.192-223","DOI":"10.46586\/TOSC.V2023.I1.192-223"},{"key":"18_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-031-58716-0_2","volume-title":"EUROCRYPT 2024","author":"I Dinur","year":"2024","unstructured":"Dinur, I.: Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14651, pp. 33\u201362. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_2"},{"key":"18_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"},{"issue":"9","key":"18_CR26","doi-asserted-by":"publisher","first-page":"6218","DOI":"10.1109\/TIT.2022.3171178","volume":"68","author":"A Dutta","year":"2022","unstructured":"Dutta, A., Nandi, M., Saha, A.: Proof of mirror theory for $$\\xi _{\\rm max}=2$$. IEEE Trans. Inf. Theory 68(9), 6218\u20136232 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3171178","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"Dutta, A., Nandi, M., Talnikar, S.: Permutation based EDM: an inverse free BBB secure PRF. IACR Trans. Symmetric Cryptol. 2021(2), 31\u201370 (2021). https:\/\/doi.org\/10.46586\/TOSC.V2021.I2.31-70","DOI":"10.46586\/TOSC.V2021.I2.31-70"},{"key":"18_CR28","unstructured":"Eberhard, S.: More on additive triples of bijections. CoRR abs\/1704.02407 (2017). http:\/\/arxiv.org\/abs\/1704.02407"},{"key":"18_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"},{"key":"18_CR30","volume-title":"Bonferroni-type Inequalities with Applications","author":"J Galambos","year":"1996","unstructured":"Galambos, J., Simonelli, I.: Bonferroni-type Inequalities with Applications, 1st edn. Springer, New York (1996)","edition":"1"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53018-4_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"VT Hoang","year":"2016","unstructured":"Hoang, V.T., Tessaro, S.: Key-alternating ciphers and key-length extension: exact bounds and multi-user security. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 3\u201332. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_1"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/11799313_20","volume-title":"Fast Software Encryption","author":"T Iwata","year":"2006","unstructured":"Iwata, T.: New blockcipher modes of operation with beyond the birthday bound security. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 310\u2013327. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799313_20"},{"key":"18_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-39887-5_11","volume-title":"Fast Software Encryption","author":"T Iwata","year":"2003","unstructured":"Iwata, T., Kurosawa, K.: OMAC: one-Key CBC MAC. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 129\u2013153. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39887-5_11"},{"key":"18_CR34","unstructured":"Jha, A.: A note on the generalized sum-capture problem for rings (2024). https:\/\/ashwin-jha.github.io\/papers\/gsc.pdf"},{"issue":"3","key":"18_CR35","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1007\/S00145-020-09347-Y","volume":"33","author":"A Jha","year":"2020","unstructured":"Jha, A., Nandi, M.: Tight security of cascaded LRW2. J. Cryptol. 33(3), 1272\u20131317 (2020). https:\/\/doi.org\/10.1007\/S00145-020-09347-Y","journal-title":"J. Cryptol."},{"issue":"4","key":"18_CR36","doi-asserted-by":"publisher","first-page":"462","DOI":"10.3390\/E24040462","volume":"24","author":"A Jha","year":"2022","unstructured":"Jha, A., Nandi, M.: A survey on applications of h-technique: revisiting security analysis of PRP and PRF. Entropy 24(4), 462 (2022). https:\/\/doi.org\/10.3390\/E24040462","journal-title":"Entropy"},{"key":"18_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-030-45721-1_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Kim","year":"2020","unstructured":"Kim, S., Lee, B., Lee, J.: Tight security bounds for double-block hash-then-sum MACs. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 435\u2013465. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_16"},{"key":"18_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-319-96884-1_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Leurent","year":"2018","unstructured":"Leurent, G., Nandi, M., Sibleyras, F.: Generic attacks against beyond-birthday-bound MACs. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 306\u2013336. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_11"},{"key":"18_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/3-540-45539-6_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"S Lucks","year":"2000","unstructured":"Lucks, S.: The sum of PRPs is a secure PRF. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 470\u2013484. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_34"},{"key":"18_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-662-52993-5_3","volume-title":"Fast Software Encryption","author":"A Luykx","year":"2016","unstructured":"Luykx, A., Preneel, B., Tischhauser, E., Yasuda, K.: A MAC mode for lightweight block ciphers. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 43\u201359. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_3"},{"key":"18_CR41","doi-asserted-by":"publisher","unstructured":"MacWilliams, F., Sloane, N. (eds.): The Theory of Error-Correcting Codes, North-Holland Mathematical Library, vol.\u00a016. Elsevier (1977). https:\/\/doi.org\/10.1016\/S0924-6509(08)70527-0","DOI":"10.1016\/S0924-6509(08)70527-0"},{"key":"18_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-319-28166-7_30","volume-title":"Applied Cryptography and Network Security","author":"B Mennink","year":"2015","unstructured":"Mennink, B., Preneel, B.: On the XOR of multiple random permutations. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 619\u2013634. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28166-7_30"},{"key":"18_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-662-48800-3_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"B Mennink","year":"2015","unstructured":"Mennink, B., Reyhanitabar, R., Viz\u00e1r, D.: Security of full-state keyed sponge and duplex: applications to authenticated encryption. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 465\u2013489. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_19"},{"key":"18_CR44","doi-asserted-by":"publisher","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995). https:\/\/doi.org\/10.1017\/CBO9780511814075","DOI":"10.1017\/CBO9780511814075"},{"key":"18_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-70700-6_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"Y Naito","year":"2017","unstructured":"Naito, Y.: Blockcipher-based MACs: beyond the birthday bound without message length. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 446\u2013470. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_16"},{"key":"18_CR46","unstructured":"Patarin, J.: Introduction to mirror theory: analysis of systems of linear equalities and linear non equalities for cryptography. IACR Cryptology ePrint Archive, p.\u00a0287 (2010). http:\/\/eprint.iacr.org\/2010\/287"},{"issue":"4","key":"18_CR47","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/S00200-017-0326-Y","volume":"28","author":"J Patarin","year":"2017","unstructured":"Patarin, J.: Mirror theory and cryptography. Appl. Algebra Eng. Commun. Comput. 28(4), 321\u2013338 (2017). https:\/\/doi.org\/10.1007\/S00200-017-0326-Y","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"18_CR48","doi-asserted-by":"publisher","unstructured":"Rao, A.R., Bhimasankaram, P.: Linear Algebra. Hindustan Book Agency (2000). https:\/\/doi.org\/10.1007\/978-93-86279-01-9","DOI":"10.1007\/978-93-86279-01-9"},{"key":"18_CR49","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-031-22966-4_18","volume-title":"ASIACRYPT 2022","author":"Y Shen","year":"2022","unstructured":"Shen, Y., Sibleyras, F.: Key-reduced variants of 3kf9 with beyond-birthday-bound security. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13792, pp. 525\u2013554. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_18"},{"key":"18_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-031-30872-7_22","volume-title":"CT-RSA 2023","author":"F Sibleyras","year":"2023","unstructured":"Sibleyras, F., Todo, Y.: Keyed sum of permutations: a simpler RP-based PRF. In: Rosulek, M. (ed.) CT-RSA 2023. Lecture Notes in Computer Science, vol. 13871, pp. 573\u2013593. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30872-7_22"},{"key":"18_CR51","doi-asserted-by":"publisher","unstructured":"Song, H.: A single-key variant of lightmac_plus. Symmetry 13(10) (2021). https:\/\/doi.org\/10.3390\/sym13101818","DOI":"10.3390\/sym13101818"},{"key":"18_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-11925-5_25","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"K Yasuda","year":"2010","unstructured":"Yasuda, K.: The sum of CBC\u00a0MACs is a secure PRF. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 366\u2013381. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11925-5_25"},{"key":"18_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-642-22792-9_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"K Yasuda","year":"2011","unstructured":"Yasuda, K.: A new variant of PMAC: beyond the birthday bound. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 596\u2013609. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_34"},{"key":"18_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-34961-4_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"L Zhang","year":"2012","unstructured":"Zhang, L., Wu, W., Sui, H., Wang, P.: 3kf9: enhancing 3GPP-MAC beyond the birthday bound. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 296\u2013312. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_19"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5018-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:57:07Z","timestamp":1765108627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5018-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550173","9789819550180"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5018-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","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":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}