Dynamic IFC Theorems for Free!
Programming Languages
2024-02-26 v3 Cryptography and Security
Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.2005.04722,
title = {Dynamic IFC Theorems for Free!},
author = {Maximilian Algehed and Jean-Philippe Bernardy and Catalin Hritcu},
journal= {arXiv preprint arXiv:2005.04722},
year = {2024}
}
Comments
CSF 2021 final version