A MANDATORY MODEL OF PROVIDING PRIVACY IN MULTI-LEVEL INFORMATION ENVIRONMENTS: BELL-LAPADULA METHODOLOGY AND STATE MACHINE ANALYSIS

Authors

  • Imamaliyev Aybek Turapbayevich Associate Professor, Tashkent University of Information Technologies named after Muhammad al-Khwarizmi Author

Keywords:

Bell-LaPadula model, Mandatory Access Control (MAC), Confidentiality invariants, State Machine, Basic Security Theorem, Information flow inflation, Static security analysis, Trojan horses.

Abstract

This article investigates the Bell-LaPadula (BLP) mandatory access control model, which serves as the fundamental cornerstone for ensuring data confidentiality within Multilevel Security (MLS) environments. A profound analysis is conducted on the model's mathematical invariants that strictly regulate the relationship between subjects and objects, the concept of the "State Machine" governing dynamic system variations, and the logical framework of the Basic Security Theorem (BST). The scientific novelty of the paper lies in the mathematical modeling of static security analysis mechanisms based on BLP rules, which are specifically designed to eliminate information leakage caused by Trojan horses and cyber threats directly during the compilation phase in multilevel systems.

References

1.Bell, D. E., & LaPadula, L. J. (1973). Secure Computer Systems: Mathematical Foundations. Mitre Corp Technical Report.

2.McLean, J. (1987). Reasoning about security models. Proceedings of the IEEE Symposium on Security and Privacy, 113-131.

Downloads

Published

2026-06-01