{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:14:06Z","timestamp":1761930846352,"version":"build-2065373602"},"reference-count":22,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.2003.1210066","type":"proceedings-article","created":{"date-parts":[[2003,12,22]],"date-time":"2003-12-22T17:34:10Z","timestamp":1072114450000},"page":"261-270","source":"Crossref","is-referenced-by-count":45,"title":["An NP decision procedure for protocol insecurity with XOR"],"prefix":"10.1109","author":[{"given":"Y.","family":"Chevalier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Kusters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Rusinowitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Turuani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.1997.596790"},{"key":"22","doi-asserted-by":"crossref","DOI":"10.1109\/CSFW.1999.779773","article-title":"Athena: A new efficient automatic checker for security protocol analysis","author":"song","year":"1999","journal-title":"Proc 10th IEEE Computer Security Foundations Workshop"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502007"},{"key":"18","first-page":"201","article-title":"Finite-state analysis of SSL 3.0","author":"mitchell","year":"1998","journal-title":"Seventh USENIX Security Symposium"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61042-1_43"},{"key":"16","article-title":"A unification algorithm for the group Diffie-Hellman protocol","author":"meadows","year":"2002","journal-title":"Workshop on Issues in the Theory of Security (in Conjunction with POPL'02)"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45694-5_34"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00144-2"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2001.930144"},{"key":"12","article-title":"Analyzing protocols that use modular exponentiation: Semantic unification techniques","author":"kapur","year":"2003","journal-title":"Proc of RTAS'03"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00180-4"},{"key":"3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-46701-7_3","article-title":"Lazy infinite-state analysis of security protocols","author":"basin","year":"1999","journal-title":"Secure Networking - CQRE (Secure)'99"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2001.930145"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44618-4_28","article-title":"On the reachability problem in cryptographic protocols","author":"amadio","year":"2000","journal-title":"Proc of CONCUR 2000"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45694-5_33"},{"key":"10","article-title":"Undecidability of bounded security protocols","author":"durgin","year":"1999","journal-title":"Proc Workshop Formal Methods and Security Protocols"},{"key":"7","article-title":"Tree automata with memory, set constraints and ping pong protocols","author":"comon","year":"2001","journal-title":"Proc ICALP '01"},{"key":"6","first-page":"324","article-title":"Automated unbounded verification of security protocols","author":"chevalier","year":"2002","journal-title":"Proc CAV-2002"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2003.1210066"},{"key":"4","first-page":"667","article-title":"Symbolic trace analysis of cryptographic protocols","author":"boreale","year":"2001","journal-title":"Proc ICALP 2001"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.32"},{"journal-title":"Intruder Deductions Constraint Solving and Insecurity Decision in Presence of Exclusive or","year":"0","author":"comon","key":"8"}],"event":{"name":"18th Annual IEEE Symposium on Logic in Computer Science","acronym":"LICS-03","location":"Ottawa, Ont., Canada"},"container-title":["18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8592\/27231\/01210066.pdf?arnumber=1210066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T02:58:19Z","timestamp":1497581899000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1210066\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/lics.2003.1210066","relation":{},"subject":[]}}