Secrecy and group creation

Information and Computation

Volumn 196, Issue 2, 2005, Pages 127-155

  Cardelli, Luca ^a   Ghelli, Giorgio ^b   Gordon, Andrew D ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Calculus; Secrecy; Security types

Indexed keywords

COMMUNICATION SYSTEMS; DATA PRIVACY; DIFFERENTIATION (CALCULUS); INFORMATION ANALYSIS; NETWORK PROTOCOLS;

Π-CALCULUS; GROUP CREATION; SECRECY; SECURITY TYPES;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 12444303307     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.08.003     Document Type: Article

References (21)

1. M. Abadi Secrecy by typing in security protocols J. ACM 46 5 1999 749 786
2. M. Abadi, Security protocols and specifications, in: Foundations of Software Science and Computation Structures (FOSSACS'99), vol. 1578 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pp. 1-13
3. M. Abadi, and B. Blanchet Secrecy types for asymmetric communication Theoret. Comput. Sci. 298 3 2003 387 415
4. M. Abadi, and A.D. Gordon A calculus for cryptographic protocols: the spi calculus Inform. Comput. 148 1999 1 70
5. C. Bodei, P. Degano, F. Nielson, H. Riis Nielson, Control flow analysis for the π-calculus, in: Concurrency Theory (Concur'98), vol. 1466 of Lecture Notes in Computer Science, Springer, Berlin, 1998, pp. 84-98
6. L. Cardelli, G. Ghelli, A.D. Gordon, Secrecy and group creation, in: C. Palamidessi (Ed.), CONCUR 2000-Concurrency Theory, vol. 1877 of Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 365-379
7. L. Cardelli, G. Ghelli, and A.D. Gordon Types for the ambient calculus Inform. Comput. 177 2002 160 194
8. S. Dal Zilio, and A.D. Gordon Region analysis and a π-calculus with groups J. Funct. Program. 12 3 2002 229 292
9. D. Denning A lattice model of secure information flow Commun. ACM 19 5 1976 236 242
10. D. Dolev, and A.C. Yao On the security of public key protocols IEEE Trans. Inform. Theory IC-29 12 1983 198 208
11. M.J. Gabbay, and A.M. Pitts A new approach to abstract syntax with variable binding Formal Aspects Comput. 13 2002 341 363
12. S.J. Gay, A sort inference algorithm for the polyadic pi-calculus, in: 20th ACM Symposium on Principles of Programming Languages (POPL'93), 1993
13. R. Milner, The polyadic π-calculus: a tutorial, in: F.L. Bauer, W. Brauer, H. Schwichtenberg (Eds.), Proceedings of the International Summer School on Logic and Algebra of Specification, Marktoberdorf, 1991. Available as Technical Report ECS-LFCS-91-180, Department of Computer Science, University of Edinburgh, October 1991. Reprinted in Logic and Algebra of Specification, Springer, Berlin, 1993
14. R. Milner Communicating and Mobile Systems: The π-Calculus 1999 Cambridge University Press Cambridge
15. M. Odersky, Polarized name passing, in: Foundations of Software Technology and Theoretical Computer Science, vol. 1026 of Lecture Notes in Computer Science, Springer, Berlin, 1995
16. B. Pierce, and D. Sangiorgi Typing and subtyping for mobile processes Math. Struct. Comput. Sci. 6 5 1996 409 454
17. J. Riely, M. Hennessy, A typed language for distributed mobile processes, in: 25th ACM Symposium on Principles of Programming Languages (POPL'98), 1998, pp. 378-390
18. D. Sangiorgi, and D. Walker The π-Calculus: A Theory of Mobile Processes 2001 Cambridge University Press Cambridge
19. P. Sewell, Global/local subtyping and capability inference for a distributed π-calculus, in: 25th International Colloquium on Automata, Languages, and Programming (ICALP'98), vol. 1443 of Lecture Notes in Computer Science, Springer, Berlin, 1998, pp. 695-706
20. M. Tofte, and J.-P. Talpin Region-based memory management Inform. Comput. 132 2 1997 109 176
21. V.T. Vasconcelos, K. Honda, Principal typing-schemes in a polyadic π-calculus, in: CONCUR'93-Concurrency Theory, vol. 715 of Lecture Notes in Computer Science, Springer, Berlin, 1993, pp. 524-538