Paper 2004/295 Original: eprint.iacr.org/2004/295 ↗
An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security
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- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2005-02-23: last updated
- 2004-11-12: published
- Short URL
- https://ia.cr/2004/295
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}