{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:29Z","timestamp":1725502049805},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775041"},{"type":"electronic","value":"9783540775058"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77505-8_2","type":"book-chapter","created":{"date-parts":[[2008,1,24]],"date-time":"2008-01-24T12:56:35Z","timestamp":1201179395000},"page":"13-27","source":"Crossref","is-referenced-by-count":1,"title":["A Symbolic Intruder Model for Hash-Collision Attacks"],"prefix":"10.1007","author":[{"given":"Yannick","family":"Chevalier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mounira","family":"Kourjieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10207-004-0055-7","volume":"4","author":"D.A. Basin","year":"2005","unstructured":"Basin, D.A., M\u00f6dersheim, S., Vigan\u00f2, L.: Ofmc: A symbolic model checker for security protocols. Int. J. Inf. Sec.\u00a04(3), 181\u2013208 (2005)","journal-title":"Int. J. Inf. Sec."},{"key":"2_CR2","unstructured":"Baudet, M.: Random polynomial-time attacks and Dolev-Yao models. In: Anantharaman, S. (ed.) SASYFT 2004. Proceedings of the Workshop on Security of Systems: Formalism and Tools, Orl\u00e9ans, France (June 2004)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-28628-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"E. Biham","year":"2004","unstructured":"Biham, E., Chen, R.: Near-collisions of sha-0. In: Frankli, M.K. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 290\u2013305. Springer, Heidelberg (2004)"},{"key":"2_CR4","unstructured":"Chevalier, Y., Kourjieh, M.: A symbolic intruder model for hash-collision attacks. Technical report, IRIT (to appear)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/11523468_52","volume-title":"Automata, Languages and Programming","author":"Y. Chevalier","year":"2005","unstructured":"Chevalier, Y., Rusinowitch, M.: Combining intruder theories. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 639\u2013651. Springer, Heidelberg (2005)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Term Rewriting and Applications","author":"Y. Chevalier","year":"2005","unstructured":"Chevalier, Y., Rusinowitch, M.: Hierarchical combination of intruder theories. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, Springer, Heidelberg (2005)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","first-page":"22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","year":"2005","unstructured":"Cramer, R.J.F. (ed.): EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 22\u201326. Springer, Heidelberg (2005)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M. Daum","year":"2005","unstructured":"Daum, M., Lucks, S.: Attacking hash functions by poisoned messages. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, Springer, Heidelberg (2005), \n                    \n                      http:\/\/www.cits.rub.de\/MD5Collisions"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-48285-7_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"B. Boer den","year":"1994","unstructured":"den Boer, B., Bosselaers, A.: Collisions for the compressin function of md5. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 293\u2013304. Springer, Heidelberg (1994)"},{"key":"2_CR10","unstructured":"Kl\u00ecma, V.: Finding md5 collisions on a notebook pc using multi-message modificatons, Cryptology ePrint Archive, Report 2005\/102 (2005), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055035","volume-title":"ICALP","author":"K.G.. Larsen","year":"1998","unstructured":"Larsen, K.G., Skyum, S., Winskel, G.: Automata, languages and programming. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 13\u201317. Springer, Heidelberg (1998)"},{"key":"2_CR12","unstructured":"Turuani, M.: The cl-atse protocol analyser, 17th international conference on term rewriting and applications - rta 2006, seattle, wa\/usa (July 12 2006) 4098, 277\u2013286 (2006)"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0743-1066(95)00095-X","volume":"26","author":"C. Meadows","year":"1996","unstructured":"Meadows, C.: The NRL protocol analyzer: an overview. Journal of Logic Programming\u00a026(2), 113\u2013131 (1996)","journal-title":"Journal of Logic Programming"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: Satisfiability of word equations with constants is in pspace. In: FOCS, pp. 495\u2013500 (1999)","DOI":"10.1109\/SFFCS.1999.814622"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: Satisfiability of word equations with constants is in pspace. J. ACM, 483\u2013496 (2004)","DOI":"10.1145\/990308.990312"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/BFb0055097","volume-title":"Automata, Languages and Programming","author":"W. Plandowski","year":"1998","unstructured":"Plandowski, W., Rytter, W.: Application of lempel-ziv encodings to the solution of words equations. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 731\u2013742. Springer, Heidelberg (1998)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-55124-7_4","volume-title":"Word Equations and Related Topics","author":"K.U. Schulz","year":"1992","unstructured":"Schulz, K.U.: Makanin\u2019s algorithm for word equations - two improvements and a generalization. In: Schulz, K.U. (ed.) IWWERT 1990. LNCS, vol.\u00a0572, pp. 85\u2013150. Springer, Heidelberg (1992)"},{"key":"2_CR18","unstructured":"Wang, X., Feng, D., Lai, X., Yu, H.: Collisions for hash functions md4, md5, haval-128 and ripemd (2004), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the hash functions md4 and ripemd. In: Cramer [7], pp. 1\u201318","DOI":"10.1007\/11426639_1"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11535218_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full sha-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Wang, X., Yu, H.: How to break md5 and other hash functions. In: Cramer [7], pp. 19\u201335","DOI":"10.1007\/11426639_2"},{"key":"2_CR22","unstructured":"Yajima, J., Shimoyama, T.: Wang\u2019s sufficient conditions of md5 are not sufficient (2005), \n                    \n                      http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77505-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T04:44:12Z","timestamp":1548391452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77505-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540775041","9783540775058"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77505-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}