Controlled declassification based on intransitive noninterference

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

Volumn 3302, Issue , 2004, Pages 129-145

  Mantel, Heiko ^a   Sands, David ^b  

^a ETH ZURICH   (Switzerland)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATIONAL LINGUISTICS; INFORMATION FILTERING;

ABSTRACT SPECIFICATIONS; CHANNEL CONTROL; COMMON FEATURES; INTRANSITIVE NON-INTERFERENCE; RECENT RESEARCHES; SATISFACTORY SOLUTIONS; SECURITY POLICY; SECURITY TYPE SYSTEMS;

NETWORK SECURITY;

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

References (26)

1. [Aga00] J. Agat. Transforming out Timing Leaks. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 40-53, 2000.
2. [BL76] D. E. Bell and L. LaPadula. Secure Computer Systems: Unified Exposition and Multics Interpretation. Technical Report MTR-2997, MITRE, 1976.
3. [BP02] M. Backes and B. Pfitzmann. Computational Probabilistic Non-interference. In Proceedings of ESORICS, LNCS 2502, pages 1-23, 2002.
4. [BPR04] A. Bossi, C. Piazza, and S. Rossi. Modelling Downgrading in Information Flow Security. In Proc. of IEEE CSFW, 2004. to appear.
5. [CHM02] D. Clark, S. Hunt, and P. Malacaria. Quantitative Analysis of the Leakage of Confidential Data. In Quantitative Aspects of Programming Languages Selected papers from QAPL 2001, volume 59 of ENTCS, 2002.
6. [Coh78] E. S. Cohen. Information Transmission in Sequential Programs. In Foundations of Secure Computation, pages 297-335. Academic Press, 1978.
7. [Den76] D. E. Denning. A Lattice Model of Secure Information Flow. Communications of the ACM, 19(5):236-243, 1976.
8. [DHW02] A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate Non-interference. In Proceedings of IEEE CSFW, pages 1-17, 2002.
9. [Koc96] P. C. Kocher. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In Neal Koblitz, editor, Advances in Cryptology -CRYPTO'96, volume 1109 of LNCS, pages 104-113. Springer-Verlag, 1996.
10. [Lau03] P. Laud. Handling Encryption in an Analysis for Secure Information Flow. In Proceedings of ESOP, LNCS 2618, pages 159-173. Springer-Verlag, 2003.
11. [Low02] G. Lowe. Quantifying Information Flow. In Proceedings of IEEE CSFW, pages 18-31, 2002.
12. [Man01] H. Mantel. Information Flow Control and Applications - Bridging a Gap. In Proceedings of Formal Methods Europe, LNCS 2021, pages 153-172, 2001.
13. [MRST01] J. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A Probabilistic Polynomial-Time Calculus for Analysis of Cryptographic Protocols (Preliminary report). In Proc. of the Conf. on the Math. Foundations of Programming Semantics, volume 45 of ENTCS, 2001.
14. [MSZ04] A. C. Myers, A. Sabelfeld, and S. Zdancewic. Enforcing Robust Declassification. In Proc. of IEEE CSFW, 2004. to appear.
15. th European Symposium on Research in Computer Security, LNCS. Springer, 2004. to appear.
16. [Pin95] S. Pinsky. Absorbing Covers and Intransitive Non-Interference. In Proceedings of the IEEE Symposium on Security and Privacy, pages 102-113, Oakland, CA, USA, 1995.
17. [RG99] A. W. Roscoe and M. H. Goldsmith. What is Intransitive Noninterference? In Proceedings of IEEE CSFW, pages 228-238, 1999.
18. [Rus92] J. M. Rushby. Noninterference, Transitivity, and Channel-Control Security Policies. Technical Report CSL-92-02, SRI International, 1992.
19. [SM03a] A. Sabelfeld and A. C. Myers. A Model for Delimited Information Release. In International Symposium on Software Security, 2003.
20. [SM03b] A. Sabelfeld and A. C. Myers. Language-Based Information-Flow Security. IEEE Journal on Selected Areas in Communications, 21(1):5-19, 2003.
21. [SS00] A. Sabelfeld and D. Sands. Probabilistic Noninterference for Multi-threaded Programs. In Proceedings of IEEE CSFW, pages 200-214, 2000.
22. [SS01] A. Sabelfeld and D. Sands. A Per Model of Secure Information Flow in Sequential Programs. HOSC, 14(1):59-91, 2001.
23. [VS97] D. Volpano and G. Smith. Eliminating Covert Flows with Minimum Typings. In Proceedings of IEEE CSFW, pages 156-168, 1997.
24. [VS00] D. M. Volpano and G. Smith. Verifying Secrets and Relative Secrecy. In Proceedings of POPL, pages 268-276, 2000.
25. [Zda03] S. Zdancewic. A Type System for Robust Declassification. In Proc. of the Conf. on the Math. Foundations of Programming Semantics, ENTCS, 2003.
26. [ZM01] S. Zdancewic and A. C. Myers. Robust Declassification. In Proceedings of IEEE CSFW, pages 15-23, 2001.