{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:29Z","timestamp":1763467829258},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540746201"},{"type":"electronic","value":"9783540746218"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74621-8_7","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T11:46:32Z","timestamp":1187783192000},"page":"103-117","source":"Crossref","is-referenced-by-count":13,"title":["Combining Algorithms for Deciding Knowledge in Security Protocols"],"prefix":"10.1007","author":[{"given":"Mathilde","family":"Arnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e9ronique","family":"Cortier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phanie","family":"Delaune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11690634_27","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Baudet, M., Warinschi, B.: Guessing attacks and the computational soundness of static equivalence. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006 and ETAPS 2006. LNCS, vol.\u00a03921, pp. 398\u2013412. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"387","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theoretical Computer Science\u00a0387(1-2), 2\u201332 (2006)","journal-title":"Theoretical Computer Science"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/360204.360213","volume-title":"Proceedings of the 28th ACM Symposium on Principles of Programming Languages (POPL 2001)","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of the 28th ACM Symposium on Principles of Programming Languages (POPL 2001), pp. 104\u2013115. ACM Press, New York (2001)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Arnaud, M., Cortier, V., Delaune, S.: Combining algorithms for deciding knowledge in security protocols. Research Report 6118, INRIA, p. 28 (February 2007)","DOI":"10.1007\/978-3-540-74621-8_7"},{"issue":"2","key":"7_CR5","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. Journal of Symbolic Computation\u00a021(2), 211\u2013243 (1996)","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1007\/11523468_53","volume-title":"Automata, Languages and Programming","author":"M. Baudet","year":"2005","unstructured":"Baudet, M., Cortier, V., Kremer, S.: Computationally sound implementations of equational theories against passive adversaries. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 652\u2013663. Springer, Heidelberg (2005)"},{"key":"7_CR7","volume-title":"Proceedings 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: Proceedings of 18th Annual IEEE Symposium on Logic in Computer Science (LICS 2003), Ottawa (Canada), IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1007\/11523468_52","volume-title":"Automata, Languages and Programming","author":"Y. Chevalier","year":"2005","unstructured":"Chevalier, Y., Rusinowitch, M.: Combining intruder theories. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 639\u2013651. Springer, Heidelberg (2005)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Chevalier, Y., Rusinowitch, M.: Combining intruder theories. Technical Report 5495, INRIA (2005), http:\/\/www.inria.fr\/rrrt\/rr-5495.html","DOI":"10.1007\/11523468_52"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/11805618_9","volume-title":"Term Rewriting and Applications","author":"Y. Chevalier","year":"2006","unstructured":"Chevalier, Y., Rusinowitch, M.: Hierarchical combination of intruder theories. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 108\u2013122. Springer, Heidelberg (2006)"},{"key":"7_CR11","volume-title":"Proceedings 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: Proceedings of 18th Annual IEEE Symposium on Logic in Computer Science (LICS 2003), Ottawa (Canada), IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"7_CR12","unstructured":"Cortier, V., Delaune, S.: Deciding knowledge in security protocols for monoidal equational theories. In: Proc. of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA 2007), Wroc\u0142aw, Poland (to appear, 2007)"},{"issue":"6","key":"7_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.ipl.2005.11.008","volume":"97","author":"S. Delaune","year":"2006","unstructured":"Delaune, S.: Easy intruder deduction problems with homomorphisms. Information Processing Letters\u00a097(6), 213\u2013218 (2006)","journal-title":"Information Processing Letters"},{"key":"7_CR14","series-title":"ch.\u00a06","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. ch.\u00a06, vol.\u00a0B, Elsevier, Amsterdam (1990)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Lafourcade, P., Lugiez, D., Treinen, R.: Intruder deduction for the equational theory of Abelian groups with distributive encryption. Information and Computation (to appear, 2007)","DOI":"10.1016\/j.ic.2006.10.008"},{"key":"7_CR16","unstructured":"Lakhnech, Y., Mazar\u00e9, L., Warinschi, B.: Soundness of symbolic equivalence for modular exponentiation. In: Proceedings of the Second Workshop on Formal and Computational Cryptography (FCC 2006), pp. 19\u201323, Venice, Italy (July 2006)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Lowe","year":"1996","unstructured":"Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 147\u2013166. Springer, Heidelberg (1996)"},{"key":"7_CR18","volume-title":"Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS 2001)","author":"J. Millen","year":"2001","unstructured":"Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS 2001), ACM Press, New York (2001)"},{"issue":"1-2","key":"7_CR19","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/JCS-1998-61-205","volume":"6","author":"L.C. Paulson","year":"1998","unstructured":"Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Journal of Computer Security\u00a06(1-2), 85\u2013128 (1998)","journal-title":"Journal of Computer Security"},{"issue":"299","key":"7_CR20","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"1-3","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with a finite number of sessions, composed keys is NP-complete. Theoretical Computer Science\u00a01-3(299), 451\u2013475 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1\/2","key":"7_CR21","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. Journal of Symbolic Computation\u00a08(1\/2), 51\u201399 (1989)","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74621-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T01:38:13Z","timestamp":1587865093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74621-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540746201","9783540746218"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74621-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}