On declassification and the non-disclosure policy

Proceedings of the Computer Security Foundations Workshop

Volumn , Issue , 2005, Pages 226-240

  Matos, Ana Almeida ^a   Boudol, Gérard ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DECLASSIFICATION; INFORMATION FLOW; INFORMATION FLOW POLICIES; NON-DISCLOSURE POLICY;

COMPUTER CRIME; COMPUTER PROGRAMMING LANGUAGES; DATA PRIVACY; INFORMATION ANALYSIS; SECURITY SYSTEMS;

SECURITY OF DATA;

EID: 28144441375     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2005.21     Document Type: Conference Paper

References (55)

1. J. AAAT, Transforming out timing leaks, POPL'00 (2000) 40-53.
2. G. R. ANDREWS, R.P. REITMAN, An axiomatic approach to information flow in programs, ACM TOPLAS, Vol. 2 No. 1 (1980) 56-76.
3. D.E. BELL, L.J. LA PADULA, Secure computer system: unified exposition and Multics interpretation. Mitre Corp. Rep. MTR-2997 Rev. 1 (1976).
4. A. BOSSI, C. PIAZZA, S. Rossi, Modelling downgrading in information flow security, CSFW'04 (2004).
5. G. BOUDOL, ULM, a core programming model for global computing, ESOP'04, Lecture Notes in Comput. Sci. 2986 (2004) 234-248.
6. G. BOUDOL, I. CASTELLANI, Non-interference for concurrent programs and thread systems, Theoretical Comput. Sci. Vol. 281, No. 1 (2002) 109-130.
7. D. CLARK, S. HUNT, P. MALACARIA, Quantified interference: information theory and information flow, WITS'04 (2004).
8. S. CHONG, A.C. MYERS, Security policies for downgrading, 11th ACM Conf. on Computer and Communications Security (2004).
9. E. COHEN, Information transmission in computational systems, 6th ACM Symp. on Operating Systems Principles (1977) 133-139.
10. K. CRARY, A. KLIGER, F. PFENNING, A monadic analysis of information flow security with mutable state, J. of Functional Programming, Vol. 15 No. 2 (2005) 249-291.
11. D. E. DENNING, A lattice model of secure information flow, CACM Vol. 19 No. 5 (1976) 236-243.
12. A. DI PIERRO, C. HANKIN, H. WIKLICKY, Approximate non-interference, CSFW'02 (2002) 1-15.
13. E. FERRARI, P. SAMARATI, E. BERTINO, S. JAJODIA, Providing flexibility in information flow control for objectoriented systems, IEEE Symp. on Security and Privacy (1997) 130-140.
14. R. FOCARDI, R. GORRIERI, A classification of security properties for process algebras, J. of Computer Security, Vol. 3 No. 1 (1995) 5-33.
15. R. FOCARDI, S. ROSSI, Information flow security in dynamic contexts, CSFW'01 (2001) 307-319.
16. J. A. GOGUEN, J. MESEGUER, Security policies and security models, IEEE Symp. on Security and Privacy (1982) 11-20.
17. N. HEINTZE, J. RIECKE, The SLam calculus: programming with secrecy and integrity, POPL'98 (1998) 365-377.
18. A.K. JONES, R.J. LIPTON, The enforcement of security policies for computation, 5th ACM Symp. on Operating Systems Principles (1975) 197-206.
19. B.W. LAMPSON, A note on the confinement problem, CACM Vol. 16 No. 10 (1973) 613-615.
20. P. J. LANDIN, The mechanical evaluation of expressions, Computer Journal Vol. 6 (1964) 308-320.
21. P. LAUD, Semantics and program analysis of computationally secure information flow, ESOP'01, Lecture Notes in Comput. Sci. 2028 (2001) 77-91.
22. P. LAUD, Handling encryption in an analysis for secure information flow, ESOP'03, Lecture Notes in Comput. Sci. 2618 (2003) 159-173.
23. P. LI, Y. MAO, S. ZDANCEWIC, Information integrity policies, Formal Aspects of Security and Trust Workshop (2003).
24. P. LI, S. ZDANCEWIC, Downgrading policies and relaxed noninterference, POPL'05 (2005) 158-170.
25. G. LOWE, Semantic models of information flow, Theoretical Comput. Sci. 315 (2004) 209-256.
26. J. M. LUCASSEN, D. K. GIFFORD, Polymorphic effect systems, POPL'88 (1988) 47-57.
27. H. MANTEL, D. SANDS, Controlled declassification based on intransitive noninterference, APLAS'04, Lecture Notes in Comput. Sci. 3302 (2004) 129-145.
28. R. MILNER, M. TOFTE, R. HARPER, D. MACQUEEN, The definition of Standard ML (Revised), The MIT Press (1997).
29. A. MYERS, JFlow: practical mostly-static information flow control, POPL'99 (1999).
30. A. C. MYERS, B. LISKOV, A decentralized model for information flow control, ACM Symp. on Operating Systems Principles (1997) 129-142.
31. A. C. MYERS, B. LISKOV, Protecting privacy using the decentralized label model, ACM Trans. on Soft. Eng. and Methodology, Vol. 9 No. 4 (2000) 410-442.
32. A. C. MYERS, A. SABELFELD, S. ZDANCEWIC, Enforcing robust declassification, CSFW'04 (2004).
33. F. POTTIER, V. SIMONET, Information flow inference for ML, ACM TOPLAS Vol. 25 No. 1 (2003) 117-158.
34. A.W. ROSCOE, M.H. GOLDSMITH, What is intransitive noninterference?, CSFW'99 (1999).
35. J. RUSHBY, Noninterference, transitivity, and channel-control security policies, Comput. Sci. Lab. SRI International, Tech. Rep. CSL-92-02 (1992).
36. P. RYAN, J. MCLEAN, J. MILLEN, V. GLIGOR, Non-interference, who needs it?, CSFW'01 (2001).
37. A. SABELFELD, D. SANDS, Probabilistic noninterference for multi-threaded programs, CSFW'00 (2000).
38. A. SABELFELD, A.C. MYERS, Language-based information-flow security, IEEE J. on Selected Areas in Communications Vol. 21 No. 1 (2003) 5-19.
39. A. SABELFELD, A.C. MYERS, A model for delimited information release, Intern. Symp. on Software Security, Lecture Notes in Comput. Sci. to appear (2003).
40. R. S. SANDHU, Lattice-based access control models, IEEE Computer Vol. 26 No. 11 (1993) 9-19.
41. V. SIMONET, The Flow Caml system: documentation and user's manual, INRIA Tech. Rep. 0282 (2003).
42. G. SMITH, A new type system for secure information flow, CSFW'01 (2001).
43. G. SMITH, D. VOLPANO, Secure information flow in a multi-threaded imperative language, POPL'98 (1998).
44. S. TSE, S. ZDANCEWIC, Run-time principals in information-flow type systems, IEEE Symp. on Security and Privacy (2004).
45. S. TSE, S. ZDANCEWIC, A design for a security-typed language with certificate-based declassification, ESOP'05, Lecture Notes in Comput. Sci. to appear (2005).
46. D. VOLPANO, Secure introduction of one-way functions, CSFW'00 (2000) 246-254.
47. D. VOLPANO, G. SMITH, Eliminating covert flows with minimum typings, CSFW'97 (1997) 156-168.
48. D. VOLPANO, G. SMITH, Probabilistic noninterference in a concurrent language, CSFW'98 (1998) 34-43.
49. D. VOLPANO, G. SMITH, Verifying secrets and relative secrecy, POPL'00 (2000) 268-276.
50. D. VOLPANO, G. SMITH, C. IRVINE, A sound type system for secure flow analysis, J. of Computer Security, Vol. 4, No 3 (1996) 167-187.
51. A. WRIGHT, M. FELLEISEN, A syntactic approach to type soundness, Information and Computation Vol. 115 No. 1 (1994) 38-94.
52. S. ZDANCEWIC, A type system for robust declassification, MFPS'03, ENTCS Vol. 83 (2003).
53. S. ZDANCEWIC, Challenges for information-flow security, PLID'04 (2004).
54. S. ZDANCEWIC, A.C. MYERS, Secure information How via linear continuations, HOSC Vol. 15 No. 2-3 (2002) 209-234.
55. L. ZHENG, A.C. MYERS, Dynamic security labels and noninterference, Formal Aspects of Security and Trust Workshop (2004).