{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:49:33Z","timestamp":1725472173299},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540488156"},{"type":"electronic","value":"9783540488163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11921240_11","type":"book-chapter","created":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T13:28:19Z","timestamp":1162474099000},"page":"153-167","source":"Crossref","is-referenced-by-count":2,"title":["Handling Algebraic Properties in Automatic Analysis of Security Protocols"],"prefix":"10.1007","author":[{"given":"Y.","family":"Boichut","sequence":"first","affiliation":[]},{"given":"P. -C.","family":"H\u00e9am","sequence":"additional","affiliation":[]},{"given":"O.","family":"Kouchnarenko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Smartright technical white paper v1.0. Technical report, Thomson (October 2001), http:\/\/www.smartright.org"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11513988_27","volume-title":"Computer Aided Verification","author":"A. Armando","year":"2005","unstructured":"Armando, A., Basin, D., Boichut, Y., Chevalier, Y., Compagna, L., Cuellar, J., Drielsma, P.H., He\u00e1m, P.C., Kouchnarenko, O., Mantovani, J., M\u00f6dersheim, S., von Oheimb, D., Rusinowitch, M., Santiago, J., Turuani, M., Vigan\u00f2, L., Vigneron, L.: The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 281\u2013285. Springer, Heidelberg (2005)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-45657-0_27","volume-title":"Computer Aided Verification","author":"A. Armando","year":"2002","unstructured":"Armando, A., Basin, D., Bouallagui, M., Chevalier, Y., Compagna, L., M\u00f6dersheim, S., Rusinowitch, M., Turuani, M., Vigan\u00f2, L., Vigneron, L.: The AVISS Security Protocol Analysis Tool. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 349\u2013354. Springer, Heidelberg (2002)"},{"key":"11_CR4","unstructured":"AVISPA. Deliverable 2.1: The High-Level Protocol Specification Language (2003), available at: http:\/\/www.avispa-project.org"},{"key":"11_CR5","unstructured":"AVISPA. Deliverable 7.2: Assessment of the AVISPA tool v. 1 (2003), available at: http:\/\/www.avispa-project.org"},{"key":"11_CR6","unstructured":"Boichut, Y., H\u00e9am, P.-C., Kouchnarenko, O.: Automatic Verification of Security Protocols Using Approximations. Research Report RR-5727, INRIA-CASSIS Project (October 2005)"},{"key":"11_CR7","unstructured":"Boichut, Y., H\u00e9am, P.-C., Kouchnarenko, O., Oehl, F.: Improvements on the Genet and Klay technique to automatically verify security protocols. In: Proc. AVIS 2004, joint to ETAPS 2004, pp. 1\u201311 (April 2004) (to appear in ENTCS)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-45069-6_23","volume-title":"Computer Aided Verification","author":"L. Bozga","year":"2003","unstructured":"Bozga, L., Lakhnech, Y., P\u00e9rin, M.: HERMES: An automatic tool for verification of secrecy in security protocols. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 219\u2013222. Springer, Heidelberg (2003)"},{"key":"11_CR9","unstructured":"Chevalier, Y., Compagna, L., Cuellar, J., Hankes Drielsma, P., Mantovani, J., M\u00f6dersheim, S., Vigneron, L.: A high level protocol specification language for industrial security-sensitive protocols. In: Proceedings of SAPS 2004, Linz, Austria, vol.\u00a0180 (September 2004)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Chevalier, Y., Kusters, R., Rusinowitch, M., Turuani, M.: An NP decision procedure for protocol insecurity with XOR. Theoretical Computer Science\u00a0338 (2005)","DOI":"10.1016\/j.tcs.2005.01.015"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/11506881_5","volume-title":"Intrusion and Malware Detection and Vulnerability Assessment","author":"I. Cibrario","year":"2005","unstructured":"Cibrario, I., Durante, L., Sisto, R., Valenzano, A.: Automatic detection of attacks on cryptographic protocols: A case study. In: Julisch, K., Kr\u00fcgel, C. (eds.) DIMVA 2005. LNCS, vol.\u00a03548, pp. 69\u201384. Springer, Heidelberg (2005)"},{"key":"11_CR12","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), http:\/\/www.grappa.univ-lille3.fr\/tata\/"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.tcs.2004.09.036","volume":"331","author":"H. Comon-Lundh","year":"2005","unstructured":"Comon-Lundh, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science\u00a0331(1), 143\u2013214 (2005)","journal-title":"Theoretical Computer Science"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security (2005)","DOI":"10.3233\/JCS-2006-14101"},{"key":"11_CR15","unstructured":"Durgin, N.A., Lincoln, P.D., Mitchell, J.C., Scedrov, A.: Undecidability of bounded security protocols. In: Proc. FMSP 1999, Italy, Trento (August 1999)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Feuillade, G., Genet, T., Viet Triem Tong, V.: Reachability analysis of term rewriting systems. Journal of Automated Reasonning\u00a033 (2004)","DOI":"10.1007\/s10817-004-6246-0"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/10721959_21","volume-title":"Automated Deduction - CADE-17","author":"T. Genet","year":"2000","unstructured":"Genet, T., Klay, F.: Rewriting for cryptographic protocol verification. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 271\u2013290. Springer, Heidelberg (2000)"},{"key":"11_CR18","unstructured":"Genet, T., Tang-Talpin, Y.-M., Viet Triem Tong, V.: Verification of copy-protection cryptographic protocol using approximations of term rewriting systems. In: Proc. of WITS 2003 (2003)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-48294-6_10","volume-title":"Static Analysis","author":"D. Monniaux","year":"1999","unstructured":"Monniaux, D.: Abstracting cryptographic protocols with tree automata. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, p. 149. Springer, Heidelberg (1999)"},{"key":"11_CR20","unstructured":"Ohsaki, H., Takai, T.: Actas: A system design for associative and commutative tree automata theory. In: Proc. of RULE 2004 (June 2004) (to appear in ENTCS)"},{"key":"11_CR21","first-page":"174","volume-title":"Proc. of CSFW 2001","author":"M. Rusinowitch","year":"2001","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: Proc. of CSFW 2001, pp. 174\u2013190. IEEE, Los Alamitos (2001)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/11532231_28","volume-title":"Automated Deduction \u2013 CADE-20","author":"T. Truderung","year":"2005","unstructured":"Truderung, T.: Regular protocols and attacks with regular knowledge. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol.\u00a03632, pp. 377\u2013391. Springer, Heidelberg (2005)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/11690634_28","volume-title":"Foundations of Software Science and Computation Structures","author":"R. Zunino","year":"2006","unstructured":"Zunino, R., Degano, P.: Handling exp, x (and timestamps) in protocol analysis. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 413\u2013427. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11921240_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:58Z","timestamp":1605643138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11921240_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540488156","9783540488163"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11921240_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}