{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:32Z","timestamp":1761610112209,"version":"build-2065373602"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4076,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s1571-0661(04)00316-0","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T05:34:35Z","timestamp":1075959275000},"page":"7-23","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["Cryptographic Analysis in Cubic Time"],"prefix":"10.1016","volume":"62","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00316-0_NEWBIB1","doi-asserted-by":"crossref","unstructured":"M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46:749\u2013786, 1999. A preliminary version appeared in Proceedings of Theoretical Aspects of Computer Software, LNCS, Springer-Verlag, 1997.","DOI":"10.1145\/324133.324266"},{"key":"10.1016\/S1571-0661(04)00316-0_NEWBIB2","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"},{"issue":"2","key":"10.1016\/S1571-0661(04)00316-0_NEWBIB3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0167-6423(99)00007-6","article-title":"Introduction to set constraint-based program analysis","volume":"35","author":"Aiken","year":"1999","journal-title":"Science of Computer Programming (SCP)"},{"key":"10.1016\/S1571-0661(04)00316-0_NEWBIB4","unstructured":"C. Bodei. Security Issues in Process Calculi. PhD thesis, Department of Computer Science, University of Pisa, 2000."},{"key":"10.1016\/S1571-0661(04)00316-0_NEWBIB5","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":"165","author":"Bodei","year":"2001","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00316-0_NEWBIB6","doi-asserted-by":"crossref","unstructured":"C. Bodei, P. Degano, H. Riis Nielson, and F. Nielson. Static analysis for secrecy and non-interference in networks of processes. In Proc. PACT'01, number 2127 in Lecture Notes in Computer Science, pages 27\u201341. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-44743-1_3"},{"key":"10.1016\/S1571-0661(04)00316-0_NEWBIB7","doi-asserted-by":"crossref","unstructured":"R. R. Hansen, J. G. Jensen, F. Nielson, and H. Riis Nielson. Abstract Interpretation of Mobile Ambients. In Proceedings of SAS'99, volume 1694 of LNCS, pages 134\u2013148. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48294-6_9"},{"key":"10.1016\/S1571-0661(04)00316-0_NEWBIB8","doi-asserted-by":"crossref","unstructured":"D. Lugiez and Ph. Schnoebelen. The regular viewpoint on pa-processes. In 9th Int. Conference on Concurrency (CONCUR), pages 50\u201366. LNCS 1466, Springer Verlag, 1998.","DOI":"10.1007\/BFb0055615"},{"issue":"1","key":"10.1016\/S1571-0661(04)00316-0_NEWBIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes (I and II)","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00316-0_NEWBIB10","doi-asserted-by":"crossref","unstructured":"F. Nielson and H. Riis Nielson. Flow logics and operational semantics. Electronic Notes of Theoretical Computer Science, 10, 1998.","DOI":"10.1016\/S1571-0661(05)80695-4"},{"year":"1999","series-title":"Principles of Program Analysis","author":"Nielson","key":"10.1016\/S1571-0661(04)00316-0_NEWBIB11"},{"key":"10.1016\/S1571-0661(04)00316-0_NEWBIB12","doi-asserted-by":"crossref","unstructured":"F. Nielson and H. Seidl. Control flow analysis in cubic time. In Proceedings of ESOP'01, volume 2028 of LNCS, pages 252\u2013268. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-45309-1_17"},{"key":"10.1016\/S1571-0661(04)00316-0_NEWBIB13","unstructured":"F. Nielson and H. Seidl. Succinct solvers. Technical Report 01\u201312, University of Trier, Germany, 2001."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104003160?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104003160?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:15Z","timestamp":1761609915000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104003160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":13,"alternative-id":["S1571066104003160"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00316-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Cryptographic Analysis in Cubic Time","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)00316-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}