History-based access control and secure information flow

Lecture Notes in Computer Science

Volumn 3362, Issue , 2005, Pages 27-48

  Banerjee, Anindya ^a   Naumann, David A ^b  

^a Sunflower Networking Group   (United States)

^b Stevens Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING; SECURITY OF DATA; SEMANTICS; VIRTUAL REALITY;

INFORMATION FLOW; STATIC ANALYSIS; STATIC CHECKING; VIRTUAL MACHINES;

INFORMATION RETRIEVAL;

EID: 24144435318     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30569-9_2     Document Type: Conference Paper

References (18)

1. M. Abadi and C. Fournet. Access control based on execution history. In Proceedings of the 10th Annual Network and Distributed System Security Symposium, pages 107-121, Feb. 2003.
2. A. Banerjee and D. A. Naumann. Stack-based access control and secure information flow. Journal of Functional Programming, Special Issue on Language-based Security. To appear.
3. A. Banerjee and D. A. Naumann. Secure information flow and pointer confinement in a Java-like language. In IEEE Computer Security Foundations Workshop (CSFW), pages 253-270. IEEE Computer Society Press, 2002.
4. A. Banerjee and D. A. Naumann. Using access control for secure information flow in a Java-like language. In IEEE Computer Security Foundations Workshop (CSFW), pages 155-169. IEEE Computer Society Press, 2003.
5. D. Bell and L. LaPadula. Secure computer systems: Mathematical foundations. Technical Report MTR-2547, MITRE Corp., 1973.
6. D. Denning and P. Denning. Certification of programs for secure information flow. Communications of the ACM, 20(7):504-513, 1977.
7. C. Fournet and A. D. Gordon. Stack inspection: Theory and variants. ACM Trans. Prog. Lang. Syst., 25(3):360-399, 2003.
8. J. Goguen and J. Meseguer. Security policies and security models. In Proceedings of the 1982 IEEE Symposium on Security and Privacy, pages 11-20, 1982.
9. L. Gong. Inside Java 2 Platform Security. Addison-Wesley, 1999.
10. J. Gough. Compiling for the .NET Common Language Runtime. Prentice Hall, 2001.
11. N. Heintze and J. G. Riecke. The SLam calculus: programming with secrecy and integrity. In A CM Symposium on Principles of Programming Languages (POPL), pages 365-377, 1998.
12. A. Igarashi and N. Kobayashi. Resource Usage Analysis. A CM Trans. Prog. Lang. Syst., 2004. To appear.
13. Y. Mandelbaum, D. Walker, and R. Harper. An effective theory of type refinements. In Proceedings of the the Eighth ACM SIGPLAN International Conference on Functional Programming (ICFP'03), Aug. 2003.
14. K. Marriott, P. J. Stuckey, and M. Sulzmann. Resource usage verification. In Proceedings of the First Asian Programming Languages Symposium (APLAS), 2003.
15. A. C. Myers. JFlow: Practical mostly-static information flow control. In ACM Symposium on Principles of Programming Languages (POPL), pages 228-241, 1999.
16. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, Jan. 2003.
17. Q. Sun, A. Banerjee, and D. A. Naumann. Modular and constraint-based information flow inference for an object-oriented language. In R. Giacobazzi, editor, Static Analysis Symposium (SAS), volume 3148 of Lecture Notes in Computer Science, pages 84-99. Springer-Verlag, 2004.
18. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3): 167-187, 1996.