{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:10:47Z","timestamp":1773655847654,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540255963","type":"print"},{"value":"9783540320333","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_23","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:20:02Z","timestamp":1285633202000},"page":"308-322","source":"Crossref","is-referenced-by-count":25,"title":["Intruder Deduction for AC-Like Equational Theories with Homomorphisms"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Lafourcade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Lugiez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Treinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-44929-9_1","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"M. Abadi","year":"2000","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 3\u201322. Springer, Heidelberg (2000)"},{"key":"23_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1109\/LICS.2003.1210066","volume-title":"Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS 2003)","author":"Y. Chevalier","year":"2003","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: An NP decision procedure for protocol insecurity with XOR. In: Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS 2003), Ottawa, Canada, pp. 261\u2013270. IEEE Comp. Soc. Press, Los Alamitos (2003)"},{"key":"23_CR5","unstructured":"Clark, J., Jacob, J.: A survey of authentication protocol literature (1997), \n                  \n                    http:\/\/www.cs.york.ac.uk\/~jac\/papers\/drareviewps.ps"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/LICS.2003.1210067","volume-title":"Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS 2003)","author":"H. Comon-Lundh","year":"2003","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In: Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS 2003), Ottawa, Canada, pp. 271\u2013280. IEEE Comp. Soc. Press, Los Alamitos (2003)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-39910-0_10","volume-title":"Verification: Theory and Practice","author":"H. Comon-Lundh","year":"2004","unstructured":"Comon-Lundh, H., Treinen, R.: Easy intruder deductions. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.\u00a02772, pp. 225\u2013242. Springer, Heidelberg (2004)"},{"key":"23_CR8","unstructured":"Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. Research Report LSV-04-15, LSV, ENS de Cachan (September 2004), Available at \n                  \n                    http:\/\/www.lsv.ens-cachan.fr\/Publis\/RAPPORTS_LSV\/rapports-year-2004-list.php"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B, ch. 6, pp. 243\u2013320. Elsevier Science Publishers and The MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"23_CR10","first-page":"198","volume-title":"Transactions on Information Theory","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public-key protocols. In: Transactions on Information Theory, vol.\u00a029, pp. 198\u2013208. IEEE Comp. Soc. Press, Los Alamitos (1983)"},{"key":"23_CR11","unstructured":"Jacquemard, F.: Security protocols open repository, Available at \n                  \n                    http:\/\/www.lsv.ens-cachan.fr\/spore\/index.html"},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/0608057","volume":"8","author":"E. Kaltofen","year":"1987","unstructured":"Kaltofen, E., Krishnamoorthy, M.S., Saunders, B.D.: Fast parallel computation of hermite and smith forms of polynomial matrices. SIAM J. Algebraic Discrete Methods\u00a08(4), 683\u2013690 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"23_CR13","unstructured":"Lafourcade, P., Lugiez, D., Treinen, R.: Intruder deduction for ac-like equational theories with homomorphisms. Research Report LSV-04-16, LSV, ENS de Cachan (November 2004), Available at \n                  \n                    http:\/\/www.lsv.ens-cachan.fr\/Publis\/RAPPORTS_LSV\/rapports-year-2004-list.php"},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(95)00144-2","volume":"56","author":"G. Lowe","year":"1995","unstructured":"Lowe, G.: An attack on the Needham-Schroeder public key authentication protocol. Information Processing Letters\u00a056(3), 131\u2013133 (1995)","journal-title":"Information Processing Letters"},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/151261.151265","volume":"40","author":"D.A. McAllester","year":"1993","unstructured":"McAllester, D.A.: Automatic recognition of tractability in inference relations. JACM\u00a040(2), 284\u2013303 (1993)","journal-title":"JACM"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Narendran, P.: Solving linear equations over polynomial semirings. In: Proc. of 11th Annual Symposium on Logic in Computer Science (LICS), July 1996, pp. 466\u2013472 (1996)","DOI":"10.1109\/LICS.1996.561463"},{"key":"23_CR17","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"23_CR18","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"23_CR19","unstructured":"Turuani, M.: Personal communication (2003)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:45:34Z","timestamp":1620013534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}