{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:06:51Z","timestamp":1761743211719},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642014390"},{"type":"electronic","value":"9783642014406"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01440-6_10","type":"book-chapter","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T08:45:40Z","timestamp":1240908340000},"page":"96-114","source":"Crossref","is-referenced-by-count":4,"title":["Security of Truncated MACs"],"prefix":"10.1007","author":[{"given":"Peng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dengguo","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changlu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenling","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-48405-1_16","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J.H. An","year":"1999","unstructured":"An, J.H., Bellare, M.: Constructing VIL-mACs from FIL-mACs: Message authentication under weakened assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 252\u2013269. Springer, Heidelberg (1999)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/11818175_36","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M.: New proofs for NMAC and HMAC: Security without collision-resistance. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 602\u2013619. Springer, Heidelberg (2006)"},{"key":"10_CR3","unstructured":"Bellare, M., Goldreich, O., Mityagin, A.: The power of verification queries in message authentication and authenticated encryption. Cryptology ePrint Archive, Report 2004\/309 (2004), http:\/\/eprint.iacr.org\/"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-44750-4_2","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Gu\u00e9rin, R., Rogaway, P.: XOR mACs: New methods for message authentication using finite pseudorandom functions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 15\u201328. Springer, Heidelberg (1995)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"262","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. Journal of Computer and System Sciences\u00a061, 262\u2013399 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-73420-8_36","volume-title":"Automata, Languages and Programming","author":"M. Bellare","year":"2007","unstructured":"Bellare, M., Ristenpart, T.: Hash functions in the dedicated-key setting: Design choices and MPP transforms. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 399\u2013410. Springer, Heidelberg (2007)"},{"key":"10_CR7","unstructured":"Bernstein, D.J.: Floating-point arithmetic and message authentication (1999), http:\/\/cr.yp.to\/antiforgery\/hash127-20040918.pdf"},{"key":"10_CR8","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":"D.J. Bernstein","year":"2005","unstructured":"Bernstein, D.J.: The poly1305-AES message-authentication code. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol.\u00a03557, pp. 32\u201349. Springer, Heidelberg (2005)"},{"key":"10_CR9","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":"D.J. Bernstein","year":"2005","unstructured":"Bernstein, D.J.: Stronger security bounds for wegman-carter-shoup authenticators. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 164\u2013180. Springer, Heidelberg (2005)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-48405-1_14","volume-title":"Advances in Cryptology - CRYPTO \u201999","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.\u00a01666, pp. 216\u2013233. Springer, Heidelberg (1999)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44598-6_12","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J. Black","year":"2000","unstructured":"Black, J., Rogaway, P.: CBC mACs for arbitrary-length messages:The three-key constructions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 197\u2013215. Springer, Heidelberg (2000)"},{"key":"10_CR12","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":"J. Black","year":"2002","unstructured":"Black, J., Rogaway, P.: A block-cipher mode of operation for parallelizable message authentication. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 384\u2013397. Springer, Heidelberg (2002)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/11496137_13","volume-title":"Applied Cryptography and Network Security","author":"M. Boesgaard","year":"2005","unstructured":"Boesgaard, M., Christensen, T., Zenner, E.: Badger \u2013 A fast and provably secure MAC. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 176\u2013191. Springer, Heidelberg (2005)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Integrity Primitives for Secure Information Systems","year":"1995","unstructured":"Bosselaers, A., Preneel, B. (eds.): RIPE 1992. LNCS, vol.\u00a01007. Springer, Heidelberg (1995)"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018(2), 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-78967-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"Y. Dodis","year":"2008","unstructured":"Dodis, Y., Pietrzak, K., Puniya, P.: A new mode of operation for block ciphers and length-preserving MACs. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 198\u2013219. Springer, Heidelberg (2008)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-540-72540-4_31","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y. Dodis","year":"2007","unstructured":"Dodis, Y., Puniya, P.: Feistel networks made public, and applications. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 534\u2013554. Springer, Heidelberg (2007)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-48405-1_15","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Etzel","year":"1999","unstructured":"Etzel, M., Patel, S., Ramzan, Z.: Square hash: Fast message authentication via optimized universal hash functions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 234\u2013251. Springer, Heidelberg (1999)"},{"key":"10_CR19","unstructured":"FIPS-133. Federal information processing standards publication (FIPS 133). computer data authentication (1985)"},{"key":"10_CR20","unstructured":"FIPS-198. The keyed-hash message authentication code. Federal Information Processing Standards Publication (FIPS PUB) 198 (2002)"},{"key":"10_CR21","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.\u00a01267, pp. 172\u2013189. Springer, Heidelberg (1997)"},{"key":"10_CR22","unstructured":"ISO\/IEC. ISO\/IEC 9797-1, information technology security techniques message authentication codes (MACs) part 1: Mechanisms using a block cipher (1997)"},{"key":"10_CR23","unstructured":"ISO\/IEC. ISO\/IEC 9797-2, information technology security techniques message authentication codes (MACs) part 2: Mechanisms using a hash-function (2002)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-39887-5_11","volume-title":"Fast Software Encryption","author":"T. Iwata","year":"2003","unstructured":"Iwata, T., Kurosawa, K.: OMAC: One-key CBC MAC. In: Johansson, T. (ed.) FSE 2003. LNCS, vol.\u00a02887, pp. 129\u2013153. Springer, Heidelberg (2003)"},{"key":"10_CR25","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.\u00a02365, pp. 237\u2013251. Springer, Heidelberg (2002)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Krawczyk, H., Bellare, M., Canetti, R.: HMAC: Keyed-hashing for message authentication. RFC 2104 (1997)","DOI":"10.17487\/rfc2104"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-74462-7_23","volume-title":"Selected Areas in Cryptography","author":"T. Krovetz","year":"2007","unstructured":"Krovetz, T.: Message authentication on 64-bit architectures. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol.\u00a04356, pp. 327\u2013341. Springer, Heidelberg (2007)"},{"issue":"1","key":"10_CR28","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ipl.2005.11.026","volume":"100","author":"T. Krovetz","year":"2006","unstructured":"Krovetz, T., Rogaway, P.: Variationally universal hashing. Information Processing Letters\u00a0100(1), 36\u201339 (2006)","journal-title":"Information Processing Letters"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11586821_12","volume-title":"Cryptography and Coding","author":"U.M. 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.\u00a03796, pp. 168\u2013185. Springer, Heidelberg (2005)"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/11523468_39","volume-title":"Automata, Languages and Programming","author":"U.M. 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.\u00a03580, pp. 472\u2013484. Springer, Heidelberg (2005)"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0055734","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Naor","year":"1998","unstructured":"Naor, M., Reingold, O.: From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs (extended abstract). In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 267\u2013282. Springer, Heidelberg (1998)"},{"key":"10_CR32","unstructured":"NIST. Recommendation for block cipher modes of operation: The CMAC mode for authentication. NIST Special Publication 800-38B (2005), http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-38B\/SP_800-38B.pdf"},{"issue":"3","key":"10_CR33","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s001450010009","volume":"13","author":"E. Petrank","year":"2000","unstructured":"Petrank, E., Rackoff, C.: CBC MAC for real-time data sources. Journal of Cryptology\u00a013(3), 315\u2013338 (2000)","journal-title":"Journal of Cryptology"},{"key":"10_CR34","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 \u201995","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.\u00a0963, pp. 29\u201342. Springer, Heidelberg (1995)"},{"key":"10_CR35","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 \u201996","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.\u00a01109, pp. 313\u2013328. Springer, Heidelberg (1996)"},{"issue":"3","key":"10_CR36","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, L.: New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences\u00a022(3), 265\u2013279 (1981)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01440-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:47:54Z","timestamp":1558277274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01440-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642014390","9783642014406"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01440-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}