Protocol composition for arbitrary primitives

Proceedings - IEEE Computer Security Foundations Symposium

Volumn , Issue , 2010, Pages 322-336

  Ciobâcǎ, Ştefan ^a   Cortier, Véronique ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC PRIMITIVES; DIFFIE HELLMAN; DIFFIE-HELLMAN KEY EXCHANGE PROTOCOL; DISJOINTNESS; DOLEV-YAO MODEL; EQUATIONAL THEORY; EXCLUSIVE-OR; KEY-EXCHANGE PROTOCOL; PROTOCOL COMPOSITION; SECURITY PROTOCOLS;

HASH FUNCTIONS; NETWORK PROTOCOLS; SECURITY SYSTEMS;

NETWORK SECURITY;

EID: 77957575144     PISSN: 19401434     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2010.29     Document Type: Conference Paper

References (29)

1. G. Lowe, "Breaking and fixing the Needham-Schroeder public-key protocol using FDR, " in Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), ser. LNCS, vol. 1055. Springer-Verlag, 1996, pp. 147-166. (Pubitemid 126050413)
2. A. Armando, R. Carbone, L. Compagna, J. Cuellar, and L. T. Abad, "Formal analysis of saml 2.0 web browser single sign-on: Breaking the saml-based single sign-on for google apps, " in 6th ACM Workshop on Formal Methods in Security Engineering (FMSE 2008), 2008, pp. 1-10.
3. A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinowitch, J. Santiago, M. Turuani, L. Vigaǹo, and L. Vigneron, "The AVISPA Tool for the automated validation of internet security protocols and applications, " in 17th International Conference on Computer Aided Verification, CAV'2005, ser. Lecture Notes in Computer Science, vol. 3576. Springer, 2005, pp. 281-285.
4. M. Abadi and B. Blanchet, "Computer-Assisted Verification of a Protocol for Certified Email, " Science of Computer Programming, vol. 58, no. 1-2, pp. 3-27, Oct. 2005, special issue SAS'03.
5. M. Abadi, B. Blanchet, and C. Fournet, "Just Fast Keying in the Pi Calculus, " in 13th European Symposium on Programming (ESOP'04), ser. Lecture Notes on Computer Science, vol. 2986. Springer Verlag, Mar. 2004, pp. 340-354.
6. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov, "Undecidability of bounded security protocols, " in Workshop on Formal Methods and Security, 1999.
7. M. Rusinowitch and M. Turuani, "Protocol insecurity with finite number of sessions and composed keys is NP-complete, " Theoretical Computer Science, vol. 299, pp. 451-475, 2003.
8. B. Blanchet, "An efficient cryptographic protocol verifier based on prolog rules, " in 14th Computer Security Foundations Workshop (CSFW'01). IEEE Computer Society Press, June 2001.
9. G. Lowe, "Casper: A compiler for the analysis of security protocols, " in 10th Computer Security Foundations Workshop (CSFW'97). IEEE Computer Society Press, 1997.
10. B. Blanchet, "An automatic security protocol verifier based on resolution theorem proving (invited tutorial), " in 20th International Conference on Automated Deduction (CADE- 20), July 2005.
11. M. Backes, M. Maffei, and D. Unruh, "Zero-knowledge in the applied pi-calculus and automated verification of the direct anonymous attestation protocol, " in IEEE Symposium on Security and Privacy, 2008, pp. 202-215.
12. S. Delaune, S. Kremer, and M. D. Ryan, "Verifying privacytype properties of electronic voting protocols, " Journal of Computer Security, vol. 17, no. 4, pp. 435-487, Jul. 2009.
13. Ş . Ciobâcǎ and V. Cortier, "Protocol composition for arbitrary primitives, " Laboratoire Spécification et Vérification, ENS Cachan, France, Research Report LSV-10-09, Apr. 2010.
14. M. Abadi and C. Fournet, "Mobile values, new names, and secure communication, " in 28th ACM Symposium on Principles of Programming Languages (POPL'01), January 2001, pp. 104-115.
15. F. Baader and T. Nipkow, Term Rewriting and All That. Cambridge University Press, 1999.
16. J. D. Guttman and F. J. Thayer, "Protocol independence through disjoint encryption." in 13th Computer Security Foundations Workshop (CSFW'00). IEEE Comp. Soc. Press, 2000, pp. 24-34.
17. V. Cortier, J. Delaitre, and S. Delaune, "Safely composing security protocols, " in 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), ser. Lecture Notes in Computer Science, vol. 4855. Springer, Dec. 2007, pp. 352-363.
18. B. Blanchet and A. Podelski, "Verification of cryptographic protocols: Tagging enforces termination, " in Foundations of Software Science and Computation Structures (FoSSaCS'03), ser. LNCS, vol. 2620, April 2003.
19. R. Ramanujam and S.P.Suresh, "Tagging makes secrecy decidable for unbounded nonces as well, " in 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03), 2003.
20. J. Heather, G. Lowe, and S. Schneider, "How to prevent type flaw attacks on security protocols, " in 13th Computer Security Foundations Workshop (CSFW'00). IEEE Computer Society Press, 2000.
21. F. J. T. Fábrega, "Strand spaces: proving security protocols correct, " J. Comput. Secur., vol. 7, no. 2-3, pp. 191-230, 1999.
22. J. D. Guttman, "Cryptographic protocol composition via the authentication tests, " in Foundations of Software Science and Computation Structures (FOSSACS'09), ser. Lecture Notes in Computer Science, March 2009.
23. S. Delaune, S. Kremer, and M. D. Ryan, "Composition of password-based protocols, " in 21st IEEE Computer Security Foundations Symposium (CSF'08). IEEE Computer Society Press, Jun. 2008, pp. 239-251.
24. S. Mödersheim and L. Viganò, "Secure pseudonymous channels, " in 14th European Symposium On Research In Computer Security (ESORICS'09), ser. Lecture Notes in Computer Science, vol. 5789. Springer, 2009, pp. 337-354.
25. S. Delaune, S. Kremer, and O. Pereira, "Simulation based security in the applied pi calculus, " in 29th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'09), ser. Leibniz International Proceedings in Informatics, vol. 4. Leibniz-Zentrum f̈ur Informatik, Dec. 2009, pp. 169-180.
26. A. Datta, A. Derek, J. C. Mitchell, and A. Roy, "Protocol composition logic (PCL), " Electron. Notes Theor. Comput. Sci., vol. 172, pp. 311-358, 2007.
27. R. Canetti, "Universally composable security: A new paradigm for cryptographic protocols, " in IEEE Symposium on Foundations of Computer Science, 2001, pp. 136-145.
28. R. Canetti and T. Rabin, "Universal composition with joint state, " in CRYPTO, 2003, pp. 265-281.
29. V. Cortier and S. Delaune, "A method for proving observational equivalence, " in 22nd IEEE Computer Security Foundations Symposium (CSF'09). IEEE Computer Society Press, Jul. 2009, pp. 266-276.