{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T05:52:22Z","timestamp":1676785942660},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2004,8,1]],"date-time":"2004-08-01T00:00:00Z","timestamp":1091318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJIS"],"published-print":{"date-parts":[[2004,8]]},"DOI":"10.1007\/s10207-004-0036-x","type":"journal-article","created":{"date-parts":[[2004,7,9]],"date-time":"2004-07-09T13:00:20Z","timestamp":1089378020000},"page":"145-167","source":"Crossref","is-referenced-by-count":24,"title":["A calculus for control flow analysis of security protocols"],"prefix":"10.1007","volume":"2","author":[{"given":"Mikael","family":"Buchholtz","sequence":"first","affiliation":[]},{"given":"Hanne","family":"Riis Nielson","sequence":"additional","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,8,1]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/324133.324266","volume":"5","author":"Abadi","year":"1999","unstructured":"Abadi M (1999) Secrecy by typing in security protocols. J ACM 5(46):749\u2013786","journal-title":"J ACM"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Abadi M, Blanchet B (2002) Analyzing security protocols with secrecy types and logic programs. In: Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2002). ACM Press, New York, pp 33\u201344","DOI":"10.1145\/503272.503277"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Abadi M, Fournet C (2001) Mobile values, new names, and secure communication. In: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2001). ACM Press, New York, pp 104\u2013115","DOI":"10.1145\/360204.360213"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"Abadi","year":"1999","unstructured":"Abadi M, Gordon AD (1999) A calculus for cryptographic protocols \u2013 the spi calculus. Inf Comput 148(1):1\u201370","journal-title":"Inf Comput"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Blanchet B (2001) An efficient cryptographic protocol verifier based on Prolog rules. In: Proceedings of the 14th Computer Security Foundations Workshop (CSFW 2001). IEEE Press, New York, pp 82\u201396","DOI":"10.1109\/CSFW.2001.930138"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Blanchet B (2002) From secrecy to authenticity in security protocols. In: Static Analysis, 9th International Symposium (SAS 2002). Lecture notes in computer science, vol 2477. Springer, Berlin Heidelberg New York, pp 342\u2013359","DOI":"10.1007\/3-540-45789-5_25"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Bodei C, Buchholtz M, Degano P, Nielson F, Riis Nielson H (2003) Automatic validation of protocol narration. In: Proceedings of the 16th Computer Security Foundations Workshop (CSFW 2003). IEEE Press, New York, pp 126\u2013140","DOI":"10.1109\/CSFW.2003.1212709"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/S0167-739X(02)00047-X","volume":"18","author":"Bodei","year":"2002","unstructured":"Bodei C, Degano P, Nielson F, Riis Nielson H (2002) Flow Logic for Dolev\u2013Yao secrecy in cryptographic processes. Future Generat Comput Sys 18(6):747\u2013756","journal-title":"Future Generat Comput Sys"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Bugliesi M, Castagna G, Crafa S (2001) Boxed ambients. In: Theoretical Aspects in Computer Science (TACS 2001). Lecture notes in computer science, vol 2215. Springer, Berlin Heidelberg New York, pp 37\u201363","DOI":"10.1007\/3-540-45500-0_2"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"Cardelli","year":"2000","unstructured":"Cardelli L, Gordon AD (2000) Mobile ambients. Theor Comput Sci 240(1):177\u2013213","journal-title":"Theor Comput Sci"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Cervesato I (2003) Data access specification and the most powerful symbolic attacker in MSR. In: Proceedings of the international symposium on software security (ISSS 2002). Lecture notes in computer science, vol 2609. Springer, Berlin Heidelberg New York, pp 384\u2013416","DOI":"10.1007\/3-540-36532-X_23"},{"key":"36_CR12","unstructured":"Clark J, Jacob J (1997) A survey of authentication protocol literature: version 1.0. http:\/\/www-users.cs.york.ac.uk\/\u223cjac\/papers\/drareviewps.ps"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Dolev D, Yao AC (1981) On the security of public key protocols. In: Proceedings of the 22nd annual symposium on foundations of computer science. IEEE Press, New York, pp 350\u2013357","DOI":"10.1109\/SFCS.1981.32"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1145\/363516.363532","volume":"9","author":"Durante","year":"2000","unstructured":"Durante A, Focardi R, Gorrieri R (2000) A compiler for analyzing cryptographic protocols using noninterference. ACM Trans Softw Eng Methodol 9(4):488\u2013528","journal-title":"ACM Trans Softw Eng Methodol"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"ElGamal","year":"1985","unstructured":"ElGamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31(4):469\u2013472","journal-title":"IEEE Trans Inf Theory"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3233\/JCS-1994\/1995-3103","volume":"3","author":"Focardi","year":"1995","unstructured":"Focardi R, Gorrieri R (1995) A classification of security properties for process algebras. J Comput Secur 3(1):5\u201333","journal-title":"J Comput Secur"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/32.629493","volume":"23","author":"Focardi","year":"1997","unstructured":"Focardi R, Gorrieri R (1997) The compositional security checker: a tool for the verification of information flow security properties. IEEE Trans Softw Eng 23(9):550\u2013571","journal-title":"IEEE Trans Softw Eng"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Fournet C, Abadi M (2003) Hiding names: private authentication in the applied pi calculus. In: Proceedings of the international symposium on software security (ISSS 2002). Lecture notes in computer science, vol 2609. Springer, Berlin Heidelberg New York, pp 317\u2013338","DOI":"10.1007\/3-540-36532-X_20"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Gordon AD, Jeffrey A (2001) Authenticity by typing for security protocols. In: Proceedings of the 14th Computer Security Foundations Workshop (CSFW 2001). IEEE Press, New York, pp 145\u2013159","DOI":"10.1109\/CSFW.2001.930143"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Levi F, Sangiorgi D (2000) Controlling interference in ambients. In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2000). ACM Press, New York, pp 352\u2013364","DOI":"10.1145\/325694.325741"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Lowe G (1996) Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Proceedings of the conference on tools and algorithms for the construction and analysis of systems. Lecture notes in computer science, vol 1055. Springer, Berlin Heidelberg New York, pp 147\u2013166","DOI":"10.1007\/3-540-61042-1_43"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Lowe G (1997) A hierarchy of authentication specifications. In: Proceedings of the 10th Computer Security Foundations Workshop (CSFW 1997). IEEE Press, New York, pp 31\u201343","DOI":"10.1109\/CSFW.1997.596782"},{"key":"36_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3233\/JCS-1998-61-204","volume":"6","author":"Lowe","year":"1998","unstructured":"Lowe G (1998) Casper: a compiler for the analysis of security protocols. J Comput Secur 6(1):53\u201384","journal-title":"J Comput Secur"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"Lowe G (1999) Towards a completeness result for model checking of security protocols. J Comput Secur 7(2\u20133):89\u2013146","DOI":"10.3233\/JCS-1999-72-302"},{"key":"36_CR25","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1049\/ip-cdt:19951991","volume":"142","author":"Mao","year":"1995","unstructured":"Mao W, Boyd C (1995) Methodical use of cryptographic transformations in authentication protocols. IEE Proc Comput Dig Tech 142(4):272\u2013278","journal-title":"IEE Proc Comput Dig Tech"},{"key":"36_CR26","unstructured":"Milner R (1989) Communication and concurrency. Prentice Hall series in computer science. Prentice Hall, Englewood Cliffs, NJ"},{"key":"36_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"Milner","year":"1992","unstructured":"Milner R, Parrow J, Walker D (1992) A calculus of mobile processes (I and II). Inf Comput 100(1):1\u201377","journal-title":"Inf Comput"},{"key":"36_CR28","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/359657.359659","volume":"21","author":"Needham","year":"1978","unstructured":"Needham R, Schroeder M (1978) Using encryption for authentication in large networks of computers. Commun ACM 21(12):993\u2013999","journal-title":"Commun ACM"},{"key":"36_CR29","doi-asserted-by":"crossref","unstructured":"Nielson F, Riis Nielson H, Hankin C (1999) Principles of program analysis. Springer, Berlin Heidelberg New York","DOI":"10.1007\/978-3-662-03811-6"},{"key":"36_CR30","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S0304-3975(01)00140-2","volume":"283","author":"Nielson","year":"2002","unstructured":"Nielson F, Riis Nielson H, Hansen RR (2002) Validating firewalls using flow logics. Theor Comput Sci 283(2):381\u2013418","journal-title":"Theor Comput Sci"},{"key":"36_CR31","doi-asserted-by":"crossref","unstructured":"Nielson F, Riis Nielson H, Hansen RR, Jensen JG (1999) Validating firewalls in mobile ambients. In: CONCUR 1999 \u2013 Concurrency Theory. Lecture notes in computer science, vol 1664. Springer, Berlin Heidelberg New York, pp 463\u2013477","DOI":"10.1007\/3-540-48320-9_32"},{"key":"36_CR32","doi-asserted-by":"crossref","unstructured":"Nielson F, Riis Nielson H, Seidl H (2002) Cryptographic analysis in cubic time. Electronic notes in theoretical computer science, vol 62","DOI":"10.1016\/S1571-0661(04)00316-0"},{"key":"36_CR33","doi-asserted-by":"crossref","unstructured":"Riis Nielson H, Nielson F, Buchholtz M (2004) Security for mobility. In: Proceedings of FOSAD 2001. Lecture notes in computer science, vol 2946. Springer, Berlin Heidelberg New York, pp 207\u2013265","DOI":"10.1007\/978-3-540-24631-2_6"},{"key":"36_CR34","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/24592.24594","volume":"21","author":"Otway","year":"1987","unstructured":"Otway D, Rees O (1987) Efficient and timely mutual authentication. ACM Oper Sys Rev 21(1):8\u201310","journal-title":"ACM Oper Sys Rev"},{"key":"36_CR35","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"key":"36_CR36","unstructured":"Roscoe AW (1998) The theory and practice of concurrency. Prentice Hall, Englewood Cliffs, NJ"},{"key":"36_CR37","unstructured":"Schneier B (1994) Applied cryptography. Wiley, New York"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-004-0036-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-004-0036-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-004-0036-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:01:21Z","timestamp":1559127681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-004-0036-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8]]},"references-count":37,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2004,8]]}},"alternative-id":["36"],"URL":"https:\/\/doi.org\/10.1007\/s10207-004-0036-x","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8]]}}}