{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:51:01Z","timestamp":1730314261196,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,11,3]]},"DOI":"10.1145\/1180337.1180340","type":"proceedings-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T01:15:56Z","timestamp":1168996556000},"page":"23-32","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["An intruder model for verifying liveness in security protocols"],"prefix":"10.1145","author":[{"given":"Jan","family":"Cederquist","sequence":"first","affiliation":[{"name":"University of Twente, Enschede, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Torabi","family":"Dashti","sequence":"additional","affiliation":[{"name":"Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"316","volume-title":"SAS '03","author":"Abadi M.","year":"2003","unstructured":"M. Abadi and B. Blanchet . Computer-assisted verification of a protocol for certified email . In SAS '03 , volume 2694 of LNCS , pages 316 -- 335 , 2003 .]] M. Abadi and B. Blanchet. Computer-assisted verification of a protocol for certified email. In SAS '03, volume 2694 of LNCS, pages 316--335, 2003.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.481513"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(00)00249-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.1998.674826"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.839935"},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","first-page":"105","volume-title":"WDAG '96","author":"Basu A.","year":"1996","unstructured":"A. Basu , B. Charron-Bost , and S. Toueg . Simulating reliable links with unreliable links in the presence of process crashes . In WDAG '96 , volume 1151 of LNCS , pages 105 -- 122 . Springer , 1996 .]] A. Basu, B. Charron-Bost, and S. Toueg. Simulating reliable links with unreliable links in the presence of process crashes. In WDAG '96, volume 1151 of LNCS, pages 105--122. Springer, 1996.]]"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","first-page":"91","volume-title":"TPHOL'01","author":"Bella G.","year":"2001","unstructured":"G. Bella and L. C. Paulson . Mechanical proofs about a non-repudiation protocol . In TPHOL'01 , volume 2152 of LNCS , pages 91 -- 104 . Springer , 2001 .]] G. Bella and L. C. Paulson. Mechanical proofs about a non-repudiation protocol. In TPHOL'01, volume 2152 of LNCS, pages 91--104. Springer, 2001.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90088-X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602897_3"},{"key":"e_1_3_2_1_12_1","series-title":"IFIP","first-page":"41","volume-title":"Formal Aspect of Security and Trust","author":"Cederquist J.","year":"2004","unstructured":"J. Cederquist and M. Dashti . Formal analysis of a fair payment protocol . In Formal Aspect of Security and Trust , volume 173 of IFIP , pages 41 -- 54 . Springer , 2004 .]] J. Cederquist and M. Dashti. Formal analysis of a fair payment protocol. In Formal Aspect of Security and Trust, volume 173 of IFIP, pages 41--54. Springer, 2004.]]"},{"key":"e_1_3_2_1_13_1","volume-title":"LICS'01","author":"Cervesato I.","year":"2001","unstructured":"I. Cervesato . The Dolev-Yao intruder is the most powerful attacker . In LICS'01 . IEEE Computer Society Press, 16- -19 June 2001 .]] I. Cervesato. The Dolev-Yao intruder is the most powerful attacker. In LICS'01. IEEE Computer Society Press, 16--19 June 2001.]]"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","first-page":"324","volume-title":"CAV '02","author":"Chevalier Y.","year":"2002","unstructured":"Y. Chevalier and L. Vigneron . Automated unbounded verification of security protocols . In CAV '02 , volume 2404 of LNCS , pages 324 -- 337 . Springer , 2002 .]] Y. Chevalier and L. Vigneron. Automated unbounded verification of security protocols. In CAV '02, volume 2404 of LNCS, pages 324--337. Springer, 2002.]]"},{"key":"e_1_3_2_1_15_1","first-page":"3","article-title":"Is it possible to decide whether a cryptographic protocol is secure or not?","volume":"4","author":"Comon H.","year":"2002","unstructured":"H. Comon and V. Shmatikov . Is it possible to decide whether a cryptographic protocol is secure or not? J. of Telecommunications and Information Technology , 4 : 3 -- 13 , 2002 .]] H. Comon and V. Shmatikov. Is it possible to decide whether a cryptographic protocol is secure or not? J. of Telecommunications and Information Technology, 4:3--13, 2002.]]","journal-title":"J. of Telecommunications and Information Technology"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"key":"e_1_3_2_1_17_1","first-page":"995","volume-title":"Handbook of theoretical computer science (vol. B): formal models and semantics","author":"Emerson E.","year":"1990","unstructured":"E. Emerson . Temporal and modal logic . In J. van Leeuwen, editor, Handbook of theoretical computer science (vol. B): formal models and semantics , pages 995 -- 1072 . MIT Press , 1990 .]] E. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of theoretical computer science (vol. B): formal models and semantics, pages 995--1072. MIT Press, 1990.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/22587.22589"},{"key":"e_1_3_2_1_19_1","unstructured":"R. Engelschall. URL rewriting engine. Apache HTTP Server Version 1.3.]]  R. Engelschall. URL rewriting engine. Apache HTTP Server Version 1.3.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"N. Francez. Fairness. Springer 1986.]]   N. Francez. Fairness. Springer 1986.]]","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"e_1_3_2_1_22_1","first-page":"26","volume-title":"Workshops in Computing Series","author":"Groote J. F.","year":"1995","unstructured":"J. F. Groote and A. Ponse . The syntax and semantics of \u03bc. In Algebra of Communicating Processes , Workshops in Computing Series , pages 26 -- 62 . Springer , 1995 .]] J. F. Groote and A. Ponse. The syntax and semantics of \u03bc. In Algebra of Communicating Processes, Workshops in Computing Series, pages 26--62. Springer, 1995.]]"},{"key":"e_1_3_2_1_23_1","series-title":"LNCS","first-page":"193","volume-title":"ISC '03","author":"G\u00fcrgens S.","year":"2003","unstructured":"S. G\u00fcrgens , C. Rudolph , and H. Vogt . On the security of fair non-repudiation protocols . In ISC '03 , volume 2851 of LNCS , pages 193 -- 207 , 2003 .]] S. G\u00fcrgens, C. Rudolph, and H. Vogt. On the security of fair non-repudiation protocols. In ISC '03, volume 2851 of LNCS, pages 193--207, 2003.]]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/859246.859250"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359585"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_20"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00049-X"},{"key":"e_1_3_2_1_28_1","series-title":"LNCS","first-page":"551","volume-title":"CONCUR'01","author":"Kremer S.","year":"2001","unstructured":"S. Kremer and J. Raskin . A game-based verification of non-repudiation and fair exchange protocols . In CONCUR'01 , volume 2154 of LNCS , pages 551 -- 565 . Springer , 2001 .]] S. Kremer and J. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In CONCUR'01, volume 2154 of LNCS, pages 551--565. Springer, 2001.]]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(02)00094-1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.806125"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/201019.201032"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/353677.353681"},{"issue":"45","key":"e_1_3_2_1_33_1","first-page":"60","article-title":"a temporal logic of concurrent programs","volume":"13","author":"Pnueli A.","year":"1981","unstructured":"A. Pnueli . a temporal logic of concurrent programs . Theor. Comput. Sci. , 13 : 45 -- 60 , 1981 .]] A. Pnueli. a temporal logic of concurrent programs. Theor. Comput. Sci., 13:45 -- 60, 1981.]]","journal-title":"Theor. Comput. Sci."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00141-4"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45126-6_15"},{"key":"e_1_3_2_1_36_1","series-title":"LNCS","first-page":"101","volume-title":"WELCOM '01","author":"Vogt H.","year":"2001","unstructured":"H. Vogt , H. Pagnia , and F. G\u00e4rtner . Using smart cards for fair exchange . In WELCOM '01 , volume 2232 of LNCS , pages 101 -- 113 . Springer , 2001 .]] H. Vogt, H. Pagnia, and F. G\u00e4rtner. Using smart cards for fair exchange. In WELCOM '01, volume 2232 of LNCS, pages 101--113. Springer, 2001.]]"},{"key":"e_1_3_2_1_37_1","series-title":"LNCS","first-page":"258","volume-title":"ACISP '99","author":"Zhou J.","year":"1999","unstructured":"J. Zhou , R. Deng , and F. Bao . Evolution of fair non-repudiation with TTP . In ACISP '99 , volume 1587 of LNCS , pages 258 -- 269 . Springer , 1999 .]] J. Zhou, R. Deng, and F. Bao. Evolution of fair non-repudiation with TTP. In ACISP '99, volume 1587 of LNCS, pages 258--269. Springer, 1999.]]"}],"event":{"name":"CCS06: 13th ACM Conference on Computer and Communications Security 2006","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"],"location":"Alexandria Virginia USA","acronym":"CCS06"},"container-title":["Proceedings of the fourth ACM workshop on Formal methods in security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1180337.1180340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T00:48:46Z","timestamp":1673311726000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1180337.1180340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,3]]},"references-count":35,"alternative-id":["10.1145\/1180337.1180340","10.1145\/1180337"],"URL":"https:\/\/doi.org\/10.1145\/1180337.1180340","relation":{},"subject":[],"published":{"date-parts":[[2006,11,3]]},"assertion":[{"value":"2006-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}