AI Glossary / Data governance and quality / Advanced

Chinese wall

Definition

A Chinese wall is an information barrier intended to prevent inappropriate sharing between activities or parties with conflicting interests. In computer security, the Brewer-Nash model gives the idea a specific history-dependent form: access to one company's confidential dataset restricts access to competing datasets in the same conflict class. The supplied term is retained here; information barrier is a clearer general description. The technical model and an organization's complete operational arrangements are not identical.

What it means

The question is not simply whether someone has a job title or a valid account. Earlier access can affect what that person should be allowed to see next. For an original AI research workspace serving separate clients, a researcher might be permitted to work with one client's confidential material but not a competitor's. The project must define the relevant conflicts rather than infer them from folder names. Public material and approved shared information need their own treatment. A label on a workspace does not itself establish that retrieval, exports and generated outputs respect the intended barrier.

How it works

Brewer and Nash's 1989 paper groups information into company datasets and conflict-of-interest classes, with access decisions using the subject's prior access history. The paper also addresses writing because read restrictions alone do not prevent information from flowing indirectly between datasets. These are elements of the formal model, not a complete contemporary compliance program. In an original AI implementation, the team would map data and acting identities to the chosen policy, enforce decisions at relevant operations and preserve the history needed for those decisions. Shared service identities, copied content and persistent model context require explicit design consideration.

Three practical examples

  • A research organization separates confidential client workspaces and evaluates whether a person's previous client access creates a conflict for a new request.
  • An AI retrieval system applies the relevant information-barrier policy before supplying confidential documents to a generation step.
  • A team reviews report exports and shared notes to identify whether material from a restricted workspace could become available through another workspace.

Think of it this way

Imagine a consultant choosing a confidential project from one of two competing organizations. Accepting the first project changes which other assignments are appropriate. Moving the files into separate cupboards does not make the consultant forget what was learned. The analogy explains why access history can matter and why organizational responsibilities extend beyond storage layout. It does not define legal obligations.

Worked example

Consider an original simplified read-access illustration with four confidential datasets: A1 and A2 belong to conflict class A, while B1 and B2 belong to conflict class B. A researcher starts with no recorded access. Subject to all other permissions being satisfied, the researcher first reads A1. A later request for another document in A1 remains compatible with the illustration's conflict rule, but a request for A2 is rejected. The researcher then reads B2, which belongs to the previously untouched class B. A subsequent request for B1 is rejected. The final accessed set is A1 and B2: two datasets, one from each class. The sequence does not permit two datasets from class A merely because the researcher has access to two datasets overall. This is only a read-rule illustration. It does not establish safe writing, copying, summarization or collaboration, and it assumes the classes and access history are correctly defined and maintained.

Illustrative case study

In a fictional AI-assisted research firm, each client has a separate document collection. The team discovers that a shared assistant account can retrieve from every collection, even when an individual researcher's assigned work is restricted. It revises the design so retrieval decisions reflect the relevant identity and policy, then evaluates generated notes and exports as additional information paths. The team uses the four-dataset example to explain why separate folders are insufficient. The scenario illustrates a design issue to investigate, not a claim that one technical change establishes a complete information barrier. Human handling and other collaboration channels remain part of the actual arrangement.

Common misconceptions and mistakes

Separate folders do not automatically create an effective information barrier. A history-dependent policy is also different from a fixed role list. Another mistake is evaluating only direct reads while ignoring copied documents, shared summaries or other routes by which confidential content moves. Resetting a session does not necessarily erase a person's prior knowledge or the history relevant to the policy. Finally, the historical security paper should not be treated as a statement of current legal obligations. A technical model explains particular access and flow properties under assumptions; its use does not itself prove organizational compliance.

Business use

For an AI project handling separate clients' information, document what must be kept apart and why. Identify who or what acts on each request, which information sources can be retrieved and where outputs can be stored or shared. In the fictional research firm, a shared assistant's broad access needs review alongside individual permissions. Test cases should include a request that becomes inappropriate after earlier access, as well as indirect movement through generated content. Assign responsibility for maintaining conflict classifications as relationships change. This makes the separation reviewable.

People also ask

Is this just another name for a firewall?

No. An information barrier concerns permitted access and information movement, which may involve people and applications as well as networks.

Why does earlier access matter?

In the Brewer-Nash model, it can create a conflict with a later request.

Do read restrictions establish safe information flow by themselves?

No. Writing and indirect sharing require consideration too.

Check your understanding

After reading A1, can the researcher read A2 under the toy conflict rule?

Answer: No.

Can the researcher subsequently read B2?

Answer: Yes, assuming other permissions and the stated initial history.

Why is B1 then rejected?

Answer: The researcher has already accessed B2 in the same conflict class.

Does the example prove that generated summaries can be shared safely?

Answer: No; output and writing behavior are outside its simplified read-only scope.

Related terms

  • Compartmentalization (information security)
  • Information barrier
  • conflict of interest
  • Brewer-Nash model
  • access history
  • information flow control
  • compartmentalization

Learn next

Draw two conflict classes with two fictional datasets in each. Trace a sequence of read requests and record how earlier access changes later decisions. Then add a shared notes area and explain why the read-only exercise does not establish whether information may safely be written there.

More in Data governance and quality

  • Backup validation - Backup validation is the process of checking whether a backup meets defined requirements for integrity, completeness and intended recovery use.
  • Biometric tokenization - Biometric tokenization is a term used for authentication arrangements that combine biometric verification with a substitute digital credential or...
  • Chain of trust - A chain of trust is a sequence of relationships or verification steps through which confidence in one component or claim depends on an accepted starting...
  • Context-based access control - Context-based access control, or CBAC, is used here in its Cisco IOS firewall sense: traffic filtering that uses session information, including supported...
  • Crypto-shredding - Crypto-shredding is the practice of making encrypted data inaccessible by irrecoverably eliminating the key material needed to decrypt it.
  • Cryptographic splitting - Cryptographic splitting is a broad label for dividing protected data or secret material into separately held parts using a cryptographic design.

Sources

David F. C. Brewer and Michael J. Nash, The Chinese Wall Security Policy, 1989, primary paper hosted by MIT: https://people.csail.mit.edu/alinush/6.858-fall-2014/papers/chinese-wall-sec-pol.pdf The A1/A2/B1/B2 sequence, consultant analogy and AI research scenario are original educational illustrations. The historical paper grounds the formal model; historical legal statements in it are not presented as current legal guidance. The simplified example does not implement the paper's complete read-and-write policy.

Previous: Child node Next: Choice set

  • Home
  • Daily AI Updates
  • Blog
  • AIFBL Academy
  • AI Glossary
  • Products and Tools
  • Store
  • Free CFO AI Prompt Pack
  • About Shihan Sheriff
  • Privacy Policy
  • Terms of Use
  • Refund Policy
  • Cookie Policy
  • Earnings Disclaimer