abstract

Flow-sensitive semantics for dynamic information flow policies (abstract only)

Authors:

Niklas Broberg,

David SandsAuthors Info & Claims

ACM SIGPLAN Notices, Volume 44, Issue 8

Page 6

https://doi.org/10.1145/1667209.1667219

Published: 04 December 2009 Publication History

Abstract

Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that handle dynamic information flow policies suffer from a common drawback. They build on semantic models of security which are inherently flow insensitive, which means that many simple intuitively secure programs will be considered insecure.

In this paper we address this problem in the context of a particular system, flow locks. We provide a new flow sensitive semantics for flow locks based on a knowledge-style definition (following Askarov and Sabelfeld), in which the knowledge gained by an actor observing a program run is constrained according to the flow locks which are open at the time each observation is made. We demonstrate the applicability of the definition in a soundness proof for a simple flow lock type system. We also show how other systems can be encoded using flow locks, as an easy means to provide these systems with flow sensitive semantics.

Flow-sensitive semantics for dynamic information flow policies (abstract only)
1. Security and privacy
  1. Systems security
2. Theory of computation
  1. Semantics and reasoning

Recommendations

Flow-sensitive semantics for dynamic information flow policies
PLAS '09: Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security

Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that handle dynamic information flow policies suffer from a common drawback. They ...
A Dynamic Combined Flow Algorithm for the Two-Commodity Max-Flow Problem Over Delay-Tolerant Networks
The multi-commodity flow problem plays an important role in network optimization, routing, and service scheduling. With the network partitioning and the intermittent connectivity, the commodity flows in delay tolerant networks (DTNs) are time-dependent, ...
Group flow, complex flow, unit vector flow, and the (2+∈)-flow conjecture

If F is a (possibly infinite) subset of an abelian group @C, then we define f(F,@C) as the smallest natural number such that every f(F,@C)-edge-connected (finite) graph G has a flow where all flow values are elements in F. We prove that f(F,@C) exists ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 44, Issue 8

August 2009

38 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/1667209

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 December 2009

Published in SIGPLAN Volume 44, Issue 8

Check for updates

Qualifiers

Abstract

Recommendations