A Graded Modal Approach to Relaxed Semantic Declassification
In this paper we present Declassification Core Calculus (DeCC), a graded modal type theory for relaxed semantic declassification, a declassification criterion inspired from Delimited Release and Relaxed Noninterference. We build upon Dependency Core Calculus (DCC) that already has a graded monad for classification of information. DeCC inherits DCC's graded monad, but adds a new modality for the purpose of declassification. We build a logical relation model describing both the unary and relational semantics of the types including the two graded modalities, and use this model to prove the soundness of DeCC. We describe how our new modality interacts with DCC's graded monad via distributive laws, and also describe the conditions under which our new modality forms a comonad. This work has been mechanised in the HOL4 theorem prover.
Authors
- Vineet Rajani (ORCID: https://orcid.org/0000-0001-7701-8311)
- Hrutvik Kanabar (ORCID: https://orcid.org/0000-0003-3116-0392)
- A. D. Coleman
Institutions
- Kent State University (US)
- University of Kent (GB)
Publication Details
- Published
- 2025-06-16
- DOI
- https://doi.org/10.1109/csf64896.2025.00032
- Primary Topic
- Security and Verification in Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.00