ANOSY: Approximated Knowledge Synthesis with Refinement Types for Declassification
Abstract
Non-interference is a popular way to enforce confidentiality of sensitive data. However, declassification of sensitive information is often needed in realistic applications but breaks non-interference. We present ANOSY, an approximate knowledge synthesizer for quantitative declassification policies. ANOSY uses refinement types to automatically construct machine checked over- and under-approximations of attacker knowledge for boolean queries on multi-integer secrets. It also provides an AnosyT monad to track the attacker knowledge over multiple declassification queries and checks for violations against user-specified policies in information flow control applications. We implement a prototype of ANOSY and show that it is precise and permissive: up to 14 declassification queries are permitted before a policy violation occurs using the powerset of intervals domain.
Keywords
Cite
@article{arxiv.2203.12069,
title = {ANOSY: Approximated Knowledge Synthesis with Refinement Types for Declassification},
author = {Sankha Narayan Guria and Niki Vazou and Marco Guarnieri and James Parker},
journal= {arXiv preprint arXiv:2203.12069},
year = {2022}
}
Comments
16 pages, 6 figures, this is a preprint of a paper to appear in Programming Language Design and Implementation (PLDI) 2022