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).
This work was supported by the Brain Korea 21 Project in 2006.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Kanter, I., Kinzel, W., Kanter, E.: Secure Exchange of Information by Synchronization of Neural Networks. Europhyses Letters 57, 141–147 (2002)
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)
Neumann, J.V. (ed.): The Theory of Self-reproducing Automata. University of Illinois Press, Urbana (1966)
Jeon, J.C., Yoo, K.Y.: Design of Montgomery Multiplication Architecture based on Programmable Cellular Automata. Computational intelligence 20, 495–502 (2004)
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)
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)
Ruan, C., Varadharajan, V.: A Formal Graph Based Framework for Supporting Authorization Delegations and Conflict Resolutions. Int. J. Inf. Security 10, 211–222 (2003)
Chen, F., Sandhu, R.: Constraints for RBAC. In: 1st ACM Workshop on Role-Based Access Control, Gaithersburg, MD, pp. 39–46 (1995)
Ahn, G. (ed.): RCL 2000, Ph.d dissertation, George Mason University (2000)
Lafe, O.: Cellular Automata Transforms: Theory and Applications in Multimedia Compression, Encryption, and Modeling. Kluwer Academic Publishers, Dordrecht (2000)
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
Jeon, JC., Yoo, KY. (2006). Conflict Detection in Role-Based Access Control Using Multiple-Attractor Cellular Automata. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Computing. ICIC 2006. Lecture Notes in Computer Science, vol 4113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816157_66
Download citation
DOI: https://doi.org/10.1007/11816157_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37271-4
Online ISBN: 978-3-540-37273-8
eBook Packages: Computer ScienceComputer Science (R0)