Publication Details

This article was originally published as: Kong, Y, Seberry, J, Getta, JR & Yu, P, A Cryptographic Solution for General Access Control, Proceedings of the 8th Information Security Conference (ICS 2005), Singapore, 20-23 September 2005, Lecture Notes in Computer Science 3650, Springer-Verlag, 2005, 461-473. The original publication is available here through Springerlink.


As one of the most popular information safeguarding mechanisms, access control is widely deployed in information systems. However, access control approach suffers from a tough problem, i.e. system administrators must be unconditionally trusted. Cryptographic substitutes have been developed to solve the above problem. In particular, hierarchical encryption, as an alternate solution of access control in a hierarchy, has been intensively studied. In this paper, we propose a cryptographic solution for general access control based on Chinese Remainder Theorem. Our solution has two categories: data based solution and key based solution. In contrast to the most recent hierarchical encryption system: Ray, Ray and Narasimhamurthi's system [1], our solution is more efficient, secure and flexible. Moreover, we introduce an efficient mechanism for authorization alterations. This paper ends with a set of experimental results that support our research.