A process-algebraic approach for the analysis of probabilistic noninterference

Journal of Computer Security

Volumn 12, Issue 2, 2004, Pages 191-245

  Aldini, Alessandro ^a   Bravetti, Mario ^b   Gorrieri, Roberto ^b  

^a UNIVERSITY OF URBINO   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DATA PROCESSING; FREQUENCIES; MATHEMATICAL MODELS; PROBABILITY;

NONINTERFERENCE; PROCESS ALGEBRA; SYSTEM PROGRAMS;

SECURITY OF DATA;

EID: 3042529082     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2004-12202     Document Type: Article

References (62)

1. A. Aldini, M. Bernardo, R. Gorrieri and M. Roccetti, Comparing the QoS of internet audio mechanisms via formal methods, ACM Transactions on Modeling and Computer Simulation 11(1) (2001), 1-42.
2. A. Aldini and M. Bravetti, An asynchronous calculus for generative-reactive probabilistic systems, in: Proc. of 8th Int. Workshop on Process Algebra and Performance Modeling, Carleton Scientific, 2000, pp. 591-605.
3. A. Aldini, M. Bravetti and R. Gorrieri, A process-algebraic approach for the analysis of probabilistic non-interference, Technical Report UBLCS-2002-02, University of Bologna, Italy, 2002, ftp://ftp.es.unibo.it/pub/techreports/
4. A. Aldini and R. Gorrieri, Security analysis of a probabilistic non-repudiation protocol, in: Proc. of 2nd Joint Int. Workshop on Process Algebra and Performance Modelling, Probabilistic Methods in Verification, Springer LNCS, Vol. 2399, 2002, pp. 17-36.
5. G.R. Andrews and R.P. Reitman, An axiomatic approach to information flow in programs, ACM Transactions on Programming Languages and Systems 2(1) (1980), 56-76.
6. M. Backes and B. Pfitzmann, Computational probabilistic non-interference, in: Proc. of 7th European Symposium on Research in Computer Security, Springer LNCS, Vol. 2502, 2002, pp. 1-23.
7. J.C.M. Baeten, J.A. Bergstra and S.A. Smolka, Axiomatizing probabilistic processes: ACP with generative probabilities, Information and Computation 121 (1995), 234-255.
8. C. Baier and H. Hermanns, Weak bisimulation for fully probabilistic processes, in: Proc. of 9th Int. Conf. on Computer Aided Verification, Springer LNCS, Vol. 1254, 1997, pp. 119-130.
9. D.E. Bell and L.J. La Padula, Secure computer systems: mathematical foundations and model, Technical Report M74-244, The MITRE Corporation, Bedford, MA, 1973.
10. M. Bravetti, Specification and analysis of stochastic real-time systems, PhD Thesis, University of Bologna (Italy), 2002, ftp://ftp.cs.unibo.it/pub/ techreports/
11. M. Bravetti and A. Aldini, Discrete time generative-reactive probabilistic processes with different advancing speeds, Theoretical Computer Science 290(1) (2003), 355-406.
12. M. Bravetti and A. Aldini, Expressing processes with different action durations through probabilities, in: Proc. of 1st Joint Int. Workshop on Process Algebra and Performance Modelling. Probabilistic Methods in Verification, Springer LNCS, Vol. 2165, 2001, pp. 168-183.
13. M. Bravetti and M. Bernardo, Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time, in: Proc. of 1st Workshop on Models for Time-Critical Systems, ENTCS 39(3) (2000).
14. M. Bravetti, M. Bernardo and R. Gorrieri, A note on the congruence proof for recursion in Markovian bisimulation equivalence, in: Proc. of 6th Int. Workshop on Process Algebras and Performance Modeling, C. Priami, ed., 1998, pp. 153-164.
15. F. van Breugel and J. Worrell, Towards quantitative verification of probabilistic systems (extended abstract), in: Proc. of 28th International Colloquium on Automata, Languages and Programming, Springer LNCS, Vol. 2076, 2001, pp. 421-432.
16. C. Cachin, K. Kursawe and V. Shoup, Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract), in: Proc. of 19th Symposium on Principles of Distributed Computing, ACM Press, 2000, pp. 123-132.
17. D. Clark, C. Hankin, S. Hunt and R. Nagarajan, Possibilistic information flow is safe for probabilistic non-interference, in: 1st Workshop on Issues in the Theory of Security, 2000.
18. J. Desharnais, V. Gupta, R. Jagadeesan and P. Panangaden, The metric analogue of weak bisimulation for probabilistic processes, in: Proc. of 17th Symposium on Logic in Computer Science, IEEE Computer Society Press, 2002.
19. A. Di Pierro, C. Hankin and H. Wiklicky, Probabilistic security analysis in a declarative framework, in: 1st Workshop on Issues in the Theory of Security, 2000.
20. A. Di Pierro, C. Hankin and H. Wiklicky, Approximate non-interference, in: Proc. of 15th Computer Security Foundations Workshop, IEEE CS Press, 2002, pp. 1-17.
21. A. Di Pierro, C. Hankin and H. Wiklicky, Analysing approximate confinement under uniform attacks, in: Proc. of 9th Symposium on Static Analysis, Springer LNCS, Vol. 2477, 2002, pp. 310-325.
22. A. Durante, R. Focardi and R. Gorrieri, A compiler for analysing cryptographic protocols using non-interference, ACM Transactions on Software Engineering and Methodology, special issue on Software Engineering & Security 9(4) (2000), 489-530.
23. N. Evans and S. Schneider, Analysing time dependent security properties in CSP using PVS, in: Proc. of Symposium on Research in Computer Security, Springer LNCS, Vol. 1895, 2000, pp. 222-237.
24. R. Focardi and R. Gorrieri, A classification of security properties, Journal of Computer Security 3(1) (1995), 5-33.
25. R. Focardi and R. Gorrieri, The compositional security checker: a tool for the verification of information flow security properties, IEEE Trans. Sof. Eng. 27 (1997), 550-571.
26. R. Focardi and R. Gorrieri, Classification of security properties (Part I: information flow), in: Foundations of Security Analysis and Design - Tutorial Lectures, R. Focardi and R. Gorrieri, eds, Springer LNCS, Vol. 2171, 2001, pp. 331-396.
27. R. Focardi, R. Gorrieri and F. Martinelli, Information flow analysis in a discrete-time process algebra, in: Proc. of 13th IEEE Computer Security Foundations Workshop, IEEE CS Press, 2000, pp. 170-184.
28. R. Focardi, R. Gorrieri and F. Martinelli, Non interference for the analysis of cryptographic protocols, in: Proc. of 27th International Colloquium on Automata, Languages and Programming, Springer LNCS, Vol. 1853, 2000, pp. 354-372.
29. S.N. Foley, A taxonomy for information flow policies and models, in: Proc. of the IEEE Symposium on Security and Privacy, 1991, pp. 98-108.
30. R. Forster, Non interference properties for nondeterministic processes, PhD Thesis, Oxford University, UK, 1999.
31. R.J. van Glabbeek, S.A. Smolka and B. Steffen, Reactive, generative and stratified models of probabilistic processes, Information and Computation 121 (1995), 59-80.
32. J.A. Goguen and J. Meseguer, Security policy and security models, in: Proc. of Symposium on Security and Privacy, IEEE CS Press, 1982, pp. 11-20.
33. J.W. Gray, III, Toward a mathematical foundation for information flow security, Journal of Computer Security 1 (1992), 255-294.
34. J.W. Gray, III and P.F. Syverson, A logical approach to multilevel security of probabilistic systems, in: Proc. of IEEE Computer Society Symposium on Research in Security and Privacy, 1992, pp. 164-176.
35. P.R. Halmos, Measure Theory, Springer, 1950.
36. C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, 1985.
37. J. Jacob, Security specifications, in: Proc. of IEEE Symposium on Security and Privacy, IEEE CS Press, 1988, pp. 14-23.
38. J. Jürjens, Secure information flow for concurrent processes, in: Proc. of 11th Int. Conf. on Concurrency Theory, Springer LNCS, Vol. 1877, 2000, pp. 395-409.
39. P. Lincoln, J.C. Mitchell, M. Mitchell and A. Scedrov, A probabilistic poly-time framework for protocol analysis, in: Proc. of 5th ACM Conf. on Computer and Communications Security, ACM Press, 1998, pp. 112-121.
40. G. Lowe, Quantifying information flow, in: Proc. of 15th Computer Security Foundations Workshop, IEEE CS Press, 2002, pp. 18-31.
41. H. Mantel, Possibilistic definitions of security - an assembly kit, in: Proc. of 13th IEEE Computer Security Foundations Workshop, IEEE CS Press, 2000, pp. 185-199.
42. O. Markowitch and Y. Roggeman, Probabilistic non-repudiation without trusted third party, in: 2nd Conf. on Security in Communication Networks, 1999.
43. J. McLean, Security models and information flow, in: Proc. of IEEE Symposium on Research in Security and Privacy, 1990, pp. 180-187.
44. J.K. Millen, Hookup security for synchronous machines, in: Proc. of 3rd Computer Security Foundations Workshop, IEEE CS Press, 1990, pp. 84-90.
45. R. Milner, Communication and Concurrency, Prentice Hall, 1989.
46. A.W. Roscoe, CSP and determinism in security modelling, in: Proc. of IEEE Symposium on Security and Privacy, IEEE CS Press, 1995, pp. 114-127.
47. A.W. Roscoe, G.M. Reed and R. Forster, The successes and failures of behavioural models, in: Millenial Perspectives in Computer Science, Davies, Roscoe and Woodcock, eds, Palgrave, 2000.
48. A.W. Roscoe, J.C.P. Woodcock and L. Wulf, Noninterference through determinism, in: Proc. of European Symposium Research Computer Security, Springer LNCS, Vol. 875, 1994, pp. 33-53.
49. P.Y.A. Ryan, A CSP Formulation of Non-interference, Cipher, IEEE CS Press, 1991, pp. 19-27.
50. P.Y.A. Ryan, J. McLean, J. Millen and V. Gligor, Non-interference: who needs it? in: Proc. of 14th Computer Security Foundations Workshop, IEEE CS Press, 2001, pp. 237-238.
51. P.Y.A. Ryan and S. Schneider, Process algebra and noninterference, in: Proc. of 12th Computer Security Foundations Workshop, IEEE CS Press, 1999, pp. 214-227.
52. A. Sabelfeld and D. Sands, A Per model of secure information flow in sequential programs, in: Proc. of 8th European Symposium on Programming, Springer LNCS, Vol. 1576, 1999, pp. 40-58.
53. A. Sabelfeld and D. Sands, Probabilistic noninterference for multi-threaded programs, in: Proc. of 13th Computer Security Foundations Workshop, IEEE CS Press, 2000, pp. 200-215.
54. D. Sangiorgi and R. Milner, The problem of weak bisimulation up to, in: Proc. of 3rd Int. Conf. on Concurrency Theory, Springer LNCS, Vol. 630, 1992, pp. 32-46.
55. S. Schneider, Concurrent and Real-Time Systems: the CSP Approach, J. Wiley & Sons, Inc., 1999.
56. G. Smith, A new type system for secure information flow, in: Proc. of 14th Computer Security Foundations Workshop, IEEE CS Press, 2001, pp. 115-125.
57. G. Smith, Weak probabilistic bisimulation for secure information flow, in: 2nd ACM SIGPLAN and IFIP WG 1.7 Workshop on Issues in the Theory of Security, 2002.
58. S.A. Smolka and B. Steffen, Priority as extremal probability, Formal Aspects of Computing 8(5) (1996), 585-606.
59. P. Syverson and J.W. Gray, III, The epistemic representation of information flow security in probabilistic systems, in: Proc. of 8th Computer Security Foundations Workshop, IEEE CS Press, 1995, pp. 152-166.
60. A.S. Tanenbaum, Computer Networks, Prentice Hall, 1996.
61. D. Volpano and G. Smith, Verifying secrets and relative secrecy, in: Proc. of ACM Symposium on Principles of Programming Languages, ACM Press, 2000, pp. 268-276.
62. J.T. Wittbold and D.M. Johnson, Information flow in nondeterministic systems, in: Proc. of 1990 Symposium on Research in Security and Privacy, IEEE CS Press, 1990, pp. 144-161.