z-logo
open-access-imgOpen Access
Precise enforcement of progress-sensitive security
Author(s) -
Scott Moore,
Aslan Askarov,
Stephen Chong
Publication year - 2012
Publication title -
proceedings of the acm conference on computer and communications security
Language(s) - English
Resource type - Conference proceedings
SCImago Journal Rank - 1.023
H-Index - 176
ISSN - 1543-7221
DOI - 10.1145/2382196.2382289
Subject(s) - enforcement , information leakage , covert channel , computer security , computer science , information security , information flow , channel (broadcasting) , covert , leakage (economics) , state (computer science) , risk analysis (engineering) , security information and event management , computer network , cloud computing security , business , political science , programming language , cloud computing , linguistics , philosophy , law , economics , macroeconomics , operating system
Program progress (or termination) is a covert channel that may leak sensitive information. To control information leakage on this channel, semantic definitions of security should be progress sensitive and enforcement mechanisms should restrict the channel's capacity. However, most state-of-the-art language-based information-flow mechanisms are progress insensitive---allowing arbitrary information leakage through this channel---and current progress-sensitive enforcement techniques are overly restrictive. We propose a type system and instrumented semantics that together enforce progress-sensitive security more precisely than existing approaches. Our system is permissive in that it is able to accept programs in which the termination behavior depends only on low-security (e.g., public or trusted) information. Our system is parameterized on a termination oracle, and controls the progress channel precisely, modulo the ability of the oracle to determine the termination behavior of a program based on low-security information. We have instantiated the oracle for a simple imperative language with a logical abstract interpretation that uses an SMT solver to synthesize linear rank functions. In addition, we extend the system to permit controlled leakage through the progress channel, with the leakage bound by an explicit budget. We empirically analyze progress channels in existing Jif code. Our evaluation suggests that security-critical programs appear to satisfy progress-sensitive security.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom