Patent Application
20080066147
The same numbers are used throughout the drawings to reference like and/or corresponding aspects, features, and components.
In a described implementation, security scheme 100 can be overlaid and/or integrated with one or more devices 102, which can be comprised of hardware, software, firmware, some combination thereof, and so forth. As illustrated, “d” devices, with “d” being some integer, are interconnected over one or more networks 104. More specifically, device 102(1), device 102(2), device 102(3) . . . device 102(d) are capable of communicating over network 104.
Each device 102 may be any device that is capable of implementing at least a part of security scheme 100. Examples of such devices include, but are not limited to, computers (e.g., a client computer, a server computer, a personal computer, a workstation, a desktop, a laptop, a palm-top, etc.), game machines (e.g., a console, a portable game device, etc.), set-top boxes, televisions, consumer electronics (e.g., DVD player/recorders, camcorders, digital video recorders (DVRs), etc.), personal digital assistants (PDAs), mobile phones, portable media players, some combination thereof, and so forth. An example electronic device is described herein below with particular reference to
Network 104 may be formed from any one or more networks that are linked together and/or overlaid on top of each other. Examples of networks 104 include, but are not limited to, an internet, a telephone network, an Ethernet, a local area network (LAN), a wide area network (WAN), a cable network, a fibre network, a digital subscriber line (DSL) network, a cellular network, a Wi-Fi® network a WiMAX® network, a virtual private network (VPN), some combination thereof, and so forth. Network 104 may include multiple domains, one or more grid networks, and so forth. Each of these networks or combination of networks may be operating in accordance with any networking standard.
As illustrated, device 102(1) corresponds to a user 106 that is interacting with it. Device 102(2) corresponds to a service 108 that is executing on it. Device 102(3) is associated with a resource 110. Resource 110 may be part of device 102(3) or separate from device 102(3).
User 106, service 108, and a machine such as any given device 102 form a non-exhaustive list of example entities. Entities, from time to time, may wish to access resource 110. Security scheme 100 ensures that entities that are properly authenticated and authorized are permitted to access resource 110 while other entities are prevented from accessing resource 110.
As illustrated, device 102(A) includes two security-related components: a security token 204 and an application 210. Security token 204 includes one or more assertions 206. Device 102(B) includes five security-related components: an authorization context 212, a resource guard 214, an audit log 216, an authorization engine 218, and a security policy 220. Security policy 220 includes a trust and authorization policy 222, an authorization query table 224, and an audit policy 226.
Each device 102 may be configured differently and still be capable of implementing all or a part of security scheme 100. For example, device 102(A) may have multiple security tokens 204 and/or applications 210. As another example, device 102(B) may not include an audit log 216 or an audit policy 226. Other configurations are also possible.
In a described implementation, authority 202 issues security token 204 having assertions 206 to entity 208. Assertions 206 are described herein below, including in the section entitled “Security Policy Assertion Language Example Characteristics”. Entity 208 is therefore associated with security token 204. In operation, entity 208 wishes to use application 210 to access resource 110 by virtue of security token 204.
Resource guard 214 receives requests to access resource 10 and effectively manages the authentication and authorization process with the other security-related components of device 102(B). Trust and authorization policy 222, as its name implies, includes policies directed to trusting entities and authorizing actions within security environment 200. Trust and authorization policy 222 may include, for example, security policy assertions (not explicitly shown in
Authorization context 212 collects assertions 206 from security token 204, which is/are used to authenticate the requesting entity, and security policy assertions from trust and authorization policy 222. These collected assertions in authorization context 212 form an assertion context. Hence, authorization context 212 may include other information in addition to the various assertions.
The assertion context from authorization context 212 and an authorization query from authorization query table 224 are provided to authorization engine 218. Using the assertion context and the authorization query, authorization engine 218 makes an authorization decision. Resource guard 214 responds to the access request based on the authorization decision. Audit log 216 contains audit information such as, for example, identification of the requested resource 110 and/or the algorithmic evaluation logic performed by authorization engine 218.
In a described implementation, entity 208 authenticates* itself to resource guard 214 with a token*, security token 204. Resource guard 214 forwards the token assertions* to authorization context 212. These token assertions are assertions 206 (of
Policy assertions are extracted from trust and authorization policy 222 by security policy 220. The policy assertions may include both trust-related assertions and authorization-related assertions. Security policy 220 forwards the policy assertions* to authorization context 212. Authorization context 212 combines the token assertions and the policy assertions into an assertion context. The assertion context* is provided from authorization context 212 to authorization engine 218 as indicated by the encircled “A”.
An authorization query is ascertained from the authorization query table. Resource guard 214 provides the authorization query (auth. query*) to authorization engine 218. Authorization engine 218 uses the authorization query and the assertion context in an evaluation algorithm to produce an authorization decision. The authorization decision (auth. dcn.*) is returned to resource guard 214. Whether entity 208 is granted access* to resource 110 by resource guard 214 is dependent on the authorization decision. If the authorization decision is affirmative, then access is granted. If, on the other hand, the authorization decision issued by authorization engine 218 is negative, then resource guard 214 does not grant entity 208 access to resource 110.
The authorization process can also be audited using semantics that are complementary to the authorization process. The auditing may entail monitoring of the authorization process and/or the storage of any intermediate and/or final products of, e.g., the evaluation algorithm logically performed by authorization engine 218. To that end, security policy 220 provides to authorization engine 218 an audit policy* from audit policy 226. At least when auditing is requested, an audit record* having audit information may be forwarded from authorization engine 218 to audit log 216. Alternatively, audit information may be routed to audit log 216 via resource guard 214, for example, as part of the authorization decision or separately.
Generally, a device 102 may represent any computer or processing-capable device, such as a client or server device; a workstation or other general computer device; a PDA; a mobile phone; a gaming platform; an entertainment device; one of the devices listed above with reference to
In a described implementation of device 102, I/O interfaces 404 may include (i) a network interface for communicating across network 104, (ii) a display device interface for displaying information on a display screen, (iii) one or more man-machine interfaces, and so forth. Examples of (i) network interfaces include a network card, a modem, one or more ports, and so forth. Examples of (ii) display device interfaces include a graphics driver, a graphics card, a hardware or software driver for a screen or monitor, and so forth. Printing device interfaces may similarly be included as part of I/O interfaces 404. Examples of (iii) man-machine interfaces include those that communicate by wire or wirelessly to man-machine interface devices 402 (e.g., a keyboard, a remote, a mouse or other graphical pointing device, etc.).
Generally, processor 406 is capable of executing, performing, and/or otherwise effectuating processor-executable instructions, such as processor-executable instructions 410. Media 408 is comprised of one or more processor-accessible media. In other words, media 408 may include processor-executable instructions 410 that are executable by processor 406 to effectuate the performance of functions by device 102.
Thus, realizations for security-related implementations may be described in the general context of processor-executable instructions. Generally, processor-executable instructions include routines, programs, applications, coding, modules, protocols, objects, components, metadata and definitions thereof data structures, application programming interfaces (APIs), schema, etc. that perform and/or enable particular tasks and/or implement particular abstract data types. Processor-executable instructions may be located in separate storage media, executed by different processors, and/or propagated over or extant on various transmission media.
Processor(s) 406 may be implemented using any applicable processing-capable technology. Media 408 may be any available media that is included as part of and/or accessible by device 102. It includes volatile and non-volatile media, removable and non-removable media, and storage and transmission media (e.g., wireless or wired communication channels). For example, media 408 may include an array of disks/flash memory/optical media for longer-term mass storage of processor-executable instructions 410, random access memory (RAM) for shorter-term storing of instructions that are currently being executed, link(s) on network 104 for transmitting communications (e.g., security-related data), and so forth.
As specifically illustrated, media 408 comprises at least processor-executable instructions 410. Generally, processor-executable instructions 410, when executed by processor 406, enable device 102 to perform the various functions described herein, including those actions that are illustrated in the various flow diagrams. By way of example only, processor-executable instructions 410 may include a security token 204, at least one of its assertions 206, an authorization context module 212, a resource guard 214, an audit log 216, an authorization engine 218, a security policy 220 (e.g., a trust and authorization policy 222, an authorization query table 224, and/or an audit policy 226, etc.), some combination thereof, and so forth. Although not explicitly shown in
This section describes example characteristics of an implementation of a security policy assertion language (SecPAL). The SecPAL implementation of this section is described in a relatively informal manner and by way of example only. It has an ability to address a wide spectrum of security policy and security token obligations involved in creating an end-to-end solution. These security policy and security token obligations include, by way of example but not limitation; describing explicit trust relationships; expressing security token issuance policies; providing security tokens containing identities, attributes, capabilities, and/or delegation policies; expressing resource authorization and delegation policies; and so forth.
In a described implementation, SecPAL is a declarative, logic-based language for expressing security in a flexible and tractable manner. It can be comprehensive, and it can provide a uniform mechanism for expressing trust relationships, authorization policies, delegation policies, identity and attribute assertions, capability assertions, revocations, audit requirements, and so forth. This uniformity provides tangible benefits in terms of making the security scheme understandable and analyzable. The uniform mechanism also improves security assurance by allowing one to avoid, or at least significantly curtail, the need for semantic translation and reconciliation between disparate security technologies.
A SecPAL implementation may include any of the following example features: [1] SecPAL can be relatively easy to understand. It may use a definitional syntax that allows its assertions to be read as English-language sentences. Also, its grammar may be restricted such that it requires users to understand only a few subject-verb-object (e.g., subject-verb phrase) constructs with cleanly defined semantics. Finally, the algorithm for evaluating the deducible facts based on a collection of assertions may rely on a small number of relatively simple rules.
[2] SecPAL can leverage industry standard infrastructure in its implementation to ease its adoption and integration into existing systems. For example, an extensible markup language (XML) syntax may be used that is a straightforward mapping from the formal model. This enables use of standard parsers and syntactic correctness validation tools. It also allows use of the W3C XML Digital Signature and Encryption standards for integrity, proof of origin, and confidentiality.
[3] SecPAL may enable distributed policy management by supporting distributed policy authoring and composition. This allows flexible adaptation to different operational models governing where policies, or portions of policies, are authored based on assigned administrative duties. Use of standard approaches to digitally signing and encrypting policy objects allow for their secure distribution. [4] SecPAL enables an efficient and safe evaluation. Simple syntactic checks on the inputs are sufficient to ensure evaluations will terminate and produce correct answers.
[5] SecPAL can provide a complete solution for access control requirements supporting required policies, authorization decisions, auditing, and a public-key infrastructure (PKI) for identity management. In contrast, most other approaches only manage to focus on and address one subset of the spectrum of security issues. [6] SecPAL may be sufficiently expressive for a number of purposes, including, but not limited to, handling the security issues for Grid environments and other types of distributed systems. Extensibility is enabled in ways that maintain the language semantics and evaluation properties while allowing adaptation to the needs of specific systems.
As illustrated at the top row of assertion format 500, an example assertion at a broad level includes: a principal portion 502, a says portion 504, and a claim portion 506. Textually, the broad level of assertion format 500 may be represented by: principal says claim.
At the next row of assertion format 500, claim portion 506 is separated into example constituent parts. Hence, an example claim portion 506 includes: a fact portion 508, an if portion 510, “n” conditional fact1 . . . n portions 508(1 . . . n), and a c portion 512. The subscript “n” represents some integer value. As indicated by legend 524, c portion 512 represents a constraint portion. Although only a single constraint is illustrated, c portion 512 may actually represent multiple constraints (e.g., c1, . . . ,cm). The set of conditional fact portions 508(1 . . . n) and constraints 512(1 . . . m) on the right-hand side of if portion 510 may be termed the antecedent.
Textually, claim portion 506 may be represented by: fact if fact1, . . . , factn, c. Hence, the overall assertion format 500 may be represented textually as follows: principal says fact if fact1, . . . , factn, c. However, an assertion may be as simple as: principal says fact. In his abbreviated, three-part version of an assertion, the conditional portion that starts with if portion 510 and extends to c portion 512 is omitted.
Each fact portion 508 may also be further subdivided into its constituent parts. Example constituent parts are: an e portion 514 and a verb phrase portion 516. As indicated by legend 524, e portion 514 represents an expression portion Textually, a fact portion 508 may be represented by: e verbphrase.
Each e or expression portion 514 may take on one of two example options. These two example expression options are: a constant 514(c) and a variable 514(v). Principals may fall under constants 514(c) and/or variables 514(v).
Each verb phrase portion 516 may also take on one of three example options. These three example verb phrase options are: a predicate portion 518 followed by one or more e1 . . . n portions 514(1 . . . n), a can assert portion 520 followed by a fact portion 508, and an alias portion 522 followed by an expression portion 514. Textually, these three verb phrase options may be represented by: predicate e1 . . . en, can assert fact, and alias e, respectively. The integer “n” may take different values for facts 508(1 . . . n) and expressions 514(1 . . . n).
Generally, SecPAL statements are in the form of assertions made by a security principal. Security principals are typically identified by cryptographic keys so that they can be authenticated across system boundaries. In their simplest form, an assertion states that the principal believes a fact is valid (e.g., as represented by a claim 506 that includes a fact portion 508). They may also state a fact is valid if one or more other facts are valid and some set of conditions are satisfied (e.g., as represented by a claim 506 that extends from a fact portion 508 to an if portion 510 to conditional fact portions 508(1 . . . n) to a c portion 512). There may also be conditional facts 508(1 . . . n) without any constraints 512 and/or constraints 512 without any conditional facts 508(1 . . . n).
In a described implementation, facts are statements about a principal. Four example types of fact statements are described here in this section. First, a fact can state that a principal has the right to exercise an action(s) on a resource with an “action verb”. Example action verbs include, but are not limited to, call, send, read, list, execute, write, modify, append, delete, install, own, and so forth. Resources may be identified by universal resource indicators (URIs) or any other approach.
Second, a fact can express the binding between a principal identifier and one or more attribute(s) using the “possess” verb. Example attributes include, but are not limited to, email name, common name, group name, role title, account name, domain name server/service (DNS) name, internet protocol (IP) address, device name, application name, organization name, service name, account identification/identifier (ID), and so forth. An example third type of fact is that two principal identifiers can be defined to represent the same principal using the “alias” verb.
“Qualifiers” or fact qualifiers may be included as part of any of the above three fact types. Qualifiers enable an assertor to indicate environmental parameters (e.g., time, principal location, etc.) that it believes should hold if the fact is to be considered valid. Such statements may be cleanly separated between the assertor and a relying party's validity checks based on these qualifier values.
An example fourth type of fact is defined by the “can assert” verb. This “can assert” verb provides a flexible and powerful mechanism for expressing trust relationships and delegations. For example, it allows one principal (A) to state its willingness to believe certain types of facts asserted by a second principal (B). For instance, given the assertions “A says B can assert fact( )” and “B says fact( )”, it can be concluded that A believes fact( ) to be valid and therefore it can be deduced that “A says fact( )”.
Such trust and delegation assertions may be (i) unbounded and transitive to permit downstream delegation or (ii) bounded to preclude downstream delegation. Although qualifiers can be applied to “can assert” type facts, omitting support for qualifiers to these “can assert” type facts can significantly simplify the semantics and evaluation safety properties of a given security scheme.
In a described implementation, concrete facts can be stated, or policy expressions may be written using variables. The variables are typed and may either be unrestricted (e.g., allowed to match any concrete value of the correct type) or restricted (e.g., required to match a subset of concrete values based on a specified pattern).
Security authorization decisions are based on an evaluation algorithm (e.g., that may be conducted at authorization engine 218) of an authorization query against a collection of assertions (e.g., an assertion context) from applicable security policies (e.g., a security policy 220) and security tokens (e.g., one or more security tokens 204). Authorization queries are logical expressions, which may become quite complex, that combine facts and/or conditions. These logical expressions may include, for example, AND, OR, and/or NOT logical operations on facts, either with or without attendant conditions and/or constraints.
This approach to authorization queries provides a flexible mechanism for defining what must be known and valid before a given action is authorized. Query templates (e.g., from authorization query table 224) form a part of the overall security scheme and allow the appropriate authorization query to be declaratively stated for different types of access requests and other operations/actions.
Especially in distributed computing systems, security management presents many challenges. It is better if adequate control and understanding of the security policies that are used in such a system are ensured while at the same time responsive and cost effective security management is provided. This creates a tension between centralized and de-centralized management approaches.
Centralized security management approaches can ensure consistent policies across an entire distributed system and provide a single point where all policies are visible. However, such centralized approaches are not generally very responsive as all changes must be processed by a single administrative team and then distributed outward to the enforcement points. De-centralized security management approaches, on the other hand, are typically very responsive with the local administrator for a machine or application able to make desired policy changes. Unfortunately, de-centralized approaches make it more difficult to understand the effective security policy for the entire system at any point in time.
Consequently, there is a need for a hybrid system that allows a degree of centralized control over the general security policy that the distributed system will enforce while still allowing local administrators to make adjustments to local machine and application policies. Existing systems fail to provide a general approach to addressing this administrative need.
Most systems provide little beyond a functional separation based on a set of disjoint policies. With most existing systems, there are distinct security policies for functions such as: trusted external authorities, file system authorization, application function authorization, network channel security, and so forth. Each of these distinct security policies can be configured independently with control limited by who can access the policy data. Tools do exist to allow a centralized administrative team to set these distinct security policies for an entire organization, with some policy being left to local control. However, the granularity of control is inherently limited by functional divisions determined at the time the system and applications were implemented.
There are a few systems that have been designed with hierarchical security policy control as a primary requirement. In one existing system, there are separate enterprise, machine, and user security policies with each of these constrained by the preceding policy or policies. This hierarchical approach is closer to what is needed, but it is still limited in several important ways. First, the hierarchical precedence is built into the system logic and cannot be overridden or altered. Second, the implementation is specific to one particular policy requirement. Third, policy authoring is granted to hard-wired notions of the enterprise administrator, the machine administrator, and the interactive user.
More specifically, security authorization system 600 includes “N” authorization policies 602 in which “N” is a positive integer. The integer “N” is also greater than one any time multiple authorization policies 602 are being combined by policy composition unit 604. As explicitly shown, security authorization system 600 includes first authorization policy 602(1), second authorization policy 602(2), third authorization policy 602(3), . . . , Nth authorization policy 602(N).
In a described implementation, each authorization policy 602 is associated with a resource 110. Policy composition unit 604 combines those authorization policies 602 that are input thereto into composed effective authorization policy 602(*). Security authorization system 600 implements a security language (not separately shown) that ensures that authorization policies 602 may be combined in a manner such that any authorization decision based on the combination is predictable. For example, the asserted rights lack negations and are therefore positive and monotonic. Consequently, such assertions compose in an additive manner.
With reference to
Certain implementations as described herein address either or both of the following: First, approaches to supporting the separation of duties between administrators based on explicitly assigned policy authoring rights are described. Second, logic-based policy language characteristics that enable independently authored policy components to be unambiguously combined are described.
In a described implementation, there is a general purpose approach to managing the distributed authoring of security policy. The approach can provide fine-grained control over who may author specific types of policies. It also defines how those policies can be logically composed to create the effective policy. Furthermore, the approach can achieve these using the same policy approach and semantics as the authored security policies.
One described aspect is the ability to delegate the rights to author specific types of policy statements to other administrators. This provides flexible and effective controls for defining peer relationships (e.g., allowing another administrator to author the same policies) as well as hierarchical relationships (e.g., one administrator can author a constrained subset of policies).
Administrators and principals can both conceptually be considered as being entities. Nevertheless, they are used herein at times to differentiate between different entities by way of different terminology.
As described herein above, a general form of expression for a described security language implementation comports with the following:
This same formulation can be used for policy expressions for policy control. This can facilitate the avoidance of potential ambiguity that may arise when semantic translation is required between policies and other types of expressions. A first example below reflects approaches to supporting the separation of duties between administrators based on explicitly assigned policy authoring rights. A second example below reflects logic-based policy language characteristics that enable independently authored policy components to be unambiguously combined.
For the first example, if a principal A is allowed to write authorization policy statements for files in //mycomputer/public, then A can write policies of the form:
Conversely, if A wants to only allow B to write access policies governing read access for application Foo's files that are located in //mycomputer/public/Foo, B can assert the following:
The second example is directed to a mechanism by which policies authored by multiple authorities can be composed. This is a natural consequence of the logic-based nature of example security language implementations as described herein. It is known that A has authored the following two policy assertions:
It is given that there are two authenticated input assertions for a request to access //mycomputer/public/Foo/data.txt. The two authenticated input assertions are assumed to be asserted by A for simplicity in this example. The two authenticated input assertions are as follows:
It can then be concluded that C has read, write, and delete access to the file because the two authenticated input assertions satisfy both A's and B's authorization policies. On the other hand, if the only input assertion were the second one (i.e., “A says C possesses (group Name, ProjectFoo)”), then it would be concluded that B has read access to the file but not write or delete.
In a described implementation, there is a universe of rights 702 with respect to resource 110. The higher-level administrator has at least some, if not all, rights 704 to author policies with respect to resource 110. These policy authoring rights 704 includes at least three portions: PA, PB, and PC. Although three portions are shown, policy authoring rights may be divided into any arbitrary number of portions.
In this example, the higher-level administrator delegates some of its policy authoring rights 704 to the three lower-level administrators. Specifically, lower-level administrator A is delegated policy authoring rights on portion PA 706(A), lower-level administrator B is delegated policy authoring rights on portion PB 706(B), and lower-level administrator C is delegated policy authoring rights on portion PC 706(C).
In turn, each respective lower-level administrator may issue any number of authorization policies 602 within its respective delegated portion 706 of policy authoring rights 704. In the illustrated example, each lower-level administrator has made one authorization policy 602 apiece. Specifically, lower-level administrator A issues first authorization policy 602(1) covering all or part of policy authoring rights portion PA 706(A). Similarly, lower-level administrator B issues second authorization policy 602(2) covering all or part of policy authoring rights portion PB 706(B). And lower-level administrator C issues third authorization policy 602(3) covering all or part of policy authoring rights portion PC 706(C).
Policy authoring rights 704 of rights on resource 702 may be separated into any number of portions 706. The portions 706 may pertain to any aspect of resource 110. Examples include, but are not limited to, the following. Portions 706 may be directed to different parts of a resource, such as different parts of an overall database. Portions 706 may be directed to different actions or operations that may be performed on a resource. Portions 706 may be directed to different types of principals or groups thereof that may access a resource. Portions 706 may be directed to different policy authoring rights categories. Example policy authoring categories are described herein below with particular reference to
In a described implementation, the higher-level administrator having policy authoring rights 704 delegates all or a part thereof to lower-level administrator A. This delegation grants lower-level administrator A policy authoring rights on portion PA 706(A). Such a policy authoring right assertion may comport generally with a form such as:
In an example, these authorization policies of portion PA include some delegation rights. Lower-level administrator A therefore delegates policy authoring rights portion PB 706(B) to lower-level administrator B. Portion PB likewise includes some delegation rights. Lower-level administrator B therefore delegates policy authoring rights portion PC 706(C) to lower-level administrator C.
Each administrator is therefore able to delegate all or a part of its policy authoring rights when those policy authoring rights include some measure of delegation rights. As shown in block diagram 800, lower-level administrators A, B, and C each issue one respective authorization policy 602(1), 602(2), or 602(3) that is supported by their respective portion 706(A), 706(B), or 706(C) of the policy authoring rights.
As described herein, the variable options for an implementation of the security language enables the different portions and lower-level administrators to be arbitrarily defined. Moreover, the policies are flexible in that they may be changed or adjusted at any time without being bound to some hard-wired approach.
A more specific general format for assertions that enable separation of policy-setting duties and subsequent composition thereof may comport with the following:
Each of these policy authoring rights categories 902 has a corresponding authorization policy 602. Thus, an entity having policy authoring rights in trust category 902(T) may issue a trust authorization policy 602(T). An entity having policy authoring rights in resource access category 902(R) may issue a resource access authorization policy 602(R). An entity having policy authoring rights in delegation category 902(D) may issue a delegation authorization policy 902(D). An entity having policy authoring rights in audit policy 902(A) may issue an audit authorization policy 602(A).
The following descriptions of categories of policy authoring rights are presented by way of example but not limitation. Trust policies usually relate to policies addressing external authorities. Resource access policies usually relate to policies delineating who can access which resource in what manner. Delegation policies usually relate to an ability to grant another a capability to make an assertion. These capabilities may involve an ability to issue authorization policies as described herein. Audit policies usually relate to specifications of what information about a resource authorization decision is to be retained and in what form.
In a described implementation, at block 1002, a portion PA of policy authoring rights with respect to a resource is delegated by an entity to an administrator A. At block 1004, a portion PB of the policy authoring rights with respect to the resource is delegated by the entity to an administrator B.
At block 1006, a portion PC of the policy authoring rights with respect to the resource is delegated by the entity to an administrator C. Each action of delegating may be effected, for example, using at least one assertion issued by the entity in accordance with a security language as described herein. The assertion may include a delegation-directive verb and a delegation fact, with the delegation fact including one or more variables.
At block 1008, in response to an incoming resource request that is directed to a given resource, the policies associated with the given resource are combined into a composed effective policy. For example, one or more policies may be issued by each of administrators A, B, and C by virtue of their having been delegated policy authoring rights. These separate authorization policies 602 may be combined by a policy composition unit 604 into a composed effective authorization policy 602(*).
At block 1010, an authorization decision is made by evaluating an authorization query based on the composed effective policy (and any other related assertions from an assertion context).
In a described implementation, at block 1102, a resource request is received. For example, a resource request directed to a resource 110 may be received. At block 1104, a trust policy authored by a principal A is retrieved. For example, a trust authorization policy 602(1)/602(T) that is associated with a resource 110 and that was authored by an administrator A may be retrieved.
At block 1106, a resource access policy authored by a principal B is retrieved. For example, a resource access authorization policy 602(2)/602(R) that is associated with resource 110 and that was authored by an administrator B may be retrieved.
At block 1108, a delegation policy authored by a principal C is retrieved. For example, a delegation authorization policy 602(3)/602(D) that is associated with resource 110 and that was authored by an administrator C may be retrieved.
At block 1110, an audit policy authored by a principal D is retrieved. For example, an audit authorization policy 602(4)/602(A) that is associated with resource 110 and that was authored by an administrator D may be retrieved.
At block 1112, the different authorization polices from the different policy authoring rights categories may be combined into a composed effective policy. These four different authorization policies may alternatively be from a single category, or there may be two different authorization policies from two different categories. Other permutations are also possible.
Furthermore, the number of authorization policies 602 may be more or less than four. In other words, “N” authorization policies 602(1 . . . N) may be combined in policy composition unit 604 to create composed effective authorization policy 602(*).
At block 1114, an authorization decision is made responsive to the resource request and based on the composed effective policy. For example, an authorization decision may be made by authorization engine 218 responsive to the resource request and based on composed effective authorization policy 602(*).
The devices, actions, aspects, features, functions, procedures, modules, data structures, protocols, components, etc. of
Although systems, media, devices, methods, procedures, apparatuses, mechanisms, schemes, approaches, processes, arrangements, and other implementations have been described in language specific to structural, logical, algorithmic, and functional features and/or diagrams, it is to be understood that the invention defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
