{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:41:01Z","timestamp":1648939261229},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T00:00:00Z","timestamp":1478044800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00453-016-0236-6","type":"journal-article","created":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T12:23:47Z","timestamp":1478089427000},"page":"1161-1195","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Generic Attacks Against Hash-Based MACs and HAIFA"],"prefix":"10.1007","volume":"79","author":[{"given":"Itai","family":"Dinur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ga\u00ebtan","family":"Leurent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,2]]},"reference":[{"key":"236_CR1","unstructured":"Aumasson, J.P., Henzen, L., Meier, W., Phan, R.C.W.: SHA-3 proposal BLAKE. Submission to NIST. http:\/\/131002.net\/blake\/blake.pdf (2008\/2010)"},{"key":"236_CR2","doi-asserted-by":"crossref","unstructured":"Aumasson, J.P., Neves, S., Wilcox-O\u2019Hearn, Z., Winnerlein, C.: BLAKE2: simpler, smaller, fast as MD5. In: Jacobson, M.J.J. Jr., Locasto, M.E., Mohassel, P., Safavi-Naini, R. (eds.) ACNS. Lecture Notes in Computer Science, vol. 7954, pp. 119\u2013135. Springer (2013)","DOI":"10.1007\/978-3-642-38980-1_8"},{"key":"236_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M.: New proofs for NMAC and HMAC: security without collision-resistance. In: Dwork, C. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 4117, pp. 602\u2013619. Springer (2006)","DOI":"10.1007\/11818175_36"},{"key":"236_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 1109, pp. 1\u201315. Springer (1996)","DOI":"10.1007\/3-540-68697-5_1"},{"key":"236_CR5","unstructured":"Biham, E., Dunkelman, O.: A framework for iterative hash functions\u2014HAIFA. IACR Cryptology ePrint Archive, Report 2007\/278 (2007)"},{"key":"236_CR6","doi-asserted-by":"crossref","unstructured":"Dinur, I., Leurent, G.: Improved generic attacks against hash-based MACs and HAIFA. In: Garay and Gennaro [10], pp. 149\u2013168","DOI":"10.1007\/978-3-662-44371-2_9"},{"key":"236_CR7","doi-asserted-by":"crossref","unstructured":"Dolmatov, V., Degtyarev, A.: GOST R 34.11-2012: hash function. RFC 6986 (informational), Aug 2013. http:\/\/www.ietf.org\/rfc\/rfc6986.txt","DOI":"10.17487\/rfc6986"},{"key":"236_CR8","unstructured":"Ferguson, N., Lucks, S., Schneier, B., Whiting, D., Bellare, M., Kohno, T., Callas, J., Walker, J.: The Skein hash function family. Submission to NIST. http:\/\/skein-hash.info (2008\/2010)"},{"key":"236_CR9","unstructured":"Flajolet, P., Odlyzko, A.M.: Random mapping statistics. In: Quisquater, J., Vandewalle, J. (eds.) Advances in Cryptology\u2014EUROCRYPT \u201989, Workshop on the Theory and Application of Cryptographic Techniques, Houthalen, Belgium, 10\u201313 Apr 1989, Proceedings. Lecture Notes in Computer Science, vol. 434, pp. 329\u2013354. Springer (1989)"},{"key":"236_CR10","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Gennaro, R. (eds.): Advances in Cryptology\u2014CRYPTO 2014\u201434th Annual Cryptology Conference, Santa Barbara, CA, USA, 17\u201321 Aug 2014, Proceedings, Part I, Lecture Notes in Computer Science, vol. 8616. Springer (2014)","DOI":"10.1007\/978-3-662-44381-1"},{"key":"236_CR11","doi-asserted-by":"crossref","unstructured":"Guo, J., Peyrin, T., Sasaki, Y., Wang, L.: Updates on generic attacks against HMAC and NMAC. In: Garay and Gennaro [10], pp. 131\u2013148","DOI":"10.1007\/978-3-662-44371-2_8"},{"key":"236_CR12","doi-asserted-by":"crossref","unstructured":"Guo, J., Sasaki, Y., Wang, L., Wang, M., Wen, L.: Equivalent key recovery attacks against HMAC and NMAC with Whirlpool reduced to 7 rounds. In: Cid, C., Rechberger, C. (eds.) Fast Software Encryption\u201421st International Workshop, FSE 2014, London, UK, 3-5 Mar 2014. Revised Selected Papers. Lecture Notes in Computer Science, vol. 8540, pp. 571\u2013590. Springer (2014)","DOI":"10.1007\/978-3-662-46706-0_29"},{"key":"236_CR13","doi-asserted-by":"crossref","unstructured":"Guo, J., Sasaki, Y., Wang, L., Wu, S.: Cryptanalysis of HMAC\/NMAC-Whirlpool. In: Sako and Sarkar [24], pp. 21\u201340","DOI":"10.1007\/978-3-642-42045-0_2"},{"key":"236_CR14","doi-asserted-by":"crossref","unstructured":"Joux, A.: Multicollisions in iterated hash functions. Application to cascaded constructions. In: Franklin, M.K. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 3152, pp. 306\u2013316. Springer (2004)","DOI":"10.1007\/978-3-540-28628-8_19"},{"key":"236_CR15","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Kohno, T.: Herding hash functions and the Nostradamus attack. In: Vaudenay, S. (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 4004, pp. 183\u2013200. Springer (2006)","DOI":"10.1007\/11761679_12"},{"key":"236_CR16","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B.: Second preimages on n-bit hash functions for much less than 2 $$^{n}$$ n work. In: Cramer, R. (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 3494, pp. 474\u2013490. Springer (2005)","DOI":"10.1007\/11426639_28"},{"key":"236_CR17","doi-asserted-by":"crossref","unstructured":"Kortelainen, T., Kortelainen, J.: On diamond structures and trojan message attacks. In: Sako and Sarkar [24] pp. 524\u2013539","DOI":"10.1007\/978-3-642-42045-0_27"},{"key":"236_CR18","unstructured":"Leurent, G., Peyrin, T., Wang, L.: New generic attacks against hash-based MACs. IACR Cryptology ePrint Archive 2014, 406. http:\/\/eprint.iacr.org\/2014\/406 (2014)"},{"key":"236_CR19","doi-asserted-by":"crossref","unstructured":"Leurent, G., Peyrin, T., Wang, L.: New generic attacks against hash-based MACs. In: Sako and Sarkar [24], pp. 1\u201320","DOI":"10.1007\/978-3-642-42045-0_1"},{"key":"236_CR20","doi-asserted-by":"crossref","unstructured":"Love, E.R.: Some logarithm inequalities. Math. Gaz. 64(427), 55\u201357. http:\/\/www.jstor.org\/stable\/3615890 (1980)","DOI":"10.2307\/3615890"},{"key":"236_CR21","doi-asserted-by":"crossref","unstructured":"Naito, Y., Sasaki, Y., Wang, L., Yasuda, K.: Generic state-recovery and forgery attacks on ChopMD-MAC and on NMAC\/HMAC. In: Sakiyama, K., Terada, M. (eds.) IWSEC. Lecture Notes in Computer Science, vol. 8231, pp. 83\u201398. Springer (2013)","DOI":"10.1007\/978-3-642-41383-4_6"},{"key":"236_CR22","doi-asserted-by":"crossref","unstructured":"Peyrin, T., Sasaki, Y., Wang, L.: Generic related-key attacks for HMAC. In: Wang, X., Sako, K. (eds.) ASIACRYPT. Lecture Notes in Computer Science, vol. 7658, pp. 580\u2013597. Springer (2012)","DOI":"10.1007\/978-3-642-34961-4_35"},{"key":"236_CR23","doi-asserted-by":"crossref","unstructured":"Peyrin, T., Wang, L.: Generic universal forgery attack on iterative hash-based MACs. In: Nguyen, P.Q., Oswald, E. (eds.) Advances in Cryptology\u2014EUROCRYPT 2014\u201433rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, 11\u201315 May 2014. Proceedings. Lecture Notes in Computer Science, vol. 8441, pp. 147\u2013164. Springer (2014)","DOI":"10.1007\/978-3-642-55220-5_9"},{"key":"236_CR24","doi-asserted-by":"crossref","unstructured":"Sako, K., Sarkar, P. (eds.): Advances in Cryptology\u2014ASIACRYPT 2013\u201419th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, 1\u20135 Dec 2013, Proceedings, Part II, Lecture Notes in Computer Science, vol. 8270. Springer (2013)","DOI":"10.1007\/978-3-642-42045-0"},{"issue":"5","key":"236_CR25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/141809.141812","volume":"22","author":"G Tsudik","year":"1992","unstructured":"Tsudik, G.: Message authentication with one-way hash functions. SIGCOMM Comput. Commun. Rev. 22(5), 29\u201338 (1992)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"1","key":"236_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC Oorschot van","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."},{"key":"236_CR27","doi-asserted-by":"crossref","unstructured":"Yasuda, K.: \u201cSandwich\u201d is indeed secure: how to authenticate a message with just one hashing. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP. Lecture Notes in Computer Science, vol. 4586, pp. 355\u2013369. Springer (2007)","DOI":"10.1007\/978-3-540-73458-1_26"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0236-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0236-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0236-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T06:39:27Z","timestamp":1568529567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0236-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,2]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["236"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0236-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,2]]}}}