2012
DOI: 10.1145/2398856.2364557
|View full text |Cite
|
Sign up to set email alerts
|

Addressing covert termination and timing channels in concurrent information flow systems

Abstract: When termination of a program is observable by an adversary, confidential information may be leaked by terminating accordingly. While this termination covert channel has limited bandwidth for sequential programs, it is a more dangerous source of information leakage in concurrent settings. We address concurrent termination and timing channels by presenting a dynamic information-flow control system that mitigates and eliminates these channels while allowing termination and timing to depend on secret values. Intu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
59
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 23 publications
(59 citation statements)
references
References 63 publications
0
59
0
Order By: Relevance
“…Once we have the possibility of allocating memory on the heap, we can use the same instantiation language MS to implement a thread scheduler. Concurrency has received a lot of attention in the literature on language-based security [15], [28], [29], [31], [32], [40], especially in the context of timing-channels. Several authors [15], [28], [32] propose special-purpose thread schedulers designed to close such timingchannels, and in this section we present an implementation of a secure cooperative thread scheduling algorithm.…”
Section: B Secure Thread Schedulingmentioning
confidence: 99%
See 2 more Smart Citations
“…Once we have the possibility of allocating memory on the heap, we can use the same instantiation language MS to implement a thread scheduler. Concurrency has received a lot of attention in the literature on language-based security [15], [28], [29], [31], [32], [40], especially in the context of timing-channels. Several authors [15], [28], [32] propose special-purpose thread schedulers designed to close such timingchannels, and in this section we present an implementation of a secure cooperative thread scheduling algorithm.…”
Section: B Secure Thread Schedulingmentioning
confidence: 99%
“…Concurrency has received a lot of attention in the literature on language-based security [15], [28], [29], [31], [32], [40], especially in the context of timing-channels. Several authors [15], [28], [32] propose special-purpose thread schedulers designed to close such timingchannels, and in this section we present an implementation of a secure cooperative thread scheduling algorithm. For the purpose of this case study, each function written by the user is assumed to have been rewritten into continuation passing style (CPS), as is standard for many compilers for functional programming languages [3], [14], and defunctionalized into a form that contains no higher-order functions, i.e., closure is an identifier followed by a heterogeneous array of local variables.…”
Section: B Secure Thread Schedulingmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, even exposing language features as simple as -statements can expose users to timing attacks [42,64]. Researchers have made significant strides towards addressing these challenges-many IFC systems now support real-world features and abstractions safely [10,15,20,34,43,50,51,54,55,59,60,62,67,68]. To the best of our knowledge, though, no existing language-level dynamic IFC supports parallelism.…”
Section: Introductionmentioning
confidence: 99%
“…For example, modern Web applications typically handle user requests in parallel, on multiple CPU cores, taking advantage of modern hardware. Web applications built atop state-of-the-art dynamic IFC Web frameworks (e.g., Jacqueline [67], Hails [12,13], and LMonad [45]), unfortunately, do not handle user requests in parallel-the language-level IFC systems that underlie them (e.g., Jeeves [68] and LIO [54]) do not support parallel thread execution.…”
Section: Introductionmentioning
confidence: 99%