A Model for Delimited Information Release

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3233, Issue , 2004, Pages 174-191

  Sabelfeld, Andrei ^a   Myers, Andrew C ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

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

Author keywords

Computer security; Confidentiality; Declassification; Information flow; Noninterference; Security policies; Security type systems

Indexed keywords

SECURITY OF DATA; SECURITY SYSTEMS;

CONFIDENTIALITY; DECLASSIFICATION; INFORMATION FLOWS; NONINTERFERENCE; SECURITY POLICY; SECURITY TYPE SYSTEMS;

LAUNDERING;

EID: 35048828759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-37621-7_9     Document Type: Article

References (51)

1. M. Abadi. Secrecy by typing in security protocols. J. ACM, 46(5):749-786, September 1999.
2. 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.
3. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The Spi calculus. Information and Computation, 148(1):1-70, January 1999.
4. J. Agat. Transforming out timing leaks. In Proc. ACM Symp. on Principles of Programming Languages, pages 40-53, January 2000.
5. 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.
6. A. Bossi, C. Piazza, and S. Rossi. Modelling downgrading in information flow security. In Proc. IEEE Computer Security Foundations Workshop, June 2004. To appear.
7. 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.
8. 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.
9. 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.
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. D. Duggan. Cryptographic types. In Proc. IEEE Computer Security Foundations Workshop, pages 238-252, June 2002.
14. R. Giacobazzi and I. Mastroeni. Abstract non-interference: Parameterizing noninterference by abstract interpretation. In Proc. ACM Symp. on Principles of Programming Languages, pages 186-197, January 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, April 2003.
16. J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. IEEE Symp. on Security and Privacy, pages 11-20, April 1982.
17. J. A. Goguen and J. Meseguer. Unwinding and inference control. In Proc. IEEE Symp. on Security and Privacy, pages 75-86, April 1984.
18. J. Gosling, B. Joy, and G. Steele. The Java Language Specification. AddisonWesley, August 1996.
19. 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, January 1998.
20. R. Joshi and K. R. M. Leino. A semantic approach to secure information flow. Science of Computer Programming, 37(1-3):113-138, 2000.
21. 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, April 2001.
22. P. Laud. Handling encryption in an analysis for secure information flow. In Proc. European Symp. on Programming, volume 2618 of LNCS, pages 159-173. SpringerVerlag, April 2003.
23. G. Lowe. Quantifying information flow. In Proc. IEEE Computer Security Foundations Workshop, pages 18-31, June 2002.
24. 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.
25. H. Mantel and D. Sands. Controlled downgrading based on intransitive (non)interference. Draft, July 2003.
26. J. McLean. The specification and modeling of computer security. Computer, 23(1):9-16, January 1990.
27. A. C. Myers. JFlow: Practical mostly-static information flow control. In Proc. ACM Symp. on Principles of Programming Languages, pages 228-241, January 1999.
28. A. C. Myers and B. Liskov. A decentralized model for information flow control. In Proc. ACM Symp. on Operating System Principles, pages 129-142, October 1997.
29. A. C. Myers and B. Liskov. Complete, safe information flow with decentralized labels. In Proc. IEEE Symp. on Security and Privacy, pages 186-197, May 1998.
30. A. C. Myers, A. Sabelfeld, and S. Zdancewic. Enforcing robust declassification. In Proc. IEEE Computer Security Foundations Workshop, June 2004. To appear.
31. 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.
32. S. Pinsky. Absorbing covers and intransitive non-interference. In Proc. IEEE Symp. on Security and Privacy, pages 102-113, May 1995.
33. F. Pottier and S. Conchon. Information flow inference for free. In Proc. ACM International Conference on Functional Programming, pages 46-57, September 2000.
34. F. Pottier and V. Simonet. Information flow inference for ML. In Proc. ACM Symp. on Principles of Programming Languages, pages 319-330, January 2002.
35. A. W. Roscoe and M. H. Goldsmith. What is intransitive noninterference? In Proc. IEEE Computer Security Foundations Workshop, pages 228-238, June 1999.
36. J. M. Rushby. Noninterference, transitivity, and channel-control security policies. Technical Report CSL-92-02, SRI International, 1992.
37. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, January 2003.
38. A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. In Proc. IEEE Computer Security Foundations Workshop, pages 200-214, July 2000.
39. 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.
40. J. H. Saltzer, D. P. Reed, and D. D. Clark. End-to-end arguments in system design. ACM Transactions on Computer Systems, 2(4):277-288, November 1984.
41. C. E. Shannon and W. Weaver. The Mathematical Theory of Communication. University of Illinois Press, 1963.
42. 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, January 1998.
43. E. Sumii and B. Pierce. Logical relations for encryption. In Proc. IEEE Computer Security Foundations Workshop, pages 256-269, June 2001.
44. D. Volpano. Secure introduction of one-way functions. In Proc. IEEE Computer Security Foundations Workshop, pages 246-254, July 2000.
45. D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. J. Computer Security, 7(2-3):231-253, November 1999.
46. D. Volpano and G. Smith. Verifying secrets and relative secrecy. In Proc. ACM Symp. on Principles of Programming Languages, pages 268-276, January 2000.
47. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. J. Computer Security, 4(3): 167-187, 1996.
48. G. Winskcl. The Formal Semantics of Programming Languages: An Introduction. MIT Press, Cambridge, MA, 1993.
49. S. Zdancewic. A type system for robust declassification. In Proc. Mathematical Foundations of Programming Semantics, ENTCS. Elsevier, March 2003.
50. S. Zdancewic and A. C. Myers. Robust declassification. In Proc. IEEE Computer Security Foundations Workshop, pages 15-23, June 2001.
51. 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, April 2001.