{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:09:28Z","timestamp":1725559768584},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_52","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"639-651","source":"Crossref","is-referenced-by-count":20,"title":["Combining Intruder Theories"],"prefix":"10.1007","author":[{"given":"Yannick","family":"Chevalier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u00ebl","family":"Rusinowitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-24725-8_24","volume-title":"Programming Languages and Systems","author":"M. Abadi","year":"2004","unstructured":"Abadi, M., Blanchet, B., Fournet, C.: Just Fast Keying in the Pi Calculus. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 340\u2013354. Springer, Heidelberg (2004)"},{"issue":"1","key":"52_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."},{"issue":"2","key":"52_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1006\/jsco.1996.0009","volume":"21","author":"F. Baader","year":"1996","unstructured":"Baader, F., Schulz, K.U.: Unification in the union of disjoint equational theories. combining decision procedures. J. Symb. Comput.\u00a021(2), 211\u2013243 (1996)","journal-title":"J. Symb. Comput."},{"key":"52_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-39650-5_15","volume-title":"Computer Security \u2013 ESORICS 2003","author":"D. Basin","year":"2003","unstructured":"Basin, D., M\u00f6dersheim, S., Vigan\u00f2, L.: An On-The-Fly Model-Checker for Security Protocol Analysis. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol.\u00a02808, pp. 253\u2013270. Springer, Heidelberg (2003)"},{"key":"52_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/3-540-48224-5_55","volume-title":"Automata, Languages and Programming","author":"M. Boreale","year":"2001","unstructured":"Boreale, M.: Symbolic trace analysis of cryptographic protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 667\u2013681. Springer, Heidelberg (2001)"},{"key":"52_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-45138-9_21","volume-title":"Mathematical Foundations of Computer Science 2003","author":"M. Boreale","year":"2003","unstructured":"Boreale, M., Buscemi, M.: Symbolic analysis of crypto-protocols based on modular exponentiation. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 269\u2013278. Springer, Heidelberg (2003)"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Borisov, N., Goldberg, I., Wagner, D.: Intercepting mobile communications: the insecurity of 802.11. In: Proceedings of MOBICOM 2001, pp. 180\u2013189 (2001)","DOI":"10.1145\/381677.381695"},{"key":"52_CR8","doi-asserted-by":"crossref","unstructured":"Chevalier, Y., Kuesters, R., Rusinowitch, M., Turuani, M.: An NP Decision Procedure for Protocol Insecurity with XOR. In: Proceedings of the Logic In Computer Science Conference, LICS 2003 (June 2003)","DOI":"10.1109\/LICS.2003.1210066"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Chevalier, Y., Rusinowitch, M.: Combining intruder theories. Technical report, INRIA (2005), http:\/\/www.inria.fr\/rrrt\/rr-5495.html","DOI":"10.1007\/11523468_52"},{"key":"52_CR10","volume-title":"Proceedings 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: Proceedings of the Automated Software Engineering Conference (ASE 2001). IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. In: Proceedings of the Logic In Computer Science Conference, LICS 2003, pp. 271\u2013280 (2003)","DOI":"10.1109\/LICS.2003.1210067"},{"key":"52_CR12","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/1030083.1030121","volume-title":"Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS 2004)","author":"S. Delaune","year":"2004","unstructured":"Delaune, S., Jacquemard, F.: A decision procedure for the verification of security protocols with explicit destructors. In: Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS 2004), Washington, D.C., USA, pp. 278\u2013287. ACM Press, New York (2004)"},{"key":"52_CR13","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 243\u2013320. Elsevier, Amsterdam (1990)"},{"key":"52_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/3-540-18088-5_6","volume-title":"Automata, Languages and Programming","author":"J. Hsiang","year":"1987","unstructured":"Hsiang, J., Rusinowitch, M.: On word problems in equational theories. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 54\u201371. Springer, Heidelberg (1987)"},{"key":"52_CR15","unstructured":"Meadows, C., Narendran, P.: A unification algorithm for the group Diffie-Hellman protocol. In: Workshop on Issues in the Theory of Security (in conjunction with POPL 2002), Portland, Oregon, USA, pp. 14\u201315 (January 2002)"},{"key":"52_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":"52_CR17","doi-asserted-by":"crossref","unstructured":"Millen, J., Shmatikov, V.: Symbolic protocol analysis with an abelian group operator or Diffie-Hellman exponentiation. Journal of Computer Security (2005)","DOI":"10.3233\/JCS-2005-13404"},{"key":"52_CR18","volume-title":"Proceedings of CSFW 2001","author":"M. Rusinowitch","year":"2001","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: Proceedings of CSFW 2001. IEEE, Los Alamitos (2001)"},{"issue":"1\/2","key":"52_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0747-7171(89)80022-7","volume":"8","author":"M. Schmidt-Schau\u00df","year":"1989","unstructured":"Schmidt-Schau\u00df, M.: Unification in a combination of arbitrary disjoint equational theories. J. Symb. Comput.\u00a08(1\/2), 51\u201399 (1989)","journal-title":"J. Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:10Z","timestamp":1605643570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11523468_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}