{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:41:29Z","timestamp":1769298089554,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229626","type":"print"},{"value":"9783031229633","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22963-3_12","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:48:42Z","timestamp":1674560922000},"page":"348-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Towards Tight Security Bounds for\u00a0OMAC, XCBC and\u00a0TMAC"],"prefix":"10.1007","author":[{"given":"Soumya","family":"Chattopadhyay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5957-2837","authenticated-orcid":false,"given":"Ashwin","family":"Jha","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1029-6576","authenticated-orcid":false,"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"12_CR1","first-page":"309","volume":"2004","author":"M Bellare","year":"2004","unstructured":"Bellare, M., Goldreich, O., Mityagin, A.: The power of verification queries in message authentication and authenticated encryption. IACR Cryptol. ePrint Arch. 2004, 309 (2004)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of cipher block chaining. In: Proceedings of Advances in Cryptology - CRYPTO 1994, pp. 341\u2013358 (1994)","DOI":"10.1007\/3-540-48658-5_32"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Pietrzak, K., Rogaway, P.: Improved security analyses for CBC macs. In: Proceedings of Advances in Cryptology - CRYPTO 2005, pp. 527\u2013545 (2005)","DOI":"10.1007\/11535218_32"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Berendschot, A., et al.: Final Report of RACE Integrity Primitives, vol. 1007, LNCS, Springer-Verlag, Berlin (1995). https:\/\/doi.org\/10.1007\/3-540-60640-8","DOI":"10.1007\/3-540-60640-8"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Black, J., Rogaway, P.: CBC macs for arbitrary-length messages: the three-key constructions. In: Proceedings of Advances in Cryptology - CRYPTO 2000, pp. 197\u2013215 (2000)","DOI":"10.1007\/3-540-44598-6_12"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Black, J., Rogaway, P.: A block-cipher mode of operation for parallelizable message authentication. In: Proceedings of Advances in Cryptology - EUROCRYPT 2002, pp. 384\u2013397 (2002)","DOI":"10.1007\/3-540-46035-7_25"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"423","DOI":"10.46586\/tosc.v2021.i2.423-445","volume":"2021","author":"B Chakraborty","year":"2021","unstructured":"Chakraborty, B., Chattopadhyay, S., Jha, A., Nandi, M.: On length independent security bounds for the PMAC family. IACR Trans. Symmet. Cryptol. 2021(2), 423\u2013445 (2021)","journal-title":"IACR Trans. Symmet. Cryptol."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, S., Jha, A., Nandi, M.: Fine-tuning the ISO\/IEC Standard Lightmac. In: Proceedings of Advances in Cryptology - ASIACRYPT 2021, pp. 490\u2013519 (2021)","DOI":"10.1007\/978-3-030-92078-4_17"},{"key":"12_CR9","first-page":"1234","volume":"2022","author":"S Chattopadhyay","year":"2022","unstructured":"Chattopadhyay, S., Jha, A., Nandi, M.: Towards tight security bounds for OMAC, XCBC and TMAC. IACR Cryptol. ePrint Arch. 2022, 1234 (2022)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Dworkin, M.: Recommendation for block cipher modes of operation: the CMAC mode for authentication. NIST Special Publication 800\u201338b, National Institute of Standards and Technology, U. S. Department of Commerce (2005)","DOI":"10.6028\/NIST.SP.800-38b-2005"},{"key":"12_CR11","unstructured":"Ehrsam, W.F., Meyer, C.H.W., Smith, J.L., Tuchman, W.L.: Message verification and transmission error detection by block chaining. Patent 4,074,066, USPTO (1976)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Iwata, T., Kurosawa, K.: OMAC: One-Key CBC MAC. In: Fast Software Encryption - FSE 2003, Revised Papers, pp. 129\u2013153 (2003)","DOI":"10.1007\/978-3-540-39887-5_11"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Iwata, T., Kurosawa, K.: Stronger Security Bounds for OMAC, TMAC, and XCBC. In: Proceedings of Progress in Cryptology - INDOCRYPT 2003, pp. 402\u2013415 (2003)","DOI":"10.1007\/978-3-540-24582-7_30"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"427","DOI":"10.46586\/tosc.v2017.i1.427-448","volume":"2017","author":"A Jha","year":"2017","unstructured":"Jha, A., Mandal, A., Nandi, M.: On the exact security of message authentication using pseudorandom functions. IACR Trans. Symmetric Cryptol. 2017(1), 427\u2013448 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"3\u20134","key":"12_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1515\/jmc-2016-0030","volume":"10","author":"A Jha","year":"2016","unstructured":"Jha, A., Nandi, M.: Revisiting structure graphs: applications to CBC-MAC and EMAC. J. Math. Cryptol. 10(3\u20134), 157\u2013180 (2016)","journal-title":"J. Math. Cryptol."},{"key":"12_CR16","first-page":"161","volume":"2016","author":"A Jha","year":"2016","unstructured":"Jha, A., Nandi, M.: Revisiting structure graphs: applications to CBC-MAC and EMAC. IACR Cryptol. ePrint Arch. 2016, 161 (2016)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Iwata, T.: TMAC: two-key CBC MAC. In: Proceedings of Topics in Cryptology - CT-RSA 2003, pp. 33\u201349 (2003)","DOI":"10.1007\/3-540-36563-X_3"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Luykx, A., Preneel, B., Tischhauser, E., Yasuda, K.: A MAC mode for lightweight block ciphers. In: Fast Software Encryption - FSE 2016, Revised Selected Papers, pp. 43\u201359 (2016)","DOI":"10.1007\/978-3-662-52993-5_3"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Minematsu, K., Matsushima, T.: New bounds for PMAC, TMAC, and XCBC. In: Fast Software Encryption - FSE 2007, Revised Selected Papers, pp. 434\u2013451 (2007)","DOI":"10.1007\/978-3-540-74619-5_27"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Nandi, M.: Fast and secure CBC-type MAC algorithms. In: Fast Software Encryption - FSE 2009, Revised Selected Papers, pp. 375\u2013393 (2009)","DOI":"10.1007\/978-3-642-03317-9_23"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1515\/JMC.2009.006","volume":"3","author":"M Nandi","year":"2009","unstructured":"Nandi, M.: Improved security analysis for OMAC as a pseudorandom function. J. Math. Cryptol. 3(2), 133\u2013148 (2009)","journal-title":"J. Math. Cryptol."},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1515\/JMC.2008.007","volume":"2","author":"M Nandi","year":"2008","unstructured":"Nandi, M., Mandal, A.: Improved security analysis of PMAC. J. Math. Cryptol. 2(2), 149\u2013162 (2008)","journal-title":"J. Math. Cryptol."},{"key":"12_CR23","unstructured":"Patarin, J.: Etude des G\u00e9n\u00e9rateurs de Permutations Pseudo-al\u00e9atoires Bas\u00e9s sur le Sch\u00e9ma du DES. Ph.D. thesis, Universit\u00e9 de Paris (1991)"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Patarin, J.: The \u201ccoefficients H\" technique. In: Selected Areas in Cryptography - SAC 2008. Revised Selected Papers, pp. 328\u2013345 (2008)","DOI":"10.1007\/978-3-642-04159-4_21"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Pietrzak, K.: A tight bound for EMAC. In: Proceedings of Automata, Languages and Programming - ICALP 2006, Part II, pp. 168\u2013179 (2006)","DOI":"10.1007\/11787006_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22963-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:03:21Z","timestamp":1769216601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22963-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229626","9783031229633"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22963-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","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":"364","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":"98","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":"27% - 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":"10","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"}]}}