Sequential protocol composition in Maude-NPA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6345 LNCS, Issue , 2010, Pages 303-318

  Escobar, Santiago ^a   Meadows, Catherine ^b   Meseguer, José ^c   Santiago, Sonia ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b NAVAL RESEARCH LABORATORY   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; MULTI AGENT SYSTEMS;

'CURRENT; COMPOSITION OF PROTOCOL; CRYPTOGRAPHIC PROTOCOLS; DYNAMIC COMPOSITION; OPERATIONAL SEMANTICS; PROTOCOL CANS; PROTOCOL COMPOSITION; SEQUENTIAL COMPOSITIONS; SIMPLE PROTOCOL; SOUNDNESS AND COMPLETENESS;

SEMANTICS;

EID: 78049354833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15497-3_19     Document Type: Conference Paper

References (22)

1. 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)
2. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494-503 (2002)
3. Capkun, S., Hubaux, J. P.: Secure positioning in wireless networks. IEEE Journal on Selected Areas in Communication 24 (2) (February 2006)
4. Cervesato, I., Meadows, C., Pavlovic, D.: An encapsulated authentication logic for reasoning about key establishment protocols. In: IEEE Computer Security Foundations Workshop (2005)
5. Cortier, V., Delaune, S.: Safely composing security protocols. Formal Methods in System Design 34(1), 1-36 (2009)
6. Datta, A., Derek, A., Mitchell, J. C., Pavlovic, D.: Secure protocol composition. In: Proc. Mathematical Foundations of Programming Semantics. ENTCS, vol. 83 (2003)
7. Desmedt, Y.: Major security problems with the "unforgeable" (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-159 (1988)
8. Doghim, S., Guttman, J., Thayer, F. J.: Searching for Shapes in Cryptographic Protocols. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 523-537. Springer, Heidelberg (2007)
9. Durgin, N., Mitchell, J., Pavlovic, D.: A Compositional Logic for Program Correctness. In: Fifteenth Computer Security Foundations Workshop - CSFW-14, Cape Breton, NS, Canada, June 11-13, IEEE Computer Society Press, Los Alamitos (2001)
10. Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theor. Comput. Sci. 367 (1-2), 162-202 (2006)
11. Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA: Cryptographic protocol analysis modulo equational properties. In: FOSAD 2008/2009 Tutorial Lectures, vol. 5705, pp. 1-50. Springer, Heidelberg (2009)
12. Escobar, S., Meadows, C., Meseguer, J., Santiago, S.: Sequential Protocol Composition in Maude-NPA. Technical Report DSIC-II/06/10, Universidad Politécnica de Valencia (June 2010)
13. Thayer Fabrega, F. J., Herzog, J., Guttman, J.: Strand Spaces: What Makes a Security Protocol Correct? Journal of Computer Security 7, 191-230 (1999)
14. 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-99. IEEE Computer Society Press, Los Alamitos (1998)
15. Guttman, J.: Security protocol design via authentication tests. In: Proc. Computer Security Foundations Workshop. IEEE Computer Society Press, Los Alamitos (2001)
16. 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)
17. Guttman, J. D., Thayer, F. J.: Protocol independence through disjoint encryption. In: CSFW, pp. 24-34 (2000)
18. Harkins, D., Carrel, D.: The Internet Key Exchange (IKE), IETF RFC 2409 (November 1998)
19. Lowe, G.: Breaking and fixing the Needham-Schroeder public key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 147-166. Springer, Heidelberg (1996) (Pubitemid 126050413)
20. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73-155 (1992)
21. Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18-61. Springer, Heidelberg (1998)
22. TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)