IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Chinese Wall Security Policy Model: Granular Computing on DAC Model

Chinese Wall Security Policy Model: Granular Computing on DAC Model
View Sample PDF
Author(s): Tsau Y. Lin (San Jose State University, USA)
Copyright: 2006
Pages: 19
Source title: Web and Information Security
Source Author(s)/Editor(s): Elena Ferrari (University of Insubria at Como, Italy) and Bhavani Thuraisingham (The University of Texas at Dallas, USA)
DOI: 10.4018/978-1-59140-588-7.ch010

Purchase

View Chinese Wall Security Policy Model: Granular Computing on DAC Model on the publisher's website for pricing and purchasing information.

Abstract

In 1989, Brewer and Nash (BN) proposed the Chinese Wall Security Policy (CWSP). Intuitively speaking, they want to build a family of impenetrable walls, called Chinese walls, among the datasets of competing companies so that no datasets that are in conflict can be stored in the same side of Chinese walls. Technically, the idea is: (X, Y) Ï CIR (= the binary relation of conflict of interests) if and only if (X, Y) Ï CIF (= the binary relation of information flows). Unfortunately, BN’s original proof has a major flaw (Lin, 1989). In this chapter, we have established and generalized the idea using an emerging technology, granular computing.

Related Content

. © 2021. 31 pages.
. © 2021. 23 pages.
. © 2021. 20 pages.
. © 2021. 29 pages.
. © 2021. 27 pages.
. © 2021. 20 pages.
. © 2021. 20 pages.
Body Bottom