Timed Abstract Non-interference

In this paper, we introduce a timed notion of abstract non-interference. This is obtained by considering semantics which observe time elapsed in computations. Timing channels can be modeled in this way either by letting the attacker to observe time as a public variable or reckon the time elapsed by observing the computational traces' length, corresponding to observe the program counter. In the first case abstract non-interference provides a model for abstracting the information about time, namely we can for example consider models of attackers that can observe only intervals of time, or other more abstract properties. In the second case abstract non-intdriwence provides a model for attackers able to observe properties of trace length, e.g., the public memory during the whole computation. We investigate when adding the observaiton qf time does not increase the attacker's power in disclosing confidential information about data. This models the absence of timing channels in language-based security.

[1]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[2]  Bowen Alpern,et al.  Safety Without Stuttering , 1986, Inf. Process. Lett..

[3]  Roberto Giacobazzi,et al.  Making abstract interpretations complete , 2000, JACM.

[4]  Geoffrey Smith,et al.  A Sound Type System for Secure Flow Analysis , 1996, J. Comput. Secur..

[5]  Roberto Giacobazzi,et al.  Generalized Abstract Non-interference: Abstract Secure Information-Flow Analysis for Automata , 2005, MMM-ACNS.

[6]  Butler W. Lampson,et al.  A note on the confinement problem , 1973, CACM.

[7]  Damiano Zanardini,et al.  Higher-Order Abstract Non-interference , 2005, TLCA.

[8]  Andrew C. Myers,et al.  Robust declassification , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[9]  David Sands,et al.  A Per Model of Secure Information Flow in Sequential Programs , 1999, ESOP.

[10]  Mirko Zanotti Security Typings by Abstract Interpretation , 2002, SAS.

[11]  R.,et al.  A CLASSIFICATION OF SECURITY PROPERTIES FOR PROCESS ALGEBRAS 1 , 1994 .

[12]  Peter J. Denning,et al.  Certification of programs for secure information flow , 1977, CACM.

[13]  Roberto Giacobazzi,et al.  Adjoining Declassification and Attack Models by Abstract Interpretation , 2005, ESOP.

[14]  Patrick Cousot,et al.  Constructive design of a hierarchy of semantics of a transition system by abstract interpretation , 2002, MFPS.

[15]  Scott F. Smith,et al.  Static enforcement of security with types , 2000, ICFP '00.

[16]  Geoffrey Smith,et al.  Probabilistic noninterference in a concurrent language , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).

[17]  Roberto Giacobazzi,et al.  Abstract non-interference: parameterizing non-interference by abstract interpretation , 2004, POPL.

[18]  Isabella Mastroeni,et al.  The PER Model of Abstract Non-interference , 2005, SAS.

[19]  D. E. Bell,et al.  Secure Computer Systems : Mathematical Foundations , 2022 .

[20]  Dennis M. Volpano Safety versus Secrecy , 1999, SAS.

[21]  Ellis S. Cohen Information transmission in computational systems , 1977, SOSP '77.

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

[23]  K. Rustan M. Leino,et al.  A semantic approach to secure information flow , 2000, Sci. Comput. Program..

[24]  Roberto Giacobazzi,et al.  Proving Abstract Non-interference , 2004, CSL.

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

[26]  Roberto Barbuti,et al.  A Notion of Non-Interference for Timed Automata , 2002, Fundam. Informaticae.

[27]  David A. Bell,et al.  Secure computer systems: mathematical foundations and model , 1973 .

[28]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[29]  Johan Agat,et al.  Transforming out timing leaks , 2000, POPL '00.

[30]  Peeter Laud Semantics and Program Analysis of Computationally Secure Information Flow , 2001, ESOP.

[31]  Chris Hankin,et al.  Information flow for Algol-like languages , 2002, Comput. Lang. Syst. Struct..