Two formal approaches for approximating noninterference properties

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

Volumn 2946, Issue , 2004, Pages 1-43

  Aldini, Alessandro ^a   Bravetti, Mario ^b   Di Pierro, Alessandra ^c   Gorrieri, Roberte ^b   Hankin, Chris ^d   Wiklicky, Herbert ^d  

^a UNIVERSITY OF URBINO   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c UNIVERSITY OF PISA   (Italy)

^d IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

EXTERNAL OBSERVER; INDISTINGUISHABILITY; NONINTERFERENCE PROPERTIES; PROBABILISTIC CONCURRENT CONSTRAINT PROGRAMMING; PROBABILISTIC PROCESS ALGEBRA; PROGRAMMING PARADIGMS; QUANTITATIVE MEASURES; SECURITY PROPERTIES;

NETWORK SECURITY;

EID: 21144453684     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24631-2_1     Document Type: Article

References (59)

1. A. Aldini. Probabilistic Information Flow in a Process Algebra. In Proc. of 12th Int. Conf. on Concurrency Theory (CONCUR'01), Springer LNCS 2154:152-168, 2001.
2. A. Aldini. On the Extension of Non-interference with Probabilities. In Proc. of WITS'02 - 2nd Workshop on Issues in the Theory of Security (J. Guttman, Ed.), Portland, OR (USA), 2002.
3. A. Aldini, M. Bravetti, and R. Gorrieri. A Process-algebraic Approach for the Analysis of Probabilistic Noninterference. Journal of Computer Security, to appear.
4. A. Aldini and R. Gorrieri. Security Analysis of a Probabilistic Nonrepudiation Protocol. In Proc. of 2nd Joint Int. Workshop on Process Algebra and Performance Modelling, Probabilistic Methods in Verification (PAPM-ProbMiV'02), Springer LNCS 2399:17-36, 2002.
5. J.C.M. Baeten and W.P. Weijland. "Process Algebra", Cambridge University Press, 1990.
6. J.C.M. Baeten, J.A. Bergstra, and S.A. Smolka. Axiomatizing Probabilistic Processes: ACP with Generative Probabilities. Information and Computation 121:234-255, 1995.
7. 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.
8. J.A. Bergstra, A. Ponse, and S.A. Smolka (Eds.) Handbook of Process Algebra, Elsevier Science Publishers B.V., Amsterdam, 2001.
9. M. Bernardo. Theory and Application of Extended Markovian Process Algebra. Ph.D. Thesis, University of Bologna, Italy, 1999. ftp://ftp.cs.unibo.it/pub/techreports/99-13.ps.gz
10. M. Bernardo, L. Donatiello, and R. Gorrieri. A Formal Approach to the Integration of Performance Aspects in the Modeling and Analysis of Concurrent Systems. Information and Computation 144(2):83-154, 1998.
11. P. Billingsley. Probability and Measure. Wiley & Sons, New York, 2nd edition, 1986.
12. ∼bravetti
13. M. Bravetti and A. Aldini. Discrete Time Generative-reactive Probabilistic Processes with Different Advancing Speeds. Theoretical Computer Science 290(1):355-406, 2003.
14. 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), State College (PA), ENTCS 39(3), 2000.
15. F. van Breugel, and J. Worrell. Towards Quantitative Verification of Probabilistic Systems (extended abstract). In Proc. of 28th Int. Colloquium on Automata, Languages and Programming (ICALP'01), Springer LNCS 2076:421-432, 2001.
16. E. Brinksma, H. Hermanns, and J.-P. Katoen (Eds.) Lectures on Formal Methods and Performance Analysis, Springer LNCS 2090, 2001.
17. 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, pp. 123-132, 2000.
18. M.C. Calzarossa and S. Tucci (Eds.) Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002 Tutorial Lectures, Springer LNCS 2459, 2002.
19. D. Clark, S. Hunt, and P. Malacaria. Quantitative Analysis of Leakage of Confidential Data. In QAPL 2001 - First International Workshop on Quantitative Aspects of Programming Laguages, volume 59 of Electronic Notes in Theoretical Computer Science, Elsevier, 2002.
20. F.S. de Boer, A. Di Pierro, and C. Palamidessi. Nondeterminism and Infinite Computations in Constraint Programming. Theoretical Computer Science, 151(1):37-78, 1995.
21. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for Labeled Markov Processes. In Proc. of 10th Int. Conf. on Concurrency Theory (CONCUR'99), Springer LNCS 1664:258-273, 1999.
22. 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), IEEE CS Press, pp. 413-422, 2002.
23. A. Di Pierro, C. Hankin, and H. Wiklicky. Probabilistic Confinement in a Declarative Framework. In Declarative Programming - Selected Papers from AGP 2000 - La Havana, Cuba, volume 48 of Electronic Notes in Theoretical Computer Science, Elsevier, 2001.
24. A. Di Pierro, C. Hankin, and H. Wiklicky. Analysing Approximate Confinement under Uniform Attacks. In Proc. of SAS 2002 - 9th Int. Symposium on Static Analysis, Springer LNCS 2477:310-326, 2002.
25. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate Non-interference. In Proc. of 15th IEEE Computer Security Foundations Workshop, pages 3-17, Cape Breton, Nova Scotia, Canada, 2002.
26. A. Di Pierro, C. Hankin, and H. Wiklicky. Measuring the Confinement of Concurrent Probabilistic Systems. In Proc. of WITS'03 - Workshop on Issues in the Theory of Security (R. Gorrieri, Ed.), Warsaw, Poland, 2003. http://www.dsi.unive.it/IFIPWG1_7/wits2003.html.
27. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate Non-interference. Journal of Computer Security, 2003. To appear.
28. 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), Lecture Notes in Computer Science, Springer Verlag, 2003. To appear.
29. A. Di Pierro and H. Wiklicky. An Operational Semantics for Probabilistic Concurrent Constraint Programming. In Proc. of ICCL'98 - Int. Conf. on Computer Languages, P. Iyer, Y. Choo, and D. Schmidt, Eds., pp. 174-183, IEEE Computer Society Press, 1998.
30. A. Di Pierro and H. Wiklicky. Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model. In Proc. of MFCS'98 - Mathematical Foundations of Computer Science, L. Brim, J. Gruska, and J. Zlatuska, Eds., Springer LNCS 1450:446-455, 1998.
31. A. Di Pierro and H. Wiklicky. Quantitative Observables and Averages in Probabilistic Concurrent Constraint Programming. In New Trends in Constraints Selected Papers of the 1999 ERCIM/Compulog Workshop on Constraints, K.R. Apt, T. Kakas, E. Monfroy, and F. Rossi, Eds., Springer LNCS 1865, 2000.
32. J.A. Goguen and J. Meseguer. Security Policy and Security Models. In Proc. of Symposium on Security and Privacy (SSP'82), IEEE CS Press, pp. 11-20, 1982.
33. R. Focardi and R. Gorrieri. A Classification of Security Properties. Journal of Computer Security 3(1):5-33, 1995.
34. R. Focardi and R. Gorrieri (Eds.) Foundations of Security Analysis and Design - Tutorial Lectures, Springer LNCS 2171, 2001.
35. 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.
36. J. W. Gray III. Probabilistic Interference. In Proc. of Symposium on Security and Privacy (SSP'90), IEEE CS Press, pp. 170-179, 1990.
37. J. W. Gray III. Toward a Mathematical Foundation for Information Flow Security. Journal of Computer Security 1:255-294, 1992.
38. J. W. Gray III and P. F. Syverson. A Logical Approach to Multilevel Security of Probabilistic Systems. In Proc. of Symposium on Security and Privacy (SSP'92), IEEE CS Press, pp. 164-176, 1992.
39. C.M. Grinstead and J.L. Snell. Introduction to Probability. American Mathematical Society, Providence, Rhode Island, second revised edition, 1997.
40. P. Harrison and B. Strulo. Stochastic Process Algebra for Discrete Event Simulation. In Quantitative Methods in Parallel Systems, ESPRIT Basic Research Series, pp. 18-37, Springer, 1995.
41. L. Henkin, J.D. Monk, and A. Tarski. Cylindric Algebras (Part I). North-Holland, 1971.
42. H. Hermanns, U. Herzog, J. Hillston, V. Mertsiotakis, and M. Rettelbach. Stochastic Process Algebras: Integrating Qualitative and Quantitative Modelling. In 7th Conf. on Formal Description Techniques (FORTE'94), pp. 449-451, 1994.
43. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
44. C. A. R. Hoare. Communicating Sequential Processes, Prentice Hall, 1985.
45. P.C. Kocher. Cryptanalysis of Diffie-Hellman, RSA, DSS, and Other Cryptosystems Using Timing Attacks. In Advances in Cryptology, CRYPTO'95: 15th Annual Int. Cryptology Conf., D. Coppersmith, Ed., Springer LNCS 963:171-183, 1995.
46. P.D. Lincoln, J.C. Mitchell, M. Mitchell, and A. Scedrov. A Probabilistic Poly-time Framework for Protocol Analysis. In ACM Conf. on Computer and Communications Security, pp. 112-121, ACM Press, 1998.
47. O. Markowitch and Y. Roggeman. Probabilistic Non-Repudiation Without Trusted Third Party. In 2nd Conf. on Security in Communication Networks, Amalfi, Italy, 1999.
48. J. McLean. Security Models and Information Flow. In Proc. of Symposium on Security and Privacy (SSP'90), IEEE CS Press, pp. 180-189, 1990.
49. R. Milner. Communication and Concurrency, Prentice Hall, 1989.
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 (CSFW'01), IEEE CS Press, pp. 237-238, 2001.
51. A. Sabelfeld and D. Sands. A Per Model of Secure Information Flow in Sequential Programs. In Proc. of European Symp. on Programming (ESOP'99), Springer LNCS 1576:40-58, 1999.
52. A. Sabelfeld and D. Sands. Probabilistic Noninterference for Multithreaded Programs. In Proc. of 13th Computer Security Foundations Workshop (CSFW'00), IEEE CS Press, pp. 200-215, 2000.
53. A. Sabelfeld and A.C. Myers. Language-Based Information Flow Security. IEEE Journal on Selected Areas in Communications 21(1):5-19, 2003.
54. V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Symposium on Principles of Programming Languages (POPL), pp. 232-245, ACM Press, 1990.
55. V.A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of concurrent constraint programming. In Symposium on Principles of Programming Languages (POPL), pp. 333-353, ACM Press, 1991.
56. J. Shao. Mathematical Statistics. Springer Texts in Statistics. Springer Verlag, 1999.
57. G. Smith. A new Type System for Secure Information Flow. In Proc. of 14th Computer Security Foundations Workshop (CSFW'01), IEEE CS Press, pp. 115-125, 2001.
58. C. Smith. Probabilistic Noninterference through Weak Probabilistic Bisimulation. In Proc. of 16th Computer Security Foundations Workshop (CSFW'03), IEEE CS Press, pp. 3-13, 2003.
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 (CSFW'95), IEEE CS Press, pp. 152-166, 1995.