Abstract
We present a modified version of the Chinese Wall model. Especially, we make some investigations on the indirect information flow induced by the write access. In the original Brewer-Nash model the write permission is very restricted. There a subject can get write access to one object only and only during early states of the system. We change this rule and introduce a dynamic concept of the “conflict of interest relation”. Thus, we prevent an indirect information flow by building more Chinese Walls. Finally, we prove that the system is “conflict secure”, i.e. a subject can never get sensitive information from two or more objects which are in conflict of interest to each other.
Chapter PDF
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
D.E. Bell, L.J. LaPadula, Secure Computer Systems: Unified Exposition and Multics Interpretation, NTIS AD-A023 588, MTR 2997, ESD-Tr-75-306, MITRE Corporation, Bedford, MA, 3/1976
D.F.C. Brewer, M.J. Nash, The Chinese Wall Security Policy, Proc. of the IEEE Symp. on Security and Privacy 1989, 206–214
T. Lin, Chinese Wall Security Policy — an Aggressive Model, Proc. of the. 5th Aerospace Computer Security Conference 1989, IEEE Comp. Sec. Press 1990, 282–289
C. Meadows, Extending the Brewer-Nash Model to a Multilevel Context, Proc. of the IEEE Symp. on Security and Privacy 1990, 95–102
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag
About this paper
Cite this paper
Kessler, V. (1992). On the Chinese Wall model. In: Deswarte, Y., Eizenberg, G., Quisquater, JJ. (eds) Computer Security — ESORICS 92. ESORICS 1992. Lecture Notes in Computer Science, vol 648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013891
Download citation
DOI: https://doi.org/10.1007/BFb0013891
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56246-7
Online ISBN: 978-3-540-47488-3
eBook Packages: Springer Book Archive