A Semantic Hierarchy for Erasure Policies
Paper in proceeding, 2011

We consider the problem of logical data erasure, contrasting with physical erasure in the same way that end-to-end information flow control contrasts with access control. We present a semantic hierarchy for erasure policies, using a possibilistic knowledge-based semantics to define policy satisfaction such that there is an intuitively clear upper bound on what information an erasure policy permits to be retained. Our hierarchy allows a rich class of erasure policies to be expressed, taking account of the power of the attacker, how much information may be retained, and under what conditions it may be retained. While our main aim is to specify erasure policies, the semantic framework allows quite general information-flow policies to be formulated for a variety of semantic notions of secrecy.



information flow


Filippo Del Tedesco

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Sebastian Hunt

City University

David Sands

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 7093 352-369
978-364225559-5 (ISBN)

Areas of Advance

Information and Communication Technology

Subject Categories

Computer Science





More information

Latest update

9/6/2018 2