you will change file access in Bionic Beaver. This project relates to projects 1 and 2, but only…

Stuck with a difficult assignment? No time to get your paper done? Feeling confused? If you’re looking for reliable and timely help for assignments, you’ve come to the right place. We promise 100% original, plagiarism-free papers custom-written for you. Yes, we write every assignment from scratch and it’s solely custom-made for you.


Order a Similar Paper Order a Different Paper

In this project, you will change file access in Bionic Beaver. This project relates to projects 1 and 2, but only

builds on project 1. In project 1, you attached a tag to each process. In project 2, you used part of this tag to

constrain scheduling to prevent a covert channel. In this project, you will implement hierarchical access control

according to Bell-LaPadula (BLP) to eliminate overt information flows.

Recall that the tag contains two fields:

1. level (the two LSBs, bits 0 and 1) and

2. bitmap (bits 2-30).

As before, two level fields can be compared numerically in a total order: 3 > 2 > 1 > 0. The bitmap fields can be

treated as associating each bit with a need-to-know category. A bitmap with bit b set can be used to represent a

security label indicating that a file contains information specific to category b, or that a user has been cleared to

access information on category b, or that a process has access to category b. In Mandatory Access Control

(MAC), these labels can be used to determine access rights (in addition to the usual discretionary access control

methods).

File access control is decided on the basis of the properties of the process that requests access to a file, and the

properties of that file. In BLP, there are two rules that constrain information flow to be only from less sensitive

to more sensitive, fewer categories to more categories:

1. No read up, and

2. No write down.

Up and down depend upon the labels. A process with label L = is not allowed to read a file with

label L’ = if either level’ > level or if any bit is set in bitmap B’ and is not set in bitmap B (i.e., L

dominates L’). That is, a process can only “read down” to a file at the same or lower level, and containing

information associated with a subset of the need-to-know categories for which the process is authorized. This

prevents information from flowing from a more restricted file to a less restricted process. To prevent

information flow from a more restricted process to a less restricted file, a process with label L = is

not allowed to write to a file with label L’ = if either level > level’ or if any bit is set in B and is not

set in B’ (i.e., L is dominated by L’). That is, a process can only “write up” to a file at the same or higher level,

containing information associated with a superset of the need-to-know categories for which the process is

authorized.

Attachments:

Writerbay.net

We’ve proficient writers who can handle both short and long papers, be they academic or non-academic papers, on topics ranging from soup to nuts (both literally and as the saying goes, if you know what we mean). We know how much you care about your grades and academic success. That's why we ensure the highest quality for your assignment. We're ready to help you even in the most critical situation. We're the perfect solution for all your writing needs.

Get a 15% discount on your order using the following coupon code SAVE15


Order a Similar Paper Order a Different Paper