{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:54:01Z","timestamp":1769313241609,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540746171","type":"print"},{"value":"9783540746195","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74619-5_27","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T10:19:51Z","timestamp":1187345991000},"page":"434-451","source":"Crossref","is-referenced-by-count":21,"title":["New Bounds for PMAC, TMAC, and XCBC"],"prefix":"10.1007","author":[{"given":"Kazuhiko","family":"Minematsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyasu","family":"Matsushima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Recommendation for Block Cipher Modes of Operation: The CMAC Mode for Authentication. NIST Special Publication 800-38B, available from \n                    \n                      http:\/\/csrc.nist.gov\/CryptoToolkit\/modes\/"},{"key":"27_CR2","unstructured":"den Boer, B., Boly, J.P., Bosselaers, A., Brandt, J., Chaum, D., Damg\u00e5rd, I., Dichtl, M., Fumy, W., van der Ham, M., Jansen, C.J.A., Landrock, P., Preneel, B., Roelofsen, G., de Rooij, P., Vandewalle, J.: RIPE Integrity Primitives, final report of RACE Integrity Primitives Evaluation (1995)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The Security of the Cipher Block Chaining Message Authentication Code. Journal of Computer and System Science\u00a061(3) (2000)","DOI":"10.1006\/jcss.1999.1694"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryptiont. In: FOCS \u201997. Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 394\u2013403 (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a03621, pp. 527\u2013541. Springer, Heidelberg (2005)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 164\u2013180. Springer, Heidelberg (2005)"},{"key":"27_CR7","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":"27_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"Carter, L., Wegman, M.: Universal Classes of Hash Functions. Journal of Computer and System Science\u00a018, 143\u2013154 (1979)","journal-title":"Journal of Computer and System Science"},{"key":"27_CR9","volume-title":"Algorithms and Combinatorics","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O.: Modern Cryptography, Probabilistic Proofs and Pseudorandomness. In: Algorithms and Combinatorics, vol.\u00a017, Springer, Heidelberg (1998)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a02904, pp. 402\u2013415. Springer, Heidelberg (2003)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"27_CR12","unstructured":"Krovetz, T., Rogaway, P.: The OCB Authenticated-Encryption Algorithm. Internet Draft (2005)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-36563-X_3","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"K. Kurosawa","year":"2003","unstructured":"Kurosawa, K., Iwata, T.: TMAC: Two-Key CBC MAC. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 33\u201349. Springer, Heidelberg (2003)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45708-9_3","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"M. Liskov","year":"2002","unstructured":"Liskov, M., Rivest, R.L., Wagner, D.: Tweakable Block Ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 31\u201346. Springer, Heidelberg (2002)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-46035-7_8","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"U. Maurer","year":"2002","unstructured":"Maurer, U.: Indistinguishability of Random Systems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 110\u2013132. Springer, Heidelberg (2002)"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/978-3-540-24638-1_23","volume-title":"Theory of Cryptography","author":"U. Maurer","year":"2004","unstructured":"Maurer, U., Pietrzak, K.: Composition of Random Systems: When Two Weak Make One Strong. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 410\u2013427. Springer, Heidelberg (2004)"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/11535218_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"K. Pietrzak","year":"2005","unstructured":"Pietrzak, K.: Composition Does Not Imply Adaptive Security. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 55\u201365. Springer, Heidelberg (2005)"},{"key":"27_CR18","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.\u00a04052, pp. 168\u2013179. Springer, Heidelberg (2006)"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a03329, pp. 16\u201331. Springer, Heidelberg (2004), \n                    \n                      http:\/\/www.cs.ucdavis.edu\/~rogaway\/papers\/offsets.pdf"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"Wegman, M., Carter, L.: New Hash Functions and Their Use in Authentication and Set Equality. Journal of Computer and System Sciences\u00a022, 265\u2013279 (1981)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74619-5_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:30:35Z","timestamp":1619519435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74619-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540746171","9783540746195"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74619-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}