Welcome to the InfoSci Platform
Chinese Wall Security Policy Model: Granular Computing on DAC Model

Chinese Wall Security Policy Model: Granular Computing on DAC Model

Tsau Y. Lin
Copyright: © 2006 |Pages: 19
ISBN13: 9781591405887|ISBN10: 1591405882|ISBN13 Softcover: 9781591405894|EISBN13: 9781591405900
DOI: 10.4018/978-1-59140-588-7.ch010
Cite Chapter Cite Chapter

MLA

Lin, Tsau Y. "Chinese Wall Security Policy Model: Granular Computing on DAC Model." Web and Information Security, edited by Elena Ferrari and Bhavani Thuraisingham, IGI Global, 2006, pp. 196-214. https://doi.org/10.4018/978-1-59140-588-7.ch010

APA

Lin, T. Y. (2006). Chinese Wall Security Policy Model: Granular Computing on DAC Model. In E. Ferrari & B. Thuraisingham (Eds.), Web and Information Security (pp. 196-214). IGI Global. https://doi.org/10.4018/978-1-59140-588-7.ch010

Chicago

Lin, Tsau Y. "Chinese Wall Security Policy Model: Granular Computing on DAC Model." In Web and Information Security, edited by Elena Ferrari and Bhavani Thuraisingham, 196-214. Hershey, PA: IGI Global, 2006. https://doi.org/10.4018/978-1-59140-588-7.ch010

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.