Compositional information flow security for concurrent programs

Journal of Computer Security

Volumn 15, Issue 3, 2007, Pages 373-416

  Bossi, Annalisa ^a   Piazza, Carla ^b   Rossi, Sabina ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Bisimulation; Concurrency; Noninterference; Security

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; INFORMATION ANALYSIS;

ATOMIC STATEMENT CONSTRUCTORS; NONINTERFERENCE PRINCIPLE; TARSKI DECIDABILITY;

SECURITY OF DATA;

EID: 34249893892     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2007-15303     Document Type: Article

References (41)

1. J. Agat, Transforming out timing leaks, in: Proc. of ACM Symposium on Principles of Programming Languages (POPL'00), ACM Press, 2000, pp. 40-53.
2. T. Amtoft and A. Banerjee, Information flow analysis in logical form, in: Proceedings of the 11th Static Analysis Symposium (SAS'04), volume 3148 of LNCS, Springer, 2004, pp. 100-115.
3. G.R. Andrews, Foundation of Multithreaded, Parallel, and Distributed Programming, Addison, 2000.
4. G. Barthe, P. D'Argenio and T. Rezk. Secure information flow by self composition, in: Proc. of the 17th IEEE Computer Security Foundations Workshop (CSFW'04), IEEE Computer Society Press, 2004, pp. 100-114.
5. A. Bossi, R. Focardi, C. Piazza and S. Rossi, Verifying persistent security properties, Computer Languages, Systems and Structures 30(3-4) (2004), 231-258.
6. G. Boudol and I. Castellani, Noninterference for concurrent programs, in: Proc. of Int. Colloquium on Automata, Languages and Progmmming (ICALP'01), F. Orejas, P.G. Spirakis and J. van Leeuwen, eds, volume 2076 of LNCS, Springer, 2001, pp. 382-395.
7. G. Boudol and I. Castellani, Noninterference for concurrent programs and tread systems, Theoretical Computer Science 281(1) (2002), 109-130.
8. G.E. Collins, Quantifier elimination for real closed fields by cylindrical algebraic decomposition, in: 2nd Gl Conf. on Automata Theory and Formal Languages, H. Barkhage, ed., volume 33 of LNCS, Springer, 1975, pp. 134-183.
9. G.E. Collins and H. Hong, Partial cylindrical algebraic decomposition for quantifier elimination, Journal, of Symbolic Computation 12 (1991), 299-328.
10. M. Dam, Decidability and proof systems for language-based noninterference relations, in: Proc. of ACM Symposium on Principles of Programming Languages (POPL'06), ACM Press, 2006, pp. 67-78.
11. D.E. Denning and P.J. Denning, Certification of programs for secure information flow, Commun. ACM 20(7) (1977), 504-513.
12. R. Focardi and R. Gorrieri, Classification of security properties (Part I: Information flow), in: Proc. of Foundations of Security Analysis and Design (FOSAD'Ol), R. Focardi and R. Gorrieri, eds, volume 2171 of LNCS, Springer, 2001, pp. 331-396.
13. J.A. Goguen and J. Meseguer, Security policies and security models, in: Proc. of the IEEE Symposium on Security and Privacy (SSP'82), IEEE Computer Society Press, 1982, pp. 11-20.
14. J.A. Goguen and J. Meseguer, Unwinding and inference control, in: Proc. of the IEEE Symposium on Security and Privacy (SSP '84), IEEE Computer Society Press, 1984, pp. 75-86.
15. D. Grigoriev, Complexity of deciding tarski algebra, Journal of Symbolic Computation 5 (1988), 65-108.
16. K.G. Larsen and A. Skou, Bisimulation through probabilistic testing, in: Proc. of ACM Symposium on Principles of Programming Languages (POPL'89), ACM Press, 1989, pp. 344-352.
17. P. Li and S. Zdancewic, Downgrading policies and relaxed noninterference, in: Proc. of ACM Symposium on Principles of Programming Languages (POPL'05), ACM Press, 2005, pp. 158-170.
18. H. Mantel, Unwinding possibilistic security properties, in: Proc. of the European Symposium on Research in Computer Security (ESoRiCS '00), volume 2895 of LNCS, Springer, 2000, pp. 238-254.
19. Y.V. Matiyasevich, Enumerable sets are diophantine, Soviet Mathematics Doklady 11(2) (1970), 354-358.
20. R. Milner, Communication and Concurrency, Prentice-Hall, 1989.
21. A.C. Myers, JFlow: practical mostly-static information flow control, in: Proc. of ACM Symposium on Principles of Programming Languages (POPL'99), ACM Press, 1999, pp. 228-241.
22. A.C. Myers and B. Liskov, Protecting privacy using the decentralized label model, ACM Transactions on Software Engineering and Methodology (TOSEM) 9(4) (2000), 410-442.
23. A.C. Myers, A. Sabelfeld and S. Zdancewic, Enforcing robust declassification, in: Proc. of the 17th IEEE Computer Security Foundations Workshop (CSFW'04), IEEE Computer Society, 2004, pp. 172-186.
24. D. von Oheimb, Information flow control revisited: noninfluence = noninterference + nonleakage, in: Proc. of the 9th European Symposium on Research in Computer Security (ESORICS'04), volume 3193 of LNCS, Springer, 2004, pp. 225-243.
25. J. Renegar, On the computational complexity and geometry of the first-order theory of the reals, parts I-III, Journal of Symbolic Computation 13 (1992), 255-352.
26. P.Y.A. Ryan and S. Schneider, Process algebra and non-interference, Journal of Computer Security 9(1/2) (2001), 75-103.
27. A. Sabelfeld and H. Mantel, Static confidentiality enforcement for distributed programs, in: Proc. of Int. Static Analysis Symposium (SAS'02), M.V. Hermenegildo and G. Puebla, eds, volume 2477 of LNCS, Springer, 2002, pp. 376-394.
28. A. Sabelfeld and A.C. Myers, Language-based information-flow security, IEEE Journal on Selected Areas in Communication 21(1):5-19, 2003.
29. A. Sabelfeld and A.C. Myers, A model for delimited information release, in: Proceedings of the International Symposium on Software Security, Theories and Systems (ISSS 2003), volume 3233 of LNCS, Springer, 2003, pp. 174-191.
30. A. Sabelfeld and D. Sands, Probabilistic noninterference for multi-threaded programs, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW'00), IEEE Computer Society Press, 2000, pp. 200-215.
31. A. Sabelfeld and D. Sands, A per model of secure information flow in sequential programs, Higher-Older and Symbolic Computation 14(1) (2001), 59-91.
32. A. Sabelfeld and D. Sands, Dimensions and principles of declassification, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW'05), IEEE Computer Society Press, 2005, pp. 255-269.
33. G. Smith, A new type system for secure information flow, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW'01), IEEE Computer Society, 2001, pp. 115-125.
34. G. Smith and D.M. Volpano, Secure information flow in a multi-threaded imperative language, in: Proc. of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'98), ACM Press, 1998, pp. 355-364.
35. A. Tarski, A Decision Method for Elementary Algebra and Geometry, 2nd edn, University of California Press, CA, 1951.
36. D. Volpano, Secure introduction of one-way functions, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW'00), IEEE Computer Society Press, 2000, pp. 246-254.
37. D.M. Volpano and G. Smith, A type-based approach to program security, in: TAPSOFT, 1997, pp. 607-621.
38. D.M. Volpano and G. Smith, Probabilistic noninterference in a concurrent language, Journal of Computer Security 7(2-3) (1999), 231-253.
39. D.M. Volpano and G. Smith, Verifying secrets and relative secrecy, in: Proc. of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'00), ACM Press, 2000, pp. 268-276.
40. G. Winskel, The Formal Semantics of Programming Languages, The MIT Press, 1993.
41. S. Zdancewic and A.C. Myers, Robust declassification, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW'01), IEEE Computer Society Press, 2001, pp. 15-23.