{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:39Z","timestamp":1725511779613},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"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-70918-3_54","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"634-645","source":"Crossref","is-referenced-by-count":4,"title":["Associative-Commutative Deducibility Constraints"],"prefix":"10.1007","author":[{"given":"Sergiu","family":"Bursuc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubert","family":"Comon-Lundh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phanie","family":"Delaune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"54_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2004.10.018","volume":"333","author":"B. Blanchet","year":"2005","unstructured":"Blanchet, B., Podelski, A.: Verification of Cryptographic Protocols: Tagging Enforces Termination. Theoretical Computer Science\u00a0333(1-2), 67\u201390 (2005)","journal-title":"Theoretical Computer Science"},{"key":"54_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-540-24597-1_11","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"Y. Chevalier","year":"2003","unstructured":"Chevalier, Y., et al.: Deciding the security of protocols with Diffie-Hellman exponentiation and product in exponents. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 124\u2013135. Springer, Heidelberg (2003)"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1109\/LICS.2003.1210066","volume-title":"Proc. 18th IEEE Symp. Logic in Computer Science (LICS\u201903)","author":"Y. Chevalier","year":"2003","unstructured":"Chevalier, Y., et al.: An NP decision procedure for protocol insecurity with XOR. In: Proc. 18th IEEE Symp. Logic in Computer Science (LICS\u201903), pp. 261\u2013270. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"54_CR4","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)"},{"issue":"1","key":"54_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.tcs.2004.09.036","volume":"331","author":"H. Comon","year":"2005","unstructured":"Comon, 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":"54_CR6","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":"54_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/LICS.2003.1210067","volume-title":"Proc. 18th IEEE Symp. Logic in Computer Science (LICS\u201903)","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. 18th IEEE Symp. Logic in Computer Science (LICS\u201903), pp. 271\u2013280. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"Davis, M., Matijasevich, Y., Robinson, J.: Hilbert\u2019s tenth problem, Diophantine equations: positive aspects of a negative solution. In: Proc. of Symposia in Pure Maths, pp. 323\u2013378 (1976)","DOI":"10.1090\/pspum\/028.2\/0432534"},{"key":"54_CR9","unstructured":"Delaune, S.: V\u00e9rification des protocoles cryptographiques et propri\u00e9t\u00e9s alg\u00e9briques. Th\u00e8se de doctorat, ENS Cachan, France (2006)"},{"key":"54_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/11787006_12","volume-title":"Automata, Languages and Programming","author":"S. Delaune","year":"2006","unstructured":"Delaune, S., et al.: Symbolic protocol analysis in presence of a homomorphism operator and exclusive\u00a0or. In: Bugliesi, M., et al. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 132\u2013141. Springer, Heidelberg (2006)"},{"key":"54_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_44","volume-title":"Automata, Languages and Programming","author":"W. Karianto","year":"2006","unstructured":"Karianto, W., Krieg, A., Thomas, W.: On intersection problems for polynomially generated sets. In: Bugliesi, M., et al. (eds.) ICALP 2006. LNCS, vol.\u00a04052, Springer, Heidelberg (2006)"},{"issue":"2\u20133","key":"54_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/JCS-1999-72-302","volume":"7","author":"G. Lowe","year":"1999","unstructured":"Lowe, G.: Towards a completeness result for model checking of security protocols. J. Computer Security\u00a07(2\u20133), 89\u2013146 (1999)","journal-title":"J. Computer Security"},{"issue":"3","key":"54_CR13","doi-asserted-by":"crossref","first-page":"515","DOI":"10.3233\/JCS-2005-13306","volume":"13","author":"J. Millen","year":"2005","unstructured":"Millen, J., Shmatikov, V.: Symbolic protocol analysis with an abelian group operator or Diffie-Hellman exponentiation. J. Computer Security\u00a013(3), 515\u2013564 (2005)","journal-title":"J. Computer Security"},{"key":"54_CR14","doi-asserted-by":"crossref","unstructured":"Ramanujam, R., Suresh, S.P.: Decidability of context-explicit security protocols. J. Computer Security\u00a013(1) (2005)","DOI":"10.3233\/JCS-2005-13106"},{"key":"54_CR15","volume-title":"Proc.14th IEEE Computer Security Foundations Workshop","author":"M. Rusinowitch","year":"2001","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: Proc.14th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, Los Alamitos (2001)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:36:18Z","timestamp":1558272978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709176","9783540709183"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}