Bell–LaPadula model

From Wikipedia, the free encyclopedia
  (Redirected from David Elliott Bell)
Jump to: navigation, search

The Bell–LaPadula Model (abbreviated BLP) is a state machine model used for enforcing access control in government and military applications.[1] It was developed by David Elliott Bell and Leonard J. LaPadula, subsequent to strong guidance from Roger R. Schell to formalize the U.S. Department of Defense (DoD) multilevel security (MLS) policy.[2][3][4] The model is a formal state transition model of computer security policy that describes a set of access control rules which use security labels on objects and clearances for subjects. Security labels range from the most sensitive (e.g."Top Secret"), down to the least sensitive (e.g., "Unclassified" or "Public").

The Bell–LaPadula model is an example of a model where there is no clear distinction of protection and security.[5]

Features[edit]

The Bell–LaPadula model focuses on data confidentiality and controlled access to classified information, in contrast to the Biba Integrity Model which describes rules for the protection of data integrity. In this formal model, the entities in an information system are divided into subjects and objects. The notion of a "secure state" is defined, and it is proven that each state transition preserves security by moving from secure state to secure state, thereby inductively proving that the system satisfies the security objectives of the model. The Bell–LaPadula model is built on the concept of a state machine with a set of allowable states in a computer system. The transition from one state to another state is defined by transition functions.

A system state is defined to be "secure" if the only permitted access modes of subjects to objects are in accordance with a security policy. To determine whether a specific access mode is allowed, the clearance of a subject is compared to the classification of the object (more precisely, to the combination of classification and set of compartments, making up the security level) to determine if the subject is authorized for the specific access mode. The clearance/classification scheme is expressed in terms of a lattice. The model defines two mandatory access control (MAC) rules and one discretionary access control (DAC) rule with three security properties:

  1. The Simple Security Property - a subject at a given security level may not read an object at a higher security level (no read-up).
  2. The ★-property (read "star"-property) - a subject at a given security level must not write to any object at a lower security level (no write-down).
  3. The Discretionary Security Property - use of an access matrix to specify the discretionary access control.

The transfer of information from a high-sensitivity document to a lower-sensitivity document may happen in the Bell–LaPadula model via the concept of trusted subjects. Trusted Subjects are not restricted by the ★-property. Untrusted subjects are. Trusted Subjects must be shown to be trustworthy with regard to the security policy. This security model is directed toward access control and is characterized by the phrase: "no read up, no write down." Compare the Biba model, the Clark-Wilson model and the Chinese Wall model.

With Bell-LaPadula, users can create content only at or above their own security level (i.e. secret researchers can create secret or top-secret files but may not create public files; no write-down). Conversely, users can view content only at or below their own security level (i.e. secret researchers can view public or secret files, but may not view top-secret files; no read-up).

The Bell–LaPadula model explicitly defined its scope. It did not treat the following extensively:

  • Covert channels. Passing information via pre-arranged actions was described briefly.
  • Networks of systems. Later modeling work did address this topic.
  • Policies outside multilevel security. Work in the early 1990s showed that MLS is one version of boolean policies, as are all other published policies.

Strong ★ Property[edit]

The Strong ★ Property is an alternative to the ★-Property, in which subjects may write to objects with only a matching security level. Thus, the write-up operation permitted in the usual ★-Property is not present, only a write-to-same operation. The Strong ★ Property is usually discussed in the context of multilevel database management systems and is motivated by integrity concerns.[6] This Strong ★ Property was anticipated in the Biba model where it was shown that strong integrity in combination with the Bell–LaPadula model resulted in reading and writing at a single level.

Tranquility principle[edit]

The tranquility principle of the Bell–LaPadula model states that the classification of a subject or object does not change while it is being referenced. There are two forms to the tranquility principle: the "principle of strong tranquility" states that security levels do not change during the normal operation of the system. The "principle of weak tranquility" states that security levels may never change in such a way as to violate a defined security policy. Weak tranquility is desirable as it allows systems to observe the principle of least privilege. That is, processes start with a low clearance level regardless of their owners clearance, and progressively accumulate higher clearance levels as actions require it.

Limitations[edit]

  • Only addresses confidentiality, control of writing (one form of integrity), ★-property and discretionary access control
  • Covert channels are mentioned but are not addressed comprehensively
  • The tranquility principle limits its applicability to systems where security levels do not change dynamically. It allows controlled copying from high to low via trusted subjects.
  • The state-transition model does not contain any state invariants.

See also[edit]

Notes[edit]

  1. ^ Hansche, Susan; John Berti; Chris Hare (2003). Official (ISC)2 Guide to the CISSP Exam. CRC Press. p. 104. ISBN 978-0-8493-1707-1. 
  2. ^ Bell, David Elliott and LaPadula, Leonard J. (1973). "Secure Computer Systems: Mathematical Foundations" (PDF). MITRE Corporation. 
  3. ^ Bell, David Elliott and LaPadula, Leonard J. (1976). "Secure Computer System: Unified Exposition and Multics Interpretation" (PDF). MITRE Corporation. 
  4. ^ Bell, David Elliott (December 2005). "Proceedings of the 21st Annual Computer Security Applications Conference" (PDF). Tucson, Arizona, USA. pp. 337–351. doi:10.1109/CSAC.2005.37.  |chapter= ignored (help) Slides - Looking Back at the Bell-LaPadula Model
  5. ^ Landwehr, Carl (September 1981). "Formal Models for Computer Security" (PDF). ACM Computing Surveys (New York: Association for Computing Machinery) 13 (3): 8, 11, 247–278. doi:10.1145/356850.356852. ISSN 0360-0300. 
  6. ^ Sandhu, Ravi S. (1994). "Handbook of Information Security Management (1994-95 Yearbook)" (PDF). Auerbach Publishers. pp. 145–160. Retrieved 2006-08-12.  |chapter= ignored (help)

References[edit]

  • Bishop, Matt (2003). Computer Security: Art and Science. Boston: Addison Wesley. 
  • Krutz, Ronald L.; Russell Dean Vines (2003). The CISSP Prep Guide (Gold ed.). Indianapolis, Indiana: Wiley Publishing. 
  • McLean, John (1994). "Security Models". Encyclopedia of Software Engineering 2. New York: John Wiley & Sons, Inc. pp. 1136–1145.