SYSTEM AND METHOD FOR EVALUATING A REVERSE QUERY
1 Assignment
0 Petitions
Accused Products
Abstract
Real-time techniques for determining all access requests to an attribute-based access control policy which evaluate to a given decision, “permit” or “deny”. The policy is enforced to control access to one or more resources in a computer network. In one embodiment, a method includes: (i) receiving a reverse query and a set of admissible access requests, each of which includes one or more attributes in the policy and values of these; (ii) extracting attributes to which all access requests in the set assign identical values; (iii) reducing the ABAC policy by substituting values for the extracted attributes; (iv) caching the policy as a simplified policy; (v) translating the simplified policy and the given decision into a satisfiable logic proposition; (vi) deriving all solutions satisfying the proposition; and (vi) extracting, based on the solutions, all access requests from the set for which the policy yields the given decision.
-
Citations
36 Claims
-
1-18. -18. (canceled)
-
19. A computer-implemented method for real-time evaluation of a reverse query to an attribute-based access control (ABAC) policy (P) which is enforced to control access to one or more resources in a computer network, said method comprising the steps of:
-
i) receiving a reverse query indicating a given access decision (d), which is one of permit access and deny access, and a subset (R) of access requests which is defined by constraints over the set of possible access requests; ii) constructing a partial request (rpartial) from the subset (R) of access requests; iii) reducing the ABAC policy in accordance with the partial request; iv) caching the ABAC policy after said reducing, as a simplified policy (P′
);v) translating the cached simplified policy (P′
) and the given decision (d) into a satisfiable logic proposition in Boolean variables (vi, i=1, 2, . . . ), including replacing, by a Boolean variable, any Boolean expression in the policy representing a comparison of an attribute and a fixed value, or into a representation of the satisfiable logic proposition; andvi) deriving all variable assignments (cj=[v1=xj1, v2=xj2, . . . ], j=1, 2, . . . ) satisfying the logic proposition. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33)
-
-
34. A computer system configured for real-time evaluation of a reverse query to an attribute-based access control (ABAC) policy which is enforced to control access to one or more resources in a computer network,
wherein the reverse query indicates a given access decision (d), which is one of permit access and deny access, and a subset (R) of access requests which is defined by constraints over the set of possible access requests, the computer system comprising: -
a data memory operable to store one or more ABAC policies; a partial request generation means operable to construct a partial request (rpartial) from the subset (R) of access requests; a policy decision partial evaluation means connected to the partial request generation means and to the data memory, and operable to reduce the ABAC policy (P) in accordance with the partial request (rpartial), thereby yielding a simplified policy (P′
);a translation means, connected to the policy decision means and operable to translate the simplified policy (P′
), and the given decision (d) into a satisfiable logic proposition (F) in Boolean variables (vi, i=1, 2, . . . ), wherein the translation means is configured to replace, by a Boolean variable, any Boolean expression in the policy representing a comparison of an attribute and a fixed value or into a representation of the satisfiable logic proposition;an analyzing means, connected to the translation means and operable to derive all variable assignment (cj=[v1=xj1, v2=xj2, . . . ], j=1, 2, . . . ) satisfying the logic proposition. - View Dependent Claims (35, 36)
-
Specification