Towards a logical account of declassification

PLAS'07 - Proceedings of the 2007 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security

Volumn , Issue , 2007, Pages 61-66

  Banerjee, Anindya ^a   Naumann, David A ^b   Rosenberg, Stan ^b  

^a KANSAS STATE UNIVERSITY   (United States)

^b STEVENS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Aliasing; Confidentiality; Information flow

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; SECURITY OF DATA;

ASSERTIONS AND AUXILIARY STATE; INFORMATION FLOW;

INFORMATION SYSTEMS;

EID: 36448951937     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1255329.1255340     Document Type: Conference Paper

References (27)

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, January 1999.
2. A. Askarov and A. Sabelfeld. Gradual release: Unifying declassification, encryption and key release policies. In Proc. IEEE Symp. on Security and Privacy, May 2007.
3. A. Bossi, C. Piazza, and S. Rossi. Modelling downgrading in information flow security. In Proc. IEEE Computer Security Foundations Workshop, pages 187-201, June 2004.
4. N. Broberg and D. Sands. Flow locks: Towards a core calculus for dynamic flow policies. In Proc. European Symp. on Programming, volume 3924 of LNCS, pages 180-196. Springer-Verlag, 2006.
5. S. Chong and A. C. Myers. Security policies for downgrading. In ACM Conference on Computer and Communications Security, pages 198-209, October 2004.
6. 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.
7. J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. IEEE Symp. on Security and Privacy, pages 11-20, April 1982.
8. 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, January 2004.
9. R. Giacobazzi and I. Mastroeni. Adjoining declassification and attack models by abstract interpretation. In Proc. European Symp. on Programming, volume 3444 of LNCS, pages 295-310. Springer-Verlag, April 2005.
10. R. Joshi and K. R. M. Leino. A semantic approach to secure information flow. Science of Computer Programming, 37(1-3):113-138, 2000.
11. P. Li and S. Zdancewic. Downgrading policies and relaxed noninterference. In Proc. ACM Symp. on Principles of Programming Languages, pages 158-170, January 2005.
12. H. Mantel. Information flow control and applications-Bridging a gap. In Proc. Formal Methods Europe, volume 2021 of LNCS, pages 153-172. Springer-Verlag, March 2001.
13. H. Mantel and A. Reinhard. Controlling the what and where of declassification in language-based security. In Proc. European Symp. on Programming, volume 4421 of LNCS, pages 141-156. Springer-Verlag, 2007.
14. H. Mantel and D. Sands. Controlled downgrading based on intransitive (non)interference. In Proc. Asian Symp. on Programming Languages and Systems, volume 3302 of LNCS, pages 129-145. Springer-Verlag, November 2004.
15. J. Mullins. Non-deterministic admissible interference. J. of Universal Computer Science, 6(11): 1054-1070, 2000.
16. S. Pinsky. Absorbing covers and intransitive non-interference. In Proc. IEEE Symp. on Security and Privacy, pages 102-113, May 1995.
17. F. Prost. On the semantics of non-interference type-based analyses. In JFLA'001, Journées Francophones des Langages Applicatifs, January 2001.
18. A. W. Roscoe and M. H. Goldsmith. What is intransitive non-interference? In Proc. IEEE Computer Security Foundations Workshop, pages 228-238, June 1999.
19. P. Ryan and S. Schneider. Process algebra and noninterference. In Proc. IEEE Computer Security Foundations Workshop, pages 214-227, June 1999.
20. J. M. Rushby. Noninterference, transitivity, and channel-control security policies. Technical Report CSL-92-02, SRI International, 1992.
21. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, January 2003.
22. A. Sabelfeld and A. C. Myers. A model for delimited information release. In Proc. International Symp. on Software Security (ISSS'03), volume 3233 of LNCS, pages 174-191. Springer-Verlag, October 2004.
23. A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. Higher Order and Symbolic Computation, 14(1):59-91, March 2001.
24. A. Sabelfeld and D. Sands. Dimensions and principles of declassification. In Proc. IEEE Computer Security Foundations Workshop, pages 255-269, June 2005.
25. A. Sabelfeld and D. Sands. Declassification: Dimensions and principles. J. Computer Security, 2007. To appear.
26. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. J. Computer Security, 4(3): 167-187, 1996.
27. S. Zdancewic. Challenges for information-flow security. In Proc. Programming Language Interference and Dependence (PLID), August 2004.