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.
KeywordsHasse Diagram Public Parameter Random Variable Uniform Direct Scheme Provable Security
- 7.Skiena, S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory With Mathematica. Perseus Books (1990)Google Scholar
- 8.Steiner, M., Tsudik, G., Waidner, M.: Diffie-hellman key distribution extended to group communication. In: CCS 1996: Proceedings of the 3rd ACM conference on Computer and communications security, pp. 31–37. ACM Press, New York (1996)Google Scholar
- 9.Wu, J.: An access control scheme for partially ordered set hierarchy with provable security. Master’s thesis, Lakehead University, Thunder Bay, ON, Canada (2005)Google Scholar
- 10.Zheng, Y., Hardjono, T., Pieprzyk, J.: The sibling intractable function family (siff): notion, construction and applications. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E76-A(1), 4–13 (1993)Google Scholar