Timed abstract non-interference

被引:0
|
作者
Giacobazzi, R [1 ]
Mastroeni, I
机构
[1] Univ Verona, Dipartimento Informat, I-37100 Verona, Italy
[2] Kansas State Univ, Dept Comp & Informat Sci, Manhattan, KS 66506 USA
关键词
abstract interpretation; security; non-interference; timing channels;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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-interference 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 observation of 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.
引用
收藏
页码:289 / 303
页数:15
相关论文
共 50 条
  • [1] Abstract non-interference - Parameterizing non-interference by abstract interpretation
    Giacobazzi, R
    Mastroeni, I
    ACM SIGPLAN NOTICES, 2004, 39 (01) : 186 - 197
  • [2] Proving abstract non-interference
    Giacobazzi, R
    Mastroeni, I
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2004, 3210 : 280 - 294
  • [3] A decidable notion of timed non-interference
    Barbuti, R
    Tesei, L
    FUNDAMENTA INFORMATICAE, 2003, 54 (2-3) : 137 - 150
  • [4] A notion of non-interference for timed automata
    Barbuti, R
    De Francesco, N
    Santone, A
    Tesei, L
    FUNDAMENTA INFORMATICAE, 2002, 51 (1-2) : 1 - 11
  • [5] Parametric non-interference in timed automata
    Andre, Etienne
    Kryukov, Aleksander
    2020 25TH INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS (ICECCS 2020), 2020, : 37 - 42
  • [6] The PER model of abstract non-interference
    Hunt, S
    Mastroeni, I
    STATIC ANALYSIS, PROCEEDINGS, 2005, 3672 : 171 - 185
  • [7] A Proof System for Abstract Non-interference
    Giacobazzi, Roberto
    Mastroeni, Isabella
    JOURNAL OF LOGIC AND COMPUTATION, 2010, 20 (02) : 449 - 479
  • [8] Higher-order abstract non-interference
    Zanardini, D
    TYPED LAMBDA CALCULI AND APPLICATIONS, PROCEEDINGS, 2005, 3461 : 417 - 432
  • [9] Non-Interference Control Synthesis for Security Timed Automata
    Gardey, Guillaume
    Mullins, John
    Roux, Olivier H.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 180 (01) : 35 - 53
  • [10] Abstract Certification of Global Non-interference in Rewriting Logic
    Alba-Castro, Mauricio
    Alpuente, Maria
    Escobar, Santiago
    FORMAL METHODS FOR COMPONENTS AND OBJECTS, 2010, 6286 : 105 - 124