Chinese wall security policy-an aggressive model

Lin, Tsau Young

doi:10.1109/csac.1989.81064

Cited by 71 publications

(63 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Lin's model the partition based on the complement of the CIR relation (induced equivalence relation), can overlap if the CIR relation is not "ant-transitive", case named by Lin as a "Bad CIR Relation" (page 10 in (Lin, 2003)), so a real case excluded by Lin's model! Also, we are observing, that, Lin in (Lin, 1989)- (Lin, 2007) fix the problems of the DIF / CIF by the using of the same BN's idea (Brewer & Nash, 1989), unsanitized/sanitized information and also the read/write access type, where: In BN the unsanitized information is confined to its selfcompany but in Lin to allied dataset. So, the inheriting of the problem (Sandhu, 1992) "consultant to work for one company only" to "consultant to work for one allied companies only".…”

Section: Related Work Based On Access Matrixmentioning

confidence: 99%

“…However, and after analyses of the previous proposed models (Brewer & Nash, 1989)- (Sandhu, 1992), and theirs applications (Atluri et al, 2004) (Hsiao & Hwang, 2010) (Wu et al, 2010) (Tsai et al, 2011) (Kesarwani et al, 2011) (Xie et al, 2013) (Alqahtani, Gamble, & Ray, 2013) (Minsky, 2004), we are surprising by many problems. For example the problem of the Conflict of interest (COI) is a set of disjoint class or a binary relation (CIR), the error was fixed in 1989 by Lin (Lin, 1989)- (Lin, 2007), but to our days there are many applications based on COI classes and not a CIR binary relation.…”

Section: Related Work Based On Access Matrixmentioning

confidence: 99%

“…In the same year, Lin announces a modified model, called an aggressive Chinese Wall Security Policy Model (ACWSPM ) (Lin, 1989) to fix the errors of BN. The error is that the conflict of interest (COI ) is a binary relation (CIR), and not, an equivalence class (partitions).…”

Section: Related Work Based On Access Matrixmentioning

confidence: 99%

“…They have developed their first model in 1989 (Brewer & Nash, 1989). The model became very attractive and therefore many other models based on the same idea have been proposed in subsequent years (Lin, 1989(Lin, , 2000(Lin, , 2002(Lin, , 2003(Lin, , 2007(Lin, , 2015Sharifi & Tripunitara, 2013). The model and its variant have been successfully used in many applications (Atluri, Chun, & Mazzoleni, 2004;Minsky, 2004;Hsiao & Hwang, 2010;Wu, Ahn, Hu, & Singhal, 2010;Tsai, Chen, Huang, Huang, & Chou, 2011;Kesarwani et al, 2011;Xie, Ray, Adaikkalavan, & Gamble, 2013) in order to control the information flow between the competing subjects residing in the same system.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A New Distributed Chinese Wall Security Policy Model

Fehis¹,

Nouali²,

Kechadi³

2016

JDFSL

View full text Add to dashboard Cite

The application of the Chinese wall security policy model (CWSPM ) to control the information flows between two or more competing and/or conflicting companies in cloud computing (Multi-tenancy) or in the social network, is a very interesting solution. The main goal of the Chinese Wall Security Policy is to build a wall between the datasets of competing companies, and among the system subjects. This is done by the applying to the subjects mandatory rules, in order to control the information flow caused between them. This problem is one of the hottest topics in the area of cloud computing (as a distributed system) and has been attempted in the past; however the proposed solutions cannot deal with the composite information flows problem (e.g., a malicious Trojan horses problem), caused by the writing access rule imposed to the subject on the objects. In this article, we propose a new CWSP model, based on the access query type of the subject to the objects using the concepts of the CWSP. We have two types of walls placement, the first type consists of walls that are built around the subject, and the second around the object. We cannot find inside each once wall two competing objects' data. We showed that this mechanism is a good alternative to deal with some previous models' limitations. The model is easy to implement in a distributed system (as Cloud-Computing). It is based on the technique of Object Oriented Programming (Can be used in Cloud computing "Software as a service SaaS") or by using the capabilities as an access control in real distributed system.

show abstract

Section: Related Work Based On Access Matrixmentioning

confidence: 99%

Section: Related Work Based On Access Matrixmentioning

confidence: 99%

Section: Related Work Based On Access Matrixmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A New Distributed Chinese Wall Security Policy Model

Fehis¹,

Nouali²,

Kechadi³

2016

JDFSL

View full text Add to dashboard Cite

show abstract

“…Singleton lower and upper approximations were studied in [8,9,16,18,19]. Note that similar three definitions of lower and upper approximations, though not for incomplete decision tables, were studied in [10][11][12][21][22][23][24].…”

Section: Introductionmentioning

confidence: 99%

Local and Global Approximations for Incomplete Data

Grzymała-Busse

Rząsa

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. For completely specified decision tables, where lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set X and the upper approximation of X is the smallest definable set containing X. For incomplete decision tables the existing definitions of upper approximations provide sets that, in general, are not minimal definable sets. The same is true for approximations based on relations that are generalizations of the equivalence relation. In this paper we introduce two definitions of approximations, local and global, such that the corresponding upper approximations are minimal. Local approximations are more precise than global approximations. Global lower approximations may be determined by a polynomial algorithm. However, algorithms to find both local approximations and global upper approximations are NP-hard.

show abstract

Granular computing: Models and applications

Han¹,

Lin²

2009

Int. J. Intell. Syst.

View full text Add to dashboard Cite

Chinese wall security policy-an aggressive model

Cited by 71 publications

References 1 publication

A New Distributed Chinese Wall Security Policy Model

A New Distributed Chinese Wall Security Policy Model

Local and Global Approximations for Incomplete Data

Granular computing: Models and applications

Contact Info

Product

Resources

About