CryptoDB
An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2004-12261, title={An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / hierarchical access control}, url={http://eprint.iacr.org/2004/295}, note={ jwu1@lakeheadu.ca 12837 received 9 Nov 2004, last revised 23 Feb 2005}, author={Jiang Wu and Ruizhong Wei}, year=2004 }