{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:25:14Z","timestamp":1757456714800,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609468"},{"type":"electronic","value":"9789819609475"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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-0947-5_9","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T05:02:03Z","timestamp":1733634123000},"page":"251-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Toward Full n-bit Security and\u00a0Nonce Misuse Resistance of\u00a0Block Cipher-Based MACs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7230-2057","authenticated-orcid":false,"given":"Wonseok","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5471-9350","authenticated-orcid":false,"given":"Jooyoung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1569-0775","authenticated-orcid":false,"given":"Yeongmin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Banik, S., Pandey, S.K., Peyrin, T., Sasaki, Y., Sim, S.M., Todo, Y.: GIFT: A Small Present. In: Fischer, W., Homma, N. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2017. LNCS, vol. 10529, pp. 321\u2013345. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_16","DOI":"10.1007\/978-3-319-66787-4_16"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of the cipher block chaining message authentication code. Journal of Computer and System Sciences 61(3), 362\u2013399 (2000)","DOI":"10.1006\/jcss.1999.1694"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Bellare, M., Pietrzak, K., Rogaway, P.: Improved security analyses for cbc macs. In: Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings. Lecture Notes in Computer Science, vol.\u00a03621, pp. 527\u2013545. Springer (2005). https:\/\/doi.org\/10.1007\/11535218_32","DOI":"10.1007\/11535218_32"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J.: Stronger Security Bounds for Wegman-Carter-Shoup Authenticators. In: Cramer, R. (ed.) Advances in Cryptology - EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 164\u2013180. Springer (2005). https:\/\/doi.org\/10.1007\/11426639_10","DOI":"10.1007\/11426639_10"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J.: The Poly1305-AES message-authentication code. In: Gilbert, H., Handschuh, H. (eds.) Fast Software Encryption. LNCS, vol.\u00a03557, pp. 32\u201349. Springer (2005). https:\/\/doi.org\/10.1007\/11502760_3","DOI":"10.1007\/11502760_3"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Bhargavan, K., Leurent, G.: On the Practical (In-)Security of 64-bit Block Ciphers: Collision Attacks on HTTP over TLS and OpenVPN. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS. pp. 456\u2013467. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978423","DOI":"10.1145\/2976749.2978423"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Black, J., Rogaway, P.: A Block-Cipher Mode of Operation for Parallelizable Message Authentication. In: Knudsen, L.R. (ed.) Advances in Cryptology - EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 384\u2013397. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_25, https:\/\/iacr.org\/archive\/eurocrypt2002\/23320380\/pmac.pdf","DOI":"10.1007\/3-540-46035-7_25"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J.B., Seurin, Y., Vikkelsoe, C.: PRESENT: An Ultra-Lightweight Block Cipher. In: Paillier, P., Verbauwhede, I. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2007. LNCS, vol.\u00a04727, pp. 450\u2013466. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-74735-2_31","DOI":"10.1007\/978-3-540-74735-2_31"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Chen, Y.L., Mennink, B., Preneel, B.: Categorization of Faulty Nonce Misuse Resistant Message Authentication. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology - ASIACRYPT 2021. LNCS, vol. 13092, pp. 520\u2013550. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_18","DOI":"10.1007\/978-3-030-92078-4_18"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Choi, W., Lee, B., Lee, Y., Lee, J.: Improved security analysis for nonce-based enhanced hash-then-mask MACs. In: Moriai, S., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2020. LNCS, vol. 12491, pp. 697\u2013723. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_23","DOI":"10.1007\/978-3-030-64837-4_23"},{"key":"9_CR11","unstructured":"Choi, W., Lee, J., Lee, Y.: Toward full $$n$$-bit security and nonce misuse resistance of block cipher-based MACs. Cryptology ePrint Archive, Paper 2024\/731 (2024), https:\/\/eprint.iacr.org\/2024\/731"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Cogliati, B., Dutta, A., Nandi, M., Patarin, J., Saha, A.: Proof of Mirror Theory for a Wide Range of $$\\xi $$$$_{\\max }$$. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023. LNCS, vol. 14007, pp. 470\u2013501. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_16","DOI":"10.1007\/978-3-031-30634-1_16"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Cogliati, B., Seurin, Y.: EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology - CRYPTO 2016. LNCS, vol.\u00a09814, pp. 121\u2013149. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_5","DOI":"10.1007\/978-3-662-53018-4_5"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Datta, N., Dutta, A., Dutta, K.: Improved Security Bound of (E\/D)WCDM. IACR Transactions on Symmetric Cryptology Issue 4, 138\u2013176 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i4.138-176","DOI":"10.46586\/tosc.v2021.i4.138-176"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Datta, N., Dutta, A., Nandi, M., Yasuda, K.: Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology - CRYPTO 2018. LNCS, vol. 10991, pp. 631\u2013661. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_21","DOI":"10.1007\/978-3-319-96884-1_21"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Dutta, A., Nandi, M., Talnikar, S.: Beyond Birthday Bound Secure MAC in Faulty Nonce Model. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2019. LNCS, vol. 11476, pp. 437\u2013466. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_15","DOI":"10.1007\/978-3-030-17653-2_15"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Guo, J., Peyrin, T., Poschmann, A., Robshaw, M.J.B.: The LED Block Cipher. In: Preneel, B., Takagi, T. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2011. LNCS, vol.\u00a06917, pp. 326\u2013341. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_22","DOI":"10.1007\/978-3-642-23951-9_22"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Handschuh, H., Preneel, B.: Key-recovery attacks on universal hash function based mac algorithms. In: Advances in Cryptology - CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Lecture Notes in Computer Science, vol.\u00a05157, pp. 144\u2013161. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_9, https:\/\/iacr.org\/archive\/crypto2008\/51570145\/51570145.pdf","DOI":"10.1007\/978-3-540-85174-5_9"},{"key":"9_CR19","unstructured":"Information technology \u2013 Security techniques \u2013 Message Authentication Codes (MACs) \u2013 Part 1: Mechanisms using a block cipher. Standard, International Organization for Standardization (Mar 2011)"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Iwata, T., Kurosawa, K.: OMAC: One-Key CBC MAC. In: Johansson, T. (ed.) Fast Software Encryption. LNCS, vol.\u00a02887, pp. 129\u2013153. Springer (2003). https:\/\/doi.org\/10.1007\/978-3-540-39887-5_11, https:\/\/iacr.org\/archive\/fse2003\/28870137\/28870137.pdf","DOI":"10.1007\/978-3-540-39887-5_11"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Jha, A., Nandi, M.: Revisiting structure graphs: Applications to cbc-mac and emac. Journal of Mathematical Cryptology 10(3-4), 157\u2013180 (2016)","DOI":"10.1515\/jmc-2016-0030"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Mennink, B., Neves, S.: Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory. In: Katz, J., Shacham, H. (eds.) Advances in Cryptology - CRYPTO 2017. LNCS, vol. 10403, pp. 556\u2013583. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_19","DOI":"10.1007\/978-3-319-63697-9_19"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Minematsu, K., Iwata, T.: Building blockcipher from tweakable blockcipher: Extending fse 2009 proposal. In: Cryptography and Coding: 13th IMA International Conference, IMACC 2011, Oxford, UK, December 12-15, 2011. Proceedings 13. pp. 391\u2013412. Springer (2011)","DOI":"10.1007\/978-3-642-25516-8_24"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Morris J. Dworkin: Recommendation for Block Cipher Modes of Operation: Galois\/Counter Mode (GCM) and GMAC. NIST Special Publication 800-38D (Nov 28 2007)","DOI":"10.6028\/NIST.SP.800-38d"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Naito, Y.: Blockcipher-Based MACs: Beyond the Birthday Bound Without Message Length. In: ASIACRYPT (3). pp. 446\u2013470. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_16","DOI":"10.1007\/978-3-319-70700-6_16"},{"key":"9_CR26","unstructured":"Patarin, J.: Introduction to Mirror Theory: Analysis of Systems of Linear Equalities and Linear Non Equalities for Cryptography. IACR Cryptology ePrint Archive, Report 2010\/287 (2010), available at https:\/\/eprint.iacr.org\/2010\/287"},{"key":"9_CR27","unstructured":"Patarin, J.: Mirror Theory and Cryptography. IACR Cryptology ePrint Archive, Report 2016\/702 (2016), available at https:\/\/eprint.iacr.org\/2016\/702"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Pietrzak, K.: A tight bound for emac. In: Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II 33. pp. 168\u2013179. Springer (2006)","DOI":"10.1007\/11787006_15"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Shoup, V.: On Fast and Provably Secure Message Authentication Based on Universal Hashing. In: Koblitz, N. (ed.) Advances in Cryptology - CRYPTO \u201996. LNCS, vol.\u00a01109, pp. 313\u2013328. Springer (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_24","DOI":"10.1007\/3-540-68697-5_24"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Wegman, M.N., Carter, J.L.: New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences 22, Issue 3, 265\u2013279 (1981)","DOI":"10.1016\/0022-0000(81)90033-7"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Yasuda, K.: The sum of CBC MACs is a secure PRF. In: Cryptographers\u2019 Track at the RSA Conference. pp. 366\u2013381. Springer (2010)","DOI":"10.1007\/978-3-642-11925-5_25"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Yasuda, K.: A New Variant of PMAC: Beyond the Birthday Bound. In: Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference. Lecture Notes in Computer Science, vol.\u00a06841, p.\u00a0593. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_34, https:\/\/www.iacr.org\/archive\/crypto2011\/68410593\/68410593.pdf","DOI":"10.1007\/978-3-642-22792-9_34"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Zhang, L., Wu, W., Sui, H., Wang, P.: 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound. In: ASIACRYPT. vol.\u00a07658, pp. 296\u2013312. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_19, https:\/\/www.iacr.org\/archive\/asiacrypt2012\/76580291\/76580291.pdf","DOI":"10.1007\/978-3-642-34961-4_19"}],"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-0947-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T05:03:22Z","timestamp":1733634202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0947-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609468","9789819609475"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0947-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 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"}}]}}