Owned policies for information security

Proceedings of the Computer Security Foundations Workshop

Volumn 17, Issue , 2004, Pages 126-138

  Chen, Hubie ^a   Chong, Stephen ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; INFORMATION ANALYSIS; KNOWLEDGE ACQUISITION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

INFORMATION FLOW; OWNED POLICIES; PARTIAL KNOWLEDGE; SECURITY POLICIES;

SECURITY OF DATA;

EID: 4944253990     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A. Banerjee and D. A. Neumann. Secure information flow and pointer confinement in a Java-like language. In IEEE Computer Security Foundations Workshop (CSFW), June 2002.
2. D. E. Denning. A lattice model of secure information flow. Communications of the ACM, 19(5):236-243, 1976.
3. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate non-interference. In Proc. 15th IEEE Computer Security Foundations Workshop, pages 1-15, June 2002.
4. GNU general public license. http://www.gnu.org/copyleft/gpl~.html.
5. J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. IEEE Symposium on Security and Privacy, pages 11-20, April 1982.
6. N. Heintze and J. G. Riecke. The SLam calculus: Programming with secrecy and integrity. In Conference Record of the Twenty-Fifth Annual ACM Symposium on Principles of Programming Languages, pages 365-377, San Diego, California, January 1998.
7. K. Honda and N. Yoshida. A uniform type structure for secure information flow. In Conference Record of the Twenty-Ninth Annual ACM Symposium on Principles of Programming Languages, pages 81-92. ACM Press, January 2002.
8. P. Jeavons, D. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527-548, 1997.
9. B. Lampson, M. Abadi, M. Burrows, and E. Wobber. Authentication in distributed systems: Theory and practice. In Proc. 13th ACM Symp. on Operating System Principles (SOSP), pages 165-182, October 1991. Operating System Review, 253(5).
10. B. Lampson, M. Abadi, M. Burrows, and E. Wobber. Authentication in distributed systems: Theory and practice. In Proc. 13th ACM Symp. on Operating System Principles (SOSP), pages 165-182, October 1991. Operating System Review, 253(5).
11. G. Lowe. Quantifying information flow. In Proc. 15th IEEE Computer Security Foundations Workshop, June 2002.
12. C. J. McCollum, J. R. Messing, and L. Notargiacomo. Beyond the pale of MAC and DAC - defining new forms of access control. In Proc. IEEE Symposium on Security and Privacy, pages 190-200, 1990.
13. J. K. Millen. Covert channel capacity. In Proc. IEEE Symposium on Security and Privacy, Oakland, CA, 1987.
14. A. C. Myers. JFlow: Practical mostly-static information flow control. In Conference Record of the Twenty-Sixth Annual ACM Symposium on Principles of Programming Languages, pages 228-241, San Antonio, TX, January 1999.
15. A. C. Myers. Mostly-static decentralized information flow control. Technical Report MIT/LCS/TR-783, MIT, Cambridge, MA, January 1999. Ph.D. thesis.
16. A. C. Myers and B. Liskov. A decentralized model for information flow control. In Proc. 16th ACM Symp. on Operating System Principles (SOSP), pages 129-142, Saint-Malo, France, 1997.
17. A. C. Myers and B. Liskov. Complete, safe information flow with decentralized labels. In Proc. IEEE Symposium on Security and Privacy, pages 186-197, Oakland, CA, USA, May 1998.
18. S. Pinsky. Absorbing covers and intransitive non-interference. In Proc. IEEE Symposium on Security and Privacy, pages 102-113, 1995.
19. F. Pottier and S. Conchon. Information flow inference for free. In Proceedings of the 2000 ACM SIGPLAN International Conference on Functional Programming, pages 46-57, 2000.
20. F. Pottier and V. Simonet. Information flow inference for ML. In Conference Record of the Twenty-Ninth Annual ACM Symposium on Principles of Programming Languages, pages 319-330, 2002.
21. A. W. Roscoe and M. H. Goldsmith. What is intransitive noninterference? In Proc. 12th IEEE Computer Security Foundations Workshop, 1999.
22. J. Rushby. Noninterference, transitivity and channel-control security policies. Technical report, SRI, 1992.
23. D. Volpano and G. Smith. Verifying secrets and relative secrecy. In Conference Record of the Twenty-Seventh Annual ACM Symposium on Principles of Programming Languages, pages 268-276, Boston, MA, January 2000.
24. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167-187, 1996.
25. S. Zdancewic. A type system for robust declassification. In Proceedings of the Nineteenth Conference an the Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science, March 2003.
26. S. Zdancewic and A. C. Myers. Robust declassification. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 15-23, Cape Breton, Nova Scotia, Canada, June 2001.
27. L. Zheng and A. C. Myers. Dynamic security labels and noninterference. Technical Report 2004-1924, Cornell University Computing and Information Science, 2004.