Advertisement

Conflict Detection in Role-Based Access Control Using Multiple-Attractor Cellular Automata

  • Jun-Cheol Jeon
  • Kee-Young Yoo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4113)

Abstract

Cellular automata (CA) have been accepted as a good evolutionary computational model for the simulation of complex physical systems. Meanwhile delegation of role is necessary for scalability of general computing environments. However, this practical principle can lead to conflicts at compile time and run time. Thus, we propose a policy for Separation of Duty (SoD) in Role-based Access Control (RBAC), and demonstrate how conflicts between specified SoD constraints and delegation activities can be detected based on evolutionary computation using Multiple-Attractor CA (MACA).

Keywords

Cellular Automaton Cellular Automaton Mutual Exclusion Conflict Detection User Node 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Daemen, J., Govaerts, R., Vandewalle, J.: A Framework for The Design of One-way Hash Functions including Cryptanalysis of Damgaard’s One Way Function based on Cellular Automation. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 82–96. Springer, Heidelberg (1993)Google Scholar
  2. 2.
    Kanter, I., Kinzel, W., Kanter, E.: Secure Exchange of Information by Synchronization of Neural Networks. Europhyses Letters 57, 141–147 (2002)CrossRefGoogle Scholar
  3. 3.
    Hei, S., Zhang, S.: An Evolutionary Approach to the Design of Controllable Cellular Automata Structure for Random Number Generation. IEEE Transactions on Evolutionary Computation 7, 23–36 (2003)CrossRefGoogle Scholar
  4. 4.
    Neumann, J.V. (ed.): The Theory of Self-reproducing Automata. University of Illinois Press, Urbana (1966)Google Scholar
  5. 5.
    Jeon, J.C., Yoo, K.Y.: Design of Montgomery Multiplication Architecture based on Programmable Cellular Automata. Computational intelligence 20, 495–502 (2004)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Seredynski, M., Pienkosz, K., Bouvry, P.: Reversible Cellular Automata Based Encryption. In: Jin, H., Gao, G.R., Xu, Z., Chen, H. (eds.) NPC 2004. LNCS, vol. 3222, pp. 411–418. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Das, S., Sikdar, B.K., Chaudhuri, P.P.: Charaterization of Reachable/Nonreachable Cellular Automata States. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 813–822. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Ruan, C., Varadharajan, V.: A Formal Graph Based Framework for Supporting Authorization Delegations and Conflict Resolutions. Int. J. Inf. Security 10, 211–222 (2003)CrossRefGoogle Scholar
  9. 9.
    Chen, F., Sandhu, R.: Constraints for RBAC. In: 1st ACM Workshop on Role-Based Access Control, Gaithersburg, MD, pp. 39–46 (1995)Google Scholar
  10. 10.
    Ahn, G. (ed.): RCL 2000, Ph.d dissertation, George Mason University (2000)Google Scholar
  11. 11.
    Lafe, O.: Cellular Automata Transforms: Theory and Applications in Multimedia Compression, Encryption, and Modeling. Kluwer Academic Publishers, Dordrecht (2000)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jun-Cheol Jeon
    • 1
  • Kee-Young Yoo
    • 1
  1. 1.Department of Computer EngineeringKyungpook National UniversityDaeguKorea

Personalised recommendations