{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:41:05Z","timestamp":1725806465904},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319124742"},{"type":"electronic","value":"9783319124759"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12475-9_21","type":"book-chapter","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T05:25:19Z","timestamp":1412141119000},"page":"300-308","source":"Crossref","is-referenced-by-count":0,"title":["Equivalence between MAC, WCR and PRF for Blockcipher Based Constructions"],"prefix":"10.1007","author":[{"given":"Nilanjan","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","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). Citations in this document: \u00a71."},{"key":"21_CR2","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":"21_CR3","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\u00a0MACs. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 527\u2013545. Springer, Heidelberg (2005)"},{"key":"21_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 \u201994","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.\u00a0839, pp. 341\u2013358. Springer, Heidelberg (1994)"},{"key":"21_CR5","unstructured":"Bernstein, D.J.: A short proof of the unpredictability of cipher block chaining (2005), \n                    \n                      http:\/\/cr.yp.to\/papers.html#easycbc"},{"key":"21_CR6","unstructured":"Black, J.A., Rogaway, P.: CBC MACs for arbitrary-length messages: The three-key constructions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, p. 197. Springer, Heidelberg (2000). Citations in this document: \u00a71.1."},{"key":"21_CR7","unstructured":"Datta, N., Nandi, M.: Equivalence between MAC and PRF for Blockcipher based Constructions, ePrint Archive, 2013\/575 (2013). Citations in this document: \u00a72."},{"key":"21_CR8","unstructured":"Black, J.A., 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). Citations in this document: \u00a71.1."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. JACM, 792\u2013807 (1986). Citations in this document: \u00a71.","DOI":"10.1145\/6490.6503"},{"key":"21_CR10","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). Citations in this document: S1.1."},{"key":"21_CR11","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.\u00a02904, pp. 402\u2013415. Springer, Heidelberg (2003)"},{"key":"21_CR12","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":"21_CR13","unstructured":"Luby, M., Racko, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing, 373\u2013386 (1988). Citations in this document: \u00a71.1."},{"key":"21_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.: New Bounds for PMAC, TMAC, and XCBC. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol.\u00a04593, pp. 434\u2013451. Springer, Heidelberg (2007)"},{"key":"21_CR15","unstructured":"Mandal, A., Nandi, M.: Improved Security Analysis of PMAC. Journal of Mathematical Cryptology, 149\u2013162 (July 2008)"},{"key":"21_CR16","unstructured":"Nandi, M.: A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol.\u00a06147, pp. 212\u2013229. Springer, Heidelberg (2010). Citations in this document: \u00a71.1, \u00a71.2."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Nandi, M.: Improved security analysis for OMAC as a pseudorandom function. Journal of Mathematical Cryptology, 133\u2013148 (2009)","DOI":"10.1515\/JMC.2009.006"},{"key":"21_CR18","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). Citations in this document: \u00a71.1."},{"key":"21_CR19","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":"21_CR20","unstructured":"Patarin, J.: Etude des G\u00e9n\u00e9rateurs de Permutations Bas\u00e9s sur le Sch\u00e9ma du D.E.S., Phd Th\u00e9sis de Doctorat de l\u2019Universit\u00e9 de Paris 6 (1991)"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s001450010009","volume":"13","author":"E. Petrank","year":"2000","unstructured":"Petrank, E., Racko, C.: CBC MAC for real-time data sources. Journal of Cryptology\u00a013, 315\u2013338 (2000)","journal-title":"Journal of Cryptology"},{"key":"21_CR22","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":"21_CR23","unstructured":"Sarkar, P.: Pseudo-Random Functions and Parallelizable Modes of Operations of a Block Cipher (2009), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/217"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44983-3_14","volume-title":"Selected Areas in Cryptography","author":"S. Vaudenay","year":"2001","unstructured":"Vaudenay, S.: Decorrelation over infinite domains: The encrypted CBC-MAC case. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol.\u00a02012, pp. 189\u2013201. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12475-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T21:25:45Z","timestamp":1558992345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12475-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319124742","9783319124759"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12475-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}