Corpus ID: 204897348

Brewer and Nash security model

  title={Brewer and Nash security model},
  author={F. Jeannot},
A review of Brewer and Nash security model (1989) and some later improvements. 


Chinese wall security policy-revisited a short proof
  • T. Lin
  • Computer Science
  • 2007 IEEE International Conference on Systems, Man and Cybernetics
  • 2007
In this paper, Chinese wall security policy (CWSP) was re-examined via social networks and granular computing. A short proof of the strong Chinese wall security theorem was presented.
Extending the Brewer-Nash model to a multilevel context
  • C. Meadows
  • Computer Science
  • Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy
  • 1990
It is shown how the Brewer-Nash Chinese wall model can be extended to a policy for handling the aggregation problem in a multilevel context and a lattice-based information flow policy is derived that is used to develop a security policy. Expand
Chinese wall security policy-an aggressive model
  • T. Lin
  • Computer Science
  • [1989 Proceedings] Fifth Annual Computer Security Applications Conference
  • 1989
A modified Brewer and Nash model without BN-axiom is defined and a new formal model is introduced in which Chinese Walls are built right on the boundary of China-an aggressive model for Chinese Wall security policy. Expand
Lattice-based access control models
A balanced perspective on lattice-based access control models is provided and information flow policies, the military lattice,Access control models, the Bell-LaPadula model, the Biba model and duality, and the Chinese Wall lattice are reviewed. Expand
Chinese Wall Security Policy Models: Information Flows and Confining Trojan Horses
  • T. Lin
  • Business, Computer Science
  • DBSec
  • 2003
A theory based on granulation that has captured the essence of BN’s intuitive idea, Chinese wall security policy model, and the results are more than the Chinese wall models: Malicious Trojan horses in certain DAC Model (discretionary access control) can be controlled or confined. Expand
Lattice-based enforcement of Chinese Walls
It is demonstrated that the Brewer-Nash model of the Chinese Wall policy is too restrictive to be employed in a practical system and can be easily represented within the Bell-LaPadula framework. Expand
Least-restrictive enforcement of the Chinese wall security policy
An enforcement mechanism for the Chinese Wall security policy is presented that is simple and efficient, and least-restrictive -- an authorization state is reachable if and only if it does not violate the policy. Expand
Placing the Chinese Walls on the boundary of conflicts - analysis of symmetric binary relations
  • T. Lin
  • Mathematics, Computer Science
  • Proceedings 26th Annual International Computer Software and Applications
  • 2002
It is shown that ACWSP can be strengthened by theinduced equivalence relation; intuitively the walls are placed on the boundary of induced equivalence classes. Expand
A decentralized treatment of a highly distributed Chinese-Wall policy
  • N. Minsky
  • Computer Science
  • Proceedings. Fifth IEEE International Workshop on Policies for Distributed Systems and Networks, 2004. POLICY 2004.
  • 2004
This paper demonstrates one of the main drawbacks of centralized AC mechanisms, when applied to distributed systems, and shows the absence of this drawback under the inherently decentralized law-governed interaction (LGI) mechanism. Expand
A new Chinese wall security policy model based on the subject's wall and object's wall
A new approach based on the access query type of the subject to the objects and the philosophy of the CWSP is proposed, which can fix the composite information flows (CIF) problem between the CC (a malicious Trojan horses problem). Expand