A quantitative approach to noninterference for probabilistic systems

Electronic Notes in Theoretical Computer Science

Volumn 99, Issue , 2004, Pages 155-182

  Aldini, Alessandro ^a   Di Pierro, Alessandra ^b  

^a UNIVERSITY OF URBINO   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Probabilistic Noninterference; Process Algebra; Similarity Relation; Weak Bisimulation

Indexed keywords

ALGEBRA; APPROXIMATION THEORY; COMPUTER SIMULATION; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; PROBABILITY;

PROBABILISTIC NONINTERFERENCE; PROCESS ALGEBRA; SIMILARITY RELATION; WEAK BISIMULATION;

SECURITY OF DATA;

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

References (27)

1. A. Aldini, M. Bravetti, A. Di Pierro, R. Gorrieri, C. Hankin, and H. Wiklicky. Two Formal Approaches for Approximating Noninterference Properties. Foundations of Security Analysis and Design II - Tutorial Lectures, Springer LNCS 2946:1-43, 2004.
2. A. Aldini, M. Bravetti, and R. Gorrieri. A Process-algebraic Approach for the Analysis of Probabilistic Noninterference. Journal of Computer Security 12(2), 2004.
3. C. Baier and H. Hermanns. Weak Bisimulation for Fully Probabilistic Processes. In Proc. of 9th Int. Conf., on Computer Aided Verification (CAV'97), Springer LNCS 1254:119-130, 1997.
4. M. Bravetti and A. Aldini. Discrete Time Generative-reactive Probabilistic Processes with Different Advancing Speeds. Theoretical Computer Science 290(1):355-406, 2003.
5. 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 (MTCS'00), ENTCS 39(3), 2000.
6. 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 (ICALP'01) Springer LNCS 2076:421-432, 2001.
7. D. Clark, S. Hunt, and P. Malacaria. Quantitative Analysis of the Leakage of Confidential Data. In ENTCS 59(3), (A. Di Pierro and H. Wiklicky, Eds.), Elsevier Science Publishers, 2002.
8. T. Cover and J. Thomas. Elements of Information Theory. John Wiley, New York, 1991.
9. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximation of Labeled Markov Processes. In Proc. of 15th Symposium on Logic in Computer Science (LICS'00), pp. 95-106, IEEE CS Press, 2000.
10. 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 (LICS'02), pp. 413-422, IEEE CS Press, 2002.
11. A. Di Pierro, C. Hankin, and H. Wiklicky. Quantitative Relations and Approximate Process Equivalences. In Proc. of 14th Int. Conf. on Concurrency Theory (CONCUR'03), Springer LNCS 2761:508-522, 2003.
12. A. Di Pierro, C. Hankin, and H. Wiklicky. Measuring the Confinement of Concurrent Probabilistic Systems. In Proc. of WITS'03 - 2003 IFIP WG 1.7, ACM SIGPLAN and GI FoMSESS Workshop on Issues in the Theory of Security, 2003.
13. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate Noninterference. In Proc. of 15th Computer Security Foundations Workshop (CSFW'02), pp. 3-17, IEEE CS Press, 2002.
14. R. Focardi and R. Gorrieri. A Classification of Security Properties. Journal of Computer Security 3(l):5-33, 1995.
15. R. Focardi, R. Gorrieri, and F. Martinelli. Non Interference for the Analysis of Cryptographic Protocols. In Proc. of 27th Int. Colloquium on Automata, Languages and Programming (1CALP'00), Springer LNCS 1853:354-372, 2000.
16. R. J. van Glabbeek, S. A. Smolka, and B. Steffen. Reactive, Generative and Stratified Models of Probabilistic Processes. Information and Computation 121:59-80, 1995.
17. J.A. Goguen and J. Meseguer. Security Policy and Security Models. In Proc. of Symposium on Security and Privacy (SSP'82), pp. 11-20, IEEE CS Press, 1982.
18. J. W. Gray III. Probabilistic Interference. In Proc. of Symposium on Security and Privacy (SSP'90), pp. 170-179, IEEE CS Press, 1990.
19. C.-C. Jou and S. A. Smolka. Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes. In Proc. of 1st Int. Conf. on Concurrency Theory (CONCUR'90), Springer LNCS 458:367-383, 1990.
20. D. Kozen. Semantics of Probabilistic Programs. Journal of Computer and Systems Sciences 22(3):328-350, 1981.
21. P. Lincoln, J. C. Mitchell, M. Mitchell, and A. Scedrov. A Probabilistic Poly-Time Framework for Protocol Analysis. In Proc. of 5th Conf. on Computer and Communications Security, pp. 112-121, ACM Press, 1998.
22. G. Lowe. Quantifying Information Flow. In Proc. of 15th Computer Security Foundation Workshop (CSFW'02), pp. 18-31, IEEE CS Press, 2002.
23. R. Milner. Communication and Concurrency, Prentice Hall, 1989.
24. P.Y.A. Ryan, J. McLean, J. Millen, and V. Gligor. Non-interference: Who needs It? In Proc. of 14th Computer Security Foundations Workshop (CSFW'Ol), pp. 237-238, IEEE CS Press, 2001.
25. P.Y.A. Ryan, S. Schneider. Process Algebra and Non-interference. Journal of Computer Security 9:75-103, 2001.
26. J. Shao. Mathematical Statistics. Springer Texts in Statistics, Springer Verlag, New York -Berlin - Heidelberg, 1999.
27. G. Smith. Probabilistic Noninterference through Weak Probabilistic Bisimulation. In Proc. of 16th Computer Security Foundations Workshop (CSFW'03), pp. 3-13, IEEE CS Press, 2003.