Static confidentiality enforcement for distributed programs

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

Volumn 2477, Issue , 2002, Pages 376-394

  Sabelfeld, Andrei ^a   Mantel, Heiko ^b  

^a School of Operations Research and Information Engineering   (United States)

^b GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; MESSAGE PASSING;

CHANNELS OF COMMUNICATION; DISTRIBUTED FILE SERVER; DISTRIBUTED PROGRAM; DISTRIBUTED PROGRAMMING; DISTRIBUTED SYSTEMS; NONBLOCKING COMMUNICATION; OBSERVABLE BEHAVIOR; SECURITY TYPE SYSTEMS;

STATIC ANALYSIS;

EID: 84958755151     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45789-5_27     Document Type: Conference Paper

References (52)

1. M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749-786, September 1999.
2. M. Abadi, A. Banerjee, N. Heintze, and J. Riecke. A core calculus of dependency. In Proc. of Symposium on Principles of Programming Languages, January 1999.
3. M. Abadi and B. Blanchet. Secrecy types for asymmetric communication. In FOSSACS'01, LNCS 2030, pages 25-41, April 2001.
4. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proc. ofConference on Computer and Communications Security, 1997.
5. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal ofCryptology, 15(2), 2002.
6. J. Agat. Transforming out timing leaks. In Proc. of Symposium on Principles of Programming Languages, pages 40-53, January 2000.
7. J. Agat and D. Sands. On confidentiality and algorithms. In Proc. of IEEE Symposium on Security and Privacy, May 2001.
8. G. R. Andrews. Foundations of Multithreaded, Parallel, and Distributed Programming. Addison Wesley, 2000.
9. J. Armstrong, R. Virding, C. Wikstrom, and M. Williams. Concurrent Programming in Erlang. Prentice-Hall, 2nd edition, 1996.
10. J.-P. Banatre and C. Bryce. Information flow control in a parallel language framework. In Proc. of IEEE Computer Security Foundations Workshop, June 1993.
11. A. Banerjee and D. A. Naumann. Secure information flow and pointer confinement in a Java-like language. In Proc. of IEEE Computer Security Foundations Workshop, June 2002.
12. G. Boudol and I. Castellani. Noninterference for concurrent programs. In ICALP'01, LNCS 2076, pages 382-395, July 2001.
13. E. S. Cohen. Information transmission in computational systems. ACM SIGOPS Operating Systems Review, 11(5):133-139, 1977.
14. E. S. Cohen. Information transmission in sequential programs. In R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton, editors, Foundations of Secure Computation, pages 297-335. Academic Press, 1978.
15. D. E. Denning. A lattice model of secure information flow. Communications of the ACM, 19(5):236-243, May 1976.
16. D. E. Denning. Cryptography and Data Security. Addison-Wesley, 1982.
17. D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Communications of the ACM, 20(7):504-513, July 1977.
18. R. Focardi and R. Gorrieri. A classification of security properties for process algebras. Journal of Computer Security, 3(1):5-33, 1995.
19. R. Focardi, R. Gorrieri, and F. Martinelli. Information flow analysis in a discrete-time process algebra. In Proc. ofIEEE Computer Security Foundations Workshop, pages 170-184, July 3-52000.
20. J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. of IEEE Symposium on Security and Privacy. April 1982.
21. J. Gosling, B. Joy, and G. Steele. The Java Language Specification. Addison- Wesley, 1996.
22. N. Heintze and J. G. Riecke. The SLam calculus: programming with secrecy and integrity. In Proc. of Symposium on Principles of Programming Languages, 1998.
23. M. Hennessy and J. Riely. Information flow vs resource access in the asynchronous pi-calculus (extended abstract). In ICALP'00, LNCS 1853, pages 415-427, 2000.
24. C. Hoare. Communicating Sequential Processes (CSP). Prentice Hall, 1985.
25. K. Honda, V. Vasconcelos, and N. Yoshida. Secure information flow as typed process behaviour. In Proc. ofEuropean Symposium on Programming, LNCS 1782, pages 180-199, 2000.
26. K. Honda and N. Yoshida. A uniform type structure for secure information flow. In Proc. ofSymposium on Principles ofProgramming Languages, January 2002.
27. B. W. Lampson. A note on the confinement problem. Commun. ACM, 16(10):613-615, Oct. 1973.
28. P. Laud. Semantics and program analysis of computationally secure information flow. In Proc. of European Symposium on Programming, LNCS 2028, April 2001.
29. K. R. M. Leino and R. Joshi. A semantic approach to secure information flow. Science ofComputer Programming, 37(1-3):113-138, 2000.
30. H. Mantel. Possibilistic definitions of security - an assembly kit In Proc. of IEEE Computer Security Foundations Workshop, pages 185-199, July 2000.
31. H. Mantel. On the composition of secure systems. In Proc. of IEEE Symposium on Security and Privacy, May 2002.
32. H. Mantel and A. Sabelfeld. A generic approach to the security of multi-threaded programs. In Proc. ofIEEE Computer Security Foundations Workshop, June 2001.
33. H. Mantel and A. Sabelfeld. A unifying approach to the security of distributed and multi-threaded programs. Journal ofComputer Security, 2002. To appear.
34. D. McCullough. Specifications for multi-level security and hook-up property. In Proc. ofIEEE Symposium on Security and Privacy, pages 161-166. May 1987.
35. J. McLean. The specification and modeling of computer security. Computer, 23(1), January 1990.
36. J. McLean. A general theory of composition for trace sets closed under selective interleaving functions. In Proc. ofIEEE Symposium on Security and Privacy, 1994.
37. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
38. M. Mizuno and A. Oldehoeft. Information flow control in a distributed object-oriented system with statically-bound object variables. In Proc. ofNational Computer Security Conference, pages 56-67, 1987.
39. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proc. of IEEE Symposium on Security and Privacy, pages 184-200, 2001.
40. A. D. Pierro, C. Hankin, and H. Wiklicky. Approximate non-interference. In Proc. ofIEEE Computer Security Foundations Workshop, June 2002.
41. R. P. Reitman. Information flow in parallel programs: an axiomatic approach. PhD thesis, Cornell University, 1978.
42. P. Ryan, S. Schneider, M. Goldsmith, G. Lowe, and B. Roscoe. The Modelling and Analysis ofSecurity Protocols: the CSP Approach. Addison-Wesley, 2001.
43. A. Sabelfeld. The impact of synchronisation on secure information flow in concurrent programs. In Proc. ofInternational Conference on Perspectives ofSystem Informatics, LNCS 2244, pages 227-241, July 2001.
44. A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. In Proc. ofIEEE Computer Security Foundations Workshop, July 2000.
45. A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. Higher-Order and Symbolic Computation, 14(1):59-91, 2001.
46. G. Smith. A new type system for secure information flow. In Proc. of IEEE Computer Security Foundations Workshop, pages 115-125, June 2001.
47. G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In Proc. of Symposium on Principles of Programming Languages, 1998.
48. D. Volpano. Safety versus secrecy. In Proc. of Symposium on Static Analysis, LNCS 1694, pages 303-311, September 1999.
49. D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. Journal ofComputer Security, 7(23):231-253, November 1999.
50. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal ofComputer Security, 4(3):167-187, 1996.
51. S. Zdancewic and A. C. Myers. Secure information flow via linear continuations. Higher Order and Symbolic Computation, 2002. To appear.
52. S. Zdancewic, L. Zheng, N. Nystrom, and A. C. Myers. Untrusted hosts and confidentiality: Secure program partitioning. In Proc. of ACM Symposium on Operating System Principles, October 2001.