Prove Theorem 6–1 for the strict integrity policy of Biba’s model.If there is an information transfer path from object o1 ∈ O to object on+1 ∈ O, then enforcement of the strict integrity policy requires that i(on+1) ≤ i(o1) for all n > 1.

Answered: Prove Theorem 6–1 for the strict…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Prove Theorem 6–1 for the strict integrity policy of Biba’s model.If there is an information transfer path from object o₁ ∈ O to object o_n₊₁ ∈ O, then enforcement of the strict integrity policy requires that i(o_n₊₁) ≤ i(o₁) for all n > 1.

Expert Solution

Step 1

Introduction

Biba's model is a computer security model that focuses on data integrity. It has two main rules:

The Simple Integrity Axiom: "No read up" - a subject at level n can read an object at level n or lower, but not at a higher level.
The * (star) Integrity Axiom: "No write down" - a subject at level n can write to an object at level n or higher, but not at a lower level.

In addition, Biba's model includes two integrity policies: the Simple Integrity Policy and the Strict Integrity Policy.

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions