{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:48:11Z","timestamp":1770745691893,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440093","type":"print"},{"value":"9783540456612","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45661-9_19","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T11:02:03Z","timestamp":1179745323000},"page":"237-251","source":"Crossref","is-referenced-by-count":57,"title":["On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit A New Construction"],"prefix":"10.1007","author":[{"given":"\u00c9liane","family":"Jaulmes","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Joux","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Valette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,12]]},"reference":[{"key":"19_CR1","series-title":"Lect Notes Comput Sci","volume-title":"CRYPTO\u201996","author":"M. Bellare","year":"1996","unstructured":"M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In CRYPTO\u201996, volume 1109 of LNCS. Springer, 1996."},{"key":"19_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-48405-1_17","volume-title":"CRYPTO\u201999","author":"M. Bellare","year":"1999","unstructured":"M. Bellare, O. Goldreich, and H. Krawczyk. Stateless evaluation of pseudorandom functions: Security beyond the birthday barrier. In CRYPTO\u201999, volume 1666 of LNCS, pages 270\u2013287. Springer, 1999."},{"key":"19_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-44750-4_2","volume-title":"CRYPTO\u201995","author":"M. Bellare","year":"1995","unstructured":"M. Bellare, R. Guerin, and P. Rogaway. XOR MACs: New methods for message authentication using finite pseudorandom functions. In CRYPTO\u201995, volume 963 of LNCS, pages 15\u201328. Springer-Verlag, 1995."},{"key":"19_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-48658-5_32","volume-title":"CRYPTO\u201994","author":"M. Bellare","year":"1994","unstructured":"M. Bellare, J. Killian, and P. Rogaway. The security of the cipher block chaining message authentication code. In CRYPTO\u201994, volume 839 of LNCS, pages 341\u2013358. Springer, 1994. See new version at \n                    http:\/\/www.cs.ucdavis.edu\/~rogaway\/\n                    \n                  ."},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/BFb0054132","volume-title":"EUROCRYPT\u201998","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, T. Krovetz, and P. Rogaway. Luby-rackoff backwards: increasing security by making block-ciphers non-invertible. In EUROCRYPT\u201998, volume 1403 of LNCS, pages 266\u2013280. Springer, 1998."},{"key":"19_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48405-1_14","volume-title":"CRYPTO\u201999","author":"J. Black","year":"1999","unstructured":"J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway. UMAC: Fast and secure message authentication. In CRYPTO\u201999, volume 1666 of LNCS, pages 216\u2013233. Springer-Verlag, 1999."},{"key":"19_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44598-6_12","volume-title":"CRYPTO 2000","author":"J. Black","year":"2000","unstructured":"J. Black and P. Rogaway. CBC MACs for arbitrary-length messages: The three-key constructions. In CRYPTO 2000, volume 1880 of LNCS, pages 197\u2013215. Springer, 2000."},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/BFb0055742","volume-title":"CRYPTO\u201998","author":"C. Hall","year":"1998","unstructured":"C. Hall, D. Wagner, J. Kelsey, and B. Schneier. Building PRFs from PRPs. In CRYPTO\u201998, volume 1462 of LNCS, pages 370\u2013389. Springer, 1998."},{"key":"19_CR9","unstructured":"International Organization for Standards, Geneva, Switzerland. ISO\/IEC 9797-1. Information Technology-Security Techniques-Data integrity mechanism using a cryptographic check function employing a block cipher algorithm, second edition edition, 1999."},{"key":"19_CR10","unstructured":"\u00c9. Jaulmes, A. Joux, and F. Valette. On the security of randomized cbc-mac beyond the birthday paradox limit: A new construction. Available at \n                    http:\/\/eprint.iacr.org\n                    \n                  , 2002. Full version of this paper."},{"key":"19_CR11","unstructured":"E. Petrank and C. Rackoff. CBC-MAC for real-time data sources. Technical Report 97-10, Dimacs, 1997."},{"key":"19_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60590-8","volume-title":"CRYPTO\u201995","author":"B. Preneel","year":"1995","unstructured":"B. Preneel and P. van Oorschot. MDx-MAC and building fast MACs from hash functions. In CRYPTO\u201995, volume 963 of LNCS, pages 1\u201314. Springer, 1995."},{"key":"19_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-44598-6_13","volume-title":"CRYPTO 2000","author":"M. Semanko","year":"2000","unstructured":"M. Semanko. L-collision attacks against randomized MACs. In CRYPTO 2000, volume 1880 of LNCS, pages 216\u2013228. Springer, 2000."},{"key":"19_CR14","unstructured":"U.S. Department of Commerce\/National Bureau of Standards, National Technical Information Service, Springfield, Virginia. FIPS 113. Computer Data Authentication. Federal Information Processing Standards Publication 113, 1994."},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"M. Wegman and J. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22(3):265\u2013279, 1981.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45661-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T20:56:19Z","timestamp":1550350579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45661-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440093","9783540456612"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45661-9_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}