CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A Semantic Hierarchy for Erasure Policies

Filippo Del Tedesco (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Sebastian Hunt ; David Sands (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
Lecture Notes in Computer Science, Seventh International Conference on Information Systems Security, December 2011, Kolkata (India) (03029743). Vol. 7093 (2011), p. 352-369 .
[Konferensbidrag, refereegranskat]

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.

Nyckelord: erasure, information flow, security

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2011-09-22. Senast ändrad 2017-09-14.
CPL Pubid: 146518


Läs direkt!

Länk till annan sajt (kan kräva inloggning)