Dynamic IFC Theorems for Free!
| Autor: | Catalin Hritcu, Jean-Philippe Bernardy, Maximilian Algehed |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
FOS: Computer and information sciences
Soundness Computer Science - Logic in Computer Science Computer Science - Programming Languages Computer Science - Cryptography and Security business.industry Computer science Programming language Agda Cryptography Type (model theory) Mathematical proof computer.software_genre Logic in Computer Science (cs.LO) Key (cryptography) Computer Science::Programming Languages Parametricity business Cryptography and Security (cs.CR) computer Programming Languages (cs.PL) Abstraction (linguistics) computer.programming_language |
| Zdroj: | CSF IEEE 34th Computer Security Foundations Symposium (CSF) 2021 IEEE 34th Computer Security Foundations Symposium (CSF) |
| Popis: | 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. Comment: CSF 2021 final version |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|