Real-time information flow analysis

IEEE Journal on Selected Areas in Communications

Volumn 21, Issue 1, 2003, Pages 20-35

  Focardi, Riccardo ^a   Gorrieri, Roberto ^b   Martinelli, Fabio ^c  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c Istituto di informatica e telematica del Consiglio nazionale delle ricerche   (Italy)

Author keywords

Bisimulation; Information flow security; Partial mode checking; Process algebra; Real time systems; Timing covert channels

Indexed keywords

BOOLEAN ALGEBRA; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; MATHEMATICAL MODELS; REAL TIME SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); SECURITY OF DATA; SYNCHRONIZATION;

INFORMATION FLOW ANALYSIS; PARTIAL MODEL CHECKING TECHNIQUES; SECURITY PROCESS ALGEBRA; TIMING COVERT CHANNELS;

DATA COMMUNICATION SYSTEMS;

EID: 0037246625     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2002.806122     Document Type: Article

References (37)

1. A. Aldini, "Probabilistic information flow in a process algebra," in Proc. CONCUR'01, vol. LNCS 2154, 2001, pp. 152-168.
2. R. Alur and D. L. Dill, "A theory of timed automata," Theor. Comput. Sci., vol. 126, 183-235, 1994.
3. H. R. Andersen, "Partial model checking (extended abstract)," in Proc. of LICS'95, 1995, pp. 398-407.
4. The Concurrency Workbench-NC. [Online]. Available: http://www.cs.sunysb.edu/~cwb/
5. F. Corradini, D. D'Ortenzio, and P. Inverardi, "On the relationships among four timed process algebras," Fundamenta Informaticae, vol. 34, pp. 1-19, 1999.
6. A. Durante, R. Focardi, and R. Gorrieri, "A compiler for analysing cryptographic protocols using noninterference," ACM Trans. Softw. Eng. Methodology (TOSEM), vol. 9, pp. 489-530, 2000.
7. E. Felten and M. Schneider, "Timing attacks on web privacy," in Proc. 7th ACM Conf. Computer Communications Security, 2000, pp. 25-32.
8. R. Focardi and R. Gorrieri, "A classification of security properties," J. Comput. Security, vol. 3, pp. 5-33, 1995.
9. ____, "The compositional security checker: A tool for the verification of information flow security properties," IEEE Trans. Softw. Eng., vol. 27, pp. 550-571, 1997.
10. ____, "Classification of security properties. Part I: Information flow," in Foundations of Security Analysis and Design. New York: Springer-Verlag, 2001. vol. LNCS 2171, pp. 331-396.
11. R. Focardi, R. Gorrieri, and F. Martinelli, "Information flow analysis in a discrete time process algebra," in Proc. 13th IEEE Computer Security Foundations Workshop (CSFW13), 2000, pp. 170-184.
12. ____, "Noninterference for the analysis of cryptographic protocols," in Proc. Int. Colloquium Automata, Languages, Programming (ICALP'00), vol. LNCS 1853, 2000, pp. 354-372.
13. ____, "A comparison of three authentication properties," Theor. Comput. Sci., to be published.
14. R. Focardi and F. Martinelli, "A uniform approach for the definition of security properties," in Proc. World Congress Formal Methods (FM'99), vol. LNCS 1708, 1999, pp. 794-813.
15. R. J. van Glabbeek, "The linear time-Branching time spectrum," in Handbook of Process Algebra. New York: Elsevier, 2001, ch. 1.
16. J. Goguen and J. Meseguer, "Security policy and security models," in Proc. 1982 Symp. Security Privacy, 1982, pp. 11-20.
17. J. W. Gray III and P. F. Syverson, "A logical approach to multilevel security of probabilistic systems," in Proc. 1992 IEEE Computer Society Symp. Security Privacy, pp. 164-176.
18. J. F. Groote, "Transition system specifications with negative premises," Theor. Comput. Sci., vol. 118, pp. 263-299, 1993.
19. M. Hennessy and T. Regan, "A temporal process algebra," Inform. Comput., vol. 117, pp. 221-239, 1995.
20. R. Lanotte, A. Maggiolo-Schettini, and S. Tini, "Privacy in real-time systems," in Proc. MTCS'01, Electronic Notes in Theoretical Computer Science, vol. 52.
21. J. Lind-Nielsen, "Mudiv: A Program Performing Partial Model Checking," M.S. thesis, Dept. Inform. Technol., Technical Univ. Denmark, Denmark, 1996.
22. D. Marchignoli and F. Martinelli, "Automatic verification of cryptographic protocols through compositional analysis techniques," in Proc. Int. Conf. Tools and Algorithms for the Construction and the Analysis of Systems (TACAS'99), vol. 1579, Lecture Notes in Computer Science, 1999.
23. F. Martinelli, "Formal Methods for the Analysis of Open Systems With Applications to Security Properties," Ph.D. dissertation, University of Siena, Italy, 1998.
24. ____, "Partial model checking and theorem proving for ensuring security properties," in Proc. CSFW'98, 1998, pp. 44-52.
25. ____, "Languages for description and analysis of authentication protocols," in Proc. 6th Italian Conf. Theoretical Computer Science, 1998, pp. 306-315.
26. ____, "Toward automatic synthesis of systems without informations leaks," in Proc. Workshop on Issues in Security (WITS), 2000.
27. R. Milner, "Operational and algebraic semantics of concurrent processes," in Handbook of Theoretical Computer Science, J. van Leewen, Ed. Cambridge, MA: MIT Press, 1990, vol. B, Formal Models and Semantics, ch. 19, pp. 1201-1242.
28. M. Muller-Olm, "Derivation of characteristic formulae," Electron. Notes Theor. Comput. Sci., vol. 18, 1998.
29. X. Nicollin and J. Sifakis, "An overview and synthesis on timed process algebras," in Proc. Real-Time: Theory in Practice, vol. 600, Lecture Notes in Computer Science, J. W. de Bakker, C. Huizing, W. P. de Roever, G. Rozenberg, and editors, Eds., 1992, pp. 526-548.
30. P. Y. A. Ryan, "Mathematical models of computer security," in Foundations of Security Analysis and Design. New York: Springer-Verlag, 2001, pp. 1-62.
31. S. Schneider, Concurrent and Real-Time Systems: The CSP Approach. New York: Wiley, 1999.
32. ____, "Analysing time-dependent security properties in CSP using PVS," in Procs. ESORICS, vol. LNCS 1895, 2000, pp. 222-237.
33. B. Steffen and A. Ingólfsdóttir, "Characteristic formulae for processes with divergence," Inform. Comput., vol. 110, no. 1, pp. 149-163, 1994.
34. C. Stirling, "Modal and temporal logics for processes," in Logics for Concurrency: Structures Versus Automata, vol. LNCS 1043, pp. 149-237.
35. R. S. Street and E. A. Emerson, "The propositional μ-Calculus is elementary," in Proc. 11th Int. Colloquium Automata, Languages, Programming, vol. LNCS 172, 1984, pp. 465-472.
36. ____, "An automata theoretic procedure for the propositional μ-Calculus," Inform. Comput., vol. 81, pp. 249-264, 1989.
37. I. Ulidowski and S. Yuen, "Extending process languages with time," in Proc. 6th Int. Conf. Algebraic Methodology Software Technology, vol. 1349, Lecture Notes in Computer Science, 1997, pp. 524-538.