Consider a server that has 20 users, each of which has 50 files in their home directory. Each user should have read and write access to every file in their own home directory. a.If this policy were expressed as a DAC matrix, how many non-empty entries (cells) would the matrix need to have? b. Express this policy as a single if-then sentence, such as might be used in an Attribute-based Access Control (ABAC) system. The sentence should be English, but imagine that it could be translated into a logical constraint.

Consider a server that has 20 users, each of which has 50 files in their home directory. Each user should have read and write access to every file in their own home directory. a.If this policy were expressed as a DAC matrix, how many non-empty entries (cells) would the matrix need to have? b. Express this policy as a single if-then sentence, such as might be used in an Attribute-based Access Control (ABAC) system. The sentence should be English, but imagine that it could be translated into a logical constraint.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 10P

See similar textbooks

Similar questions

let the size of a finite buffer be 10 messages and variable N representing the number of messages currently available in the buffer i) how many semaphores are needed to execute multiple procedures and consumers concurrently and explain why? ii) if N=5 what will happen to a consumer upon a semawait() call iii) if N=10 what will happen to a consumer upon a semawait() call iv) if N=0 will you allow the consumer to access the buffer? What will happen if you fail to block the consumer? v) When you should allow any producer to access the buffer and why
We may evaluate the two modes of cypher encryption, cypher block chaining and cypher feedback mode, by looking at how many encryption operations are needed to transport a large file.To what extent is the more efficient option preferred?
Let 2PL be a scheduler based on the two-phase locking protocol and let TS be a scheduler based on the timestamping protocol. Here is a schedule of three transactions:r1(X), w1(X), r2(X), w2(X), r3(Y), w3(Y), r1(Y), w1(Y)Determine the following:Is the schedule serial?Is it serializable?Can it be produced by 2PL?Then, identify the true statement from the list below. a) S is not serial and S cannot be produced by 2PL b) S is serial and S can be produced by 2PL c) S is not serializable and S cannot be produced by TS d) S is not serial and S cannot be produced by TS which one ?
Suppose Alice has r and w rights over the file book. Alice wants to copy r rights to book to Bob. a.Assuming there is a copy right c, write a command to do this. b.Now assume the system supports a copy flag; for example, the right r with the copy flag would be written as rc. In this case, write a command to do the copy. c.In the previous part, what happens if the copy flag is not copied? Note:Follow the concept of access control matrix and do not use commands like chmod.
A cipher suite is a choice of algorithms for key exchange, authentication and encryption to be used together in TLS. Cipher suites are specified by an abbreviation such as the following: “ADH-DES-CBC-SHA”. Search online and find one example of a cipher suite used in TLS 1.3. Write the name of the cipher suite; then, for each component, write what the abbreviation stands for and for which cryptographic task that algorithm is used in that suite.
Hence, organizations with established IAM practices can rapidly adopt cloud services while maintaining the efficiency and efficacy of their security controls.We are aware that a digital signature serves to guarantee the validity and purity of data. a) Since checksums add up all the message's bits (or blocks), are they a viable method to build digital signature schemes? Consider a hash function, such as Sign(M)=h(M).b) If we create a signature using a hash in a trickier manner, as in Sign(k,m) = = h(k) XOR m XOR h(m), then m, will be transmitted. Would this warning be trustworthy? Describe in detail. Please refrain from using chegg or other AI tools like chat GPT.
Consider a plausible situation in which the handling of logins is concerned. Create a list of all the many methods you've been able to demonstrate your identification up to this point. Do you believe that passwords will soon be rendered unnecessary?
A number of companies have been invited to prepare and submit a tender for a contract using e-mail. To provide a high level of privacy and to authenticate each tender and ensure nonrepudiation, each company has been asked to encrypt their tender using PGP. By means of a block schematic diagram, assuming no compression is to be used, show the various steps that are followed to carry out: the authentication and nonrepudiation steps, and the encryption and decryption of the tender contents.
Consider the encryption function for a symmetric cryptosystem E(k, m) described below, where K = M = {0, 1, 2, 3}, C = {0, 1, 2, 3}: E(k, m) = (2 ∗ k + m) mod 4 (a) Give the corresponding decryption function(b) Is this cryptosystem information-theoretically secure(or perfectly secure)? Why or why not?
One potential limitation of a digital signature is that for a given signature σ of a message m corresponding to a public key pk, one could generate a pk', sk' that produces a signature σ' for m, such that σ' = σ. Given a signing function S, a verification function V, that each takes corresponding private and public keys for generating and verifying a signature and is vulnerable to these duplicate keys, please generate S' and V' that are immune to a duplicate keys attack.
Consider an airline's database, which may make use of snapshot isolation. For better long-term results, the airline, for instance, may consent to a nonserializable execution.
Given the following transaction database: Sales ID Items S1 {O, W, C, N, Z} S2 {O, C, K, N, Z} S3 {K, N, W, Z, O} S4 {K, W, Z, O} S5 {C, K, N, Z} S6 {O, K, N} S7 {O, N, W, Z} S8 {K, N, Z} What is the output of the Apriori algorithm run on the Previous transaction database with Support 40% and Confidence 90%? Using Apriori Algorithm for Findi the frequent item sets and association rules.Working steps must be shown.