{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T12:18:11Z","timestamp":1676031491433},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":2950,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1016\/j.entcs.2005.06.007","type":"journal-article","created":{"date-parts":[[2005,6,24]],"date-time":"2005-06-24T13:42:03Z","timestamp":1119620523000},"page":"3-22","source":"Crossref","is-referenced-by-count":5,"title":["Deconstructing Alice and Bob"],"prefix":"10.1016","volume":"135","author":[{"given":"Carlos","family":"Caleiro","sequence":"first","affiliation":[]},{"given":"Luca","family":"Vigan\u00f2","sequence":"additional","affiliation":[]},{"given":"David","family":"Basin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.entcs.2005.06.007_bib001","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00145-001-0014-7","article-title":"Reconciling two views of cryptography (the computational soundness of formal encryption)","volume":"15","author":"Abadi","year":"2002","journal-title":"Journal of Cryptology"},{"key":"10.1016\/j.entcs.2005.06.007_bib002","doi-asserted-by":"crossref","unstructured":"N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In Proc. IEEE Symposium on Research in Security and Privacy, pages 86\u201399, 1998","DOI":"10.1109\/SECPRI.1998.674826"},{"key":"10.1016\/j.entcs.2005.06.007_bib003","doi-asserted-by":"crossref","unstructured":"C Caleiro, L. Vigan\u00f2, and D. Basin. Deconstructing Alice and Bob (extended version). Technical Report 486, Department of Computer Science, ETH Zurich, 2005","DOI":"10.1016\/j.entcs.2005.06.007"},{"issue":"1","key":"10.1016\/j.entcs.2005.06.007_bib004","first-page":"67","article-title":"Metareasoning about Security Protocols using Distributed Temporal Logic","volume":"125","author":"Caleiro","year":"2005","journal-title":"ENTCS"},{"key":"10.1016\/j.entcs.2005.06.007_bib005","series-title":"Proc. SAPS'04","article-title":"A High Level Protocol Specification Language for Industrial Security-Sensitive Protocols","author":"Chevalier","year":"2004"},{"key":"10.1016\/j.entcs.2005.06.007_bib006","author":"Clark"},{"key":"10.1016\/j.entcs.2005.06.007_bib007","series-title":"Proc. FST TCS 2002","first-page":"97","article-title":"Composing strand spaces","volume":"2556","author":"Crazzolara","year":"2002"},{"issue":"2","key":"10.1016\/j.entcs.2005.06.007_bib008","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","article-title":"On the security of public key protocols","volume":"29","author":"Dolev","year":"1983","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"10.1016\/j.entcs.2005.06.007_bib009","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/605434.605436","article-title":"On the relationship between strand spaces and multi-agent systems","volume":"6","author":"Halpern","year":"2003","journal-title":"ACM Trans. Info. and System Security"},{"issue":"1","key":"10.1016\/j.entcs.2005.06.007_bib010","doi-asserted-by":"crossref","first-page":"53","DOI":"10.3233\/JCS-1998-61-204","article-title":"Casper: a Compiler for the Analysis of Security Protocols","volume":"6","author":"Lowe","year":"1998","journal-title":"Journal of Computer Security"},{"key":"10.1016\/j.entcs.2005.06.007_bib011","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/JCS-1998-61-205","article-title":"The inductive approach to verifying cryptographic protocols","volume":"6","author":"Paulson","year":"1998","journal-title":"Journal of Computer Security"},{"key":"10.1016\/j.entcs.2005.06.007_bib012","series-title":"Modelling and Analysis of Security Protocols","author":"Ryan","year":"2000"},{"key":"10.1016\/j.entcs.2005.06.007_bib013","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/JCS-1999-72-304","article-title":"Strand spaces: Proving security protocols correct","volume":"7","author":"Thayer F\u00e1brega","year":"1999","journal-title":"Journal of Computer Security"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105050498?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105050498?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T22:50:08Z","timestamp":1586299808000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105050498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["S1571066105050498"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2005.06.007","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}