ANOSY: Approximated Knowledge Synthesis with Refinement Types for Declassification

March 22, 2022 ยท Declared Dead ยท ๐Ÿ› ACM-SIGPLAN Symposium on Programming Language Design and Implementation

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sankha Narayan Guria, Niki Vazou, Marco Guarnieri, James Parker arXiv ID 2203.12069 Category cs.PL: Programming Languages Cross-listed cs.CR Citations 1 Venue ACM-SIGPLAN Symposium on Programming Language Design and Implementation Last Checked 3 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Programming Languages

Died the same way โ€” ๐Ÿ‘ป Ghosted