Two Formal Approaches for Approximating Noninterference Properties

The formalisation of security properties for computer systems raises the problem of overcoming also in a formal setting the classical view according to which confidentiality is an absolute property stating the complete absence of any unauthorised disclosure of information. In this paper, we present two formal models in which the notion of noninterference, which is at the basis of a large variety of security properties defined in the recent literature, is approximated. To this aim, the definition of indistinguishability of process behaviour is replaced by a similarity notion, which introduces a quantitative measure e of the behavioural difference among processes. The first model relies on a programming paradigm called Probabilistic Concurrent Constraint Programming, while the second one is presented in the setting of a probabilistic process algebra. In both models, appropriate notions of distance provide information (the e) on the security level of the system at hand, in terms of the capability of an external observer of identifying illegal interferences.

[1]  Herbert Wiklicky,et al.  Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model , 1998, MFCS.

[2]  J. Meseguer,et al.  Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.

[3]  Salvatore Tucci,et al.  Performance Evaluation of Complex Systems: Techniques and Tools , 2002, Lecture Notes in Computer Science.

[4]  Jan A. Bergstra,et al.  Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..

[5]  James W. Gray,et al.  Toward a mathematical foundation for information flow security , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[6]  Geoffrey Smith,et al.  A new type system for secure information flow , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Paul F. Syverson,et al.  The epistemic representation of information flow security in probabilistic systems , 1995, Proceedings The Eighth IEEE Computer Security Foundations Workshop.

[9]  Roberto Gorrieri,et al.  A Classification of Security Properties , 1993 .

[10]  David Sands,et al.  Probabilistic noninterference for multi-threaded programs , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[11]  John C. Mitchell,et al.  A probabilistic poly-time framework for protocol analysis , 1998, CCS '98.

[12]  Peter G. Harrison,et al.  Stochastic Process Algebra for Discrete Event Simulation , 1995 .

[13]  John McLean,et al.  Security models and information flow , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[14]  Rob van Glabbeek,et al.  Handbook of Process Algebra , 2001 .

[15]  A. Tarski,et al.  Cylindric Algebras. Part II , 1988 .

[16]  Mario Bravetti,et al.  Compositional Asymmetric Cooperations for Process Algebras with Probabilities, Priorities, and Time , 2000, MTCS.

[17]  Andrew C. Myers,et al.  Language-based information-flow security , 2003, IEEE J. Sel. Areas Commun..

[18]  Herbert Wiklicky,et al.  An operational semantics for probabilistic concurrent constraint programming , 1998, Proceedings of the 1998 International Conference on Computer Languages (Cat. No.98CB36225).

[19]  John N. Tsitsiklis,et al.  Introduction to Probability , 2002 .

[20]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[21]  James W. Gray,et al.  Probabilistic interference , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[22]  Bernhard Steffen,et al.  Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[23]  Chris Hankin,et al.  Analysing Approximate Confinement under Uniform Attacks , 2002, SAS.

[24]  Herbert Wiklicky,et al.  Quantitative Observables and Averages in Probabilistic Constraint Programming , 1999, New Trends in Constraints.

[25]  Chris Hankin,et al.  Approximate non-interference , 2002, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15.

[26]  Radha Jagadeesan,et al.  Metrics for Labeled Markov Systems , 1999, CONCUR.

[27]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[28]  Mario Bravetti,et al.  A Process Algebraic Approach for the Analysis of Probabilistic Non-interference , 2011 .

[29]  Roberto Gorrieri,et al.  A Taxonomy of Security Properties for Process Algebras , 1995, J. Comput. Secur..

[30]  Radha Jagadeesan,et al.  The metric analogue of weak bisimulation for probabilistic processes , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[31]  Mario Bravetti,et al.  Discrete time generative-reactive probabilistic processes with different advancing speeds , 2003, Theor. Comput. Sci..

[32]  Chris Hankin,et al.  Probabilistic confinement in a declarative framework , 2001, APPIA-GULP-PRODE.

[33]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[34]  Paul F. Syverson,et al.  A logical approach to multilevel security of probabilistic systems , 1998, Distributed Computing.

[35]  Alessandro Aldini,et al.  On the Extension of Non-interference with Probabilities , 2002 .

[36]  Holger Hermanns,et al.  Process Algebra and Markov Chains , 2002, European Educational Forum: School on Formal Methods and Performance Analysis.

[37]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[38]  Mario Bravetti.  An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems , 2002, PAPM-PROBMIV.

[39]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[40]  Joost-Pieter Katoen,et al.  Lectures on Formal Methods and PerformanceAnalysis , 2001, Lecture Notes in Computer Science.

[41]  David Clark,et al.  Quantitative Analysis of the Leakage of Confidential Data , 2002, QAPL.

[42]  Christel Baier,et al.  Weak Bisimulation for Fully Probabilistic Processes , 1997, FBT.

[43]  Roberto Gorrieri,et al.  Security Analysis of a Probabilistic Non-repudiation Protocol , 2002, PAPM-PROBMIV.

[44]  Jonathan K. Millen,et al.  Non-interference, who needs it? , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[45]  James Worrell,et al.  Towards Quantitative Verification of Probabilistic Transition Systems , 2001, ICALP.

[46]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[47]  Holger Hermanns,et al.  Stochastic process algebras: integrating qualitative and quantitative modelling , 1994, FORTE.

[48]  J. Baeten.  Applications of process algebra , 1990 .

[49]  Roberto Gorrieri,et al.  Foundations of Security Analysis and Design - Tutorial Lectures , 2000 .

[50]  Roberto Gorrieri,et al.  A Formal Approach to the Integration of Performance Aspects in the Modeling and Analysis of Concurrent Systems , 1998, Inf. Comput..

[51]  Geoffrey Smith,et al.  Probabilistic noninterference through weak probabilistic bisimulation , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..

[52]  Frank S. de Boer,et al.  Nondeterminism and Infinite Computations in Constraint Programming , 1995, Theor. Comput. Sci..

[53]  Chris Hankin,et al.  Quantitative Relations and Approximate Process Equivalences , 2003, CONCUR.

[54]  Alessandro Aldini,et al.  Probabilistic Information Flow in a Process Algebra , 2001, CONCUR.

[55]  David Sands,et al.  A Per Model of Secure Information Flow in Sequential Programs , 1999, High. Order Symb. Comput..

[56]  Olivier Markowitch,et al.  Probabilistic Non-Repudiation without Trusted Third Party , 1999 .