Sciweavers

Share
SACRYPT
2005
Springer

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

10 years 9 months ago
An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security
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.
Jiang Wu, Ruizhong Wei
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where SACRYPT
Authors Jiang Wu, Ruizhong Wei
Comments (0)
books