Secrecy types for asymmetric communication

Theoretical Computer Science

Volumn 298, Issue 3, 2003, Pages 387-415

  Abadi, Martín ^a   Blanchet, Bruno ^b,c  

^a University of California Santa Cruz   (United States)

^b Departement d'Informatique   (France)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL METHODS; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY;

ASYMMETRIC COMMUNICATION; SECURITY PROTOCOLS;

SECURITY SYSTEMS;

EID: 0037432692     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00863-0     Document Type: Conference Paper

References (36)

1. Abadi M. Secrecy by typing in security protocols. J. ACM. 46(5):1999;749-786.
2. M. Abadi, Security protocols and their properties, in: F.L. Bauer, R. Steinbrueggen (Eds.), Foundations of Secure Computation, NATO Science Series, IOS Press, Amsterdam, 2000, pp. 39-60. Volume for the 20th International Summer School on Foundations of Secure Computation, Marktoberdorf, Germany, 1999.
3. M. Abadi, B. Blanchet, Analyzing security protocols with secrecy types and logic programs, in: Proc. 29th Annu. ACM Symp. on Principles of Programming Languages, January 2002, pp. 33-44.
4. Abadi M., Gordon A.D. A calculus for cryptographic protocols. the spi calculus Inform. and Comput. 148(1):1999;1-70. An extended version appeared as Digital Equipment Corporation Systems Research Center Report No. 149, January 1998.
5. Abadi M., Needham R. Prudent engineering practice for cryptographic protocols. IEEE Trans. Software Engng. 22(1):1996;6-15.
6. Anderson R., Needham R. Robustness principles for public key protocols. Proc. Crypto '95. 1995;236-247.
7. Birrell A., Nelson G., Owicki S., Wobber E. Network objects. Software Practice Exp. S4(25):1995;87-130.
8. Blanchet B. An efficient cryptographic protocol verifier based on Prolog rules. 14th IEEE Computer Security Foundations Workshop (CSFW-14). June 2001;82-96 IEEE Computer Society, Silver Spring, MD.
9. C. Bodei, Security issues in process calculi, Ph.D. Thesis, Università di Pisa, January 2000.
10. Bodei C., Degano P., Nielson F., Nielson H.R. Control flow analysis for the. π-calculus CONCUR'98: Concurrency Theory. Lecture Notes in Computer Science. vol. 1466:September 1998;84-98 Springer, Berlin.
11. Cardelli L., Ghelli G., Gordon A.D. Secrecy and group creation. Palamidessi C. CONCUR 2000. Concurrency Theory Lecture Notes in Computer Science. vol. 1877:August 2000;365-379 Springer, Berlin.
12. Cervesato I., Durgin N.A., Lincoln P.D., Mitchell J.C., Scedrov A. A meta-notation for protocol analysis. Proc. 12th IEEE Computer Security Foundations Workshop (CSFW'99). June 1999;55-69 IEEE Computer Society Press, Silver Spring, MD.
13. M. Debbabi, M. Mejri, N. Tawbi, I. Yahmadi, A new algorithm for the automatic verification of authentication protocols: from specifications to flaws and attack scenarios, in: Proc. DIMACS Workshop on Design and Formal Verification of Security Protocols, Rutgers University, New Jersey, September 1997.
14. G. Denker, J. Meseguer, C. Talcott, Protocol specification and analysis in Maude, in: N. Heintze, J. Wing (Eds.), Proc. Workshop on Formal Methods and Security Protocols, Indianapolis, IN, 25 June 1998.
15. Denning D.E. Cryptography and Data Security. 1982;Addison-Wesley, Reading, MA.
16. Fournet C., Gonthier G. The reflexive chemical abstract machine and the join-calculus. Proc. 23rd ACM Symp. on Principles of Programming Languages. January 1996;372-385.
17. Goldwasser S., Micali S. Probabilistic encryption. J. Comput. System Sci. 28:1984;270-299.
18. A. Gordon, A. Jeffrey, Authenticity by typing for security protocols 14th IEEE Computer Security Foundations Workshop (CSFW-14). June 2001;145-159 IEEE Computer Society, Silver Spring, MD.
19. Heintze N., Riecke J.G. The SLam calculus. programming with secrecy and integrity Proc. 25th ACM Symp. on Principles of Programming Languages. 1998;365-377.
20. Hennessy M., Riely J. Information flow vs. resource access in the asynchronous pi-calculus. Proc. 27th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science. 2000;415-427 Springer, Berlin.
21. Honda K., Vasconcelos V., Yoshida N. Secure information flow as typed process behaviour. Smolka G. Programming Languages and Systems: Proc. 9th European Symp. on Programming (ESOP 2000), Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS 2000). Lecture Notes in Computer Science. vol. 1782:2000;180-199 Springer, Berlin.
22. Kemmerer R., Meadows C., Millen J. Three systems for cryptographic protocol analysis. J. Cryptol. 7(2):1994;79-130.
23. Lowe G. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science. vol. 1055:1996;147-166 Springer, Berlin.
24. Menezes A.J., van Oorschot P.C., Vanstone S.A. Handbook of Applied Cryptography. 1996;CRC Press, Boca Raton, FL.
25. Merro M., Sangiorgi D. On asynchrony in name-passing calculi. Proc. 25th Internat. Colloq. on Automata, Languages and Programming. Lecture Notes in Computer Science. vol. 1443:1998;856-867 Springer, Berlin.
26. Millen J., Ruess H. Protocol-independent secrecy. Proc. 2000 IEEE Symp. on Security and Privacy. May 2000;110-119.
27. Milner R., Parrow J., Walker D. A calculus of mobile processes, parts I and II. Inform. and Comput. 100:1992;1-40, 41-77.
28. Myers A.C. JFlow. practical mostly-static information flow control Proc. 26th ACM Symp. on Principles of Programming Languages. January 1999;228-241.
29. Myers A.C., Liskov B. A decentralized model for information flow control. Proc. 16th ACM Symp. on Operating System Principles. 1997;129-142.
30. Needham R.M., Schroeder M.D. Using encryption for authentication in large networks of computers. Commun. ACM. 21(12):1978;993-999.
31. Paulson L.C. The inductive approach to verifying cryptographic protocols. J. Comput. Security. 6(1-2):1998;85-128.
32. Pottier F., Conchon S. Information flow inference for free. Proc. 2000 ACM SIGPLAN Internat. Conf. on Functional Programming (ICFP'00). September 2000;46-57.
33. Riely J., Hennessy M. Trust and partial typing in open systems of mobile agents. Proc. 26th ACM Symp. on Principles of Programming Languages. January 1999;93-104.
34. Leino K.R.M., Joshi R. A semantic approach to secure information flow. Mathematics of Program Construction, 4th Internat. Conf. Lecture Notes in Computer Science. vol. 1422:1998;254-271 Springer, Berlin.
35. Volpano D., Irvine C., Smith G. A sound type system for secure flow analysis. J. Comput. Security. 4:1996;167-187.
36. Weidenbach C. Towards an automatic analysis of security protocols in first-order logic. Ganzinger H. 16th Internat. Conf. on Automated Deduction (CADE-16). Lecture Notes in Artificial Intelligence. vol. 1632:July 1999;314-328 Springer, Berlin.