{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:14Z","timestamp":1763467814508},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_4","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"20-35","source":"Crossref","is-referenced-by-count":10,"title":["Intruders with Caps"],"prefix":"10.1007","author":[{"given":"Siva","family":"Anantharaman","sequence":"first","affiliation":[]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Rusinowitch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"367","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theor. Comput. Sci.\u00a0367(1-2), 2\u201332 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0304-3975(02)00090-7","volume":"290","author":"R. Amadio","year":"2003","unstructured":"Amadio, R., Lugiez, D., Vanack\u00e8re, V.: On the symbolic reduction of processes with cryptographic functions. Theor. Comput. Sci.\u00a0290(1), 695\u2013740 (2003)","journal-title":"Theor. Comput. Sci."},{"unstructured":"S.\u00a0Anantharaman, P.\u00a0Narendran, M.\u00a0Rusinowitch. Intruders with Caps, http:\/\/www.univ-orleans.fr\/lifo\/prodsci\/rapports\/RR\/RR2007\/RR-2207-02.ps","key":"4_CR3"},{"key":"4_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1007\/978-3-540-30227-8_68","volume-title":"Logics in Artificial Intelligence","author":"A. Armando","year":"2004","unstructured":"Armando, A., Compagna, L.: SATMC: a SAT-based Model Checker for Security Protocols. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 730\u2013733. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: Proc. of ACM Conference on Computer and Communications Security, pp. 16\u201325 (2005)","key":"4_CR5","DOI":"10.1145\/1102120.1102125"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(82)90036-6","volume":"19","author":"R.V. Book","year":"1982","unstructured":"Book, R.V., Jantzen, M., Wrathall, C.: Monadic thue systems. Theor. Comput. Sci.\u00a019, 231\u2013251 (1982)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Book, R.V., Otto, F.: The verifiability of two-party protocols. In: EUROCRYPT, pp. 254\u2013260 (1985)","key":"4_CR7","DOI":"10.1007\/3-540-39805-8_30"},{"key":"4_CR8","volume-title":"Proc. of the Automated Software Engineering Conference (ASE 2001)","author":"Y. Chevalier","year":"2001","unstructured":"Chevalier, Y., Vigneron, L.: A Tool for Lazy Verification of Security Protocols. In: Proc. of the Automated Software Engineering Conference (ASE 2001), IEEE Computer Society Press, Washington, DC, USA (2001)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-540-32033-3_22","volume-title":"Term Rewriting and Applications","author":"H. Comon-Lundh","year":"2005","unstructured":"Comon-Lundh, H., Delaune, S.: The finite variant property: how to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 294\u2013307. Springer, Heidelberg (2005)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","first-page":"225","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)"},{"doi-asserted-by":"crossref","unstructured":"Delaune, S., Jacquemard, F.: A decision procedure for the verification of security protocols with explicit destructors. In: Proc. of ACM Conference on Computer and Communications Security, pp. 278\u2013287 (2004)","key":"4_CR11","DOI":"10.1145\/1030083.1030121"},{"issue":"2","key":"4_CR12","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\u2013207 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"4_CR13","first-page":"677","volume":"12","author":"N.A. Durgin","year":"2004","unstructured":"Durgin, N.A., Lincoln, P.D., Mitchell, J.G., Scedrov, A.: Multiset rewriting and the complexity of bounded security protocols. Journal of Computer Security\u00a012(1), 677\u2013722 (2004)","journal-title":"Journal of Computer Security"},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"R. Gilleron","year":"1995","unstructured":"Gilleron, R., Tison, S.: Regular tree languages and rewrite systems. Fundamenta Informaticae\u00a024, 157\u2013176 (1995)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G.P. Huet","year":"1980","unstructured":"Huet, G.P.: Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM\u00a027(4), 797\u2013821 (1980)","journal-title":"Journal of the ACM"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"636","DOI":"10.2307\/2275552","volume":"62","author":"P. Narendran","year":"1997","unstructured":"Narendran, P., Pfenning, F., Statman, R.: On the unification problem for Cartesian Closed Categories. Journal of Symbolic Logic\u00a062(2), 636\u2013647 (1997)","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.entcs.2005.06.002","volume":"135","author":"M. Nesi","year":"2005","unstructured":"Nesi, M., Rucci, G.: Formalizing and analyzing the Needham-Schroeder symmetric-key protocol by rewriting. Electr. Notes Theor. Comput. Sci.\u00a0135(1), 95\u2013114 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"4_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-48660-7_34","volume-title":"Automated Deduction - CADE-16","author":"C. Weidenbach","year":"1999","unstructured":"Weidenbach, C.: Towards an automatic analysis of security protocols. In: Ganzinger, H. (ed.) Automated Deduction - CADE-16. LNCS (LNAI), vol.\u00a01632, pp. 378\u2013382. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:14:50Z","timestamp":1605762890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}