{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T06:55:19Z","timestamp":1790146519841,"version":"4.0.1"},"reference-count":37,"publisher":"Walter de Gruyter GmbH","issue":"3-4","license":[{"start":{"date-parts":[[2016,11,8]],"date-time":"2016-11-08T00:00:00Z","timestamp":1478563200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12,1]]},"abstract":"Abstract<\/jats:title>\n \n In [2], Bellare, Pietrzak and Rogaway proved an\n \n \n \n \n O<\/m:mi>\n \u2062<\/m:mo>\n \n (<\/m:mo>\n \n \n \u2113<\/m:mi>\n \u2062<\/m:mo>\n \n q<\/m:mi>\n 2<\/m:mn>\n <\/m:msup>\n <\/m:mrow>\n \/<\/m:mo>\n \n 2<\/m:mn>\n n<\/m:mi>\n <\/m:msup>\n <\/m:mrow>\n )<\/m:mo>\n <\/m:mrow>\n <\/m:mrow>\n <\/m:math>\n ${O(\\ell q^{2}\/2^{n})}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n bound for the PRF (pseudorandom function) security of the CBC-MAC based on an\n n<\/jats:italic>\n -bit random permutation \u03a0, provided\n \n \n \n \n \u2113<\/m:mi>\n <<\/m:mo>\n \n 2<\/m:mn>\n \n n<\/m:mi>\n \/<\/m:mo>\n 3<\/m:mn>\n <\/m:mrow>\n <\/m:msup>\n <\/m:mrow>\n <\/m:math>\n ${\\ell<2^{n\/3}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . Here an adversary can make at most\n q<\/jats:italic>\n prefix-free queries each having at most\n \n \n \n \u2113<\/m:mi>\n <\/m:math>\n ${\\ell}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n many \u201cblocks\u201d (elements of\n \n \n \n \n \n {<\/m:mo>\n 0<\/m:mn>\n ,<\/m:mo>\n 1<\/m:mn>\n }<\/m:mo>\n <\/m:mrow>\n n<\/m:mi>\n <\/m:msup>\n <\/m:math>\n ${\\{0,1\\}^{n}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n ). In the same paper an\n \n \n \n \n O<\/m:mi>\n \u2062<\/m:mo>\n \n (<\/m:mo>\n \n \n \n \u2113<\/m:mi>\n \n o<\/m:mi>\n \u2062<\/m:mo>\n \n (<\/m:mo>\n 1<\/m:mn>\n )<\/m:mo>\n <\/m:mrow>\n <\/m:mrow>\n <\/m:msup>\n \u2062<\/m:mo>\n \n q<\/m:mi>\n 2<\/m:mn>\n <\/m:msup>\n <\/m:mrow>\n \/<\/m:mo>\n \n 2<\/m:mn>\n n<\/m:mi>\n <\/m:msup>\n <\/m:mrow>\n )<\/m:mo>\n <\/m:mrow>\n <\/m:mrow>\n <\/m:math>\n ${O(\\ell^{o(1)}q^{2}\/2^{n})}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n bound for EMAC (or encrypted CBC-MAC) was proved, provided\n \n \n \n \n \u2113<\/m:mi>\n <<\/m:mo>\n \n 2<\/m:mn>\n \n n<\/m:mi>\n \/<\/m:mo>\n 4<\/m:mn>\n <\/m:mrow>\n <\/m:msup>\n <\/m:mrow>\n <\/m:math>\n ${\\ell<2^{n\/4}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . Both proofs are based on structure graphs representing all collisions among \u201cintermediate inputs\u201d to \u03a0 during the computation of CBC. The problem of bounding PRF-advantage is shown to be reduced to bounding the number of structure graphs satisfying certain collision patterns. In the present paper, we show that [2, Lemma 10], stating an important result on structure graphs, is incorrect. This is due to the fact that the authors overlooked certain structure graphs. This invalidates the proofs of the PRF bounds. In [31], Pietrzak improved the bound for EMAC by showing a tight bound\n \n \n \n \n O<\/m:mi>\n \u2062<\/m:mo>\n \n (<\/m:mo>\n \n \n q<\/m:mi>\n 2<\/m:mn>\n <\/m:msup>\n \/<\/m:mo>\n \n 2<\/m:mn>\n n<\/m:mi>\n <\/m:msup>\n <\/m:mrow>\n )<\/m:mo>\n <\/m:mrow>\n <\/m:mrow>\n <\/m:math>\n ${O(q^{2}\/2^{n})}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n under the restriction that\n \n \n \n \n \u2113<\/m:mi>\n <<\/m:mo>\n \n 2<\/m:mn>\n \n n<\/m:mi>\n \/<\/m:mo>\n 8<\/m:mn>\n <\/m:mrow>\n <\/m:msup>\n <\/m:mrow>\n <\/m:math>\n ${\\ell<2^{n\/8}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . As he used the same flawed lemma, this proof also becomes invalid. In this paper, we have revised and sometimes simplified these proofs. We revisit structure graphs in a slightly different mathematical language and provide a complete characterization of certain types of structure graphs. Using this characterization, we show that PRF security of CBC-MAC is about\n \n \n \n \n \n \u03c3<\/m:mi>\n \u2062<\/m:mo>\n q<\/m:mi>\n <\/m:mrow>\n \/<\/m:mo>\n \n 2<\/m:mn>\n n<\/m:mi>\n <\/m:msup>\n <\/m:mrow>\n <\/m:math>\n ${\\sigma q\/2^{n}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n provided\n \n \n \n \n \u2113<\/m:mi>\n <<\/m:mo>\n \n 2<\/m:mn>\n \n n<\/m:mi>\n \/<\/m:mo>\n 3<\/m:mn>\n <\/m:mrow>\n <\/m:msup>\n <\/m:mrow>\n <\/m:math>\n ${\\ell<2^{n\/3}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n where \u03c3 is the total number of blocks in all queries. We also recover tight bound for PRF security of EMAC with a much relaxed constraint (\n \n \n \n \n \u2113<\/m:mi>\n <<\/m:mo>\n \n 2<\/m:mn>\n \n n<\/m:mi>\n \/<\/m:mo>\n 4<\/m:mn>\n <\/m:mrow>\n <\/m:msup>\n <\/m:mrow>\n <\/m:math>\n ${\\ell<2^{n\/4}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n ) than the original (\n \n \n \n \n \u2113<\/m:mi>\n <<\/m:mo>\n \n 2<\/m:mn>\n \n n<\/m:mi>\n \/<\/m:mo>\n 8<\/m:mn>\n <\/m:mrow>\n <\/m:msup>\n <\/m:mrow>\n <\/m:math>\n ${\\ell<2^{n\/8}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n ).\n <\/jats:p>","DOI":"10.1515\/jmc-2016-0030","type":"journal-article","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T05:02:50Z","timestamp":1478667770000},"page":"157-180","source":"Crossref","is-referenced-by-count":6,"title":["Revisiting structure graphs: Applications to CBC-MAC and EMAC"],"prefix":"10.1515","volume":"10","author":[{"given":"Ashwin","family":"Jha","sequence":"first","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"374","published-online":{"date-parts":[[2016,11,8]]},"reference":[{"key":"2025120600300289260_j_jmc-2016-0030_ref_001_w2aab3b7e1619b1b6b1ab2b1b1Aa","doi-asserted-by":"crossref","unstructured":"Bellare M., Kilian J. and Rogaway P.,\nThe security of the cipher block chaining message authentication code,\nJ. Comput. Syst. Sci. 61 (2000), 362\u2013399.","DOI":"10.1006\/jcss.1999.1694"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_002_w2aab3b7e1619b1b6b1ab2b1b2Aa","doi-asserted-by":"crossref","unstructured":"Bellare M., Pietrzak K. and Rogaway P.,\nImproved security analyses for CBC MACs,\nAdvances in Cryptology \u2013 CRYPTO 2005,\nLecture Notes in Comput. Sci. 3621,\nSpringer, Berlin (2005), 527\u2013545.","DOI":"10.1007\/11535218_32"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_003_w2aab3b7e1619b1b6b1ab2b1b3Aa","unstructured":"Bernstein D. J.,\nA short proof of the unpredictability of cipher block chaining,\npreprint 2005, https:\/\/cr.yp.to\/antiforgery\/easycbc-20050109.pdf."},{"key":"2025120600300289260_j_jmc-2016-0030_ref_004_w2aab3b7e1619b1b6b1ab2b1b4Aa","doi-asserted-by":"crossref","unstructured":"Bosselaers A. and Preneel B.,\nIntegrity Primitives for Secure Information Systems. Final Report of Race Integrity Primitives,\nLecture Notes in Comput. Sci. 1007,\nSpringer, Berlin, 1995.","DOI":"10.1007\/3-540-60640-8"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_005_w2aab3b7e1619b1b6b1ab2b1b5Aa","doi-asserted-by":"crossref","unstructured":"Black J. and Rogaway P.,\nA block-cipher mode of operation for parallelizable message authentication,\nAdvances in Cryptology \u2013 EUROCRYPT 2002,\nLecture Notes in Comput. Sci. 2332,\nSpringer, Berlin (2002), 384\u2013397.","DOI":"10.1007\/3-540-46035-7_25"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_006_w2aab3b7e1619b1b6b1ab2b1b6Aa","doi-asserted-by":"crossref","unstructured":"Black J. and Rogaway P.,\nCBC MACs for arbitrary-length messages: The three-key constructions,\nJ. Cryptology 18 (2005), 111\u2013131.","DOI":"10.1007\/s00145-004-0016-3"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_007_w2aab3b7e1619b1b6b1ab2b1b7Aa","unstructured":"Datta N., Dutta A., Nandi M., Paul G. and Zhang L.,\nOne-key double-sum MAC with beyond-birthday security,\npreprint 2015, http:\/\/eprint.iacr.org\/2015\/958."},{"key":"2025120600300289260_j_jmc-2016-0030_ref_008_w2aab3b7e1619b1b6b1ab2b1b8Aa","doi-asserted-by":"crossref","unstructured":"Diffie W. and Hellman M. E.,\nNew directions in cryptography,\nIEEE Trans. Inform. Theory 22 (1976), 644\u2013654.","DOI":"10.1109\/TIT.1976.1055638"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_009_w2aab3b7e1619b1b6b1ab2b1b9Aa","doi-asserted-by":"crossref","unstructured":"Dodis Y., Gennaro R., H\u00e5stad J., Krawczyk H. and Rabin T.,\nRandomness extraction and key derivation using the CBC, cascade and HMAC modes,\nAdvances in Cryptology \u2013 CRYPTO 2004,\nLecture Notes in Comput. Sci. 3152,\nSpringer, Berlin (2004), 494\u2013510.","DOI":"10.1007\/978-3-540-28628-8_30"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_010_w2aab3b7e1619b1b6b1ab2b1c10Aa","unstructured":"Dutta A., Nandi M. and Paul G.,\nOne-key compression function based MAC with BBB security,\npreprint 2015, http:\/\/eprint.iacr.org\/2015\/1016."},{"key":"2025120600300289260_j_jmc-2016-0030_ref_011_w2aab3b7e1619b1b6b1ab2b1c11Aa","doi-asserted-by":"crossref","unstructured":"Dworkin M.,\nRecommendation for block cipher modes of operation: The CMAC mode for authentication,\npreprint 2005, http:\/\/dx.doi.org\/10.6028\/NIST.SP.800-38B-2005.","DOI":"10.6028\/NIST.SP.800-38b-2005"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_012_w2aab3b7e1619b1b6b1ab2b1c12Aa","unstructured":"Ehrsam W. F., Meyer C. H. W., Smith J. L. and Tuchman W. L.,\nMessage verification and transmission error detection by block chaining,\nUS Patent 4074066, 1976."},{"key":"2025120600300289260_j_jmc-2016-0030_ref_013_w2aab3b7e1619b1b6b1ab2b1c13Aa","doi-asserted-by":"crossref","unstructured":"Ga\u017ei P., Pietrzak K. and Ryb\u00e1r M.,\nThe exact PRF-security of NMAC and HMAC,\nAdvances in Cryptology. Part I \u2013 CRYPTO 2014,\nLecture Notes in Comput. Sci. 8616,\nSpringer, Berlin (2014), 113\u2013130.","DOI":"10.1007\/978-3-662-44371-2_7"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_014_w2aab3b7e1619b1b6b1ab2b1c14Aa","unstructured":"Ga\u017ei P., Pietrzak K. and Tessaro S.,\nTight bounds for keyed sponges and truncated CBC,\npreprint 2015, http:\/\/eprint.iacr.org\/2015\/053."},{"key":"2025120600300289260_j_jmc-2016-0030_ref_015_w2aab3b7e1619b1b6b1ab2b1c15Aa","unstructured":"Gorbunov S. and Rackoff C.,\nOn the security of cipher block chaining message authentication code,\npreprint 2016, https:\/\/cs.uwaterloo.ca\/~sgorbuno\/publications\/securityOfCBC.pdf."},{"key":"2025120600300289260_j_jmc-2016-0030_ref_016_w2aab3b7e1619b1b6b1ab2b1c16Aa","unstructured":"International Organization for Standardization,\nInformation technology \u2013 Xecurity techniques \u2013 Message authentication codes (MACs) \u2013\nPart 1: Mechanisms using a block cipher, ISO\/IEC 9797-1, Geneva, 1999."},{"key":"2025120600300289260_j_jmc-2016-0030_ref_017_w2aab3b7e1619b1b6b1ab2b1c17Aa","doi-asserted-by":"crossref","unstructured":"Iwata T. and Kurosawa K.,\nOMAC: One-key CBC MAC,\nFast Software Encryption (Lund 2003),\nLecture Notes in Comput. Sci. 2887,\nSpringer, Berlin (2003), 129\u2013153.","DOI":"10.1007\/978-3-540-39887-5_11"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_018_w2aab3b7e1619b1b6b1ab2b1c18Aa","doi-asserted-by":"crossref","unstructured":"Iwata T. and Kurosawa K.,\nStronger security bounds for OMAC, TMAC, and XCBC,\nProgress in Cryptology \u2013 INDOCRYPT 2003,\nLecture Notes in Comput. Sci. 2904,\nSpringer, Berlin (2003), 402\u2013415.","DOI":"10.1007\/978-3-540-24582-7_30"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_019_w2aab3b7e1619b1b6b1ab2b1c19Aa","doi-asserted-by":"crossref","unstructured":"Jaulmes \u00c9., Joux A. and Valette F.,\nOn the security of randomized CBC-MAC beyond the birthday paradox limit: A new construction,\nFast Software Encryption (Leuven 2002),\nLecture Notes in Comput. Sci. 2365,\nSpringer, Berlin (2002), 237\u2013251.","DOI":"10.1007\/3-540-45661-9_19"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_020_w2aab3b7e1619b1b6b1ab2b1c20Aa","doi-asserted-by":"crossref","unstructured":"Jutla C. S.,\nPRF domain extension using DAGs,\nTheoryof Cryptography, Third Theory of Cryptography Conference (New York 2006),\nLecture Notes in Comput. Sci. 3876,\nSpringer, Berlin (2006), 561\u2013580.","DOI":"10.1007\/11681878_29"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_021_w2aab3b7e1619b1b6b1ab2b1c21Aa","unstructured":"Kurosawa K. and Iwata T.,\nTMAC: Two-key CBC MAC,\nIEICE Trans. 87-A (2004), 46\u201352."},{"key":"2025120600300289260_j_jmc-2016-0030_ref_022_w2aab3b7e1619b1b6b1ab2b1c22Aa","doi-asserted-by":"crossref","unstructured":"Maurer U. M.,\nIndistinguishability of random systems,\nAdvances in Cryptology \u2013 EUROCRYPT 2002,\nLecture Notes in Comput. Sci. 2332,\nSpringer, Berlin (2002), 110\u2013132.","DOI":"10.1007\/3-540-46035-7_8"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_023_w2aab3b7e1619b1b6b1ab2b1c23Aa","doi-asserted-by":"crossref","unstructured":"Minematsu K. and Matsushima T.,\nNew bounds for PMAC, TMAC, and XCBC,\nFast Software Encryption (Luxembourg 2007),\nLecture Notes in Comput. Sci. 4593,\nSpringer, Berlin (2007), 434\u2013451.","DOI":"10.1007\/978-3-540-74619-5_27"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_024_w2aab3b7e1619b1b6b1ab2b1c24Aa","doi-asserted-by":"crossref","unstructured":"Nandi M.,\nFast and secure CBC-type MAC algorithms,\nFast Software Encryption (Leuven 2009),\nLecture Notes in Comput. Sci. 5665,\nSpringer, Berlin (2009), 375\u2013393.","DOI":"10.1007\/978-3-642-03317-9_23"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_025_w2aab3b7e1619b1b6b1ab2b1c25Aa","doi-asserted-by":"crossref","unstructured":"Nandi M.,\nImproved security analysis for OMAC as a pseudorandom function,\nJ. Math. Cryptol. 3 (2009), 133\u2013148.","DOI":"10.1515\/JMC.2009.006"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_026_w2aab3b7e1619b1b6b1ab2b1c26Aa","doi-asserted-by":"crossref","unstructured":"Nandi M.,\nA unified method for improving PRF bounds for a class of blockcipher based MACs,\nFast Software Encryption (Seoul 2010),\nLecture Notes in Comput. Sci. 6147,\nSpringer, Berlin (2010), 212\u2013229.","DOI":"10.1007\/978-3-642-13858-4_12"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_027_w2aab3b7e1619b1b6b1ab2b1c27Aa","doi-asserted-by":"crossref","unstructured":"Nandi M. and Mandal A.,\nImproved security analysis of PMAC,\nJ. Math. Cryptol. 2 (2008), 149\u2013162.","DOI":"10.1515\/JMC.2008.007"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_028_w2aab3b7e1619b1b6b1ab2b1c28Aa","unstructured":"Patarin J.,\nE,tude des g\u00e9n\u00e9rateurs de permutations pseudo-al\u00e9atoires bas\u00e9s sur le sch\u00e9ma du DES,\nPh.D. thesis, Universit\u00e9 de Paris, 1991."},{"key":"2025120600300289260_j_jmc-2016-0030_ref_029_w2aab3b7e1619b1b6b1ab2b1c29Aa","doi-asserted-by":"crossref","unstructured":"Patarin J.,\nThe \u201ccoefficients H\u201d technique,\nSelected Areas in Cryptography (Sackville 2008),\nLecture Notes in Comput. Sci. 5381,\nSpringer, Berlin (2008), 328\u2013345.","DOI":"10.1007\/978-3-642-04159-4_21"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_030_w2aab3b7e1619b1b6b1ab2b1c30Aa","doi-asserted-by":"crossref","unstructured":"Petrank E. and Rackoff C.,\nCBC MAC for real-time data sources,\nJ. Cryptology 13 (2000), 315\u2013338.","DOI":"10.1007\/s001450010009"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_031_w2aab3b7e1619b1b6b1ab2b1c31Aa","doi-asserted-by":"crossref","unstructured":"Pietrzak K.,\nA tight bound for EMAC,\nAutomata, Languages and Programming. Part II (Venice 2006),\nLecture Notes in Comput. Sci. 4052,\nSpringer, Berlin (2006), 168\u2013179.","DOI":"10.1007\/11787006_15"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_032_w2aab3b7e1619b1b6b1ab2b1c32Aa","doi-asserted-by":"crossref","unstructured":"Vaudenay S.,\nDecorrelation: A theory for block cipher security,\nJ. Cryptology 16 (2003), 249\u2013286.","DOI":"10.1007\/s00145-003-0220-6"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_033_w2aab3b7e1619b1b6b1ab2b1c33Aa","doi-asserted-by":"crossref","unstructured":"Wegman M. N. and Carter L.,\nNew classes and applications of hash functions,\n20th Annual Symposium on Foundations of Computer Science (San Juan 1979),\nIEEE Press, Piscataway (1979), 175\u2013182.","DOI":"10.1109\/SFCS.1979.26"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_034_w2aab3b7e1619b1b6b1ab2b1c34Aa","unstructured":"Wigert S.,\nSur l\u2019ordre de grandeur du nombre des diviseurs d\u2019un entier,\nArk. Mat. Astron. Fys. 3 (1907), no. 18, 1\u20139."},{"key":"2025120600300289260_j_jmc-2016-0030_ref_035_w2aab3b7e1619b1b6b1ab2b1c35Aa","doi-asserted-by":"crossref","unstructured":"Yasuda K.,\nThe sum of CBC MACs is a secure PRF,\nTopics in Cryptology \u2013 CT-RSA 2010,\nLecture Notes in Comput. Sci. 5985,\nSpringer, Berlin (2010), 366\u2013381.","DOI":"10.1007\/978-3-642-11925-5_25"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_036_w2aab3b7e1619b1b6b1ab2b1c36Aa","doi-asserted-by":"crossref","unstructured":"Yasuda K.,\nA new variant of PMAC: Beyond the birthday bound,\nAdvances in Cryptology \u2013 CRYPTO 2011,\nLecture Notes in Comput. Sci. 6841,\nSpringer, Berlin (2011), 596\u2013609.","DOI":"10.1007\/978-3-642-22792-9_34"},{"key":"2025120600300289260_j_jmc-2016-0030_ref_037_w2aab3b7e1619b1b6b1ab2b1c37Aa","doi-asserted-by":"crossref","unstructured":"Zhang L., Wu W., Sui H. and Wang P.,\n3kf9: Enhancing 3GPP-MAC beyond the birthday bound,\nAdvances in Cryptology \u2013 ASIACRYPT 2012,\nLecture Notes in Comput. Sci. 7658,\nSpringer, Berlin (2012), 296\u2013312.","DOI":"10.1007\/978-3-642-34961-4_19"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/jmc.2016.10.issue-3-4\/jmc-2016-0030\/jmc-2016-0030.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2016-0030\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2016-0030\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:31:01Z","timestamp":1764981061000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2016-0030\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,8]]},"references-count":37,"journal-issue":{"issue":"3-4","published-online":{"date-parts":[[2016,12,1]]},"published-print":{"date-parts":[[2016,12,1]]}},"alternative-id":["10.1515\/jmc-2016-0030"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2016-0030","relation":{},"ISSN":["1862-2984","1862-2976"],"issn-type":[{"value":"1862-2984","type":"electronic"},{"value":"1862-2976","type":"print"}],"subject":[],"published":{"date-parts":[[2016,11,8]]}}}