Cryptographic protocol composition via the authentication tests

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

Volumn 5504 LNCS, Issue , 2009, Pages 303-317

  Guttman, Joshua D ^a  

^a MITRE CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION TESTS; CLASSICAL LOGIC; CRYPTOGRAPHIC PROTOCOLS; MODEL-THEORETIC; PROTOCOL ANALYSIS; SECURITY GOALS; STRAND SPACE;

AUTHENTICATION; COMPUTER SOFTWARE; CRYPTOGRAPHY; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 70349303077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00596-1_22     Document Type: Conference Paper

References (19)

1. Andova, S., Cremers, C.J.F., Gjøsteen, K., Mauw, S., Mjølsnes, S.F., Radomirović, S.: Sufficient conditions for composing security protocols. Information and Computation (2007)
2. Backes, M., Maffei, M., Unruh, D.: Zero-knowledge in the applied pi-calculus and automated verification of the Direct Anonymous Attestation protocol. In: IEEE Symposium on Security and Privacy (2008)
3. Backes, M., Pfitzmann, B.: Relating cryptographic and symbolic key secrecy. In: Proceedings of 26th IEEE Symposium on Security and Privacy (May 2005)
4. Balacheff, B., Chen, L., Pearson, S., Plaquin, D., Proudler, G.: Trusted Computing Platforms: TCPA Technology in Context. Prentice Hall PTR, NJ (2003)
5. Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: ACM Conference on Communications and Computer Security (CCS) (2004)
6. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, IACR 2000/067 (October 2001)
7. Canetti, R., Herzog, J.: Universally composable symbolic analysis of mutual authentication and key-exchange protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 380-403. Springer, Heidelberg (2006)
8. Cortier, V., Delaitre, J., Delaune, S.: Safely composing security protocols. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 352-363. Springer, Heidelberg (2007)
9. Datta, A., Derek, A.,Mitchell, J.C., Pavlovic, D.: A derivation system and compositional logic for security protocols. Journal ofComputer Security 13(3), 423-482 (2005)
10. Doghmi, S.F., Guttman, J.D., Thayer, F.J.: Completeness of the authentication tests. In: Biskup, J., Lopez, J. (eds.) ESORICS 2007. LNCS, vol. 4734, pp. 106-121. Springer, Heidelberg (2007)
11. Doghmi, S.F., Guttman, J.D., 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), Extended version, http://eprint.iacr.org/2006/435
12. Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Transactions on Information Theory 29, 198-208 (1983)
13. Durgin,N.,Lincoln,P.,Mitchell, J.,Scedrov,A.: Multisetrewritingandthecomplexity of bounded security protocols. Journal of Computer Security 12(2), 247-311 (2004)
14. Fröschle, S.: Adding branching to the strand space model. In: Proceedings of EXPRESS 2008. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2008)
15. Goguen, J.A., Meseguer, J.: Order-sorted algebra I. Theoretical Computer Science 105(2), 217-273 (1992)
16. Guttman, J.D., Herzog, J.C., Ramsdell, J.D., Sniffen, B.T.: Programming cryptographic protocols. In: De Nicola, R., Sangiorgi, D. (eds.) TGC 2005. LNCS, vol. 3705, pp. 116-145. Springer, Heidelberg (2005)
17. Guttman, J.D., Thayer, F.J.: Protocol independence through disjoint encryption. In: Proceedings of 13th Computer Security Foundations Workshop. IEEE Computer Society Press, Los Alamitos (2000)
18. Guttman, J.D., Thayer, F.J.: Authentication tests and the structure of bundles. Theoretical Computer Science 283(2), 333-380 (2002)
19. Heather, J., Lowe, G., Schneider, S.: How to prevent type flaw attacks on security protocols. In: Proceedings of 13th Computer Security Foundations Workshop. IEEE Computer Society Press, Los Alamitos (2000)