{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:49:44Z","timestamp":1743043784985,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319402529"},{"type":"electronic","value":"9783319402536"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40253-6_21","type":"book-chapter","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T19:00:31Z","timestamp":1467226831000},"page":"343-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["One-Key Compression Function Based MAC with Security Beyond Birthday Bound"],"prefix":"10.1007","author":[{"given":"Avijit","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goutam","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,30]]},"reference":[{"key":"21_CR1","first-page":"252","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"Jee Hea An","year":"1999","unstructured":"An, J.H., Bellare, M.: Constructing vil-macsfrom fil-macs: message authentication under weakened assumptions. In: Wiener [40], pp. 252\u2013269"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 1\u201315. Springer, Heidelberg (1996)"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-48405-1_17","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"Mihir Bellare","year":"1999","unstructured":"Bellare, M., Goldreich, O., Krawczyk, H.: Stateless evaluation of pseudorandom functions: security beyond the birthday barrier. In: Wiener [40], pp. 270\u2013287"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-48658-5_32","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M Bellare","year":"1994","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of cipher block chaining. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 341\u2013358. Springer, Heidelberg (1994)"},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/11535218_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"Mihir Bellare","year":"2005","unstructured":"Bellare, M., Pietrzak, K., Rogaway, P.: Improved security analyses for CBC macs. In: Shoup [35], pp. 527\u2013545"},{"doi-asserted-by":"crossref","unstructured":"Bellare, M.: New proofs for \n$$\\sf NMAC$$\n and \n$$\\sf HMAC$$\n: security without collision-resistance. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 602\u2013619. Springer, Heidelberg (2006)","key":"21_CR6","DOI":"10.1007\/11818175_36"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"Mihir Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay [36], pp. 409\u2013426"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48405-1_14","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"J. Black","year":"1999","unstructured":"Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: fast and secure message authentication. In: Wiener [40], pp. 216\u2013233"},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/3-540-46035-7_25","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"John Black","year":"2002","unstructured":"Black, J., Rogaway, P.: A block-cipher mode of operation for parallelizable message authentication. In: Knudsen [22], pp. 384\u2013397"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/978-3-540-74735-2_31","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"AA Bogdanov","year":"2007","unstructured":"Bogdanov, A.A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M., Seurin, Y., Vikkelsoe, C.: PRESENT: an ultra-lightweight block cipher. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 450\u2013466. Springer, Heidelberg (2007)"},{"unstructured":"Datta, N., Dutta, A., Nandi, M., Paul, G., Zhang, L.: One-key double-sum MAC with beyond-birthday security. Cryptology ePrint Archive, Report 2015\/958 (2015). http:\/\/eprint.iacr.org\/","key":"21_CR11"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/978-3-642-32009-5_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Y Dodis","year":"2012","unstructured":"Dodis, Y., Ristenpart, T., Steinberger, J., Tessaro, S.: To hash or not to hash again? (In)Differentiability results for H\n\n$$^\\text{2 }$$\n and HMAC. In: Canetti, R., Safavi-Naini, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 348\u2013366. Springer, Heidelberg (2012)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-3-642-20465-4_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"Y Dodis","year":"2011","unstructured":"Dodis, Y., Steinberger, J.: Domain extension for MACs beyond the birthday barrier. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 323\u2013342. Springer, Heidelberg (2011)"},{"unstructured":"Dutta, A., Nandi, M., Paul, G.: One-Key Compression Function Based MAC with Security beyond Birthday Bound. Cryptology ePrint Archive, Report 2015\/1016, 20 October 2015. http:\/\/eprint.iacr.org\/","key":"21_CR14"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-662-44371-2_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"P Ga\u017ei","year":"2014","unstructured":"Ga\u017ei, P., Pietrzak, K., Ryb\u00e1r, M.: The exact PRF-security of NMAC and HMAC. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 113\u2013130. Springer, Heidelberg (2014)"},{"doi-asserted-by":"crossref","unstructured":"Ga\u017ei, P., Pietrzak, K., Tessaro, S.: Generic security of NMAC and HMAC with input whitening. Cryptology ePrint Archive, Report 2015\/881, 2015. http:\/\/eprint.iacr.org\/","key":"21_CR16","DOI":"10.1007\/978-3-662-48800-3_4"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/11615798","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"D Hong","year":"2006","unstructured":"Hong, D., Sung, J., Hong, S.H., Lim, J.-I., Lee, S.-J., Koo, B.-S., Lee, C.-H., Chang, D., Lee, J., Jeong, K., Kim, H., Kim, J.-S., Chee, S.: HIGHT: a new block cipher suitable for low-resource device. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 46\u201359. Springer, Heidelberg (2006)"},{"key":"21_CR18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-39887-5_11","volume-title":"Fast Software Encryption","author":"Tetsu Iwata","year":"2003","unstructured":"Iwata, T., Kurosawa, K.: OMAC: one-key CBC MAC. In: Johansson [20], pp. 129\u2013153"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-45661-9_19","volume-title":"Fast Software Encryption","author":"\u00c9 Jaulmes","year":"2002","unstructured":"Jaulmes, \u00c9., Joux, A., Valette, F.: On the security of randomized CBC-MAC beyond the birthday paradox limit: a new construction. In: Daemen, J., Rijmen, V. (eds.) FSE 2002. LNCS, vol. 2365, pp. 237\u2013251. Springer, Heidelberg (2002)"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Fast Software Encryption","year":"2003","unstructured":"Johansson, T. (ed.): FSE 2003. LNCS, vol. 2887. Springer, Heidelberg (2003)"},{"key":"21_CR21","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-540-39887-5_13","volume-title":"Fast Software Encryption","author":"Antoine Joux","year":"2003","unstructured":"Joux, A., Poupard, G., Stern, J.: New attacks against standardized macs. In: Johansson [20], pp. 170\u2013181"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2002","year":"2002","unstructured":"Knudsen, L.R. (ed.): EUROCRYPT 2002. LNCS, vol. 2332. Springer, Heidelberg (2002)"},{"issue":"3","key":"21_CR23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1515\/jmc-2013-5004","volume":"7","author":"N Koblitz","year":"2013","unstructured":"Koblitz, N., Menezes, A.: Another look at HMAC. J. Math. Cryptology 7(3), 225\u2013251 (2013)","journal-title":"J. Math. Cryptology"},{"doi-asserted-by":"crossref","unstructured":"Krawczyk, H., Bellare, M., Canetti, R.: HMAC: Keyed-Hashing for Message Authentication. RFC 2104 (Informational), February 1997","key":"21_CR24","DOI":"10.17487\/rfc2104"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-642-32009-5_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"W Landecker","year":"2012","unstructured":"Landecker, W., Shrimpton, T., Terashima, R.S.: Tweakable blockciphers with beyond birthday-bound security. In: Canetti, R., Safavi-Naini, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 14\u201330. Springer, Heidelberg (2012)"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"G Leurent","year":"2013","unstructured":"Leurent, G., Peyrin, T., Wang, L.: New generic attacks against hash-based MACs. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 1\u201320. Springer, Heidelberg (2013)"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/11593447_26","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"S Lucks","year":"2005","unstructured":"Lucks, S.: A failure-friendly design principle for hash functions. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 474\u2013494. Springer, Heidelberg (2005)"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/11586821_12","volume-title":"Cryptography and Coding","author":"UM Maurer","year":"2005","unstructured":"Maurer, U.M., Sj\u00f6din, J.: Domain expansion of MACs: alternative uses of the FIL-MAC. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 168\u2013185. Springer, Heidelberg (2005)"},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/11523468_39","volume-title":"Automata, Languages and Programming","author":"UM Maurer","year":"2005","unstructured":"Maurer, U.M., Sj\u00f6din, J.: Single-key AIL-MACs from any FIL-MAC. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 472\u2013484. Springer, Heidelberg (2005)"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/978-3-642-13858-4_13","volume-title":"Fast Software Encryption","author":"K Minematsu","year":"2010","unstructured":"Minematsu, K.: How to thwart birthday attacks against MACs via small randomness. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol. 6147, pp. 230\u2013249. Springer, Heidelberg (2010)"},{"key":"21_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-642-41383-4_6","volume-title":"Advances in Information and Computer Security","author":"Y Naito","year":"2013","unstructured":"Naito, Y., Sasaki, Y., Wang, L., Yasuda, K.: Generic state-recovery and forgery attacks on ChopMD-MAC and on NMAC\/HMAC. In: Sakiyama, K., Terada, M. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 83\u201398. Springer, Heidelberg (2013)"},{"key":"21_CR32","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1007\/978-3-642-34961-4_35","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"Thomas Peyrin","year":"2012","unstructured":"Thomas Peyrin, Y., Sasaki, L.W.: Generic related-key attacks for HMAC. In: Wang and Sako [37], pp. 580\u2013597"},{"key":"21_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-642-55220-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"T Peyrin","year":"2014","unstructured":"Peyrin, T., Wang, L.: Generic universal forgery attack on iterative hash-based MACs. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 147\u2013164. Springer, Heidelberg (2014)"},{"key":"21_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60590-8","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"B Preneel","year":"1995","unstructured":"Preneel, B., van Oorschot, P.C.: MDx-MAC and building fast MACs from hash functions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 1\u201314. Springer, Heidelberg (1995)"},{"key":"21_CR35","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","year":"2005","unstructured":"Shoup, V. (ed.): CRYPTO 2005. LNCS, vol. 3621. Springer, Heidelberg (2005)"},{"key":"21_CR36","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2006","year":"2006","unstructured":"Vaudenay, S. (ed.): EUROCRYPT 2006. LNCS, vol. 4004. Springer, Heidelberg (2006)"},{"key":"21_CR37","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","year":"2012","unstructured":"Wang, X., Sako, K. (eds.): ASIACRYPT 2012. LNCS, vol. 7658. Springer, Heidelberg (2012)"},{"key":"21_CR38","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/11535218_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"Xiaoyun Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Hongbo, Y.: Finding collisions in the full SHA-1. In: Shoup [35], pp. 17\u201336"},{"key":"21_CR39","series-title":"Lecture Notes in Computer Science","first-page":"19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19\u201335. Springer, Heidelberg (2005)"},{"key":"21_CR40","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201999","year":"1999","unstructured":"Wiener, M. (ed.): CRYPTO 1999. LNCS, vol. 1666. Springer, Heidelberg (1999)"},{"key":"21_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/978-3-540-76900-2_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"K Yasuda","year":"2007","unstructured":"Yasuda, K.: Boosting merkle-damg\u00e5rd hashing for message authentication. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 216\u2013231. Springer, Heidelberg (2007)"},{"key":"21_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-540-77026-8_3","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"K Yasuda","year":"2007","unstructured":"Yasuda, K.: Multilane HMAC\u2014 security beyond the birthday limit. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 18\u201332. Springer, Heidelberg (2007)"},{"key":"21_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-540-73458-1_26","volume-title":"Information Security and Privacy","author":"K Yasuda","year":"2007","unstructured":"Yasuda, K.: \u201cSandwich\u201d is indeed secure: how to authenticate a message with just one hashing. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 355\u2013369. Springer, Heidelberg (2007)"},{"key":"21_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/978-3-540-71039-4_20","volume-title":"Fast Software Encryption","author":"K Yasuda","year":"2008","unstructured":"Yasuda, K.: A one-pass mode of operation for deterministic message authentication\u2014 security beyond the birthday barrier. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 316\u2013333. Springer, Heidelberg (2008)"},{"key":"21_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-3-642-01001-9_14","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"K Yasuda","year":"2009","unstructured":"Yasuda, K.: A double-piped mode of operation for MACs, PRFs and PROs: security beyond the birthday barrier. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 242\u2013259. Springer, Heidelberg (2009)"},{"key":"21_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/978-3-642-04474-8_35","volume-title":"Information Security","author":"K Yasuda","year":"2009","unstructured":"Yasuda, K.: HMAC without the \u201cSecond\u201d key. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol. 5735, pp. 443\u2013458. Springer, Heidelberg (2009)"},{"key":"21_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"21_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"1","key":"21_CR49","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1587\/transfun.E94.A.84","volume":"94\u2013A","author":"K Yasuda","year":"2011","unstructured":"Yasuda, K.: On the full MAC security of a double-piped mode of operation. IEICE Trans. 94\u2013A(1), 84\u201391 (2011)","journal-title":"IEICE Trans."},{"issue":"1","key":"21_CR50","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1587\/transfun.E96.A.237","volume":"96","author":"K Yasuda","year":"2013","unstructured":"Yasuda, K.: A parallelizable prf-based MAC algorithm: well beyond the birthday bound. IEICE Trans. 96(1), 237\u2013241 (2013)","journal-title":"IEICE Trans."},{"key":"21_CR51","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/978-3-642-34961-4_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"Liting Zhang","year":"2012","unstructured":"Zhang, L., Wenling, W., Sui, H., Wang, P.: 3kf9: enhancing 3GPP-MAC beyond the birthday bound. In: Wang and Sako [37], pp. 296\u2013312"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40253-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T04:49:48Z","timestamp":1608007788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40253-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319402529","9783319402536"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40253-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"30 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}