Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / hierarchical access control

Date: received 9 Nov 2004, last revised 23 Feb 2005

Contact author: jwu1 at lakeheadu ca

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050223:143136 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]