MAC A verified static information-flow control library

Vassena, Marco; Russo, Alejandro; Buiras, Pablo; Waye, Lucas

doi:10.1016/j.jlamp.2017.12.003

Cited by 18 publications

(14 citation statements)

References 64 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As in MAC, the API contains a function plug that safely integrates sensitive computations into less sensitive ones. This avoids the need for nested computations and label creep, that is, the raising of the current label to a point where the computation can no longer perform useful tasks [33,46]. Finally, we also have functions run and lift that are only available to trusted code for unwrapping of the DIO ℓ monad and lifting of the IO monad into the DIO ℓ monad.…”

Section: The Depsec Librarymentioning

confidence: 99%

“…Notice that to implement this specific type signature, up-classification is necessary to assign the comment with type Labeled (A uid1 sid1) String to a field with type Labeled (PC uid sid1) String. This can be achieved soundly with the relabel primitive introduced by Vassena et al [46] as A uid1 sid1 ⊑ PC uid sid1. We include this primitive in Appendix C.…”

Section: Case Study: Conference Manager Systemmentioning

confidence: 99%

“…The library statically enforces information-flow control in the presence of advanced features like exceptions, concurrency, and mutable data structures by exploiting Haskell's type system to impose flow constraints. Vassena and Russo [45], Vassena et al [46] show progress-insensitive noninterference for MAC in a sequential setting and progress-sensitive noninterference in a concurrent setting, both using the two-steps erasure technique.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A Dependently Typed Library for Static Information-Flow Control in Idris

Gregersen

Thomsen

Askarov

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Safely integrating third-party code in applications while protecting the confidentiality of information is a long-standing problem. Pure functional programming languages, like Haskell, make it possible to enforce lightweight information-flow control through libraries like MAC by Russo. This work presents DepSec, a MAC inspired, dependently typed library for static information-flow control in Idris. We showcase how adding dependent types increases the expressiveness of state-of-the-art static information-flow control libraries and how DepSec matches a special-purpose dependent information-flow type system on a key example. Finally, we show novel and powerful means of specifying statically enforced declassification policies using dependent types.

show abstract

Section: The Depsec Librarymentioning

confidence: 99%

Section: Case Study: Conference Manager Systemmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Dependently Typed Library for Static Information-Flow Control in Idris

Gregersen

Thomsen

Askarov

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…To further illustrate this point, we can draw a parallel with the notion of an erasure function from the information-flow control literature [Russo et al 2008;Stefan et al 2011;Vassena et al 2018], whose role is to hide secrets from programs running under łunprivilegedž levels. In the meta-theory of secure-by-construction programming languages, one will typically show that secure programs commute with the erasure function: applying erasure before running the program yields the same result as applying it after running the program.…”

Section: Introductionmentioning

confidence: 99%

Simple noninterference from parametricity

Algehed

Bernardy

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

In this paper we revisit the connection between parametricity and noninterference. Our primary contribution is a proof of noninterference for a polyvariant variation of the Dependency Core Calculus of Abadi et al. in the Calculus of Constructions. The proof is modular: it leverages parametricity for the Calculus of Constructionsand the encoding of data abstraction using existential types.This perspective gives rise to simple and understandable proofs of noninterference from parametricity. All our contributions have been mechanised in the Agda proof assistant.

show abstract

“…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%

Foundations for Parallel Information Flow Control Runtime Systems

Vassena

Soeller

Amidon

et al. 2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We present the foundations for a new dynamic information flow control (IFC) parallel runtime system, LIOPAR. To our knowledge, LIOPAR is the first dynamic language-level IFC system to (1) support deterministic parallel thread execution and (2) eliminate both internaland external-timing covert channels that exploit the runtime system. Most existing IFC systems are vulnerable to external timing attacks because they are built atop vanilla runtime systems that do not account for security-these runtime systems allocate and reclaim shared resources (e.g., CPU-time and memory) fairly between threads at different security levels. While such attacks have largely been ignored-or, at best, mitigated-we demonstrate that extending IFC systems with parallelism leads to the internalization of these attacks. Our IFC runtime system design addresses these concerns by hierarchically managing resourcesboth CPU-time and memory-and making resource allocation and reclamation explicit at the language-level. We prove that LIOPAR is secure, i.e., it satisfies progress-and timing-sensitive non-interference, even when exposing clock and heap-statistics APIs.

show abstract

MAC A verified static information-flow control library

Cited by 18 publications

References 64 publications

A Dependently Typed Library for Static Information-Flow Control in Idris

A Dependently Typed Library for Static Information-Flow Control in Idris

Simple noninterference from parametricity

Foundations for Parallel Information Flow Control Runtime Systems

Contact Info

Product

Resources

About