Hello, i would like to know if there is any solution for the following problems:
ID: 3760111 • Letter: H
Question
Hello, i would like to know if there is any solution for the following problems: chapter 1 problem 7 and chapter 4 problem 8 from the book: Computer Security Principles and Practice 3rd Edition
Chapter 1 Problem 7:
Consider a company whose operations are housed in two buildings on the same prop- erty, one building is headquarters, the other building contains network and computer services. The property is physically protected by a fence around the perimeter. The only entrance to the property is through the fenced perimeter. In addition to the perimeter fence, physical security consists of a guarded front gate. The local networks are split between the Headquarters’ LAN and the Network Services’ LAN. Internet users connect to the Web server through a firewall. Dial-up users get access to a par- ticular server on the Network Services’ LAN. Develop an attack tree in which the root node represents disclosure of proprietary secrets. Include physical, social engineering, and technical attacks. The tree may contain both AND and OR nodes. Develop a tree
that has at least 15 leaf nodes.
Chapter 4 Problem 8:
Assume a system with N job positions. For job position i, the number of individual users in that position is Ui and the number of permissions required for the job position is Pi.
a. For a traditional DAC scheme, how many relationships between users and per-
missions must be defined?
b. For a RBAC scheme, how many relationships between users and permissions
must be defined?
Explanation / Answer
please post the questions
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.