Enforcing robust declassification

Proceedings of the Computer Security Foundations Workshop

Volumn 17, Issue , 2004, Pages 172-186

  Myers, Andrew C ^a   Sabelfeld, Andrei ^b   Zdancewic, Steve ^c  

^a Department of Obstetrics Gynecology   (United States)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA INTEGRITY; INFORMATION RELEASE; NONINTERFERENCE; ROBUST DECLASSIFICATION;

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; INFORMATION ANALYSIS; SEMANTICS; SENSITIVITY ANALYSIS;

ROBUSTNESS (CONTROL SYSTEMS);

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

References (46)

1. M. Abadi, A. Banerjee, N. Heintze, and J. Riecke. A core calculus of dependency. In Proc. ACM Symp. on Principles of Programming Languages, pages 147-160, Jan. 1999.
2. J. Agat. Transforming out timing leaks. In Proc. ACM Symp. on Principles of Programming Languages, pages 40-53, Jan. 2000.
3. A. Banerjee and D. A. Naumann. Secure information flow and pointer confinement in a Java-like language. In Proc. IEEE Computer Security Foundations Workshop, pages 253-267, June 2002.
4. W. R. Bevier, R. M. Cohen, and W. D. Young. Connection policies and controlled interference. In Proc. IEEE Computer Security Foundations Workshop, pages 167-176, June 1995.
5. T. Chothia, D. Duggan, and J. Vitek. Type-based distributed access control. In Proc. IEEE Computer Security Foundations Workshop, pages 170-186, 2003.
6. D. Clark, S. Hunt, and P. Malacaria. Quantitative analysis of the leakage of confidential data. In Proc. Quantitative Aspects of Programming Languages, volume 59 of ENTCS. Elsevier, 2002.
7. 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.
8. M. Dam and P. Giambiagi. Confidentiality for mobile code: The case of a simple payment protocol. In Proc. IEEE Computer Security Foundations Workshop, pages 233-244, July 2000.
9. D. E. Denning A lattice model of secure information flow. Comm. of the ACM, 19(5):236-243, May 1976.
10. D. E. Denning. Cryptography and Data Security. Addison-Wesley, Reading, MA, 1982.
11. D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Comm. of the ACM, 20(7):504-513, July 1977.
12. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate non-interference. In Proc. IEEE Computer Security Foundations Workshop, pages 1-17, June 2002.
13. E. Ferrari, P. Samarati, E. Bertino, and S. Jajodia. Providing flexibility in information flow control for object-oriented systems. In Proc. IEEE Symp. on Security and Privacy, pages 130-140, May 1997.
14. R. Giacobazzi and I. Mastroeni. Abstract non-interference: Parameterizing non-interference by abstract interpretation. In Proc. ACM Symp. on Principles of Programming Languages, pages 186-197, Jan. 2004.
15. P. Giambiagi and M.Dam. On the secure implementation of security protocols. In Proc. European Symp. on Programming, volume 2618 of LNCS, pages 144-158. Springer-Verlag, Apr. 2003.
16. J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. IEEE Symp. on Security and Privacy, pages 11-20, Apr. 1982.
17. N. Heintze and J. G. Riecke. The SLam calculus: programming with secrecy and integrity. In Proc. ACM Symp. on Principles of Programming Languages, pages 365-377, Jan. 1998.
18. R. Joshi and K. R. M. Leino. A semantic approach to secure information flow. Science of Computer Programming, 37(1-3): 113-138, 2000.
19. P. Laud. Semantics and program analysis of computationally secure information flow. In Proc. European Symp. on Programming, volume 2028 of LNCS, pages 77-91. Springer-Verlag, Apr. 2001.
20. P. Laud. Handling encryption in an analysis for secure information flow. In Proc. European Symp. on Programming, volume 2618 of LNCS, pages 159-173. Springer-Verlag, Apr. 2003.
21. G. Lowe. Quantifying information flow. In Proc. IEEE Computer Security Foundations Workshop, pages 18-31, June 2002.
22. H. Mantel. Information flow control and applications Bridging a gap. In Proc. Formal Methods Europe, volume 2021 of LNCS, pages 153-172. Springer-Verlag, Mar. 2001.
23. H. Mantel and D. Sands. Controlled downgrading based on intransitive (non)interference. Draft, July 2003.
24. A. C. Myers and B. Liskov. A decentralized model for information flow control. In Proc. ACM Symp. on Operating System Principles, pages 129-142, Oct. 1997.
25. A. C. Myers and B. Liskov. Protecting privacy using the decentralized label model. ACM Transactions on Software Engineering and Methodology, 9(4):410-442, 2000.
26. A. C. Myers, L. Zheng, S. Zdancewic, S. Chong, and N. Nystrom. Jif: Java information flow. Software release. Located at http://www.cs.cornell.edu/jif, July 2001-2003.
27. S. Pinsky. Absorbing covers and intransitive non-interference. In Proc. IEEE Symp. on Security and Privacy, pages 102-113, May 1995.
28. F. Pottier and S. Conchon. Information flow inference for free. In Proc. ACM International Conference on Functional Programming, pages 46-57, Sept. 2000.
29. F. Pottier and V. Simonet. Information flow inference for ML. In Proc. ACM Symp. on Principles of Programming Languages, pages 319-330, Jan. 2002.
30. A. W. Roscoe and M. H. Goldsmith. What is intransitive noninterference? In Proc. IEEE Computer Security Foundations Workshop, pages 228-238, June 1999.
31. J. M. Rushby. Noninterference, transitivity, and channel-control security policies. Technical Report CSL-92-02, SRI International, 1992.
32. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, Jan. 2003.
33. A. Sabelfeld and A. C. Myers. A model for delimited information release. In Proc. International Symp. on Software Security (ISSS'03), LNCS. Springer-Verlag, 2004. To appear.
34. A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. In Proc. IEEE Computer Security Foundations Workshop, pages 200-214, July 2000.
35. A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. Higher Order and Symbolic Computation, 14(1):59-91, Mar. 2001.
36. G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In Proc. ACM Symp. on Principles of Programming Languages, pages 355-364, Jan. 1998.
37. D. Volpano. Secure introduction of one-way functions. In Proc. IEEE Computer Security Foundations Workshop, pages 246-254, July 2000.
38. D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. J. Computer Security, 7(2-3):231-253, Nov. 1999.
39. D. Volpano and G. Smith. Verifying secrets and relative secrecy. In Proc. ACM Symp. on Principles of Programming Languages, pages 268-276, Jan. 2000.
40. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. J. Computer Security, 4(3): 167-187, 1996.
41. G. Winskel. The Formal Semantics of Programming Languages: An Introduction. MIT Press, Cambridge, MA, 1993.
42. S. Zdancewic. A type system for robust declassification. In Proc. Mathematical Foundations of Programming Semantics, ENTCS. Elsevier, Mar. 2003.
43. S. Zdancewic and A. C. Myers. Robust declassification. In Proc. IEEE Computer Security Foundations Workshop, pages 15-23, June 2001.
44. S. Zdancewic and A. C. Myers. Secure information flow and CPS. In Proc. European Symp. on Programming, volume 2028 of LNCS, pages 46-61. Springer-Verlag, Apr. 2001.
45. S. Zdancewic, L. Zheng, N. Nystrom, and A. C. Myers. Untrusted hosts and confidentiality: Secure program partitioning. In Proc. ACM Symp. on Operating System Principles, pages 1-14, Oct. 2001.
46. L. Zheng, S. Chong, A. C. Myers, and S. Zdancewic. Using replication and partitioning to build secure distributed systems. In Proc. IEEE Symp. on Security and Privacy, pages 236-250, May 2003.