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

Jiang Wu; Ruizhong Wei

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.

Metadata

Available format(s): PDF PS
Category: Cryptographic protocols
Publication info: Published elsewhere. Unknown where it was published
Keywords: hierarchical access control
Contact author(s): jwu1 @ lakeheadu ca
History: 2005-02-23: revised; 2004-11-12: received; See all versions
Short URL: https://ia.cr/2004/295
License: CC BY

BibTeX

@misc{cryptoeprint:2004/295,
      author = {Jiang Wu and Ruizhong Wei},
      title = {An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/295},
      year = {2004},
      url = {https://eprint.iacr.org/2004/295}
}