Observational determinism for concurrent program security

Proceedings of the Computer Security Foundations Workshop

Volumn 2003-January, Issue , 2003, Pages 29-43

  Zdancewic, S ^a   Myers, A C ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

Computer science; Computer security; Concurrent computing; Data security; Government; Information science; Information security; Timing; Web server; Yarn

Indexed keywords

BIOMINERALIZATION; COMPUTER SCIENCE; INFORMATION SCIENCE; KNOWLEDGE BASED SYSTEMS; SECURITY SYSTEMS; YARN;

CONCURRENT COMPUTING; CONCURRENT LANGUAGES; DATA CONFIDENTIALITY; GOVERNMENT; SECURITY PROPERTIES; SEQUENTIAL PROGRAMS; TIMING; WEB SERVERS;

SECURITY OF DATA;

EID: 84942242915     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2003.1212703     Document Type: Conference Paper

References (50)

1. M. Abadi, A. Banerjee, N. Heintze, and J. Riecke. A core calculus of dependency. In Proc. 26th ACM Symp. on Principles of Programming Languages (POPL), pages 147-160, San Antonio, TX, Jan. 1999.
2. M. Abadi and A. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1-70, Jan. 1999.
3. J. Agat. Transforming out timing leaks. In Proc. 27th ACM Symp. on Principles of Programming Languages (POPL), pages 40-53, Boston, MA, Jan. 2000.
4. A. Banerjee and D. A. Naumann. Secure information flow and pointer confinement in a java-like language. In Proc. of the 15th IEEE Computer Security Foundations Workshop, 2002.
5. G. Boudol and I. Castellani. Noninterference for concurrent programs and thread systems. Merci, Maurice, A mosaic in honour of Maurice Nivat, 281(1):109-130, June 2002.
6. S. Conchon. Modular information flow analysis for process calculi. In I. Cervesato, editor, Proc. Foundations of Computer Security Workshop, Copenhagen, Denmark, 2002.
7. D. E. Denning. A lattice model of secure information flow. Comm. of the ACM, 19(5):236-243, May 1976.
8. D. E. Denning and P. J. Denning. Certification of Programs for Secure Information Flow. Comm. of the ACM, 20(7):504-513, July 1977.
9. A. Deutsch. Interprocedural may-alias analysis for pointers: Beyand k-limiting. In Proc. of the '94 SIGPLAN Conference on Programming Language Design, pages 230-241, 1994.
10. M. Emami, R. Ghiya, and L. Hendren. Context-sensitive points-to analysis in the presence of function pointers. In Proc. of the '94 SIGPLAN Conference on Programming Language Design, pages 242-256, June 1994.
11. R. J. Feiertag. A technique for proving specifications are multilevel secure. Technical Report CSL-109, SRI International Computer Science Lab, Menlo Park, California, Jan. 1980.
12. R. Focardi and R. Gorrieri. The compositional security checker: A tool for the verification of information flow security properties. IEEE Transactions on Software Engineering, 23(9), Sept. 1997.
13. C. Fournet and G. Gonthier. The Reflexive CHAM and the Join-Calculus. In Proc. ACM Symp. on Principles of Programming Languages (POPL), pages 372-385, 1996.
14. J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. IEEE Symposium on Security and Privacy, pages 11-20. IEEE Computer Society Press, Apr. 1982.
15. J. A. Goguen and J. Meseguer. Unwinding and inference control. In Proc. IEEE Symposium on Security and Privacy, pages 75-86. IEEE Computer Society Press, Apr. 1984.
16. J. Gray III and P. F. Syverson. A logical approach to multilevel security of probabilistic systems. In Proceedings of the IEEE Symposium on Security and Privacy, pages 164-176. IEEE Computer Society Press, 1992.
17. N. Heintze and J. G. Riecke. The SLam calculus: Programming with secrecy and integrity. In Proc. 25th ACM Symp. on Principles of Programming Languages (POPL), pages 365-377, San Diego, California, Jan. 1998.
18. M. Hennessy and J. Riely. Information flow vs. resource access in the asynchronous pi-calculus. ACM Transactions on Programming Languages and Systems, 24(5), Sept. 2002.
19. K. Honda and N. Yoshida. A uniform type structure for secure information flow. In Proc. 29th ACM Symp. on Principles of Programming Languages, pages 81-92, Jan. 2002.
20. B. W. Lampson. A note on the confinement problem. Comm. of the ACM, 16(10):613-615, Oct. 1973.
21. W. Landi and B. Ryder. A safe approximation algorithm for interprocedural pointer aliasing. In Proc. of the SIGPLAN '92 Conference on Programming Language Design, June 1992.
22. H. Mantel and A. Sabelfeld. A unifying approach to the security of distributed and multi-threaded programs. Journal of Computer Security, 2002. To appear.
23. D. McCullough. Noninterference and the composability of security properties. In Proc. IEEE Symposium on Security and Privacy, pages 177-186. IEEE Computer Society Press, May 1988.
24. J. McLean. Proving noninterference and functional correctness using traces. Journal of Computer Security, 1(1), 1992.
25. J. McLean. A general theory of composition for trace sets closed under selective interleaving functions. In Proc. IEEE Symposium on Security and Privacy, pages 79-93. IEEE Computer Society Press, May 1994.
26. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100(1):1-77, 1992.
27. A. C. Myers. JFlow: Practical mostly-static information flow control. In Proc. 26th ACM Symp. on Principles of Programming Languages (POPL), pages 228-241, San Antonio, TX, Jan. 1999.
28. J. Palsberg and P. Ørbæk. Trust in the λ-calculus. In Proc. 2nd International Symposium on Static Analysis, number 983 in Lecture Notes in Computer Science, pages 314-329. Springer, Sept. 1995.
29. F. Pottier. A simple view of type-secure information flow in the π-calculus. In Proc. of the 15th IEEE Computer Security Foundations Workshop, 2002.
30. F. Pottier and V. Simonet. Information flow inference for ML. In Proc. 29th ACM Symp. on Principles of Programming Languages, Portland, Oregon, Jan. 2002.
31. J. C. Reynolds. Syntactic control of interference. In Proc. 5th ACM Symp. on Principles of Programming Languages (POPL), pages 39-46, 1978.
32. A. W. Roscoe. CSP and determinism in security modeling. In Proc. IEEE Symposium on Security and Privacy, 1995.
33. R. Rugina and M. Rinard. Pointer analysis for multithreaded programs. In Proc. of the ACM SIGPLAN 1999 Conference on Programming Language Design, pages 77-90, May 1999.
34. P. Ryan. A CSP formulation of non-interference and unwinding. Cipher, pages 19-30, 1991.
35. P. Ryan and S. Schneider. Process algebra and non-interference. In Proc. of the 12th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, 1999.
36. A. Sabelfeld and H. Mantel. Static confidentiality enforcement for distributed programs. In Proceedings of the 9th Static Analysis Symposium, volume 2477 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
37. A. Sabelfeld and A. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, 21(1), Jan. 2003.
38. A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. In Proc. of the 13th IEEE Computer Security Foundations Workshop, pages 200-214. IEEE Computer Society Press, July 2000.
39. S. Schneider. Security properties and CSP. In Proc. IEEE Symposium on Security and Privacy, 1996.
40. F. Smith, D. Walker, and G. Morrisett. Alias types. In Proc. of the 9th European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 366-381, 2000.
41. G. Smith. A new type system for secure information flow. In Proc. of the 14th IEEE Computer Security Foundations Workshop, pages 115-125. IEEE Computer Society Press, June 2001.
42. T. V. Vleck. Timing channels. poster session, IEEE TCSP conference, Oakland CA, May 1990. Available at http://www.multicians.org/timing-chn.html.
43. D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. Journal of Computer Security, 7(2,3):231-253, Nov. 1999.
44. D. Volpano and G. Smith. Verifying secrets and relative secrecy. In Proc. 27th ACM Symp. on Principles of Programming Languages (POPL), pages 268-276. ACM Press, Jan. 2000.
45. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167-187, 1996.
46. D. Walker and G. Morrisett. Alias types for recursive data structures. In Workshop on Types in Compilation, Sept. 2000.
47. A. Zakinthinos and E. S. Lee. A general theory of security properties and secure composition. In Proc. IEEE Symposium on Security and Privacy, Oakland, CA, 1997.
48. S. Zdancewic. Programming Languages for Information Security. PhD thesis, Cornell University, 2002.
49. S. Zdancewic and A. C. Myers. Secure information flow via linear continuations. Higher Order and Symbolic Computation, 15(2-3):209-234, Sept. 2002.
50. S. Zdancewic, L. Zheng, N. Nystrom, and A. C. Myers. Secure program partitioning. ACM Transactions on Computer Systems, 20(3):283-328, Aug. 2002.