From Fine- to Coarse-Grained Dynamic Information Flow Control and Back
Artikel i vetenskaplig tidskrift, 2019

We show that fine-grained and coarse-grained dynamic information-flow control (IFC) systems are equally expressive. To this end, we mechanize two mostly standard languages, one with a fine-grained dynamic IFC system and the other with a coarse-grained dynamic IFC system, and prove a semantics-preserving translation from each language to the other. In addition, we derive the standard security property of non-interference of each language from that of the other, via our verified translation. This result addresses a longstanding open problem in IFC: whether coarse-grained dynamic IFC techniques are less expressive than fine-grained dynamic IFC techniques (they are not!). The translations also stand to have important implications on the usability of IFC approaches. The coarse- to fine-grained direction can be used to remove the label annotation burden that fine-grained systems impose on developers, while the fine- to coarse-grained translation shows that coarse-grained systemsÐwhich are easier to design and implementÐcan track information as precisely as fine-grained systems and provides an algorithm for automatically retrofitting legacy applications to run on existing coarse-grained systems.

Information-flow control

Agda

verified source-to-source transformations

Författare

Marco Vassena

Chalmers, Data- och informationsteknik, Informationssäkerhet

Alejandro Russo

Chalmers, Data- och informationsteknik, Informationssäkerhet

Deepak Garg

Max-Planck-Gesellschaft

Vineet Rajani

Max-Planck-Gesellschaft

Deian Stefan

University of California at San Diego (UCSD)

Proceedings of the ACM on Programming Languages

24751421 (eISSN)

Vol. 3 1-31 76

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1145/3290389

Mer information

Senast uppdaterat

2024-01-03