Static analysis for secrecy and non-interference in networks of processes

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

Volumn 2127, Issue , 2001, Pages 27-41

  Bodei, C ^a   Degano, P ^a   Nielson, F ^b   Nielson, H Riis ^b  

^a Dipartimento di Informatica   (Italy)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; SEMANTICS;

CONTROL FLOW ANALYSIS; FLOW LOGIC; IN NETWORKS; NON INTERFERENCE; OPERATIONAL SEMANTICS; SPI CALCULUS; SYMMETRIC CRYPTOGRAPHY;

CALCULATIONS;

EID: 84937553676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44743-1_3     Document Type: Conference Paper

References (32)

1. M. Abadi. Secrecy by Typing In Security protocols. Journal of the ACM, 5(46):18– 36, September 1999
2. M. Abadi. Security protocols and specifications. In FoSSaCS’99, LNCS 1578, pages 1–13. Springer, 1999
3. M. Abadi, C. Fournet. Mobile Values, New names, and Secure Communication. In POPL’01, ACM, 2001
4. M. Abadi, B. Blanchet. Secrecy Types for Asymmetric Communication. In FoSSaCS’01, LNCS 2030, pages 25–41. Springer, 2001
5. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols - The Spi calculus. Information and Computation 148, 1:1–70, January 1999
6. C. Bodei. Security Issues in Process Calculi. PhD thesis, Dipartimento di Informatica, Universitàdi Pisa. TD-2/00, March, 2000
7. C. Bodei, P. Degano, F. Nielson, and H. Riis Nielson. Static analysis for the π-calculus with their application to security. To appear in I&C. Available at http://www.di.unipi.it/∼chiara/publ-40/BDNNi00.ps.
8. C. Bodei, P. Degano, F. Nielson, and H. Riis Nielson. Control flow analysis for the π-calculus. In CONCUR’98, LNCS 1466, pages 84–98. Springer, 1998
9. D. Bolignano. An approach to the formal verification of cryptographic protocols. In 3rd ACM Conf. on Computer and Communications Security, pages 106–118. ACMPress, 1996
10. M. Boreale and R. De Nicola. Testing equivalence for mobile processes. Informationand Computation, 120(2):279–303, August 1995
11. L. Cardelli and A.D. Gordon. Types for mobile ambients. In POPL’99, pages 79–92. ACMPress, 1999
12. R. De Nicola, G. Ferrari, and R. Pugliese, B. Venneri. Types for access control. Theoretical Computer Science 240(1): 215-254, June 2000
13. R. De Nicola and M.C.B. Hennessy. Testing equivalence for processes. TheoreticalComputer Science, 34:83–133, 1984
14. D. E. Denning. A Lattice Model of Secure Information Flow. Communications ofthe ACM, pages 236–243, May 1976
15. D. E. Denning and P. J. Denning. Certification of Programs for Secure Information Flow. Communications of the ACM, pages 504–513, July 1977
16. D. Dolev and A.C. Yao. On the security of public key protocols. IEEE Transactionson Information Theory, IT-29(12):198–208, March 1983
17. J.A. Goguen and J. Meseguer. Security policy and security models. In 1982IEEESymposium on Research on Security and Privacy, pages 11–20. IEEE Press, 1982
18. R. R. Hansen, J. G. Jensen, F. Nielson, and H. R. Nielson. Abstract interpretation of mobile ambients. In SAS’99, LNCS 1694, pages 135–148, 1999
19. N. Heintze and J.G Riecke. The SLam calculus: Programming with secrecy and integrity. In POPL’98, pages 365–377. ACMPress, 1998
20. J. Jürjens. Bridging the Gap: Formal vs. Complexity-theoretical Reasoning about Cryptography. Security through Analysis and Verification, Dagstuhl Dec. 2000
21. F. Nielson and H. R. Nielson. Flow logics and operational semantics. ElectronicNotes of Theoretical Computer Science, 10, 1998
22. F. Nielson, H. R. Nielson, R. R. Hansen, and J. G. Jensen. Validating firewalls in mobile ambients. In CONCUR’99, LNCS 1664, pages 463–477, 1999
23. F. Nielson, H. Seidl. Control-Flow Analysis in Cubic Time. In ESOP’01, LNCS2028, pages 252–268, 2001
24. H. Riis Nielson and F. Nielson. Semantics with Applications: A Formal Introduction. Wiley Professional Computing. Wiley, 1992
25. H. Riis Nielson, F. Nielson, H. Seidl. Cryptographic Analysis in Cubic Time. Manuscript, 2001
26. L.C. Paulson. Proving properties of security protocols by induction. In CSFW’97, pages 70–83. IEEE, 1997
27. J. Riely and M. Hennessy. A typed language for distributed mobile processes. In POPL’98, pages 378–390. ACMPress, 1998
28. J. Riely and M. Hennessy. Trust and partial typing in open systems of mobile agents. In POPL’99, pages 93–104. ACMPress, 1999
29. D. Volpano and G. Smith. Language Issues in Mobile Program Security. In MobileAgent Security, LNCS 1419, pages 25–43. Springer, 1998
30. D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. In CSFW’98, pages 34–43. IEEE, 1998
31. D. Volpano and G. Smith. Secure information flow in a multi-threaded imperative language. In POPL’98, pages 355–364. ACMPress, 1998
32. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4:4–21, 1996.