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

  • Jiang Wu
  • Ruizhong Wei
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3897)


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.


Hasse Diagram Public Parameter Random Variable Uniform Direct Scheme Provable Security 
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.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Boneh, D.: The decision diffie-hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48–63. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Harn, L., Lin, H.-Y.: A cryptographic key generation scheme for multilevel data security. Comput. Secur. 9(6), 539–546 (1990)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Sandhu, R.S.: Cryptographic implementation of a tree hierarchy for access control. Inf. Process. Lett. 27(2), 95–98 (1988)CrossRefGoogle Scholar
  7. 7.
    Skiena, S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory With Mathematica. Perseus Books (1990)Google Scholar
  8. 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. 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. 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
  11. 11.
    Zhong, S.: A practical key management scheme for access control in a user hierarchy. Computers & Security 21(8), 750–759 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jiang Wu
    • 1
  • Ruizhong Wei
    • 2
  1. 1.School of Computer ScienceUniversity of WaterlooWaterlooCanada
  2. 2.Department of Computer ScienceLakehead UniversityThunder BayCanada

Personalised recommendations