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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Trans. Comput. Syst. 1(3), 239–248 (1983)
Boneh, D.: The decision diffie-hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48–63. Springer, Heidelberg (1998)
Bresson, E., Chevassut, O., Pointcheval, D.: The group diffiehellman problems. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 325–338. Springer, Heidelberg (2003)
Harn, L., Lin, H.-Y.: A cryptographic key generation scheme for multilevel data security. Comput. Secur. 9(6), 539–546 (1990)
MacKinnon, S.J., Taylor, P.D., Meijer, H., Akl, S.G.: An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Trans. Comput. 34(9), 797–802 (1985)
Sandhu, R.S.: Cryptographic implementation of a tree hierarchy for access control. Inf. Process. Lett. 27(2), 95–98 (1988)
Skiena, S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory With Mathematica. Perseus Books (1990)
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)
Wu, J.: An access control scheme for partially ordered set hierarchy with provable security. Master’s thesis, Lakehead University, Thunder Bay, ON, Canada (2005)
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)
Zhong, S.: A practical key management scheme for access control in a user hierarchy. Computers & Security 21(8), 750–759 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, J., Wei, R. (2006). An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security. In: Preneel, B., Tavares, S. (eds) Selected Areas in Cryptography. SAC 2005. Lecture Notes in Computer Science, vol 3897. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11693383_15
Download citation
DOI: https://doi.org/10.1007/11693383_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33108-7
Online ISBN: 978-3-540-33109-4
eBook Packages: Computer ScienceComputer Science (R0)