Paper 2004/295

An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security

Jiang Wu and Ruizhong Wei

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.