Compositional Security Definitions for Higher-Order Where Declassification
Jan Menz, Andrew K. Hirsch, Peixuan Li, Deepak Garg
Abstract
To ensure programs do not leak private data, we often want to be able to provide formal guarantees ensuring such data is handled correctly. Often, we cannot keep such data secret entirely; instead programmers specify how private data may bedeclassified. While security definitions for declassification exist, they mostly do not handle higher-order programs. In fact, in the higher-order setting no compositional security definition exists for intensional information-flow properties such aswheredeclassification, which allows declassification in specific parts of a program. We use logical relations to build a model (and thus security definition) of where declassification. The key insight required for our model is that we must stop enforcing indistinguishability once arelevant declassificationhas occurred. We show that the resulting security definition provides more security than the most related previous definition, which is for the lower-order setting.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get a086cb92-da8f-46d9-9597-2c294706ffb6Related papers
- Structural Information Flow: A Fresh Look at Types for Non-interferenceHemant Gouni, Frank Pfenning, Jonathan AldrichOOPSLA 2025 · 1 citation
- Assume but Verify: Deductive Verification of Leaked Information in Concurrent ApplicationsToby Murray, Mukesh Tiwari, Gidon Ernst, David A. NaumannCCS 2023
- Declassification Policy for Program Complexity AnalysisEmmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain PéchouxLICS 2024
- Reconciling Shannon and Scott with a Lattice of Computable InformationSebastian Hunt, David Sands, Sandro StuckiPOPL 2023 · 1 citation
- Nonmalleable Information Flow ControlEthan Cecchetti, Andrew C. Myers, Owen ArdenCCS 2017 · 49 citations
