Dynamic IFC Theorems for Free!
Paper in proceeding, 2021
We show that noninterference and transparency, the key soundness theorems for dynamic IFC libraries, can be obtained "for free", as direct consequences of the more general parametricity theorem of type abstraction. This allows us to give very short soundness proofs for dynamic IFC libraries such as faceted values and LIO. Our proofs stay short even when fully mechanized for Agda implementations of the libraries in terms of type abstraction.
Author
Maximilian Algehed
Chalmers, Computer Science and Engineering (Chalmers), Functional Programming
Jean-Philippe Bernardy
University of Gothenburg
Catalin Hritcu
Max Planck Institute for Security and Privacy
2021 IEEE 34TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2021)
1940-1434 (ISSN) 2374-8303 (eISSN)
65-78978-1-7281-7607-9 (ISBN)
IEEE 34th Computer Security Foundations Symposium (CSF)
, ,
, ,
Subject Categories
Algebra and Logic
Theoretical Chemistry
Mathematical Analysis
DOI
10.1109/CSF51468.2021.00005