{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T11:49:55Z","timestamp":1783684195438,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642154966","type":"print"},{"value":"9783642154973","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15497-3_19","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:51:46Z","timestamp":1283352706000},"page":"303-318","source":"Crossref","is-referenced-by-count":6,"title":["Sequential Protocol Composition in Maude-NPA"],"prefix":"10.1007","author":[{"given":"Santiago","family":"Escobar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Catherine","family":"Meadows","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sonia","family":"Santiago","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Anlauff, M., Pavlovic, D., Waldinger, R., Westfold, S.: Proving authentication properties in the protocol derivation assistant. In: Proc. of Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (2006)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509978.509980"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Capkun, S., Hubaux, J.P.: Secure positioning in wireless networks. IEEE Journal on Selected Areas in Communication\u00a024(2) (February 2006)","DOI":"10.1109\/JSAC.2005.861380"},{"key":"19_CR4","unstructured":"Cervesato, I., Meadows, C., Pavlovic, D.: An encapsulated authentication logic for reasoning about key establishment protocols. In: IEEE Computer Security Foundations Workshop (2005)"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10703-008-0059-4","volume":"34","author":"V. Cortier","year":"2009","unstructured":"Cortier, V., Delaune, S.: Safely composing security protocols. Formal Methods in System Design\u00a034(1), 1\u201336 (2009)","journal-title":"Formal Methods in System Design"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Pavlovic, D.: Secure protocol composition. In: Proc. Mathematical Foundations of Programming Semantics. ENTCS, vol.\u00a083 (2003)","DOI":"10.1016\/S1571-0661(03)50011-1"},{"key":"19_CR7","unstructured":"Desmedt, Y.: Major security problems with the \u201cunforgeable\u201d (Feige-)Fiat-Shamir Proofs of identity and how to overcome them. In: Securicom 88, 6th Worldwide Congress on Computer and Communications Security and Protection, Paris, France, March 1988, pp. 147\u2013159 (1988)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-540-71209-1_41","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Doghim","year":"2007","unstructured":"Doghim, S., Guttman, J., Thayer, F.J.: Searching for Shapes in Cryptographic Protocols. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 523\u2013537. Springer, Heidelberg (2007)"},{"key":"19_CR9","volume-title":"Fifteenth Computer Security Foundations Workshop \u2014 CSFW-14","author":"N. Durgin","year":"2001","unstructured":"Durgin, N., Mitchell, J., Pavlovic, D.: A Compositional Logic for Program Correctness. In: Fifteenth Computer Security Foundations Workshop \u2014 CSFW-14, Cape Breton, NS, Canada, June 11-13, IEEE Computer Society Press, Los Alamitos (2001)"},{"issue":"1-2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2006.08.035","volume":"367","author":"S. Escobar","year":"2006","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theor. Comput. Sci.\u00a0367(1-2), 162\u2013202 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR11","first-page":"1","volume-title":"FOSAD 2008\/2009 Tutorial Lectures","author":"S. Escobar","year":"2009","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA: Cryptographic protocol analysis modulo equational properties. In: FOSAD 2008\/2009 Tutorial Lectures, vol.\u00a05705, pp. 1\u201350. Springer, Heidelberg (2009)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Escobar, S., Meadows, C., Meseguer, J., Santiago, S.: Sequential Protocol Composition in Maude-NPA. Technical Report DSIC-II\/06\/10, Universidad Polit\u00e9cnica de Valencia (June 2010)","DOI":"10.1007\/978-3-642-15497-3_19"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/JCS-1999-72-304","volume":"7","author":"F.J. Thayer Fabrega","year":"1999","unstructured":"Thayer Fabrega, F.J., Herzog, J., Guttman, J.: Strand Spaces: What Makes a Security Protocol Correct? Journal of Computer Security\u00a07, 191\u2013230 (1999)","journal-title":"Journal of Computer Security"},{"key":"19_CR14","first-page":"79","volume-title":"Proc. of the 5th IFIP International Working Conference on Dependable Computing for Critical Applications","author":"L. Gong","year":"1998","unstructured":"Gong, L., Syverson, P.: Fail-stop protocols: An approach to designing secure protocols. In: Proc. of the 5th IFIP International Working Conference on Dependable Computing for Critical Applications, pp. 79\u201399. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"19_CR15","volume-title":"Proc. Computer Security Foundations Workshop","author":"J. Guttman","year":"2001","unstructured":"Guttman, J.: Security protocol design via authentication tests. In: Proc. Computer Security Foundations Workshop. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"19_CR16","unstructured":"Guttman, J.D., Herzog, J.C., Swarup, V., Thayer, F.J.: Strand spaces: From key exchange to secure location. In: Workshop on Event-Based Semantics (2008)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Guttman, J.D., Thayer, F.J.: Protocol independence through disjoint encryption. In: CSFW, pp. 24\u201334 (2000)","DOI":"10.1109\/CSFW.2000.856923"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Harkins, D., Carrel, D.: The Internet Key Exchange (IKE), IETF RFC 2409 (November 1998)","DOI":"10.17487\/rfc2409"},{"key":"19_CR19","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)"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci.\u00a096(1), 73\u2013155 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J. Meseguer","year":"1998","unstructured":"Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol.\u00a01376, pp. 18\u201361. Springer, Heidelberg (1998)"},{"key":"19_CR22","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15497-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T10:52:53Z","timestamp":1740480773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15497-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642154966","9783642154973"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15497-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}