{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:54:34Z","timestamp":1778064874503,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662530177","type":"print"},{"value":"9783662530184","type":"electronic"}],"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-662-53018-4_5","type":"book-chapter","created":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T10:02:12Z","timestamp":1469008932000},"page":"121-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Cogliati","sequence":"first","affiliation":[]},{"given":"Yannick","family":"Seurin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1007\/978-3-662-46800-5_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MA Abdelraheem","year":"2015","unstructured":"Abdelraheem, M.A., Beelen, P., Bogdanov, A., Tischhauser, E.: Twisted polynomials and forgery attacks on GCM. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 762\u2013786. Springer, Heidelberg (2015)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-03317-9_21","volume-title":"Fast Software Encryption","author":"J Black","year":"2009","unstructured":"Black, J., Cochran, M.: MAC reforgeability. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 345\u2013362. Springer, Heidelberg (2009)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO 1996","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":"5_CR4","unstructured":"Bernstein, D.J.: Floating-point arithmetic and message authentication. Unpublished manuscript (2000). \n                      http:\/\/cr.yp.to\/papers.html#hash127"},{"key":"5_CR5","unstructured":"Bernstein, D.J.: Stronger security bounds for permutations. Unpublished manuscript (2005). \n                      http:\/\/cr.yp.to\/papers.html#permutations"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11426639_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"DJ Bernstein","year":"2005","unstructured":"Bernstein, D.J.: Stronger security bounds for Wegman-Carter-Shoup authenticators. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 164\u2013180. Springer, Heidelberg (2005)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11502760_3","volume-title":"Fast Software Encryption","author":"DJ Bernstein","year":"2005","unstructured":"Bernstein, D.J.: The Poly1305-AES message-authentication code. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 32\u201349. Springer, Heidelberg (2005)"},{"key":"5_CR8","unstructured":"Bernstein, D.J.: Polynomial evaluation and message authentication. Unpublished manuscript (2007). \n                      http:\/\/cr.yp.to\/papers.html#pema"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-48405-1_17","volume-title":"Advances in Cryptology - CRYPTO 1999","author":"M Bellare","year":"1999","unstructured":"Bellare, M., Goldreich, O., Krawczyk, H.: Stateless evaluation of pseudorandom functions: security beyond the birthday barrier. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 270. Springer, Heidelberg (1999)"},{"key":"5_CR10","unstructured":"Bellare, M., Goldreich, O., Mityagin, A.: The power of verification queries in message authentication and authenticated encryption. IACR Cryptology ePrint Archive, Report 2004\/309 (2004). \n                      http:\/\/eprint.iacr.org\/2004\/309"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48405-1_14","volume-title":"Advances in Cryptology - CRYPTO 1999","author":"J Black","year":"1999","unstructured":"Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: fast and secure message authentication. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 216. Springer, Heidelberg (1999)"},{"key":"5_CR12","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, Report 1999\/024 (1999). \n                      http:\/\/eprint.iacr.org\/1999\/024"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BFb0054132","volume-title":"Advances in Cryptology - EUROCRYPT 1998","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Krovetz, T., Rogaway, P.: Luby-Rackoff backwards: increasing security by making block ciphers non-invertible. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 266\u2013280. Springer, Heidelberg (1998)"},{"issue":"3","key":"5_CR14","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)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/11535218_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Bellare","year":"2005","unstructured":"Bellare, M., Pietrzak, K., Rogaway, P.: Improved security analyses for CBC MACs. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 527\u2013545. Springer, Heidelberg (2005)"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00145-004-0016-3","volume":"18","author":"J Black","year":"2005","unstructured":"Black, J., Rogaway, P.: CBC MACs for arbitrary-length messages: the three-key constructions. J. Cryptol. 18(2), 111\u2013131 (2005)","journal-title":"J. Cryptol."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (2006). \n                      http:\/\/eprint.iacr.org\/2004\/331"},{"key":"5_CR18","first-page":"79","volume-title":"Advances in Cryptology - CRYPTO 1982","author":"G Brassard","year":"1982","unstructured":"Brassard, G.: On computationally secure authentication tags requiring short secret shared keys. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) CRYPTO 1982, pp. 79\u201386. Plenum Press, New York (1982)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-662-44371-2_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Chen","year":"2014","unstructured":"Chen, S., Lampe, R., Lee, J., Seurin, Y., Steinberger, J.: Minimizing the two-round even-mansour cipher. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 39\u201356. Springer, Heidelberg (2014). \n                      http:\/\/eprint.iacr.org\/2014\/443"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-662-46706-0_15","volume-title":"Fast Software Encryption","author":"B Cogliati","year":"2015","unstructured":"Cogliati, B., Lampe, R., Patarin, J.: The indistinguishability of the XOR of \n$$k$$\n permutations. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 285\u2013302. Springer, Heidelberg (2015)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-55220-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Chen","year":"2014","unstructured":"Chen, S., Steinberger, J.: Tight security bounds for key-alternating ciphers. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 327\u2013350. Springer, Heidelberg (2014). \n                      http:\/\/eprint.iacr.org\/2013\/222"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Cogliati, B., Seurin, Y.: EWCDM: an efficient, beyond-birthday secure, nonce-misuse resistant MAC. Full version of this paper. \n                      http:\/\/eprint.iacr.org\/2016\/525","DOI":"10.1007\/978-3-662-53018-4_5"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"5_CR24","unstructured":"Ferguson, N.: Authentication weaknesses in GCM. Comments Submitted to NIST Modes of Operation Process (2005). \n                      http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/BCM\/documents\/comments\/CWC-GCM\/Ferguson2.pdf"},{"issue":"3","key":"5_CR25","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"EN Gilbert","year":"1974","unstructured":"Gilbert, E.N., MacWilliams, F.J., Sloane, N.J.A.: Codes which detect deception. Bell Syst. Tech. J. 53(3), 405\u2013424 (1974)","journal-title":"Bell Syst. Tech. J."},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0052345","volume-title":"Fast Software Encryption","author":"S Halevi","year":"1997","unstructured":"Halevi, S., Krawczyk, H.: MMH: software message authentication in the Gbit\/second rates. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 172\u2013189. Springer, Heidelberg (1997)"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-85174-5_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"H Handschuh","year":"2008","unstructured":"Handschuh, H., Preneel, B.: Key-recovery attacks on universal hash function based MAC algorithms. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 144\u2013161. Springer, Heidelberg (2008)"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/BFb0055742","volume-title":"Advances in Cryptology - CRYPTO 1998","author":"C Hall","year":"1998","unstructured":"Hall, C., Wagner, D., Kelsey, J., Schneier, B.: Building PRFs from PRPs. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 370\u2013389. Springer, Heidelberg (1998)"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"5_CR30","unstructured":"Jaulmes, \u00c9., Lercier, R.: FRMAC, a fast randomized message authentication code (2004). \n                      http:\/\/eprint.iacr.org\/2004\/166"},{"key":"5_CR31","unstructured":"Joux, A.: Authentication failures in NIST version of GCM. Comments Submitted to NIST Modes of Operation Process (2006). \n                      http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/BCM\/documents\/comments\/800-38_Series-Drafts\/GCM\/Joux_comments.pdf"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45247-8_7","volume-title":"Information Security and Cryptology - ICISC 2000","author":"T Krovetz","year":"2001","unstructured":"Krovetz, T., Rogaway, P.: Fast universal hashing with small keys and no preprocessing: the PolyR construction. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 73\u201389. Springer, Heidelberg (2001)"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-48658-5_15","volume-title":"Advances in Cryptology - CRYPTO 1994","author":"H Krawczyk","year":"1994","unstructured":"Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 129\u2013139. Springer, Heidelberg (1994)"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-540-25937-4_26","volume-title":"Fast Software Encryption","author":"T Kohno","year":"2004","unstructured":"Kohno, T., Viega, J., Whiting, D.: CWC: a high-performance conventional authenticated encryption mode. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 408\u2013426. Springer, Heidelberg (2004)"},{"key":"5_CR35","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 - 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)"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-30556-9_27","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"DA McGrew","year":"2004","unstructured":"McGrew, D.A., Viega, J.: The security and performance of the Galois\/counter mode (GCM) of operation. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 343\u2013355. Springer, Heidelberg (2004)"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-54303-1_131","volume-title":"EUROCODE 1990","author":"J Patarin","year":"1991","unstructured":"Patarin, J.: Pseudorandom permutations based on the DES scheme. In: Cohen, G.D., Charpin, P. (eds.) EUROCODE 1990. LNCS, vol. 514, pp. 193\u2013204. Springer, Heidelberg (1991)"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-46766-1_25","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"J Patarin","year":"1992","unstructured":"Patarin, J.: New results on pseudorandom permutation generators based on the DES scheme. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 301\u2013312. Springer, Heidelberg (1992)"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-85093-9_22","volume-title":"Information Theoretic Security","author":"J Patarin","year":"2008","unstructured":"Patarin, J.: A proof of security in \n$$O(2^n)$$\n for the XOR of two random permutations. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 232\u2013248. Springer, Heidelberg (2008). \n                      http:\/\/eprint.iacr.org\/2008\/010"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-04159-4_21","volume-title":"Selected Areas in Cryptography","author":"J Patarin","year":"2009","unstructured":"Patarin, J.: The \u201cCoefficients H\u201d technique. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 328\u2013345. Springer, Heidelberg (2009)"},{"key":"5_CR42","unstructured":"Patarin, J.: Security in \n$$O(2^n)$$\n for the XOR of two random permutations: proof with the standard \n$$H$$\n technique. IACR Cryptology ePrint Archive, Report 2013\/368 (2013). \n                      http:\/\/eprint.iacr.org\/2013\/368"},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-662-43933-3_15","volume-title":"Fast Software Encryption","author":"G Procter","year":"2014","unstructured":"Procter, G., Cid, C.: On weak keys and forgery attacks against polynomial-based MAC schemes. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 287\u2013304. Springer, Heidelberg (2014)"},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-44750-4_3","volume-title":"Advances in Cryptology - CRYPTO 1995","author":"P Rogaway","year":"1995","unstructured":"Rogaway, P.: Bucket hashing and its application to fast message authentication. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 29\u201342. Springer, Heidelberg (1995)"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-34047-5_13","volume-title":"Fast Software Encryption","author":"M-JO Saarinen","year":"2012","unstructured":"Saarinen, M.-J.O.: Cycling attacks on GCM, GHASH and other polynomial MACs and hashes. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 216\u2013225. Springer, Heidelberg (2012)"},{"key":"5_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-68697-5_24","volume-title":"Advances in Cryptology - CRYPTO 1996","author":"V Shoup","year":"1996","unstructured":"Shoup, V.: On fast and provably secure message authentication based on universal hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 313\u2013328. Springer, Heidelberg (1996)"},{"issue":"3","key":"5_CR47","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR48","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 MACs is a secure PRF. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 366\u2013381. Springer, Heidelberg (2010)"},{"key":"5_CR49","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)"},{"key":"5_CR50","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)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53018-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T00:03:16Z","timestamp":1595203396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53018-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662530177","9783662530184"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53018-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}