Unwinding in information flow security

Electronic Notes in Theoretical Computer Science

Volumn 99, Issue , 2004, Pages 127-154

  Bossi, A ^a   Focardi, R ^a   Macedonio, D ^a   Piazza, C ^a   Rossi, S ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; CRYPTOGRAPHY; INFORMATION ANALYSIS; NETWORK PROTOCOLS;

BISIMULATION; INFORMATION FLOW; MULTILEVEL SYSTEMS; SECURITY PROCESS ALGEBRA (SPA);

SECURITY OF DATA;

EID: 4944265912     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.02.006     Document Type: Article

References (37)

1. Martín Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749-786, 1999.
2. A. Aldini, M. Bravetti, and R. Gorrieri. A Process-algebraic Approach for the Analysis of Probabilistic Non-interference. Journal of Computer Security, 2004. To appear.
3. D. E. Bell and L. J. La Padula. Secure computer systems: Unified exposition and multics interpretation. Technical Report ESD-TR-75-306, MITRE MTR-2997, 1975.
4. V. Benzaken, M. Burelle, and G. Castagna. Information flow security for xml transformations. In Proc. of Asian Computing Science Conference (ASIAN'03), LNCS. Springer-Verlag, 2003. To appear.
5. C. Bodei, P. Degano, F. Nielson, and H. Riis Nielson. Static analysis for secrecy and non-interference in networks of processes. In Victor E. Malyshkin, editor, Proc. of International Conference on Parallel Computing Technologies, volume 2127 of Lecture Notes in Computer Science, pages 27-41. Springer-Verlag, 2001.
6. A. Bossi, R. Focardi, C. Piazza, and S. Rossi. Transforming Processes to Ensure and Check Information Flow Security. In H. Kirchner and C. Ringeissen, editors, Int. Conference on Algebraic Methodology and Software Technology (AMAST'02), volume 2422 of LNCS, pages 271-286. Springer-Verlag, 2002.
7. A. Bossi, R. Focardi, C. Piazza, and S. Rossi. A Proof System for Information Flow Security. In M. Leuschel, editor, Logic Based Program Development and Transformation, volume 2664 of LNCS, pages 199-218. Springer-Verlag, 2003.
8. A. Bossi, R. Focardi, C. Piazza, and S. Rossi. Refinement Operators and Information Flow Security. In Proc. of the 1st IEEE Int. Conference on Software Engineering and Formal Methods (SEFM'OS), pages 44-53. IEEE Computer Society Press, 2003.
9. A. Bossi, R. Focardi, C. Piazza, and S. Rossi. Verifying Persistent Security Properties. Computer Languages, Systems and Structures, 2003. To appear. Available at http ://www.dsi.unive.it/~srossi/c103. ps.gz.
10. A. Bossi, D. Macedonio, C. Piazza, and S. Rossi. Information Flow Security and Recursive Systems. In Proc. of the Italian Conference on Theoretical Computer Science (ICTCS'03), volume 2841 of LNCS, pages 369-382. Springer-Verlag, 2003.
11. M. Bugliesi, S. Crafa, M. Merro, and V. Sassone. Communication Interference in Mobile Boxed Ambients. In M. Agrawal and A. Seth, editors, Proc. of Int. Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), volume 2556 of LNCS, pages 71-84. Springer-Verlag, 2002.
12. A. Di Pierro, C. Hankin, and H.Wiklicky. Approximate Non-Interference. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'OS), pages 3-17. IEEE Computer Society Press, 2002.
13. R. Focardi and R. Gorrieri. A Classification of Security Properties for Process Algebras. Journal of Computer Security, 3(1):5-33, 1994/1995.
14. R. Focardi and R. Gorrieri. Classification of Security Properties (Part I: Information Flow). In R. Focardi and R. Gorrieri, editors, Proc. of Foundations of Security Analysis and Design (FOSAD'01), volume 2171 of LNCS, pages 331-396. Springer-Verlag, 2001.
15. R. Focardi, R. Gorrieri, and F. Martinelli. Information flow analysis in a discrete-time process algebra. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'00), pages 170-184. IEEE Computer Society Press, 2000.
16. R. Focardi, R. Gorrieri, and F. Martinelli. Non Interference for the Analysis of Cryptographic Protocols. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, Proc. of Int. Colloquium on Automata, Languages and Programming (ICALP'00), volume 1853 of LNCS, pages 744-755. Springer-Verlag, 2000.
17. R. Focardi and S. Rossi. Information Flow Security in Dynamic Contexts. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'02), pages 307-319. IEEE Computer Society Press, 2002.
18. R. Forster. Non-Interference Properties for Nondeterministic Processes. PhD thesis, Oxford University Computing Laboratory, 1999.
19. J. A. Goguen and J. Meseguer. Security Policies and Security Models. In Proc. of the IEEE Symposium on Security and Privacy (SSP'82), pages 11-20. IEEE Computer Society Press, 1982.
20. J. A. Goguen and J. Meseguer. Unwinding and Inference Control. In Proc. of the IEEE Symposium on Security and Privacy (SSP'84), pages 75-86. IEEE Computer Society Press, 1984.
21. R. Gorrieri, E. Locatelli, and F. Martinelli. A simple language for real-time cryptographic protocol analysis. In P. Degano, editor, Proc. of European Symposium on Programming (ESOP'03), volume 2618 of LNCS, pages 114-128. Springer-Verlag, 2003.
22. M. Hennessy and J. Riely. Information Flow vs. Resource Access in the Asynchronous Pi-calculus. ACM Transactions on Programming Languages and Systems (TOPLAS), 24(5):566-591, 2002.
23. H. Mantel. Unwinding Possibilistic Security Properties. In Proc. of the European Symposium on Research in Computer Security (ESoRiCS'00), volume 2895 of LNCS, pages 238-254. Springer-Verlag, 2000.
24. F. Martinelli. Partial Model Checking and Theorem Proving for Ensuring Security Properties. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'98), pages 44-52. IEEE Computer Society Press, 1998.
25. J. McLean. Security Models and Information Flow. In Proc. of the IEEE Symposium on Security and Privacy (SSP'90), pages 180-187. IEEE Computer Society Press, 1990.
26. J. McLean. Security Models. Encyclopedia of Software Engineering, 1994.
27. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
28. U. Montanari and V. Sassone. CCS Dynamic Bisimulation is Progressing. In Proc. of the Int. Symposium on Mathematical Foundations of Computer Science (MFCS'91), volume 520 of LNCS, pages 346-356. Springer-Verlag, 1991.
29. A. W. Roscoe and M. H. Goldsmith. What is intransitive noninterference? In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'99), pages 228-238. IEEE Computer Society Press, 1999.
30. A. W. Roscoe, J. C. P. Woodcock, and L. Wulf. Non-Interference through Determinism. Journal of Computer Security, 4(1), 1996.
31. P. Y. A. Ryan. A CSP Formulation of Non-Interference and Unwinding. Cipher, pages 19-27, 1991.
32. P.Y.A. Ryan and S. Schneider. Process Algebra and Non-Interference. Journal of Computer Security, 9(1/2):75-103, 2001.
33. A. Sabelfeld and A. C. Myers. Language-Based Information-Flow Security. IEEE Journal on Selected Areas in Communication, 21(1):5-19, 2003.
34. A. Sabelfeld and D. Sands. Probabilistic Noninterference for Multi-threaded Programs. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'00), pages 200-215. IEEE Computer Society Press, 2000.
35. 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), pages 355-364. ACM Press, 1998.
36. D. Sutherland. A Model of Information. In Proc. of the 9th National Computer Security Conference, pages 175-183, 1986.
37. J. T. Wittbold and D. M. Johnson. "Information Flow in Nondeterministic Systems". In Proceedings of the 1990 IEEE Symposium on Research in Security and Privacy, pages 144-161. IEEE Computer Society Press, 1990.