Simple Noninterference by Normalization
Paper in proceeding, 2019
In particular, we prove noninterference for a static IFC calculus, based on Haskell's seclib library, using normalization. Our proof follows by straightforward induction on the structure of normal forms. We implement normalization using normalization by evaluation and prove that the generated normal forms preserve semantics. Our results have been verified in the Agda proof assistant.
normalization by evaluation
information-flow control
noninterference
Author
Carlos Tomé Cortiñas
Chalmers, Computer Science and Engineering (Chalmers), Information Security
Nachiappan Valliappan
Chalmers, Computer Science and Engineering (Chalmers), Information Security
Proceedings of the ACM Conference on Computer and Communications Security
15437221 (ISSN)
61-72978-1-4503-6836-0 (ISBN)
London, United Kingdom,
WebSec: Securing Web-driven Systems
Swedish Foundation for Strategic Research (SSF) (RIT17-0011), 2018-03-01 -- 2023-02-28.
Octopi: Säker Programering för Sakernas Internet
Swedish Foundation for Strategic Research (SSF) (RIT17-0023), 2018-03-01 -- 2023-02-28.
Subject Categories (SSIF 2011)
Other Computer and Information Science
Language Technology (Computational Linguistics)
Computer Science
Areas of Advance
Information and Communication Technology
Subject Categories (SSIF 2025)
Security, Privacy and Cryptography
DOI
10.1145/3338504.3357342