{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:39:11Z","timestamp":1742798351804},"reference-count":24,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Software Technology"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0950-5849(03)00072-7","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T23:15:45Z","timestamp":1054595745000},"page":"779-790","source":"Crossref","is-referenced-by-count":3,"title":["Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols"],"prefix":"10.1016","volume":"45","author":[{"given":"John","family":"Mullins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Lafrance","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0950-5849(03)00072-7_BIB1","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/77648.77649","article-title":"A logic of authentication","volume":"8","author":"Abadi","year":"1990","journal-title":"ACM Transactions on Computer Systems"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB2","series-title":"in: CONCUR'97: Concurrency Theory","volume":"vol. 1243","author":"Abadi","year":"1997"},{"issue":"1","key":"10.1016\/S0950-5849(03)00072-7_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1998.2740","article-title":"A calculus for cryptographic protocols: The Spi calculus","volume":"148","author":"Abadi","year":"1999","journal-title":"Information and Computation"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1006\/inco.2000.3020","article-title":"Static analysis for the \u03c0-calculus with applications to security","volume":"168","author":"Bodei","year":"2001","journal-title":"Information and Computation"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/LICS.1999.782608","article-title":"Proof techniques for cryptographic processes","author":"Boreale","year":"1999","journal-title":"Logic in Computer Science"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB6","series-title":"in: Logic and Models of Concurrent Systems, NATO ASI Series F-13","author":"Boudol","year":"1985"},{"issue":"1","key":"10.1016\/S0950-5849(03)00072-7_BIB7","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/151646.151648","article-title":"The concurrency workbench: a semantics based tool for the verification of concurrent processes","volume":"15","author":"Cleaveland","year":"1993","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB8","series-title":"in: Proceedings of 12th IEEE Computer Security Foundations Workshop","author":"Durante","year":"1999"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB9","series-title":"Proceedings of the DIMACS Workshop on Design and Formal Verification of Security Protocols","article-title":"Using non interference for the analysis of security protocols","author":"Focardi","year":"1997"},{"issue":"1","key":"10.1016\/S0950-5849(03)00072-7_BIB10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/JCS-1994\/1995-3103","article-title":"A classification of security properties for process algebras","volume":"3","author":"Focardi","year":"1994","journal-title":"Journal of Computer Security"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB11","article-title":"Secrecy in security protocols as non interference","volume":"vol. 32","author":"Focardi","year":"2000"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB12","series-title":"LNCS","article-title":"A uniform approach for the definition of security properties","volume":"vol. 1708","author":"Focardi","year":"1999"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB13","series-title":"in: Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, CA","author":"Goguen","year":"1984"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"Ccs expressions, finite state processes and three problems of equivalence","volume":"86","author":"Kannellakis","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB15","doi-asserted-by":"crossref","unstructured":"S. Lafrance, J. Mullins, A generic enemy process for the analysis of cryptoprotocols, 2002, Presented at FSCBS'2002. Available at www.crac.polymtl.ca.","DOI":"10.1016\/S1571-0661(04)00311-1"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB16","series-title":"LNCS","article-title":"Breaking and fixing the Needham\u2013Schroeder public-key protocol using FDR","volume":"vol. 1055","author":"Lowe","year":"1996"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB17","series-title":"Encyclopedia of Software Engineering","first-page":"1136","article-title":"Security models","author":"McLean","year":"1994"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB18","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"issue":"11","key":"10.1016\/S0950-5849(03)00072-7_BIB19","first-page":"1054","article-title":"Nondeterministic admissible interference","volume":"6","author":"Mullins","year":"2000","journal-title":"Journal of Universal Computer Science"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB20","series-title":"in: Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, CA","author":"Pinsky","year":"1995"},{"key":"10.1016\/S0950-5849(03)00072-7_BIB21","series-title":"in: Eighth Computer Security Foundation Workshop","author":"Roscoe","year":"1995"},{"issue":"8","key":"10.1016\/S0950-5849(03)00072-7_BIB22","first-page":"447","article-title":"Verifying authentication protocols in CSP","volume":"24","author":"Schneider","year":"1998","journal-title":"IEEE Transactions of Software Engineering"},{"issue":"1","key":"10.1016\/S0950-5849(03)00072-7_BIB23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/2.108052","article-title":"Authentication for distributed systems","volume":"25","author":"Woo","year":"1992","journal-title":"IEEE Computer"},{"issue":"3","key":"10.1016\/S0950-5849(03)00072-7_BIB24","doi-asserted-by":"crossref","DOI":"10.1145\/182110.182113","article-title":"A lesson in authentication protocol design","volume":"28","author":"Woo","year":"1994","journal-title":"ACM Operating Systems Review"}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584903000727?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584903000727?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T23:55:54Z","timestamp":1553126154000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950584903000727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":24,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0950584903000727"],"URL":"https:\/\/doi.org\/10.1016\/s0950-5849(03)00072-7","relation":{},"ISSN":["0950-5849"],"issn-type":[{"value":"0950-5849","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}