{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:07Z","timestamp":1725492367445},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755586"},{"type":"electronic","value":"9783540755609"}],"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-75560-9_15","type":"book-chapter","created":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T05:36:46Z","timestamp":1191649006000},"page":"181-195","source":"Crossref","is-referenced-by-count":1,"title":["Verifying Cryptographic Protocols with Subterms Constraints"],"prefix":"10.1007","author":[{"given":"Yannick","family":"Chevalier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Lugiez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u00ebl","family":"Rusinowitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","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."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Armando, A., Compagna, L.: Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning. In: Foundation of Computer Security & Verification Workshops, Copenhagen, Denmark (2002)","DOI":"10.1007\/3-540-36135-9_14"},{"key":"15_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/11591191_38","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D.A. Basin","year":"2005","unstructured":"Basin, D.A., M\u00f6dersheim, S., Vigan\u00f2, L.: Algebraic intruder deductions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 549\u2013564. Springer, Heidelberg (2005)"},{"key":"15_CR4","unstructured":"Cervesato, I., Durgin, N.A., Lincoln, P., Mitchell, J.C., Scedrov, A.: A meta-notation for protocol analysis. In: CSFW, pp. 55\u201369 (1999)"},{"key":"15_CR5","volume-title":"ASE 2001","author":"Y. Chevalier","year":"2001","unstructured":"Chevalier, Y., Vigneron, L.: A Tool for Lazy Verification of Security Protocols. In: ASE 2001. Proceedings of the Automated Software Engineering Conference, IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"15_CR6","series-title":"LNAI","volume-title":"FroCoS 2007","author":"Y. Chevalier","year":"2007","unstructured":"Chevalier, Y., Lugiez, D., Rusinowitch, M.: Towards an automatic analysis of web services security. In: Konev, B., Wolter, F. (eds.) FroCoS 2007. LNCS (LNAI), Springer, Heidelberg (2007)"},{"issue":"2","key":"15_CR7","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":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-30101-1_9","volume-title":"Formal Methods for Components and Objects","author":"K. Bhargavan","year":"2004","unstructured":"Bhargavan, K., Fournet, C., Gordon, A.D., Pucella, R.: Tulafale: A security tool for web services. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2003. LNCS, vol.\u00a03188, pp. 197\u2013222. Springer, Heidelberg (2004)"},{"key":"15_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/11916277_22","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"V. Cortier","year":"2006","unstructured":"Cortier, V., Zalinescu, E.: Deciding Key Cycles for Security Protocols. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 317\u2013331. Springer, Heidelberg (2006)"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/1030083.1030121","volume-title":"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: CCS 2004. Proceedings of the 11th ACM Conference on Computer and Communications Security, pp. 278\u2013287. ACM Press, Washington, D.C., USA (2004)"},{"key":"15_CR11","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":"15_CR12","doi-asserted-by":"crossref","unstructured":"Dolev, D., Yao, A.: On the Security of Public-Key Protocols. IEEE Transactions on Information Theory\u00a02(29) (1983)","DOI":"10.1109\/TIT.1983.1056650"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.entcs.2005.11.074","volume":"155","author":"E. Kleiner","year":"2006","unstructured":"Kleiner, E., Roscoe, A.: On the Relationship Between Web Services Security and Traditional Protocols. Electr. Notes Theor. Comput. Sci.\u00a0155, 583\u2013603 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"15_CR14","unstructured":"Lynch, L., Meadows, C.: On the Relative Soundness of the Free Algebra Model for Public Key Encryption. In: Proc. 4th Workshop on Issues in the Theory of Security (WITS) (2004)"},{"key":"15_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\u201902), Portland, Oregon, USA, pp. 14\u201315 (January 2002)"},{"key":"15_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":"15_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Computer Systems Architecture","author":"M. Rits","year":"2006","unstructured":"Rits, M., Rahaman, M.A.: Secure SOAP Requests in Enterprise SOA. In: Jesshope, C., Egan, C. (eds.) ACSAC 2006. LNCS, vol.\u00a04186, Springer, Heidelberg (2006)"},{"key":"15_CR18","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: Proc.14th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia (2001)"},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1145\/23005.24037","volume":"34","author":"K.N. Venkataraman","year":"1987","unstructured":"Venkataraman, K.N.: Decidability of the purely existential fragment of the theory of term algebras. J. ACM\u00a034(2), 492\u2013510 (1987)","journal-title":"J. ACM"},{"key":"15_CR20","series-title":"Lecture Notes in Artificial Intelligence","first-page":"314","volume-title":"CADE-16","author":"C. Weidenbach","year":"1999","unstructured":"Weidenbach, C.: Towards an automatic analysis of security protocols in first-order logic. In: Ganzinger, H. (ed.) CADE-16. LNCS (LNAI), vol.\u00a01632, pp. 314\u2013328. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75560-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:36:59Z","timestamp":1558276619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75560-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540755586","9783540755609"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75560-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}