{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:24:59Z","timestamp":1784996699615,"version":"3.55.0"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science (JSPS) KAKENHI","doi-asserted-by":"publisher","award":["22K11982"],"award-info":[{"award-number":["22K11982"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3368453","type":"journal-article","created":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T18:56:30Z","timestamp":1708541790000},"page":"31605-31625","source":"Crossref","is-referenced-by-count":5,"title":["How to Formalize Loop Iterations in Cryptographic Protocols Using ProVerif"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1646-2333","authenticated-orcid":false,"given":"Takehiko","family":"Mieno","sequence":"first","affiliation":[{"name":"Business Development Division, EPSON AVASYS Corporation, Shinshu University, Nagano, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroyuki","family":"Okazaki","sequence":"additional","affiliation":[{"name":"Graduate School of Science and Technology, Shinshu University, Nagano, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kenichi","family":"Arai","sequence":"additional","affiliation":[{"name":"School of Information and Data Sciences, Nagasaki University, Nagasaki, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuichi","family":"Futa","sequence":"additional","affiliation":[{"name":"School of Computer Science, Tokyo University of Technology, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","author":"Blanchet","year":"2024","journal-title":"ProVerif: Cryptographic Protocol Verifier in the Formal Model"},{"key":"ref2","author":"Blanchet","year":"2024","journal-title":"ProVerif 2.05: Automatic Cryptographic Protocol Verifier, User Manual and Tutorial"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/3300000004"},{"key":"ref4","author":"Basin","year":"2024","journal-title":"Tamarin Prover"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2012.25"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.1999.779762"},{"key":"ref7","author":"Cremers","year":"2024","journal-title":"Scyther 1.1.3: Automatic Verification of Security Protocols, Scyther User Manual"},{"key":"ref8","author":"Kobeissi","year":"2024","journal-title":"Verifpal"},{"key":"ref9","author":"Armando","year":"2005","journal-title":"AVISPA 1.1: Automated Validation of Internet Security Protocols and Applications"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_39"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646128"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27901-0_3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-015-9341-5"},{"key":"ref16","volume-title":"Evaluation of Some Blockcipher Modes of Operation","author":"Rogaway","year":"2012"},{"key":"ref17","first-page":"23","article-title":"Formalization of security requirements and attack models for cryptographic hash functions in ProVerif","volume-title":"Proc. Int. Conf. Secur. Manag. (SAM)","author":"Yoshimura"},{"key":"ref18","first-page":"602","article-title":"Formal verification of Merkle\u2013Damg\u00e5rd construction in ProVerif","volume-title":"Proc. Int. Symp. Inf. Theory Appl.","author":"Mieno"},{"key":"ref19","first-page":"245","article-title":"New collision attacks on SHA-1 based on optimal joint local-collision analysis","volume-title":"Proc. Adv. Cryptol. (EUROCRYPT)","author":"Marc"},{"key":"ref20","first-page":"19","article-title":"How to break MD5 and other hash functions","volume-title":"Proc. Adv. Cryptol. (EUROCRYPT)","author":"Xiaoyun"},{"key":"ref21","article-title":"Fast collision attack on MD5","author":"Stevens","year":"2006"},{"key":"ref22","first-page":"1","article-title":"Finding SHA-1 characteristics: General results and applications","volume-title":"Proc. Adv. Cryptol. (ASIACRYPT)","author":"Christophe"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2022.103376"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516679"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2019.00012"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2012.14"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_5"},{"key":"ref28","volume-title":"ProVerif Users Research Papers","year":"2024"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/sp46214.2022.9833653"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/sp46214.2022.9833777"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3501402"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559360"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560563"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/access.2023.3284832"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-17143-7_1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/access.2023.3234959"},{"key":"ref37","first-page":"5881","article-title":"A comprehensive, formal and automated analysis of the EDHOC protocol","volume-title":"Proc. 32nd USENIX Secur. Symp. (USENIX Security)","author":"Jacomme"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/csf57540.2023.00036"},{"key":"ref39","first-page":"3935","article-title":"SAPIC+: Protocol verifiers of the world, unite!","volume-title":"Proc. USENIX Secur. Symp. (USENIX Security)","author":"Cheval"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09527-0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/sp40001.2021.00008"},{"key":"ref42","first-page":"334","article-title":"Handbook of applied cryptography","author":"Menezes","year":"2024","journal-title":"Hash Functions and Data Integrity"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47555-9_5"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46035-7_35"},{"key":"ref45","author":"M\u00f6ller","year":"2024","journal-title":"This POODLE Bites: Exploiting The SSL 3.0 Fallback"},{"key":"ref46","first-page":"86","article-title":"Using horn clauses for analyzing security protocols","volume":"5","author":"Blanchet","year":"2011","journal-title":"Formal Models and Techniques for Analyzing Security Protocols"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2001.930138"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45789-5_25"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2004.1301317"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.8"},{"key":"ref51","doi-asserted-by":"crossref","DOI":"10.6028\/NIST.SP.800-38a","article-title":"Recommendation for block cipher modes of operation: Methods and techniques","author":"Dworkin","year":"2001"},{"key":"ref52","volume-title":"Cryptographic Protocol Verification Portal","year":"2024"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45473-x_1"},{"key":"ref54","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/978-1-4615-2694-0_23","article-title":"Higher order derivatives and differential cryptanalysis","volume-title":"Communications and Cryptography","author":"Lai","year":"1994"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1515\/9780691206844"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.6028\/nist.fips.180-1"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1321"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10443411.pdf?arnumber=10443411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T12:54:54Z","timestamp":1711457694000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10443411\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3368453","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}