Synthesizing secure protocols

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

Volumn 4734 LNCS, Issue , 2007, Pages 406-421

  Cortier, Véronique ^a   Warinschi, Bogdan ^b   Zǎlinescu, Eugen ^a  

^a LORIA   (France)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSFER; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MESSAGE PASSING; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

BYPRODUCT CONTRIBUTION; SESSION IDENTIFIERS;

NETWORK PROTOCOLS;

EID: 38048999097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74835-9_27     Document Type: Conference Paper

References (17)

1. Abadi, M., Fournet, C., Gonthier, G.: Secure implementation of channel abstractions. Inf. Comput. 174(1), 37-83 (2002)
2. Bellare, M., Canetti, R., Krawczyk, H.: A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract). In: STOC '98. Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 419-428. ACM Press, New York (1998)
3. Blanchet, B., Podelski, A.: Verification of cryptographic protocols: Tagging enforces termination. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol. 2620, Springer, Heidelberg (2003)
4. Comon-Lundh, H., Cortier, V.: New decidability results for fragments of first-order logic and application to cryptographic protocols. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 148-164. Springer, Heidelberg (2003)
5. Cortier, V., Hördegen, H., Warinschi, B.: Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. In: ICS 2006. Workshop on Information and Computer Security, Timisoara, Romania (September 2006)
6. Cortier, V., Warinschi, B.: Computationally Sound, Automated Proofs for Security Protocols. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 157-171. Springer, Heidelberg (2005)
7. Cortier, V., Warinschi, B., Zǎlinescu, E.: Synthesizing secure protocols. Inria research report, INRIA (April 2007), available at http://www.loria.fr/cortier/Papiers/compiler.pdf
8. Datta, A., Derek, A., Mitchell, J.C., Pavlovic, D.: A derivation system and compositional logic for security protocols. J. Comput. Secur. 13(3), 423-482 (2005)
9. Durgin, N., Lincoln, P., Mitchell, J., Scedrov, A.: Undecidability of bounded security protocols. In: Proc. of the Workshop on Formal Methods and Security Protocols (1999)
10. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC '87. Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 218-229. ACM Press, New York (1987)
11. Gong, L., Syverson, P.: Fail-stop protocols: An approach to designing secure protocols. In: DCCA-5. Proceedings of the 5th International Working Conference on Dependable Computing for Critical Applications, pp. 44-55 (1995)
12. Katz, J., Yung, M.: Scalable protocols for authenticated group key exchange. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 110-125. Springer, Heidelberg (2003)
13. 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)
14. Lowe, G.: A hierarchy of authentication specifications. In: CSFW 1997, Rockport, Massachusetts, USA, IEEE Computer Society Press, Los Alamitos (1997)
15. Lowe, G.: Towards a completeness result for model checking of security protocols. In: CSFW 1998, IEEE Computer Society Press, Los Alamitos (1998)
16. Ramanujam, R., Suresh, S.P.: A decidable subclass of unbounded security protocols. In: WITS'03. Proc. IFIP Workshop on Issues in the Theory of Security, Warsaw (Poland), pp. 11-20 (2003)
17. Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: CSFW 2001, pp. 174-190. IEEE Computer Society Press, Los Alamitos (2001)