{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:26:47Z","timestamp":1769718407889,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642138577","type":"print"},{"value":"9783642138584","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13858-4_12","type":"book-chapter","created":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T13:38:09Z","timestamp":1277386689000},"page":"212-229","source":"Crossref","is-referenced-by-count":14,"title":["A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs"],"prefix":"10.1007","author":[{"given":"Mridul","family":"Nandi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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":"12_CR2","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 Analysis for CBC MACs. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 527\u2013545. Springer, Heidelberg (2005)"},{"key":"12_CR3","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 \u201994","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Killan, J., Rogaway, P.: The security of the cipher block chanining Message Authentication Code. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 341\u2013358. Springer, Heidelberg (1994)"},{"key":"12_CR4","unstructured":"Bernstein, D.J.: A short proof of the unpredictability of cipher block chaining (2005), http:\/\/cr.yp.to\/papers.html#easycbc ID 24120a1f8b92722b5e1 5fbb6a86521a0"},{"key":"12_CR5","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. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 197\u2013215. Springer, Heidelberg (2000)"},{"key":"12_CR6","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 Operations for Parallelizable Message Authentication. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 384\u2013397. Springer, Heidelberg (2002)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A Design Principle for Hash Functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33-4","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. JACM\u00a033-4, 792\u2013807 (1986)","journal-title":"JACM"},{"key":"12_CR9","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":"12_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":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/11681878_29","volume-title":"Theory of Cryptography","author":"C.S. Jutla","year":"2006","unstructured":"Jutla, C.S.: PRF Domain Extension using DAG. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 561\u2013580. Springer, Heidelberg (2006)"},{"key":"12_CR12","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)"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudo-random permutations from pseudo-random functions. SIAM Journal on Computing archive\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM Journal on Computing archive"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-74619-5_27","volume-title":"Fast Software Encryption","author":"K. Minematsu","year":"2007","unstructured":"Minematsu, K., Matsushima, T.: Improved Security Bounds for PMAC, TMAC, and XCBC. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol.\u00a04593, pp. 434\u2013451. Springer, Heidelberg (2007)"},{"issue":"2","key":"12_CR15","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. Journal of Mathematical Cryptology\u00a02(2), 149\u2013162 (2008)","journal-title":"Journal of Mathematical Cryptology"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R. Merkle","year":"1990","unstructured":"Merkle, R.: One Way Hash Functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 428\u2013446. Springer, Heidelberg (1990)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Nandi, M.: A Unified Method for Improving PRF Bounds for a Class of Blockcipher based MACs. Cryptology eprint archive 2009\/014 (2009)","DOI":"10.1007\/978-3-642-13858-4_12"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1515\/JMC.2009.006","volume":"3","author":"M. Nandi","year":"2009","unstructured":"Nandi, M.: Improved security analysis for OMAC as a pseudorandom function. Journal of Mathematical Cryptology\u00a03(2), 133\u2013148 (2009)","journal-title":"Journal of Mathematical Cryptology"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-03317-9_23","volume-title":"Fast Software Encryption","author":"M. Nandi","year":"2009","unstructured":"Nandi, M.: Fast and Secure CBC-Type MAC Algorithms. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol.\u00a05665, pp. 375\u2013393. Springer, Heidelberg (2009)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/11941378_23","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"M. Nandi","year":"2006","unstructured":"Nandi, M.: A Simple and Unified Method of Proving Indistinguishability. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 317\u2013334. Springer, Heidelberg (2006)"},{"key":"12_CR21","unstructured":"Patarin, J.: Etude des G\u00e9n\u00e9rateurs de Permutations Bas\u00e9s sur le Sch\u00e9ma du D.E.S., Phd Th\u00e8sis de Doctorat de l\u2019Universit\u00e9 de Paris 6 (1991)"},{"issue":"3","key":"12_CR22","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":"12_CR23","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":"12_CR24","unstructured":"Sarkar, P.: Pseudo-Random Functions and Parallelizable Modes of Operations of a Block Cipher, http:\/\/eprint.iacr.org\/2009\/217"},{"key":"12_CR25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.4310\/CIS.2001.v1.n1.a5","volume":"1","author":"S. Vaudenay","year":"2001","unstructured":"Vaudenay, S.: Decorrelation over infinite domains: the encrypted CBC-MAC case. Communications in Information and Systems (CIS)\u00a01, 75\u201385 (2001)","journal-title":"Communications in Information and Systems (CIS)"},{"issue":"4","key":"12_CR26","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00145-003-0220-6","volume":"16","author":"S. Vaudenay","year":"2003","unstructured":"Vaudenay, S.: Decorrelation: A Theory for Block Cipher Security. J. Cryptology\u00a016(4), 249\u2013286 (2003)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13858-4_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:44:25Z","timestamp":1606185865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13858-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642138577","9783642138584"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13858-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}