Enforcing Information Flow Policies with Type-Targeted Program Synthesis
Lists
Only you see this
Abstract
We present a technique for static enforcement of high-level, declarative\ninformation flow policies. Given a program that manipulates sensitive data and\na set of declarative policies on the data, our technique automatically inserts\npolicy-enforcing code throughout the program to make it provably secure with\nrespect to the policies. We achieve this through a new approach we call\ntype-targeted program synthesis, which enables the application of traditional\nsynthesis techniques in the context of global policy enforcement. The key\ninsight is that, given an appropriate encoding of policy compliance in a type\nsystem, we can use type inference to decompose a global policy enforcement\nproblem into a series of small, local program synthesis problems that can be\nsolved independently.\n We implement this approach in Lifty, a core DSL for data-centric\napplications. Our experience using the DSL to implement three case studies\nshows that (1) Lifty's centralized, declarative policy definitions make it\neasier to write secure data-centric applications, and (2) the Lifty compiler is\nable to efficiently synthesize all necessary policy-enforcing code, including\nthe code required to prevent several reported real-world information leaks.
BibTeX
@inproceedings{polikarpova2016enforcing,
author = {Nadia Polikarpova and Jean Yang and Shachar Itzhaky and Travis Hance and Armando Solar-Lezama},
title = {{Enforcing Information Flow Policies with Type-Targeted Program Synthesis}},
booktitle = {eScholarship},
year = {2016},
}Loading related content...