{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T18:40:25Z","timestamp":1740336025405,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_5","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"42-57","source":"Crossref","is-referenced-by-count":2,"title":["On the Existence of an Effective and Complete Inference System for Cryptographic Protocols"],"prefix":"10.1007","author":[{"given":"Liana","family":"Bozga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Ene","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yassine","family":"Lakhnech","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-44618-4_28","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R.M. Amadio","year":"2000","unstructured":"Amadio, R.M., Lugiez, D.: On the reachability problem in cryptographic protocols. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 380\u2013394. Springer, Heidelberg (2000)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-36576-1_9","volume-title":"Foundations of Software Science and Computational Structures","author":"B. Blanchet","year":"2003","unstructured":"Blanchet, B., Podelski, A.: Verification of cryptographic protocols: Tagging enforces termination. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 136\u2013152. Springer, Heidelberg (2003)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Boreale, M.: Symbolic trace analysis of cryptographic protocols. ICALP: Annual International Colloquium on Automata, Languages and Programming (2001)","DOI":"10.1007\/3-540-48224-5_55"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36577-X_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Bozga","year":"2003","unstructured":"Bozga, L., Lakhnech, Y., P\u00e9rin, M.: Abstract interpretation for secrecy using patterns. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, Springer, Heidelberg (2003)"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/77648.77649","volume":"8","author":"M. Burrows","year":"1990","unstructured":"Burrows, M., Abadi, M., Needham, R.: A logic of authentication. ACM Transactions on Computer Systems\u00a08(1), 18\u201336 (1990)","journal-title":"ACM Transactions on Computer Systems"},{"key":"5_CR6","unstructured":"Comon, H.: Disunification: A survey. In: Computational Logic: Essays in Honor of Alan Robinson. MIT Press, Cambridge (1991)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Comon, H., Shmatikov, V.: Is it possible to decide whether a cryptographic protocol is secure or not? Journal of Telecommunications and Information Technology (2002)","DOI":"10.26636\/jtit.2002.4.149"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44881-0_12","volume-title":"Rewriting Techniques and Applications","author":"H. Comon-Lundh","year":"2003","unstructured":"Comon-Lundh, H., Cortier, V.: New decidability results for fragments of first-order logic and application to cryptographic protocols. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, Springer, Heidelberg (2003)"},{"key":"5_CR9","first-page":"841","volume-title":"Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics","author":"P. Cousot","year":"1990","unstructured":"Cousot, P.: Methods and Logics for Proving Programs. In: Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, pp. 841\u2013994. Elsevier Science Publishers B.V, Amsterdam (1990)"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Transactions on Information Theory\u00a029(2), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"F\u00e1brega, F.J.T., Herzog, J.C., Guttman, J.D.: Strand Spaces: Why is a Security Protocol Correct? IEEE Conference on Security and Privacy, pp.160\u2013171 (1998)","DOI":"10.21236\/ADA459060"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/CSFW.2001.930144","volume-title":"14th IEEE Computer Security Foundations Workshop (CSFW 2001)","author":"M. Fiore","year":"2001","unstructured":"Fiore, M., Abadi, M.: Computing symbolic models for verifying cryptographic protocols. In: 14th IEEE Computer Security Foundations Workshop (CSFW 2001), Washington, Brussels, Tokyo, June 2001, pp. 160\u2013173. IEEE, Los Alamitos (2001)"},{"key":"5_CR13","unstructured":"Jouannaud, J.-P., Kirchner, C.: Solving equations in abstract algebras: A rule-based survey of unification. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, Cambridge (1991)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/CSFW.1997.596782","volume-title":"10th IEEE Computer Security Foundations Workshop (CSFW 1997)","author":"G. Lowe","year":"1997","unstructured":"Lowe, G.: A hierarchy of authentication specifications. In: 10th IEEE Computer Security Foundations Workshop (CSFW 1997), Washington, Brussels, Tokyo, June 1997, pp. 31\u201344. IEEE, Los Alamitos (1997)"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/JSAC.2002.806125","volume":"21","author":"C. Meadows","year":"2003","unstructured":"Meadows, C.: Formal methods for cryptographic protocol analysis: Emerging issues and trends. IEEE Journal on Selected Areas in Communication\u00a021(1), 44\u201354 (2003)","journal-title":"IEEE Journal on Selected Areas in Communication"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: ACM Conference on Computer and Communications Security, pp.166\u2013175 (2001)","DOI":"10.1145\/501983.502007"},{"key":"5_CR17","volume-title":"9th IEEE Computer Security Foundations Workshop (CSFW 1996)","author":"A.W. Roscoe","year":"1996","unstructured":"Roscoe, A.W.: Intensional specification of security protocols. In: 9th IEEE Computer Security Foundations Workshop (CSFW 1996), Washington, Brussels, Tokyo, June 1996, IEEE, Los Alamitos (1996)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: IEEE Computer Security Foundations Workshop (2001)","DOI":"10.1109\/CSFW.2001.930145"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/CSFW.1997.596775","volume-title":"10th IEEE Computer Security Foundations Workshop (CSFW 1997)","author":"S. Schneider","year":"1997","unstructured":"Schneider, S.: Verifying authentication protocols with CSP. In: 10th IEEE Computer Security Foundations Workshop (CSFW 1997), Washington, Brussels, Tokyo, June 1997, pp. 3\u201317. IEEE, Los Alamitos (1997)"},{"key":"5_CR20","unstructured":"Thayer, J., Herzog, J., Guttman, J.: Honest Ideals on Strand Spaces. In: IEEE Computer Security Foundations Workshop, pp. 66\u201378 (1998)"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/2.108052","volume":"25","author":"T.Y.C. Woo","year":"1992","unstructured":"Woo, T.Y.C., Lam, S.S.: Authentication for distributed systems. Computer\u00a025(1), 39\u201352 (1992)","journal-title":"Computer"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T18:01:42Z","timestamp":1740333702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}