Name
Abstract | ||
|---|---|---|
A computing policy is a sequence of rules, where each rule consists of a predicate and an action, and where each action is either \"accept\" or \"reject\". A policy P is said to accept or reject, respectively a request iff the action of the first rule in P, that is matched by the request is \"accept\" or \"reject\", respectively. A pair of policies P, Q is called an accept-implication pair iff every request that is accepted by policy P is also accepted by policy Q. The implication problem of policies is to design an efficient algorithm that can take as input any policy pair P, Q and determine whether P, Q is an accept-implication pair. Such an algorithm can support step-wise refinement methods for designing policies. In this paper, we present a polynomial algorithm that can take any policy pair P, Q and determine whether P, Q is an accept-implication pair. The time complexity of this algorithm is $$\\mathcal {O}$$$$m + n$$$$^{t+2}$$, where m is the number of rules in policy P, n is the number of rules in policy Q, and t is the number of attributes in P or in Q. This time complexity is polynomial when t is fixed, as is usually the case. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-21741-3_8 | Workshop On Storage Security And Survivability |
Field | DocType | Citations |
Discrete mathematics,Polynomial,As is,Theoretical computer science,Access control,Polynomial algorithm,Predicate (grammar),Time complexity,Mathematics | Conference | 1 |
PageRank | References | Authors |
0.36 | 6 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rezwana Reaz | 1 | 11 | 3.32 |
| Muqeet Ali | 2 | 1 | 0.70 |
| Mohamed G. Gouda | 3 | 1982 | 317.23 |
| Marijn J. H. Heule | 4 | 605 | 49.51 |
| Ehab S. Elmallah | 5 | 105 | 19.29 |