An access control scheme for partially ordered set hierarchy with provable security

Abstract

In a hierarchical structure, an entity has access to another if and only if the former is a superior of the later, The access control scheme for a hierarchy represented by a partially ordered set (poset) has been researched intensively in the past years. In this paper, we propose a new scheme that achieves the best performance of previous schemes and is provably secure under a comprehensive security model. © Springer-Verlag Berlin Heidelberg 2006.