Probabilistic information flowin a process algebra

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

Volumn 2154, Issue , 2001, Pages 152-168

  Aldini, Alessandro ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; NETWORK SECURITY;

ALGEBRAIC APPROACHES; INFORMATION FLOW ANALYSIS; NONDETERMINISTIC BEHAVIOR; PERFORMANCE MEASURE; PROBABILISTIC BISIMULATIONS; PROBABILISTIC INFORMATION; PROBABILISTIC SYSTEMS; SECURITY PROPERTIES;

CALCULATIONS;

EID: 84944050367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_11     Document Type: Conference Paper

References (33)

1. A. Aldini, “Probabilistic Information Flow in a Process Algebra”, Tech. Rep. UBLCS-2001-06, University of Bologna, Italy, 2001
2. A. Aldini, M. Bernardo, R. Gorrieri, M. Roccetti, “Comparing the QoS of Internet Audio Mechanisms via Formal Methods”, ACM Transactions on Modelling and Computer Simulation, ACM Press, Vol. 11, N. 1, 2001
3. A. Aldini, M. Bravetti, “An Asynchronous Calculus for Generative-Reactive Probabilistic Systems”, in Proc. of 8th Int. Workshop on Process Algebra and Performance Modeling, pp. 119-138, 2000
4. J.C.M. Baeten, J.A. Bergstra, S.A. Smolka, “Axiomatizing Probabilistic Processes: ACP with Generative Probabilities”, in Information and Comp. 121:234-255, 1995
5. C. Baier and H. Hermanns, “Weak Bisimulation for Fully Probabilistic Processes”, in Proc. of CAV’97, Springer LNCS 1254, pp. 119-130, 1997
6. M. Bravetti, A. Aldini, “Discrete Time Generative-reactive Probabilistic Processes with Different Advancing Speeds”, Tech. Rep. UBLCS-2000-03, University of Bologna, Italy, to appear in Theoretical Computer Science, 2001
7. F. van Breugel, J. Worrell, “Towards Quantitative Verification of Probabilistic Systems (extended abstract)”, to appear in Proc. of 28th International Colloquium on Automata, Languages and Programming, Springer LNCS, 2001
8. D. Clark, C. Hankin, S. Hunt, R. Nagarajan, “Possibilistic Information Flow is safe for Probabilistic Non-Interference”, in Work. on Issues in the Theory of Security, 2000
9. A. Di Pierro, C. Hankin, H. Wiklicky, “Probabilistic Security Analysis in a Declarative Framework”, in Work. on Issues in the Theory of Security, 2000
10. A. Durante, R. Focardi, R. Gorrieri, “A Compiler for Analysing Cryptographic Protocols Using Non-Interference”, in ACM TOSEM, special issue on Software Engineering & Security, Volume 9(4), pages 489-530, 2000
11. N. Evans, S. Schneider, “Analysing Time Dependent Security Properties in CSP Using PVS”, in Proc. Symposium on Research in Computer Security, pp. 222-237, Springer LNCS 1895, 2000
12. R. Focardi, R. Gorrieri, “A Classification of Security Properties”, Journal of Computer Security, 3(1):5-33, 1995
13. R. Focardi, R. Gorrieri, “The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties”, IEEE Trans. Sof. Eng., 27:550-571, 1997
14. R. Focardi, R. Gorrieri, F. Martinelli, “Information Flow Analysis in a Discrete- Time Process Algebra”, in Proc. of 13th IEEE Computer Security Foundations Work., pp. 170-184, 2000
15. R. Focardi, R. Gorrieri, F. Martinelli, “Non Interference for the Analysis of Cryptographic Protocols”, in Proc. of 27th International Colloquium on Automata, Languages and Programming, Springer LNCS 1853, pp. 354-372, 2000
16. R.J. van Glabbeek, S.A. Smolka, B. Steffen, “Reactive, Generative andStr atified Models of Probabilistic Processes”, in Information and Comp. 121:59-80, 1995
17. J.A. Goguen, J. Meseguer, “Security Policy andSe curity Models”, in Proc. IEEE Symposium on Security and Privacy, pp. 11-20, IEEE CS Press, 1982
18. J.W. Gray, “Towarda Mathematical Foundation for Information Flow Security”, Journal of Computer Security, 1:255-294, 1992
19. J.W. Gray, P.F. Syverson, “A Logical Approach to Multilevel Security of Probabilistic Systems”, in Proc. IEEE Computer Society Symposium on Research in Security and Privacy, pp. 164-176, 1992
20. P.R. Halmos, “Measure Theory”, Springer-Verlag, 1950
21. R.A. Howard, “Dynamic Probabilistic Systems”, John Wiley & Sons, 1971
22. J. Jürjens, “Secure information flow for concurrent processes”, in Proc. of Int. Conf. on Concurrency Theory, Springer LNCS 1877, pp. 395-409, 2000
23. J. McLean, “Security Models and Information Flow”, in Proc. of IEEE Symp. on Research in Security and Privacy, pp. 180-187, 1990
24. J.K. Millen, “Hookup Security for Synchronous Machines”, in Proc. of 3rd IEEE Computer Security Foundations Work., pp. 84-90, 1990
25. R. Milner, “Communication andConcurr ency”, Prentice Hall, 1989
26. A.W. Roscoe, “CSP andDeterminism in Security Modelling”, in Proc. of IEEE Symposium on Security and Privacy, pp. 114-127, 1995
27. A.W. Roscoe, G.M. Reed, R. Forster, “The successes andfailur es of behavioural models”, in Millenial Perspectives in Computer Science, 2000
28. A. W. Roscoe, J.C.P. Woodcock, L. Wulf, “Noninterference through Determinism”, in Proc. European Symposium on Research in Computer Security, pp. 33-53, Springer LNCS 875, 1994
29. P.Y.A. Ryan, S. Schneider, “Process Algebra andNoninterfer ence”, in Proc. of 12th IEEE Computer Security Foundations Work., pp. 214-227, 1999
30. A. Sabelfeld, D. Sands, “A Per Model of Secure Information Flow in Sequential Programs”, in Proc. of 8th European Symposium on Programming, Springer LNCS 1576, pg. 40-58, 1999
31. A. Sabelfeld, D. Sands, “Probabilistic Noninterference for Multi-threaded Programs”, in Proc. of 13th IEEE Computer Security Foundations Work., 2000
32. S. Schneider, “Concurrent andR eal-Time Systems: the CSP Approach”, J. Wiley & Sons, Inc., 1999
33. J.T. Wittbold, D.M. Johnson, “Information Flow in Nondeterministic Systems”, in Proc. of IEEE Symp. on Research in Security and Privacy, pp. 144-161, 1990