CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Addressing Covert Termination and Timing Channels in Concurrent Information Flow Systems

Deian Stefan ; Alejandro Russo (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Pablo Buiras (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Amit Levy ; John C. Mitchell ; David Mazières
17th ACM SIGPLAN International Conference on Functional Programming, ICFP 2012. Copenhagen, 9 - 15 September 2012 (0362-1340). Vol. 47 (2012), 9, p. 201-213.
[Konferensbidrag, refereegranskat]

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. Intuitively, we leverage concurrency by placing such potentially sensitive actions in separate threads. While termination and timing of these threads may expose secret values, our system requires any thread observing these properties to raise its information-flow label accordingly, preventing leaks to lower-labeled contexts. We implement this approach in a Haskell library and demonstrate its applicability by building a web server that uses information-flow control to restrict untrusted web applications.

Nyckelord: Monad, Library, Timing channels



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2012-09-24. Senast ändrad 2016-11-02.
CPL Pubid: 163818

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)