{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T22:40:08Z","timestamp":1748904008175,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662498897"},{"type":"electronic","value":"9783662498903"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49890-3_23","type":"book-chapter","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T04:40:46Z","timestamp":1461732046000},"page":"596-621","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Influence of Message Length in PMAC\u2019s Security Bounds"],"prefix":"10.1007","author":[{"given":"Atul","family":"Luykx","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Preneel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Szepieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kan","family":"Yasuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,28]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption. In: FOCS, pp. 394\u2013403. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"23_CR2","unstructured":"Bellare, M., Goldreich, O., Mityagin, A.: The power of verification queries in message authentication and authenticated encryption. IACR Cryptology ePrint Archive 2004, 309 (2004)"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-44750-4_2","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"Mihir Bellare","year":"1995","unstructured":"Bellare, M., Gu\u00e9rin, R., Rogaway, P.: XOR MACs: new methods for message authentication using finite pseudorandom functions. In: Coppersmith [8], pp. 15\u201328. http:\/\/dx.doi.org\/10.1007\/3-540-44750-4_2"},{"key":"23_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 1994","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). http:\/\/dx.doi.org\/10.1007\/3-540-48658-5_32"},{"key":"23_CR5","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). http:\/\/dx.doi.org\/10.1007\/11535218_32"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Fast Software Encryption","year":"2007","unstructured":"Biryukov, A. (ed.): Fast Software Encryption. LNCS, vol. 4593. Springer, Heidelberg (2007)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-46035-7_25","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"JA Black","year":"2002","unstructured":"Black, J.A., Rogaway, P.: A block-cipher mode of operation for parallelizable message authentication. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 384\u2013397. Springer, Heidelberg (2002). http:\/\/dx.doi.org\/10.1007\/3-540-46035-7_25"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 1995","year":"1995","unstructured":"Coppersmith, D. (ed.): Advances in Cryptology \u2013 CRYPTO 1995. LNCS, vol. 963. Springer, Heidelberg (1995)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Pietrzak, K.: Improving the security of MACs via randomized message preprocessing. In: Biryukov [6], pp. 414\u2013433. http:\/\/dx.doi.org\/10.1007\/978-3-540-74619-5_26","DOI":"10.1007\/978-3-540-74619-5_26"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). http:\/\/dx.doi.org\/10.1007\/978-3-662-44371-2_7"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-662-47989-6_18","volume-title":"Advances in Cryptology - CRYPTO 2015","author":"P Gazi","year":"2015","unstructured":"Gazi, P., Pietrzak, K., Tessaro, S.: The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC. In: Gennaro, R., Robshaw, M. (eds.) Advances in Cryptology - CRYPTO 2015. LNCS, vol. 9215, pp. 368\u2013387. Springer, Heidelberg (2015). http:\/\/dx.doi.org\/10.1007\/978-3-662-47989-6_18"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-24582-7_30","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"T Iwata","year":"2003","unstructured":"Iwata, T., Kurosawa, K.: Stronger security bounds for OMAC, TMAC, and XCBC. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 402\u2013415. Springer, Heidelberg (2003). http:\/\/dx.doi.org\/10.1007\/978-3-540-24582-7_30"},{"key":"23_CR13","volume-title":"Discrete Mathematics Using Latin Squares","author":"CF Laywine","year":"1998","unstructured":"Laywine, C.F., Mullen, G.L.: Discrete Mathematics Using Latin Squares, vol. 49. Wiley, New York (1998)"},{"key":"23_CR14","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). http:\/\/dx.doi.org\/10.1007\/978-3-642-13858-4_13"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Minematsu, K., Matsushima, T.: New bounds for PMAC, TMAC, and XCBC. In: Biryukov [6], pp. 434\u2013451","DOI":"10.1007\/978-3-540-74619-5_27"},{"issue":"2","key":"23_CR16","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. Cryptology 2(2), 149\u2013162 (2008)","journal-title":"J. Math. Cryptology"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11787006_15","volume-title":"Automata, Languages and Programming","author":"K Pietrzak","year":"2006","unstructured":"Pietrzak, K.: A tight bound for EMAC. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 168\u2013179. Springer, Heidelberg (2006). http:\/\/dx.doi.org\/10.1007\/11787006_15"},{"key":"23_CR18","first-page":"1","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"Bart Preneel","year":"1995","unstructured":"Preneel, B., van Oorschot, P.C.: MDx-MAC and building fast MACs from hash functions. In: Coppersmith [8], pp. 1\u201314"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30539-2_2","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"P Rogaway","year":"2004","unstructured":"Rogaway, P.: Efficient instantiations of tweakable blockciphers and refinements to modes OCB and PMAC. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 16\u201331. Springer, Heidelberg (2004)"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Shoup, V.: New algorithms for finding irreducible polynomials over finite fields. In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24\u201326 October 1988, pp. 283\u2013290. IEEE Computer Society (1988). http:\/\/dx.doi.org\/10.1109\/SFCS.1988.21944","DOI":"10.1109\/SFCS.1988.21944"},{"issue":"3","key":"23_CR21","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). http:\/\/dx.doi.org\/10.1016\/0022-0000(81)90033-7","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR22","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). http:\/\/dx.doi.org\/10.1007\/978-3-642-22792-9_34"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-27954-6_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"K Yasuda","year":"2012","unstructured":"Yasuda, K.: PMAC with parity: minimizing the query-length influence. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 203\u2013214. Springer, Heidelberg (2012). http:\/\/dx.doi.org\/10.1007\/978-3-642-27954-6_13"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-319-16715-2_16","volume-title":"Topics in Cryptology \u2014 CT-RSA 2015","author":"Y Zhang","year":"2015","unstructured":"Zhang, Y.: Using an error-correction code for fast, beyond-birthday-bound authentication. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 291\u2013307. Springer, Heidelberg (2015). http:\/\/dx.doi.org\/10.1007\/978-3-319-16715-2_16"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49890-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T22:03:31Z","timestamp":1748901811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49890-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662498897","9783662498903"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49890-3_23","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":"28 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}