US 7,992,189 B2Grant
System and method for hierarchical role-based entitlements
Issue Date:2011-08-02
•20 Claims
•6 Drawing Sheets
Abstract
A system and method for authorization to adaptively control access to a resource, comprising the steps of providing for the mapping of a principal to at least one role, wherein the at least one role is hierarchically related to the resource; providing for the evaluation of a policy based on the at least one role; and providing for the determination of whether to grant the principal access to the resource based on the evaluation of the policy.
Metadata
Assignee
- Oracle International Corporation
Inventors
- Philip B. Griffin
- Manish Devgan
- Alex Toussaint
- Rod McCauley
Application Information
Application Number:US 12/536,183
Filing Date:2009-08-05
Priority Date:2003-02-14
Art Unit:2434
Classifications
IPC:
H04L29/06
Patent Drawings (6 sheets)
Description
Cross-References
[0001] This Application claims priority to and is a Continuation of U.S. patent application Ser. No. 10/367,177 filed on Feb. 14, 2003, which is related to the following co-pending applications: U.S. patent application Ser. No. 10/367,462, filed on Feb. 14, 2003; U.S. patent application Ser. No. 10/367,190, filed on Feb. 14, 2003; and U.S. patent application Ser. No. 10/366,778, filed on Feb. 14, 2003, each of which is hereby incorporated by reference in its entirety.
Copyright Notice
[0002] A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
Field of the Disclosure
[0003] The present invention disclosure relates to authorization and control of resources in an enterprise application.
Background
[0004] Enterprise applications can increase the availability of goods and services to customers inside and outside of an organization. One issue that accompanies deployment of an enterprise application is authorization or access control. Both customers and system administrators need to be privileged to perform certain actions (e.g., modifying a customer account) or to gain access to certain enterprise application. Typical authorization systems can be complex and time consuming to implement and maintain, especially if they are tied closely to the business logic in an enterprise application.
Brief Description of the Drawings
[0005] FIG. 1 is an illustration of a exemplary resource hierarchy in accordance to one embodiment of the invention.
[0006] FIG. 2 is the exemplary hierarchy FIG. 1 further illustrating roles and security policies.
[0007] FIG. 3 is a diagram of an authorization system in accordance to one embodiment of the invention.
[0008] FIG. 4 is an illustration of a delegation role hierarchy in accordance to one embodiment of the invention.
[0009] FIG. 5 is an illustration of exemplary delegation security policies in one embodiment of the invention.
Detailed Description
[0010] The invention is illustrated by way of example and not by way of limitation in the figures of the accompanying drawings in which like references indicate similar elements. It should be noted that references to “an” or “one” embodiment in this disclosure are not necessarily to the same embodiment, and such references mean at least one.
[0011] In one embodiment, an enterprise application includes one or more resources that facilitate the performance of business, scientific or other functions and tasks. In another embodiment, an enterprise application can be a Java™ 2 Enterprise Edition (J2EE) deployment unit that bundles together Web Applications, Enterprise Java™ Beans and Resource Adaptors into a single deployable unit. The Java™ programming language and its run-time libraries and environment are available from Sun Microsystems, Inc., of Santa Clara, Calif. Enterprise applications can include software, firmware and hardware elements. Software, firmware and hardware can be arbitrarily combined or divided into separate logical components. Furthermore, it will be apparent to those skilled in the art that such components, irregardless of how they are combined or divided, can execute on the same computer or can be arbitrarily distributed among different computers connected by one or more networks.
[0012] In one embodiment, a resource can correspond to any person, place or thing, including an object or an entity (e.g., a network, a computer, a computer user, a bank account, an electronic mail message, aspects of a computer operating system such as virtual memory, threads and file storage, etc.), a method or a process (e.g., balancing a checkbook, installing a device driver, allocating virtual memory, deleting a file, etc.), the occurrence or non-occurrence of an event (e.g., an attempt by a user to logon to a computer, a change in state, etc.) and an organization or association of resources (e.g., lists, trees, maps, hierarchies, etc.).
[0013] In one embodiment, resources can be classified into a hierarchical taxonomy (which itself can be a resource). By way of a non-limiting example, in an enterprise application, it may be necessary to refer to a particular resource such as a booklet. In order to reference the booklet, one needs to know which web page it is on, which portal the web page belongs to, which web application (or “web app”) owns the web page, and which domain the web app belongs to. Each of these components is considered a resource and can be described as a resource path (e.g., a sequence of components separated by slashes):
-
- [0014] domain/web_app/portal/desktop/page/booklet
[0015] The first resource is domain which lies at the “top” of the resource hierarchy. Working down the hierarchy, the next component is web_app. The web_app is a “child” or “descendent” of domain and domain is a “parent” of web_app. The domain is superior to web_app and web_app is inferior to domain. Likewise, portal is a child of web_app and a parent of desktop. The page is a child of desktop with booklet as its child. The depth of the resource is the number of components in its path. For example, the depth of booklet is six (assuming that we are counting from 1) and the depth of portal is three. In one embodiment, the depth of a resource can be unlimited. In one embodiment, a resource can have properties or capabilities. By way of a non-limiting example, a booklet resource could have the ability to be customized by an end-user. The capability could be appended to the hierarchy as follows:
-
- [0016] domain/web_app/portal/desktop/page/booklet.customize
[0017] FIG. 1 is an illustration of an exemplary resource hierarchy in accordance to one embodiment of the invention. By way of a non-limiting example, this hierarchy can represent resources within an enterprise application. Web App 1 and Web App 2 are Web applications. A Web application resource is a part of an enterprise application that is accessible on the World Wide Web. Portal 1 and Portal 2 are portal resources and are children of Web App 1. Portal 3 is a child of Web App 2. In one embodiment, Web App 1 and Web App 2 can be children of one or more enterprise applications (not shown) which can be children of one or more domains (not shown). A portal is a point of access to data and applications that provides a unified and potentially personalized view of information and resources. Typically, a portal is implemented as one or more pages on a website (Page 1, Page 2, Page A, Page B, Page X and Page Y. Portal pages can integrate many elements, such as applications, live data feeds, static information and multimedia presentations.
[0018] Desktop A, Desktop B and Desktop C contain one or more views of a portal that have been customized for a particular user or group of users. Pages within each desktop can contain portlets (Portlet A, Portlet B, and Portlet C and booklets (Booklet 1 and Booklet 2). A portlet is a self-contained application that renders itself on a portal page. In one embodiment, a booklet is a collection of one or more pages or booklets. Resource Web App 1/Portal 1/Desktop A/Page 2/Booklet 1/Page A has a capability Cap 3. Likewise, Web App 1/Portal 1/Desktop A/Page 2/Booklet 1/Booklet 2 has a capability Cap 4 and Web App 1/Portal 1/Desktop A/Page 2/Booklet 1/Booklet 2/Page Y/Portlet A has capabilities Cap 1 and Cap 2.
[0019] Enterprise applications can control access to their resources and/or capabilities through the use of entitlements. In one embodiment, evaluation of an entitlement consists of determining a security policy by dynamically associating one or more roles with a principal. In one embodiment, a role can be based on rules that take into account information including knowledge about the principal, knowledge about a communication session, the current state of the system, and/or any other relevant information.
[0020] In one embodiment, a user represents a person who uses an enterprise application. A group can be an arbitrary collection of users. In one embodiment, members of a group share common traits such as job title, etc. A process can be a software or firmware computer program or portion thereof of any granularity (e.g., a task, thread, lightweight process, distributed object, Enterprise Java™ Bean, or any other computing operation). Users, groups and processes can be considered subjects. Subjects can be authenticated based on providing adequate proof (e.g., password, social security number, etc.) to an authentication system. Once authenticated, a subject can be considered a principal for purposes of evaluating entitlements. A principal is an identity assigned to a user, group or process as a result of authentication. A principal can also represent an anonymous user, group or process (e.g., a subject that has not been authenticated).
[0021] In one embodiment, a role definition contains one or more expressions that evaluate to true or false when evaluated for a given principal in a given context. In another embodiment, an expression can evaluate to a degree of certainty that access to a resource should be granted. Expressions may be nested within each other and can contain functions, arithmetic or logical operators, etc. In one embodiment contain functions, expressions are combined (e.g., with Boolean operators such as “and”, “or”, and “not”) to form a Boolean expression that evaluates to true or false. If a role evaluates to true, then the principal in question is considered to satisfy the role.
[0022] Role expressions can be dynamically evaluated against a principal attempting to access a resource in a given context. A context can contain any information relevant to making a determination of whether a principal belongs in a role. By way of a non-limiting example, a context can include any of a principal's attributes (e.g., name, age, address, etc.) and/or information about a communication session. In another embodiment, a context can include information from a hypertext transfer protocol (“HTTP”) or hypertext transfer protocol (secure) (HTTPS) request. This information can pertain to character encoding, remote user, authorization scheme, content length, server port, context path, request URI, request method, scheme, servlet path, content type, remote host, request protocol, locale, server name, remote address, query string, path information, etc. It will be apparent to those skilled in the art that a context can include any information which is relevant to evaluating an expression.
[0023] In one embodiment, expressions can include predicates. The invention disclosed herein is not limited to the present predicates discussed. A user predicate evaluates to true if the principal in question is the principal supplied as an argument to the predicate. The group predicate evaluates to true if the principal in question is a member of the specified group.
[0024]
| TABLE 1 | |
|---|---|
| Exemplary Roles | |
| ROLE | EXPRESSION |
| Anonymous | Satisfied by all principals |
| BankManager | (User = Donna) |
| CustomerService | (User = Michael or Peter) or (Group = BankTellers) |
| LoanOfficer | (Group = Associate) and (Group = TrainingLevel2) |
| and not (User = Bob) | |
| BankManager | (User = Donna) and ((10/14/02 <= |
| currentDate <= 10/25/02) or | |
| (11/14/02 <= currentDate <= 11/25/02)) | |
| Software | (Segment = JavaDeveloper) |
| SysAdmin | ((User = Donna) and ((10/14/02 <= |
| currentDate <= 10/25/02) or | |
| (11/14/02 <= currentDate <= 11/25/02))) or | |
| (Segment = SystemAdministrator) | |
[0025] Table 1 illustrates seven exemplary roles and their accompanying expressions. In one embodiment, the role “Anonymous” is a special role that is always satisfied. In another embodiment, the role of “Anonymous” is satisfied by an unauthenticated principal. The role of “BankManager” is met by a principal that is authenticated as user “Donna”. The role of “CustomerService” is fulfilled by a principal authenticated as “Michael” or “Peter”, or belonging to group “BankTellers”. The “LoanOfficer” role is met by a principal that is a member of both the “Associate” group and the “TrainingLevel2” group, but is not “Bob”. Roles can also be dynamic. By way of a non-limiting example, a role can be date and/or time dependent. In one embodiment, a time period can be specified using the currentDate predicate. The role of “BankManager” can be fulfilled by “Donna”, but only between Oct. 14, 2002-Oct. 25, 2002 or Nov. 14, 2002-Nov. 25, 2002. It will be apparent to those skilled in the art that many such date or time predicates are possible (e.g., a predicate that is based on a date and a time, or one that is based on time only, etc.).
[0026] In addition to the predicates discussed above, a segment predicate (hereafter referred to as a “segment”) can also be included in a role definition. A segment evaluates to true if the principal in question satisfies the segment's criteria. A segment can be defined in terms of one or more expressions or conditions which can be nested and include logical operators, mathematical operations, method calls, calls to external systems, function calls, etc. In another embodiment, a segment can be specified in plain language. By way of a non-limiting example:
[0027]
| When all of these conditions apply, the principal is a | |
| JavaDeveloper: | |
| Developer is equal to True | |
| Skill level is equal to ‘High’ | |
| Preferred language is equal to ‘Java’ | |
[0028] In this example, the segment being described is “ExperiencedJavaDeveloper”. The condition “Developer is equal to True” will evaluate to true when information contained in or referenced through a context indicates that the principal in question is a user in the software development department of an organization. Likewise, the other conditions (“Skill level is equal to ‘High’”, “Preferred language is equal to ‘Java’”) could similarly be evaluated using information from or referenced through a context. In another embodiment, a condition can pertain to information about a communication session. It will be apparent to those skilled in the art that a condition can be based on any information, whether the information is connected with a particular principal or not. If the segment as a whole evaluates to true, the principal is said to have satisfied the segment. In Table 1, by way of a non-limiting example, the role of “Software” is met by a principal that satisfies the “JavaDeveloper” segment.
By way of a further non-limiting example:
[0029]
| When all of these conditions apply, the principal is a | |
| SystemAdministrator: | |
| TimeofDay is between 12:00am and 7:00am | |
| SystemLoad is ‘Low’ | |
| AdminSkillLevel is at least 5 | |
[0030] In this example, two conditions (“TimeofDay is between 12:00 am and 7:00 am” and “SystemLoad is ‘Low’”) are based on information unrelated to a particular principal. The segment evaluates to true for the principal in question if it is the middle of the night, the system is not busy, and the principal has level 5 administration skills. In Table 1, by way of a non-limiting example, the role of “SysAdmin” is met by “Donna”, but only between Oct. 14, 2002-Oct. 25, 2002 or Nov. 14, 2002-Nov. 25, 2002, or by a principal that satisfies the “SystemAdministrator” segment.
[0031] In one embodiment, a segment can be persisted in Extensible Markup Language (XML). XML is a platform independent language for representing structured documents. Retrieving information stored in an XML document can be time consuming since the text comprising the XML document must be parsed. To save time, in another embodiment once a XML document representing a segment has been parsed, the information extracted therefrom can be cached to avoid the need to parse the file again.
[0032] FIG. 2 is the exemplary hierarchy of FIG. 1 further illustrating roles and security policies. Roles are designated by the letter ‘R’ followed by a parenthetical list of one or more roles. Likewise, policies are designated by the letter ‘P’ followed by a parenthetical list including a set of roles and an optional capability to which the policy applies. If no capability is present, the policy applies to the resource as a whole. In one embodiment, roles can be considered global in scope or can be associated with a particular resource. A global role is considered within the scope of any resource. In one embodiment, a role associated with a resource is within the scope of that resource. In another embodiment, the role is within the scope of the resource and all of its descendents. In yet another embodiment, the role is within the scope of the resource and all of its descendents unless a role with the same name is associated with a descendent. In this way, a “more local” role occludes a “less local” role of the name.
[0033] In FIG. 2 , the role Anonymous is associated with the resource Web App 1. In one embodiment, Anonymous is within the scope of Web App 1 and all resources beneath it in the hierarchy. Role G is associated with resource Desktop A and as such, is within the scope of Desktop A and its descendents. Role S is associated with resource Page A. Since Page A has no children (i.e., the attribute Cap 3 does not count as a child), the scope of role S is limited to Page A. Resource Booklet 2 is associated with roles T and U. In one embodiment, role T is within the scope of Booklet 2 and all of its descendents but the same does not hold true for role U. Since a descendent of Booklet 2 (i.e., Page Y) is associated with another role by the same name, the role U associated with Booklet 2 is only within the scope of Booklet 2 and Page X. In one embodiment, the role U associated with Page Y however is within the scope of all of the descendents of Page Y (i.e., Portlet A, Portlet B, and Portlet C). Roles V and Ware within the scope of Portlet A.
[0034] In one embodiment, a security policy (hereinafter referred to as a “policy”) is an association between a resource, a set of roles, and an optional capability. Generally, speaking, a policy grants access to the resource for all principals for which the set of roles evaluates to true. In one embodiment, a policy is satisfied if any of its roles evaluate to true for a give principal. In another embodiment, a policy is satisfied if all of its roles evaluate to true for a given principal. In another embodiment, a security policy integrity system can prevent removing or deleting roles that have policies which depend on them. Although one of skill in the art will recognize that there are many ways to implement such a system, one approach would be to keep track of the number of policies that depend on a particular role by suing a reference count. Only when the reference count is equal to zero will the particular role be eligible for removal.
[0035] In yet a further embodiment, a policy's set of roles can be an expression including Boolean operators, set operators and roles for operands. A policy can be expressed as the tuple <resource, roles, [capability]>, wherein resource specifies the name of a resource and roles specifies a set of roles, and capability is an optional capability. While a policy is predicated on one or more roles, roles are predicated on users and groups. Therefore, one of skill in the art will appreciate that policies are in essence predicated on users, groups, and/or segments. By way of illustration, there are four policies illustrated in FIG. 2 :
-
- [0036] P1=<Web App 1, {Anonymous}>
- [0037] P2=<Web App 1/Portal 1/Desktop A/Page 2, {G}>
- [0038] P3=<Web App 1/ . . . /Page Y/Portlet A, {W, T}, Cap 1>
- [0039] P4=<Web App 1/ . . . /Page Y/Portlet A, {U, G, Anonymous}, Cap 2>
[0040] By way of a non-limiting illustration, assume a principal p attempts to access resource Cap 1. In order to do so, the security policy P3 on Cap 1 requires that p satisfy either role W or T. In one embodiment, all roles within the scope of Cap 1 (i.e., Anonymous, G, T, U, U, V, and W) are determined for p. If any of the roles that p satisfies match W or T, P3 is likewise satisfied and access to Cap 1 is granted for p.
[0041] By way of a further non-limiting illustration, assume principal p attempts to access capability Cap 2 for resource Portlet A. In order to do so, the security policy P4 on Cap 2 requires that p satisfy one of the roles U, G or Anonymous. In one embodiment, all roles within the scope of Portlet A (i.e., Anonymous, G, T, U, V and U) are determined for p. Note that in one embodiment, the role U associated with resource Booklet 2 is not in the scope of Portal A. Instead, the role having the same name but associated with the more “local” resource Page Y occludes it. Thus, if any of the roles that p satisfies match U, G or Anonymous, P4 is satisfied and access to Cap 2 is granted for p. However, since in one embodiment every principal satisfies the role Anonymous, P4 will always be satisfied.
[0042] By way of a further non-limiting example, assume p attempts to access capability Cap 4 associated with resource Booklet 2. This resource has no policy. In one embodiment, access will be denied. In another embodiment, access will be granted. In yet a further embodiment, access will be granted if p satisfies a policy in a parent resource of Booklet 2. Table 2 is a non-limiting illustration of a parent policy search using the resource hierarchy of FIG. 2 . It is important to note, however, that the particular search order or the method of searching is irrelevant for purposes of this disclosure. In yet another embodiment, a resource without an explicit policy can include information regarding its parent policy and thus circumvent the need for a search.
[0043]
| TABLE 2 | |||
|---|---|---|---|
| Exemplary Policy Search | |||
| SEARCH | CAPA- | POLICY | |
| STEP | CURRENT RESOURCE | BILITY | FOUND? |
| 1 | Web App 1/Portal 1/Desktop A/Page | Cap 4 | No |
| 2/Booklet IBooklet 2 | |||
| 2 | Web App 1/Portal 1/Desktop A/Page | No | |
| No 2/Booklet I/Booklet 2 | |||
| 3 | Web App 1/Portal I/Desktop. A/Page | Cap 4 | No |
| 2/Booklet 1 | |||
| 4 | Web App 1/Portal 1/Desktop A/Page | ||
| 2/Booklet 1 | |||
| 5 | Web App 1/Portal 1/Desktop A/Page 2 | Cap 4 | No |
| 6 | Web A 1/Portal 1/Desktop A/Page 2 | Yes | |
[0044] In one embodiment, the search for a policy proceeds as follows. The starting point for the search is the resource that owns the capability (i.e., Booklet 2) to which the principal is attempting to access (i.e., Cap 4). This is the current resource. If no policy exists at the current resource for the specific capability, in Step 2 we determine whether or not there is a policy merely on the resource itself. If no policy is found, in Step 3 the current resource is set equal to its parent (i.e., Booklet 1). If the current resource has no policy for Cap 4, we determine whether or not there is a policy on Booklet 1 itself. If no policy is found, in Step 5 the current resource is set equal to its parent (i.e., Page 2). If no policy is found for Cap 4 at the current resource, we determine in Step 6 whether or not there is a policy on Page 2 itself. Since this is the case, the search stops at Step 6. Web App 1/Portal 1/Desktop A/Page 2 has policy P2. Therefore if p satisfies role G, access to Cap 4 is granted for p.
[0045] In another embodiment, capabilities are associated with particular resource types. For example, booklets may have a type of capability (e.g., Cap 4) that is not compatible with or available for other resource types (e.g., pages or desktops). Therefore, when searching for a policy as in Table 2, if a capability is not compatible for the current resource, that resource can, be omitted from the search. In yet a further embodiment, if a policy is not found for a given resource type, a global library could be consulted to determine if there are any applicable global policies.
[0046] In another embodiment, roles and policies can reside in their own hierarchies, apart from the primary resource hierarchy. For applications that do not need to associate roles and/or policies with resources in the primary hierarchy, such an approach can allow for a shallow role and/or policy tree, perhaps only with a single level. Searching smaller hierarchies can potentially reduce the time it takes to find all roles within scope and locate a policy.
[0047] FIG. 3 is a diagram of an authorization system in accordance to one embodiment of the invention. Although this diagram depicts objects as functionally separate, such depiction is merely for illustrative purposes. It will be apparent to those skilled in the art that the objects portrayed in FIG. 3 can be arbitrarily combined or divided into separate software, firmware or hardware components. Furthermore, it will also be apparent to those skilled in the art that such components, irregardless of how they are combined or divided, can execute on the same computer or can be arbitrarily distributed among different computers connected by one or more networks.
[0048] In one embodiment, security framework 300 is a modular security architecture having a published interface that allows for plug-in components. By way of a non-limiting example, a framework can be a library, a set of interfaces, distributed objects, or any other means for software, firmware and/or hardware components to intercommunicate. Connected to the framework are one or more role mapper components (302-306). A role mapper maps (e.g., determines which roles are appropriate) a principal to one or more roles based on a resource hierarchy and a context. Each role mapper can implement its own specialized algorithms in this regard and use information and resources beyond that which is provided by the framework. Also connected to the framework are one or more authorizers (308, 310 and 312). An authorizer is responsible for determining if access to a resource can be granted based on whether a principal satisfies a resource policy. Each authorizer can implement its own specialized algorithms in this regard and use information and resources beyond that which is provided by the framework. Finally, adjudicator 314 resolves any difference in outcome between authorization modules and returns a final result (e.g., “grant”, “deny” or “abstain”). In one embodiment, the adjudicator can take the logical “or” of the final results such that if any result is a “grant”, the outcome of adjudication is “grant”. In another embodiment, the adjudicator can take the logical “and” of the final results such that is any result is a “deny”, the outcome of adjudication is “deny”. In yet a further embodiment, the adjudicator can use a weighted average or other statistical means to determine the final outcome.
[0049] A process can interact with the framework in a number of ways which will be apparent to those skilled in the art. In one embodiment, a calling process provides a resource access request (1) to the framework 300. This request can include information about the principal, the resource to which access is requested, and any context information. In another embodiment, the request can contain references to this information. This information is then provided to one or more role mappers (2) by the framework. Each role mapper determines which roles are appropriate for the principal based on their own criteria. In another embodiment, each role mapper can implement a cache to speed up searching for roles. Rather than traversing a resource tree to find all roles within scope, each role mapper can cache roles that were previously retrieved from a resource tree based on a key comprising the resource to which access is requested and the principal. After the initial retrieval from a resource tree, subsequent roles for a given resource-principal combination can be taken directly from the cache.
[0050] A set of satisfied roles is then returned to the framework in (3). The framework can provide the information from (1) and (3) to the authorizer modules in (4). The authorization modules individually determine whether or not a policy is satisfied based on this information and their own criteria. In another embodiment, each authorizer can implement a cache to speed up searching for policies. Rather than traversing a resource tree to find a policy within scope, each authorizer can cache policies that were previously retrieved from a resource tree based on a key comprising the resource to which access is requested and the principal. After the initial retrieval from a resource tree, subsequent policies for a given resource-principal combination can be taken directly from the cache. The authorizer results (e.g., in terms of grant or deny decisions) are provided to the framework in (5) and provided to the adjudicator in (6). The adjudicator makes a final decision which it provides to the framework in (7). The framework then provides this decision to the calling process in (8).
[0051] As enterprise applications grow large and complex, so do the number of administrative tasks. One way to reduce the number of tasks that a system administrator is responsible for is to distribute the tasks among a number of administrators. Delegated administration allows a hierarchy of roles to manage administrative capabilities. By way of a non-limiting example, administrative capabilities can include the ability to manage customer accounts, the ability to delegate administrative capabilities, the ability to customize or personalize user interface elements (e.g., portals, booklets, desktops, portlets, etc.), the ability to perform administration of an enterprise application, etc. In another embodiment, any capability or property can be delegated. In one embodiment, delegation is an act whereby a principal in one role enables another hierarchically inferior role to have an administrative capability and/or further delegate an administrative capability. In one embodiment, a delegation role is identical to a role and can thusly be defined using predicates (e.g., user, group, currentDate, segment, etc.).
[0052] FIG. 4 is an illustration of a delegation role hierarchy in accordance to one embodiment of the invention. In one embodiment, delegation roles can be organized into a delegation hierarchy to control the extent of delegation. In one embodiment, delegation roles can be associated with a single top-level resource, such as an enterprise application, and a delegation role hierarchy can be maintained separate from the resource hierarchy. A security policy can be associated with the enterprise application to limit which principals are allowed to alter the role definitions and the separately maintained role hierarchy. In another embodiment, a fictitious resource hierarchy that mirrors an arbitrary delegation role hierarchy can be utilized whereby each delegation role is associated with a resource corresponding to the delegation role's proper position in the hierarchy. A security policy can be associated with each resource to control which principals can modify the associated role. A security policy at the root of the hierarchy could limit which principals are allowed to modify the fictitious hierarchy itself.
[0053] Referring again to FIG. 4 , role Admin_Role is at the top of the delegation role hierarchy. In one embodiment, the principal in this role has no limitations in its administrative capabilities or delegation authority. By way of a non-limiting example, a principal in the Admin_Role can modify the definition of delegation roles and the delegation hierarchy. In one embodiment, a principal in a delegation role can delegate administrative capabilities only to roles beneath it in a delegation hierarchy. Admin_Role has two children, A_Role and B_Role. A_Role has one child, C_Role, which as two children: D_Role and E_Role. By way of a non-limiting example, Admin_Role can delegate to all other roles beneath it in the hierarchy. Likewise, A_Role can delegate to C_Role, D_Role and E_Role. Whereas C_Role can only delegate to D_Role and E_Role. The leaves of the tree, D_Role, E_Role and B_Role cannot delegate since they have no children. In another embodiment, a node in the hierarchy can be related to more than one parent. This allows more than one superior role to delegate to an inferior role.
[0054] In one embodiment, a delegation can be represented by a security policy. The policy is associated with a delegated resource/capability and is based on the role to which the resource/capability was delegated. FIG. 5 is an illustration of exemplary delegation security policies in one embodiment of the invention. Assume for this example that the delegation hierarchy of FIG. 4 holds. Notice that the root resource in FIG. 5 , Enterprise App 1 is associated with the following roles: Admin_Role, A_Role, B_Role, C_Role, D_Role and E_Role. The hierarchy depicted in FIG. 5 could include other resources, roles and policies, but is limited for illustrative purposes. In one embodiment, a delegation creates a policy on the resource who's capability is being delegated. For example, resource Web App 1 has an Admin capability and an associated security policy P(D_Role). A principal in the role of C_Role, A_Role or Admin_Role created this policy by delegating to D_Role the Admin capability for Web App 1. (It will be apparent to those of skill in the art that any capability can be delegated; i.e., not just Admin.) Thus, principals that satisfy D_Role can perform administration of Web App 1. However, since Web App 1 does not have a delegation capability, a principal satisfying the D_Role cannot further delegate Web App 1's Admin capability.
[0055] Resource Desktop A has two capabilities, Admin and Delegate, each of which has a policy. The policy P(A_Role) attached to both indicates that a principal in the role of Admin_Role delegated to Role_A the capability to both administer Desktop A and further delegate this capability. Thus, a principal in Role_A can further delegate both the Admin and Delegate capabilities to hierarchically inferior delegation roles (i.e., C_Role, D_Role and E_Role). For example, resource Desktop B has a capability Admin that has a policy P(C_Role). This policy was put in place by a principal in the role of A_Role or Admin_Role. A principal in the role of C_Role will be able to administer Desktop B, but will not be able to further delegate this capability.
[0056] In one embodiment, a delegation to a node that is already delegated to by a principal in a hierarchically superior delegation role is not permitted. Referring to FIGS. 4 and 5 , and by way of a non-limiting illustration, if resource Portal 2 had a policy P(A_Role), a principal in the role of C_Role would not be able to delegate Portal 2 since it had been delegated to a role superior to C_Role (i.e., A_Role).
[0057] In another embodiment, aspects of user group administration can be delegated. By way of a non-limiting example, user groups can by organized into a hierarchy by viewing them as children of an enterprise application resource. Capabilities that can be delegated include: user profile administration, the ability to view the members of group, and the ability to create, update and remove users and groups.
[0058] One embodiment may be implemented using a conventional general purpose or a specialized digital computer or microprocessor(s) programmed according to the teachings of the present disclosure, as will be apparent to those skilled in the those skilled in the software art. The invention may also be implemented by the preparation of integrated circuits or by interconnecting an appropriate network of conventional component circuits, as will be readily apparent to those skilled in the art.
[0059] One embodiment includes a computer program product which is a storage medium (media) having instructions stored thereon/in which can be used to program a computer to perform any of the features presented herein. The storage medium can include, but is not limited to, any type of disk including floppy disks, optical discs, DVD, CD-ROMs, microdrive, and magneto-optical disks, ROMs, RAMS, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.
[0060] Stored on any one of the computer readable medium (media), the present invention includes software for controlling both the hardware of the general purpose/specialized computer or microprocessor, to interact with a human user or other mechanism utilizing the results of the present invention. Such software may include, but is not limited to, device drivers, operating systems, execution environments/containers, and user applications.
[0061] The foregoing description of the preferred embodiments of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations will be apparent to the practitioner skilled in the art. Embodiments were chosen and described in order to best describe the principles of the invention and its practical application, thereby enabling others skilled in the art to understand the invention, the various embodiments and with various modifications that are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalents.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A computer readable medium having instructions stored thereon that when executed by a processor cause a system to:
map a principal to at least one role, wherein the at least one role is hierarchically related to the resource, the resource being part of a resource hierarchy; wherein the resource is a portal, a portlet or a page, the resource inheriting a role from another resource higher in the resource hierarchy;
evaluate a policy based on the at least one role; and
determine whether to grant access to the resource based on the evaluation of the policy;
wherein roles are inherited by resources lower in the resource hierarchy unless the resources lower in the resource hierarchy are associated with roles of the same name, in which case, the role inheritance is overridden.
2. The computer readable medium of claim 1 further comprising instructions which when executed cause the system to:
allow the principal to be an authenticated user, group or process.
3. The computer readable medium of claim 1 wherein:
mapping includes determining whether or not the at least one role is satisfied by the principal.
4. The computer readable medium of claim 1 further comprising instructions which when executed cause the system to:
evaluate the at least one role to true or false for the principal in a context.
5. The computer readable medium of claim 1 wherein:
the at least one role is a Boolean expression that can include at least one of another Boolean expression and a predicate.
6. The computer readable medium of claim 5 wherein:
the predicate is evaluated against the principal and a context.
7. The computer readable medium of claim 5 wherein:
the predicate is one of user, group, time and segment.
8. The computer readable medium of claim 7 wherein:
the segment predicate is specified in plain language.
9. The computer readable medium of claim 1 wherein:
the policy is an association between the resource and a set of roles.
10. The computer readable medium of claim 9 further comprising instructions which when executed cause the system to:
grant access to the resource if the at least one role is in the set of roles.
11. A computer readable medium have sets of instructions stored thereon which, when executed by a machine, cause the machine to:
evaluate a policy based on at least one role applicable to a principal attempting to access the resource, the resource being part of a resource hierarchy; wherein the resource is a portal, a portlet or a page, the resource inheriting a role from another resource higher in the resource hierarchy;
grant access to the resource based on the evaluation; and
wherein the resource, the policy and the at least one role are hierarchically related;
wherein roles are inherited by resources lower in the resource hierarchy unless the resources lower in the resource hierarchy are associated with roles of the same name, in which case, the role inheritance is overridden.
12. The computer readable medium of claim 11, wherein the sets of instructions when further executed by the machine, cause the machine to allow the principal to be an authenticated user, group or process.
13. The computer readable medium of claim 11, wherein the at least one role is applicable to a principal if the at least one role is satisfied by the principal.
14. The computer readable medium of claim 11 , wherein the sets of instructions when further executed by the machine, cause the machine to evaluate the at least one role to true or false for the principal in a context.
15. The computer readable medium of claim 11, wherein the at least one role is a Boolean expression that includes at least one of (1) another Boolean expression and (2) a predicate.
16. The computer readable medium of claim 15 , wherein the sets of instructions when further executed by the machine, cause the machine to evaluate the predicate against the principal and a context.
17. The computer readable medium of claim 15, wherein the predicate is one of user, group, time and segment.
18. The computer readable medium of claim 17, wherein the segment predicate is specified in plain language.
19. The computer readable medium of claim 11, wherein the policy is an association between the resource and a set of roles.
20. The computer readable medium of claim 19, wherein the sets of instructions when further executed by the machine, cause the machine to grant access to the resource if the at least one role is in the set of roles.
Patent Citations (333)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5173939(A) | 1992-12-01 | Abadi et al. | Applicant |
| US5237614(A) | 1993-08-01 | Weiss | Applicant |
| US5335345(A) | 1994-08-01 | Frieder et al. | Applicant |
| US5341478(A) | 1994-08-01 | Travis, Jr. et al. | Applicant |
| US5347653(A) | 1994-09-01 | Flynn et al. | Applicant |
| US5355474(A) | 1994-10-01 | Thuraisngham et al. | Applicant |
| US5369702(A) | 1994-11-01 | Shanton | Applicant |
| US5426747(A) | 1995-06-01 | Weinreb et al. | Applicant |
| US5481700(A) | 1996-01-01 | Thuraisingham | Applicant |
| US5544322(A) | 1996-08-01 | Cheng et al. | Applicant |
| US5557747(A) | 1996-09-01 | Rogers et al. | Applicant |
| US5619710(A) | 1997-04-01 | Travis, Jr. et al. | Applicant |
| US5627886(A) | 1997-05-01 | Bowman | Applicant |
| US5757669(A) | 1998-05-01 | Christie et al. | Applicant |
| US5797128(A) | 1998-08-01 | Birnbaum | Applicant |
| US5825883(A) | 1998-10-01 | Archibald et al. | Applicant |
| US5826000(A) | 1998-10-01 | Hamilton | Applicant |
| US5826268(A) | 1998-10-01 | Schaefer et al. | Applicant |
| US5848396(A) | 1998-12-01 | Gerace | Applicant |
| US5867667(A) | 1999-02-01 | Butman et al. | Applicant |
| US5872928(A) | 1999-02-01 | Lewis et al. | Applicant |
| US5889953(A) | 1999-03-01 | Thebaut et al. | Applicant |
| US5911143(A) | 1999-06-01 | Deinhart et al. | Applicant |
| US5918210(A) | 1999-06-01 | Rosenthal et al. | Applicant |
| US5941947(A) | 1999-08-01 | Brown et al. | Applicant |
| US5950195(A) | 1999-09-01 | Stockwell et al. | Applicant |
| US5954798(A) | 1999-09-01 | Shelton et al. | Applicant |
| US5956400(A) | 1999-09-01 | Chaum et al. | Applicant |
| US5966707(A) | 1999-10-01 | Van Huben et al. | Applicant |
| US5987469(A) | 1999-11-01 | Lewis et al. | Applicant |
| US5987611(A) | 1999-11-01 | Freund | Applicant |
| US5991877(A) | 1999-11-01 | Luckenbaugh | Applicant |
| US6005571(A) | 1999-12-01 | Pachauri | Applicant |
| US6006194(A) | 1999-12-01 | Merel | Applicant |
| US6014666(A) | 2000-01-01 | Helland et al. | Applicant |
| US6023765(A) | 2000-02-01 | Kuhn | Applicant |
| US6029144(A) | 2000-02-01 | Barrett et al. | Applicant |
| US6029182(A) | 2000-02-01 | Nehab et al. | Applicant |
| US6029196(A) | 2000-02-01 | Lenz | Applicant |
| US6054910(A) | 2000-04-01 | Tada et al. | Applicant |
| US6055515(A) | 2000-04-01 | Consentino et al. | Applicant |
| US6055637(A) | 2000-04-01 | Hudson et al. | Applicant |
| US6058392(A) | 2000-05-01 | Sampson et al. | Applicant |
| US6073242(A) | 2000-06-01 | Hardy et al. | Applicant |
| US6083276(A) | 2000-07-01 | Davidson et al. | Applicant |
| US6088679(A) | 2000-07-01 | Barkley | Applicant |
| US6098173(A) | 2000-08-01 | Elgressy et al. | Applicant |
| US6108687(A) | 2000-08-01 | Craig | Applicant |
| US6122647(A) | 2000-09-01 | Horowitz et al. | Applicant |
| US6141010(A) | 2000-10-01 | Hoyle | Applicant |
| US6141686(A) | 2000-10-01 | Jackowski et al. | Applicant |
| US6148333(A) | 2000-11-01 | Guedalia et al. | Applicant |
| US6154844(A) | 2000-11-01 | Touboul et al. | Applicant |
| US6157924(A) | 2000-12-01 | Austin | Applicant |
| US6158007(A) | 2000-12-01 | Moreh et al. | Applicant |
| US6158010(A) | 2000-12-01 | Moriconi et al. | Applicant |
| US6161139(A) | 2000-12-01 | Win et al. | Applicant |
| US6167407(A) | 2000-12-01 | Nachenberg et al. | Applicant |
| US6167445(A) | 2000-12-01 | Gai et al. | Applicant |
| US6170009(B1) | 2001-01-01 | Mandal et al. | Applicant |
| US6182226(B1) | 2001-01-01 | Reid et al. | Applicant |
| US6182277(B1) | 2001-01-01 | DeGroot et al. | Applicant |
| US6185587(B1) | 2001-02-01 | Bernardo et al. | Applicant |
| US6202066(B1) | 2001-03-01 | Barkley et al. | Applicant |
| US6202157(B1) | 2001-03-01 | Brownlie et al. | Applicant |
| US6202207(B1) | 2001-03-01 | Donohue | Applicant |
| US6209101(B1) | 2001-03-01 | Mitchem et al. | Applicant |
| US6216231(B1) | 2001-04-01 | Stubblebine | Applicant |
| US6226745(B1) | 2001-05-01 | Wiederhold | Applicant |
| US6241608(B1) | 2001-06-01 | Torango | Applicant |
| US6243747(B1) | 2001-06-01 | Lewis et al. | Applicant |
| US6253321(B1) | 2001-06-01 | Nikander et al. | Applicant |
| US6256741(B1) | 2001-07-01 | Stubblebine | Applicant |
| US6260050(B1) | 2001-07-01 | Yost et al. | Applicant |
| US6269393(B1) | 2001-07-01 | Yost et al. | Applicant |
| US6269456(B1) | 2001-07-01 | Hodges et al. | Applicant |
| US6275941(B1) | 2001-08-01 | Saito et al. | Applicant |
| US6285366(B1) | 2001-09-01 | Ng et al. | Applicant |
| US6285985(B1) | 2001-09-01 | Horstmann | Applicant |
| US6292900(B1) | 2001-09-01 | Ngo et al. | Applicant |
| US6295607(B1) | 2001-09-01 | Johnson | Applicant |
| US6301613(B1) | 2001-10-01 | Ahlstrom et al. | Applicant |
| US6304881(B1) | 2001-10-01 | Halim et al. | Applicant |
| US6308163(B1) | 2001-10-01 | Du et al. | Applicant |
| US6317868(B1) | 2001-11-01 | Grimm et al. | Applicant |
| US6321336(B1) | 2001-11-01 | Applegate et al. | Applicant |
| US6327594(B1) | 2001-12-01 | Van Huben et al. | Applicant |
| US6327618(B1) | 2001-12-01 | Ahlstrom et al. | Applicant |
| US6327628(B1) | 2001-12-01 | Anuff et al. | Applicant |
| US6339423(B1) | 2002-01-01 | Sampson et al. | Applicant |
| US6339826(B2) | 2002-01-01 | Hayes, Jr. et al. | Applicant |
| US6341352(B1) | 2002-01-01 | Child et al. | Applicant |
| US6353886(B1) | 2002-03-01 | Howard et al. | Applicant |
| US6360363(B1) | 2002-03-01 | Moser et al. | Applicant |
| US6377973(B2) | 2002-04-01 | Gideon | Applicant |
| US6381579(B1) | 2002-04-01 | Gervais et al. | Applicant |
| US6385627(B1) | 2002-05-01 | Cragun | Applicant |
| US6393474(B1) | 2002-05-01 | Eichert et al. | Applicant |
| US6397222(B1) | 2002-05-01 | Zellweger | Applicant |
| US6397231(B1) | 2002-05-01 | Salisbury et al. | Applicant |
| US6408336(B1) | 2002-06-01 | Schneider et al. | Applicant |
| US6412070(B1) | 2002-06-01 | Van Dyke et al. | Applicant |
| US6412077(B1) | 2002-06-01 | Roden et al. | Applicant |
| US6418448(B1) | 2002-07-01 | Sarkar | Applicant |
| US6430556(B1) | 2002-08-01 | Goldberg et al. | Applicant |
| US6434607(B1) | 2002-08-01 | Haverstock et al. | Applicant |
| US6446200(B1) | 2002-09-01 | Ball et al. | Applicant |
| US6457007(B1) | 2002-09-01 | Kikuchi et al. | Applicant |
| US6460141(B1) | 2002-10-01 | Olden | Applicant |
| US6466239(B2) | 2002-10-01 | Ishikawa | Applicant |
| US6466932(B1) | 2002-10-01 | Dennis et al. | Applicant |
| US6473791(B1) | 2002-10-01 | Al-Ghosein et al. | Applicant |
| US6477543(B1) | 2002-11-01 | Huang et al. | Applicant |
| US6477575(B1) | 2002-11-01 | Koeppel et al. | Applicant |
| US6484177(B1) | 2002-11-01 | Van Huben et al. | Applicant |
| US6484261(B1) | 2002-11-01 | Wiegel | Applicant |
| US6487594(B1) | 2002-11-01 | Bahlmann | Applicant |
| US6510513(B1) | 2003-01-01 | Danieli | Applicant |
| US6519647(B1) | 2003-02-01 | Howard et al. | Applicant |
| US6530024(B1) | 2003-03-01 | Proctor | Applicant |
| US6539375(B2) | 2003-03-01 | Kawasaki | Applicant |
| US6542993(B1) | 2003-04-01 | Erfani | Applicant |
| US6571247(B1) | 2003-05-01 | Danno et al. | Applicant |
| US6574736(B1) | 2003-06-01 | Andrews | Applicant |
| US6581054(B1) | 2003-06-01 | Bogrett | Applicant |
| US6581071(B1) | 2003-06-01 | Gustman et al. | Applicant |
| US6584454(B1) | 2003-06-01 | Hummel et al. | Applicant |
| US6587849(B1) | 2003-07-01 | Mason et al. | Applicant |
| US6587876(B1) | 2003-07-01 | Mahon et al. | Applicant |
| US6615218(B2) | 2003-09-01 | Mandal et al. | Applicant |
| US6618806(B1) | 2003-09-01 | Brown et al. | Applicant |
| US6633538(B1) | 2003-10-01 | Tanaka et al. | Applicant |
| US6654747(B1) | 2003-11-01 | Van Huben et al. | Applicant |
| US6665677(B1) | 2003-12-01 | Wotring et al. | Applicant |
| US6668354(B1) | 2003-12-01 | Chen et al. | Applicant |
| US6671689(B2) | 2003-12-01 | Papierniak | Applicant |
| US6684369(B1) | 2004-01-01 | Bernardo et al. | Applicant |
| US6697805(B1) | 2004-02-01 | Choquier et al. | Applicant |
| US6715077(B1) | 2004-03-01 | Vasudevan et al. | Applicant |
| US6721888(B1) | 2004-04-01 | Liu et al. | Applicant |
| US6728748(B1) | 2004-04-01 | Mangipudi et al. | Applicant |
| US6732144(B1) | 2004-05-01 | Kizu et al. | Applicant |
| US6735586(B2) | 2004-05-01 | Timmons | Applicant |
| US6735701(B1) | 2004-05-01 | Jacobson | Applicant |
| US6738789(B2) | 2004-05-01 | Multer et al. | Applicant |
| US6751659(B1) | 2004-06-01 | Fenger et al. | Applicant |
| US6754672(B1) | 2004-06-01 | McLauchlin | Applicant |
| US6757698(B2) | 2004-06-01 | McBride et al. | Applicant |
| US6757822(B1) | 2004-06-01 | Feiertag et al. | Applicant |
| US6769095(B1) | 2004-07-01 | Brassard et al. | Applicant |
| US6769118(B2) | 2004-07-01 | Garrison et al. | Applicant |
| US6772332(B1) | 2004-08-01 | Boebert et al. | Applicant |
| US6779002(B1) | 2004-08-01 | Mwaura | Applicant |
| US6789202(B1) | 2004-09-01 | Ko et al. | Applicant |
| US6792537(B1) | 2004-09-01 | Liu et al. | Applicant |
| US6832313(B1) | 2004-12-01 | Parker | Applicant |
| US6834284(B2) | 2004-12-01 | Acker et al. | Applicant |
| US6854035(B2) | 2005-02-01 | Dunham et al. | Applicant |
| US6856999(B2) | 2005-02-01 | Flanagin et al. | Applicant |
| US6857012(B2) | 2005-02-01 | Sim et al. | Applicant |
| US6865549(B1) | 2005-03-01 | Connor | Applicant |
| US6873988(B2) | 2005-03-01 | Herrmann et al. | Applicant |
| US6880005(B1) | 2005-04-01 | Bell et al. | Applicant |
| US6889222(B1) | 2005-05-01 | Zhao | Applicant |
| US6901403(B1) | 2005-05-01 | Bata et al. | Applicant |
| US6904454(B2) | 2005-06-01 | Stickler | Applicant |
| US6917975(B2) | 2005-07-01 | Griffin et al. | Applicant |
| US6920457(B2) | 2005-07-01 | Pressmar | Applicant |
| US6922695(B2) | 2005-07-01 | Skufca et al. | Applicant |
| US6931549(B1) | 2005-08-01 | Ananda | Applicant |
| US6934934(B1) | 2005-08-01 | Osborne, II et al. | Applicant |
| US6957261(B2) | 2005-10-01 | Lortz | Applicant |
| US6961897(B1) | 2005-11-01 | Peel et al. | Applicant |
| US6965999(B2) | 2005-11-01 | Fox et al. | Applicant |
| US6970445(B2) | 2005-11-01 | O'Neill et al. | Applicant |
| US6970876(B2) | 2005-11-01 | Hotti et al. | Applicant |
| US6978379(B1) | 2005-12-01 | Goh et al. | Applicant |
| US6985915(B2) | 2006-01-01 | Somalwar et al. | Applicant |
| US6988138(B1) | 2006-01-01 | Alcorn et al. | Applicant |
| US7003578(B2) | 2006-02-01 | Kanada et al. | Applicant |
| US7035879(B2) | 2006-04-01 | Shi et al. | Applicant |
| US7035944(B2) | 2006-04-01 | Fletcher et al. | Applicant |
| US7039176(B2) | 2006-05-01 | Borodow et al. | Applicant |
| US7043685(B2) | 2006-05-01 | Azuma | Applicant |
| US7047522(B1) | 2006-05-01 | Dixon, III et al. | Applicant |
| US7051316(B2) | 2006-05-01 | Charisius et al. | Applicant |
| US7054910(B1) | 2006-05-01 | Nordin et al. | Applicant |
| US7062490(B2) | 2006-06-01 | Adya et al. | Applicant |
| US7062511(B1) | 2006-06-01 | Poulsen | Applicant |
| US7080000(B1) | 2006-07-01 | Cambridge | Applicant |
| US7085755(B2) | 2006-08-01 | Bluhm et al. | Applicant |
| US7089584(B1) | 2006-08-01 | Sharma | Applicant |
| US7093200(B2) | 2006-08-01 | Schreiber et al. | Applicant |
| US7093261(B1) | 2006-08-01 | Harper et al. | Applicant |
| US7093283(B1) | 2006-08-01 | Chen et al. | Applicant |
| US7111321(B1) | 2006-09-01 | Watts, Jr. et al. | Applicant |
| US7124413(B1) | 2006-10-01 | Klemm et al. | Applicant |
| US7134137(B2) | 2006-11-01 | Joshi et al. | Applicant |
| US7174563(B1) | 2007-02-01 | Brownlie et al. | Applicant |
| US7185010(B2) | 2007-02-01 | Morinville | Applicant |
| US7185192(B1) | 2007-02-01 | Kahn | Applicant |
| US7219140(B2) | 2007-05-01 | Marl et al. | Applicant |
| US7251666(B2) | 2007-07-01 | Morinville | Applicant |
| US7269664(B2) | 2007-09-01 | Hutsch et al. | Applicant |
| US7272625(B1) | 2007-09-01 | Hannel et al. | Applicant |
| US7591000(B2) | 2009-09-01 | Griffin | Applicant |
| US7653930(B2) | 2010-01-01 | Griffin | Applicant |
| US2001/0032128(A1) | 2001-10-01 | Kepecs | Applicant |
| US2001/0034771(A1) | 2001-10-01 | Hutsch et al. | Applicant |
| US2001/0039586(A1) | 2001-11-01 | Primak et al. | Applicant |
| US2001/0044810(A1) | 2001-11-01 | Timmons | Applicant |
| US2001/0047485(A1) | 2001-11-01 | Brown et al. | Applicant |
| US2002/0005867(A1) | 2002-01-01 | Gvily | Applicant |
| US2002/0010741(A1) | 2002-01-01 | Stewart et al. | Applicant |
| US2002/0019827(A1) | 2002-02-01 | Shiman et al. | Applicant |
| US2002/0023122(A1) | 2002-02-01 | Polizzi et al. | Applicant |
| US2002/0029296(A1) | 2002-03-01 | Anuff et al. | Applicant |
| US2002/0046099(A1) | 2002-04-01 | Frengut et al. | Applicant |
| US2002/0059394(A1) | 2002-05-01 | Sanders | Applicant |
| US2002/0062451(A1) | 2002-05-01 | Scheidt et al. | Applicant |
| US2002/0067370(A1) | 2002-06-01 | Forney et al. | Applicant |
| US2002/0069261(A1) | 2002-06-01 | Bellare et al. | Applicant |
| US2002/0087571(A1) | 2002-07-01 | Stapel et al. | Applicant |
| US2002/0103818(A1) | 2002-08-01 | Amberden | Applicant |
| US2002/0104071(A1) | 2002-08-01 | Charisius et al. | Applicant |
| US2002/0107913(A1) | 2002-08-01 | Rivera et al. | Applicant |
| US2002/0107920(A1) | 2002-08-01 | Hotti | Applicant |
| US2002/0111998(A1) | 2002-08-01 | Kim | Applicant |
| US2002/0112171(A1) | 2002-08-01 | Ginter et al. | Applicant |
| US2002/0120685(A1) | 2002-08-01 | Srivastava et al. | Applicant |
| US2002/0123983(A1) | 2002-09-01 | Riley et al. | Applicant |
| US2002/0124053(A1) | 2002-09-01 | Adams et al. | Applicant |
| US2002/0135617(A1) | 2002-09-01 | Samid | Applicant |
| US2002/0143819(A1) | 2002-10-01 | Han et al. | Applicant |
| US2002/0147645(A1) | 2002-10-01 | Alao et al. | Applicant |
| US2002/0147801(A1) | 2002-10-01 | Gullotta et al. | Applicant |
| US2002/0152267(A1) | 2002-10-01 | Lennon | Applicant |
| US2002/0152279(A1) | 2002-10-01 | Sollenberger et al. | Applicant |
| US2002/0161903(A1) | 2002-10-01 | Besaw | Applicant |
| US2002/0169893(A1) | 2002-11-01 | Chen et al. | Applicant |
| US2002/0169975(A1) | 2002-11-01 | Good | Applicant |
| US2002/0173971(A1) | 2002-11-01 | Stirpe et al. | Applicant |
| US2002/0178119(A1) | 2002-11-01 | Griffin et al. | Applicant |
| US2002/0188869(A1) | 2002-12-01 | Patrick | Applicant |
| US2002/0194267(A1) | 2002-12-01 | Flesner et al. | Applicant |
| US2003/0004982(A1) | 2003-01-01 | Brandon et al. | Applicant |
| US2003/0014442(A1) | 2003-01-01 | Shiigi et al. | Applicant |
| US2003/0032409(A1) | 2003-02-01 | Hutcheson et al. | Applicant |
| US2003/0033356(A1) | 2003-02-01 | Tran | Applicant |
| US2003/0046576(A1) | 2003-03-01 | High, Jr. et al. | Applicant |
| US2003/0065721(A1) | 2003-04-01 | Roskind | Applicant |
| US2003/0069874(A1) | 2003-04-01 | Hertzog et al. | Applicant |
| US2003/0078959(A1) | 2003-04-01 | Yeung et al. | Applicant |
| US2003/0078972(A1) | 2003-04-01 | Tapissier et al. | Applicant |
| US2003/0088617(A1) | 2003-05-01 | Clark et al. | Applicant |
| US2003/0110448(A1) | 2003-06-01 | Haut et al. | Applicant |
| US2003/0115484(A1) | 2003-06-01 | Moriconi et al. | Applicant |
| US2003/0120686(A1) | 2003-06-01 | Kim et al. | Applicant |
| US2003/0126236(A1) | 2003-07-01 | Marl et al. | Applicant |
| US2003/0126464(A1) | 2003-07-01 | McDaniel et al. | Applicant |
| US2003/0126558(A1) | 2003-07-01 | Griffin | Applicant |
| US2003/0131113(A1) | 2003-07-01 | Reeves et al. | Applicant |
| US2003/0135490(A1) | 2003-07-01 | Barrett et al. | Applicant |
| US2003/0140308(A1) | 2003-07-01 | Murthy et al. | Applicant |
| US2003/0144389(A1) | 2003-07-01 | Andrews et al. | Applicant |
| US2003/0145275(A1) | 2003-07-01 | Qian et al. | Applicant |
| US2003/0146937(A1) | 2003-08-01 | Lee | Applicant |
| US2003/0167315(A1) | 2003-09-01 | Chowdhry et al. | Applicant |
| US2003/0167455(A1) | 2003-09-01 | Iborra et al. | Applicant |
| US2003/0177389(A1) | 2003-09-01 | Albert et al. | Applicant |
| US2003/0182577(A1) | 2003-09-01 | Mocek | Applicant |
| US2003/0187956(A1) | 2003-10-01 | Belt et al. | Applicant |
| US2003/0200350(A1) | 2003-10-01 | Kumar et al. | Applicant |
| US2003/0204481(A1) | 2003-10-01 | Lau | Applicant |
| US2003/0212766(A1) | 2003-11-01 | Giles et al. | Applicant |
| US2003/0216938(A1) | 2003-11-01 | Shour | Applicant |
| US2003/0220913(A1) | 2003-11-01 | Doganata et al. | Applicant |
| US2003/0220963(A1) | 2003-11-01 | Golovinsky et al. | Applicant |
| US2003/0229501(A1) | 2003-12-01 | Copeland et al. | Applicant |
| US2003/0229623(A1) | 2003-12-01 | Chang et al. | Applicant |
| US2004/0003071(A1) | 2004-01-01 | Mathew et al. | Applicant |
| US2004/0010719(A1) | 2004-01-01 | Daenen | Applicant |
| US2004/0019494(A1) | 2004-01-01 | Ridgeway et al. | Applicant |
| US2004/0019650(A1) | 2004-01-01 | Auvenshine | Applicant |
| US2004/0024812(A1) | 2004-02-01 | Park et al. | Applicant |
| US2004/0030744(A1) | 2004-02-01 | Rubin et al. | Applicant |
| US2004/0030746(A1) | 2004-02-01 | Kavacheri et al. | Applicant |
| US2004/0030795(A1) | 2004-02-01 | Hesmer et al. | Applicant |
| US2004/0078371(A1) | 2004-04-01 | Worrall et al. | Applicant |
| US2004/0098467(A1) | 2004-05-01 | Dewey et al. | Applicant |
| US2004/0098606(A1) | 2004-05-01 | Tan et al. | Applicant |
| US2004/0107360(A1) | 2004-06-01 | Herrmann et al. | Applicant |
| US2004/0162733(A1) | 2004-08-01 | Griffin | Applicant |
| US2004/0162905(A1) | 2004-08-01 | Griffin et al. | Applicant |
| US2004/0162906(A1) | 2004-08-01 | Griffin et al. | Applicant |
| US2004/0167880(A1) | 2004-08-01 | Smith | Applicant |
| US2004/0167899(A1) | 2004-08-01 | Patadia et al. | Applicant |
| US2004/0205473(A1) | 2004-10-01 | Fisher et al. | Applicant |
| US2004/0205557(A1) | 2004-10-01 | Bahrs et al. | Applicant |
| US2004/0215650(A1) | 2004-10-01 | Shaji et al. | Applicant |
| US2004/0230546(A1) | 2004-11-01 | Rogers | Applicant |
| US2004/0236760(A1) | 2004-11-01 | Arkeketa et al. | Applicant |
| US2004/0243824(A1) | 2004-12-01 | Jones | Applicant |
| US2005/0021502(A1) | 2005-01-01 | Chen et al. | Applicant |
| US2005/0021656(A1) | 2005-01-01 | Callegari | Applicant |
| US2005/0050184(A1) | 2005-03-01 | Boden et al. | Applicant |
| US2005/0060324(A1) | 2005-03-01 | Johnson et al. | Applicant |
| US2005/0086206(A1) | 2005-04-01 | Balasubramanian et al. | Applicant |
| US2005/0097008(A1) | 2005-05-01 | Ehring et al. | Applicant |
| US2005/0138411(A1) | 2005-06-01 | Griffin et al. | Applicant |
| US2005/0138412(A1) | 2005-06-01 | Griffin et al. | Applicant |
| US2005/0188295(A1) | 2005-08-01 | Konkus et al. | Applicant |
| US2005/0198617(A1) | 2005-09-01 | Kim et al. | Applicant |
| US2005/0256894(A1) | 2005-11-01 | Talanis et al. | Applicant |
| US2005/0257267(A1) | 2005-11-01 | Williams et al. | Applicant |
| US2006/0005150(A1) | 2006-01-01 | Pankovcin | Applicant |
| US2006/0059107(A1) | 2006-03-01 | Elmore et al. | Applicant |
| US2006/0085412(A1) | 2006-04-01 | Johnson et al. | Applicant |
| US2006/0085836(A1) | 2006-04-01 | Lyons, Jr. et al. | Applicant |
| US2006/0122882(A1) | 2006-06-01 | Brown et al. | Applicant |
| US2006/0167858(A1) | 2006-07-01 | Dennis et al. | Applicant |
| US2006/0173999(A1) | 2006-08-01 | Rider et al. | Applicant |
| US2006/0225123(A1) | 2006-10-01 | Childress et al. | Applicant |
| US2006/0277594(A1) | 2006-12-01 | Chiavegatto, Jr. et al. | Applicant |
| US2007/0083484(A1) | 2007-04-01 | McVeigh et al. | Applicant |
| US2007/0294743(A1) | 2007-12-01 | Kaler et al. | Applicant |
| EP1256889(A2) | 2002-11-01 | Applicant | |
| WO/38078(A1) | 2000-06-01 | Applicant | |
| WO1/14962(A1) | 2001-03-01 | Applicant | |
| WO1/67285(A2) | 2001-09-01 | Applicant | |
| WO2004/074993(A2) | 2004-09-01 | Applicant | |
| WO2004/074994(A2) | 2004-09-01 | Applicant | |
| WO2004/074998(A2) | 2004-09-01 | Applicant |
Non-Patent Literature (108)
- “USData Center Chooses . . . for eBusiness,” Business Wire, pa 2079, Apr. 4, 2001, pp. 1-2.Applicant
- Adomavicius, Gediminas et al., “User Profiling in Personalization Applications Through Rule Discovery and Validation,” KDD '99, ACM San Diego, California, 1999, pp. 377-381.Applicant
- Adya, Atul et al., “FARSITE: Federated, Available, and reliable Storage for an Incompletely Trusted Environment,” ACM SIGOPS Operating System review, vol. 36, Issue S1 (Winter 2002), OSDI '02: Proceedings for the 5th Symposium on Operation Systems Design and Implementation, pp. 1-14.Applicant
- An Introduction to BEA Weblogic Server Security, “The New Security Architecture of BEA Weblogic Server 7.0,” BEA Systems, May 1, 2002, 20 pages.Applicant
- Atkins, D.L. et al., “MAWL: A Domain-Specific Language for Form-Based Services,” IEEE Transaction on Software Engineering, IEEE Service center, Los Alamitos, CA, vol. 25, No. 3, May 1999, pp. 334-346.Applicant
- Ayers, Danny et al., “Professional Java Server Programming,” Wrox Press, Ltd., Birmingham, UK, Dec. 1999, pp. 515-545.Applicant
- Baltimore SelectAccess next generation authorization management, www.baltimore.com.Applicant
- Barrett, Alexandra, “Trying Out Transactions,” SunExpert Magazine, Jan. 1999, pp. 57-59.Applicant
- BEA WebLogic Server, “Assembling and Configuring Web Applications,” BEA Systems, Release 7.0, Revised Aug. 20, 2002, 165 pages.Applicant
- BEA WebLogic Server, “Developing Security Providers for WebLogic Server,” BEA Systems, Release 7.0, Aug. 30, 2002, 315 pages.Applicant
- BEA WebLogic Server, “Introduction to WEbLogic Security,” BEA Systems, Release 7.0, Jun. 2002, Revised Jun. 28, 2002, 22 pages.Applicant
- Bertino, Elisa et al., “TRBAC: A Temporal Role-Based Access Control Model,” ACM Transactions in Information and System Security (TISSEC), vol. 4, Issue 3, Aug. 2001, pp. 191-223.Applicant
- Browne et al., “Location-Independent Naming for Virtual Distributed Software Repositories,” ACM Symposium on Software Reusability, Seattle, WA, Aug. 1995, http//portal.acm.org/dl.cfm, pp. 179-185.Applicant
- Candan, K.S. et al., “Enabling Dynamic Content Caching for Database-Driven Web Sites,” Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Santa Barbara, California, May 21-24, 2001, pp. 532-543.Applicant
- Catley et al., “Design of a Health Care Architecture for Medical Data Interoperability and Application Integration,” Proceedings of the Second Joint EMBS/BMES Conference, Houston, TX, Oct. 23-26, 2002, IEEE, vol. 3. pp. 1952-1953.Applicant
- Cingill, Ibrahim et al., “A Broader Approach to Personalization,” Communications of the ACM, vol. 43, No. 6, Aug. 2000, pp. 136-141.Applicant
- Costello, S., Baltimore to release SelectAccess 5.0 with SAML, Apr. 24, 2002, www.infoworld.com/articles/hn/xml/02/04/24/020424hnsaml.html, printed Feb. 17, 2006.Applicant
- Covington, Michael J. et al., “Securing Context-Aware Applications Using Environment Roles,” ACM Workshop on Role Based Access Control, Proceedings of the Sixth ACM Symposium on Access Control Models and Technologies, SACMAT '01, May 3-4 2001, Chantilly, Virginia USA, pp. 10-20.Applicant
- First Data Choose Baltimore SelectAccess to Secure Extranet Applications, Press Release, FirstData International, Mar. 5, 2002, www.firstdata.com.au/news—050302.html, printed Feb. 17, 2006.Applicant
- Ford, Nigel, “Web Developer.com Guide to Building Intelligent Web Sites with JavaScript,” Wiley Computer Publishing, New York, NY, 1998, pp. 65-86, 96-98, 101-102, 245-250 and 324-327.Applicant
- Freudenthal, Eric et al., “DRBAC: Distributed Role-based Access control for Dynamic Coalition Environments,” Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS' 02) IEEE 2002, 10 pages.Applicant
- Georgiadis, Christos K. et al., “Flexible Team-Based Access Control Using Contexts,” ACM Workshop on Role Based Access Control, Proceedings of the Sixth ACM Symposium on Access Control Models and Technologies, SACMAT '01, May 3-4 2001, Chantilly, Virginia USA, pp. 21-27.Applicant
- Goh, Chen et al., “Towards a More Complete Model of Role,” Symposium on Access Control Models and Technologies, Proceedings of the Third ACM Workshop on Role-Based Access Control, 1998, Fairfax, Virginia, USA, pp. 55-61.Applicant
- Hayton, R.J. et al., “Access Control in an Open Distributed Environment,” 1998 Proceedings of the IEEE Symposium on Security & Privacy, May 3-6, 1998, Oakland, California, USA, 12 pgs.Applicant
- Howes, “The String Representation of LDAP Search Filters,” The Internet Society, Dec. 1997 (RFC 2254), pp. 1-8.Applicant
- Hunter, Jason, “Java Servlet Programming,” Second Edition, O'Reilly & Associates, Inc., Sebastopol, CA, Apr. 11, 2001, 19 pages.Applicant
- Javaworld, “Enterprise JavaBeans Technology,” http://www.javaworld.com/javaworld/jw-12-2002/jw-12-2002-yesnoejb—p.html (last visit Dec. 7, 2004).Applicant
- Javaworld, “To EJB, or not to EJB, Addressing the Issues and Decisions that go into adopting an EJB based solution,” http://java.sun.com/products/ejb/ (last visit Dec. 7, 2004).Applicant
- Kistler T. et al., “Webl—A Programming Language for the Web,” Computer Networks and ISDN Systems, North Holland Publishing, Amsterdam NL, vol. 30, No. 1-7, Apr. 1998, pp. 259-270.Applicant
- Koved et al., “Security Challenges for Enterprise Java in an E-Business Environment,” IMB Systems Journal, Jan. 2001, pp. 130-152, vol. 40, Issue 1.Applicant
- Koved—SecurityChallenges—http://portal. acm.org.citation.cfm?id=1011463.Applicant
- Lee et al., Keeping Virtual Information Resources Up and Running, Nov. 1997, IMB Press, pp. 1-14.Applicant
- Levy, M.R., “Web Programming in Guide,” Software Practices and Experience, Wiley & Sons, Bognor Regis, GB, vol. 28, No. 15, Dec. 25, 1998, pp. 1581-1603.Applicant
- Method and System for Visually Constructing Document Type Definitions and Related Artifacts Using a Reusable Object Model, IBM Technical Disclosure Bulletin, May 23, 2001, 3 pages.Applicant
- Microsoft Computer Dictionary 4th edition, Microsoft Press, Redmond, WA, 1999, p. 489.Applicant
- Microsoft Computer Dictionary 5th edition p. 81.Applicant
- Microsoft, “Microsoft Windows XO Professional,” copyright 1981-2001, 3 pages.Applicant
- Moore, Bill et al., “Migrating Weblogic Applications to WebSphere Advanced Edition,” Ibm Redbooks, Jan. 2001, pp. 1, 3-4, 109-111, 181-195.Applicant
- Okamoto, Eiji, “Proposal for Integrated Security Systems,” IEEE Computer Society Press, Jun. 1992, pp. 354-358.Applicant
- Parker, E., “The Complete Idiot's Guide to Microsoft FrontPage 2000,” QUE, 1999, pp. 7 & 55.Applicant
- PCT International Search Report and Written Opinion for corresponding PC application, PCT/US04/04078, Dec. 15, 2005.Applicant
- PCT International Search Report and Written Opinion for corresponding PCT application PCT/US02/11969, Dec. 1, 2004.Applicant
- PCT International Search Report and Written Opinion for corresponding PCT application PCT/US04/04079, Aug. 24, 2004.Applicant
- PCT International Search Report and Written Opinion for corresponding PCT application PCT/US04/04140, Dec. 27, 2005.Applicant
- PCT International Search Report and Written Opinion for corresponding PCT application PCT/US04/04691, Sep. 24, 2004.Applicant
- Rossi, Gustavo et al., Designing Personalized Web Applications, ACM, WWW10, Hong King, May 1-5, 2001, pp. 275-284.Applicant
- Sandhu, Ravi S. et al., “Role-Based Access Control Models,” IEEE Computer, vol. 29, No. 2, Feb. 1996, pp. 38-47.Applicant
- Stephanidis, Constantine et al., “Decision Making in Intelligent User Interfaces,” IUI '97, Orlando, Florida, 1997, pp. 195-202.Applicant
- Stiemerling, Oliver et al., How to Make Software Softer—Designing Tailorable Applications, DIS '97, Amsterdam, The Netherlands, ACM 1997, pp. 365-376.Applicant
- Sunsted, Todd, “NJDI Overview, Part 1: An Introduction to Naming Services,” JavaWorld, Jan. 2000 (downloaded from www.javaworld.com/javaworld/jw-01-2000/jw-01-2000/jw-01-howto—p.html), pp. 1-6.Applicant
- Supplemental European Search Report and Written Opinion mailed Oct. 12, 2006, International Application No. 02773915.0, 3 pages.Applicant
- Supplemental European Search Report and Written Opinion, mailed Dec. 19, 2006, International Application 01975484.5, 3 pages.Applicant
- Supplemental European Search Report and Written Opinion, mailed Jun. 7, 2006, International Application 02723874.0, 3 pages.Applicant
- Symborski, C.W., “Updating Software and Configuration Data in a Distributed Communications Network,” Computer Networking Symposium, Proceedings of the Washington, DC, Apr. 11-13, 1998, Computer Soc. Pr, US, pp. 331-338.Applicant
- Tanyi, Emmanuel, Easy XML, Mar. 6, 2000, www.winsite.com, pp. 1-6.Applicant
- Tzelepi, Sofia K. et al., “A Flexible Content and Context-Based Access Control Model for Multimedia Medical Image Database Systems,” International Multimedia Conference, Proceedings of the 2001 ACM Workshop on Multimedia and Security: New Challenges, Oct. 5, 2001, pp. 52-55.Applicant
- U.S. Appl. No. 10/366,778, filed Feb. 14, 2003 Notice of Allowance mailed Nov. 16, 2009, 4 pages.Applicant
- U.S. Appl. No. 10/366,778, filed Feb. 14, 2003 Office Action mailed Dec. 20, 2007, 8 pages.Applicant
- U.S. Appl. No. 10/366,778, filed Feb. 14, 2003 Office Action mailed Feb. 24, 2009, 7 pages.Applicant
- U.S. Appl. No. 10/366,778, filed Feb. 14, 2003 Office Action mailed Aug. 23, 2006, 14 pages.Applicant
- U.S. Appl. No. 10/366,778, filed Feb. 14, 2003 Final Office Action mailed Jun. 24, 2008, 7 pages.Applicant
- U.S. Appl. No. 10/366,778, filed Feb. 14, 2003 Final Office Action mailed Jul. 9, 2007, 12 pages.Applicant
- U.S. Appl. No. 10/366,778, filed Feb. 14, 2003 Notice of Allowance mailed Jul. 31, 2009, 5 pages.Applicant
- U.S. Appl. No. 10/367,177, filed Feb. 14, 2003 Final Office Action mailed Dec. 20, 2007, 9 pages.Applicant
- U.S. Appl. No. 10/367,177, filed Feb. 14, 2003 Final Office Action mailed Mar. 5, 2007, 8 pages.Applicant
- U.S. Appl. No. 10/367,177 filed Feb. 14, 2003 Final Office Action mailed Jul. 17, 2008, 8 pages.Applicant
- U.S. Appl. No. 10/367,177 filed Feb. 14, 2003 Notice of Allowance mailed Feb. 12, 2009, 8 pages.Applicant
- U.S. Appl. No. 10/367,177, filed Feb. 14, 2003 Notice of Allowance mailed May 5, 2009, 11 pages.Applicant
- U.S. Appl. No. 10/367,177, filed Feb. 14, 2003 Office Action mailed Mar. 24, 2008, 7 pages.Applicant
- U.S. Appl. No. 10/367,177, filed Feb. 14, 2003 Office Action mailed Jul. 18, 2007, 7 pages.Applicant
- U.S. Appl. No. 10/367,177, filed Feb. 14, 2003 Office Action mailed Jul. 27, 2006, 11 pages.Applicant
- U.S. Appl. No. 10/367,190 Office Action mailed Nov. 12, 2009, 17 pages.Applicant
- U.S. Appl. No. 10/367,190, filed Feb. 14, 2003 Final Office Action mailed May 28, 2009, 15 pages.Applicant
- U.S. Appl. No. 10/367,190, filed Feb. 14, 2003 Office Action mailed Oct. 17, 2007, 12 pages.Applicant
- U.S. Appl.No. 10/367,190, filed Feb. 14, 2003 Office Action mailed Oct. 30, 2008, 14 pages.Applicant
- U.S. Appl. No. 10/367,190, filed Feb. 14, 2003 Office Action mailed Feb. 25, 2005, 11 pages.Applicant
- U.S. Appl. No. 10/367,190, filed Feb. 14, 2003 Office Action mailed Aug. 14, 2006, 16 pages.Applicant
- U.S. Appl. No. 10/367,190, filed on Feb. 14, 2003 Advisory Action dated Aug. 21, 2009, 3 pages.Applicant
- U.S. Appl. No. 10/367,190, filed on Feb. 14, 2003 Advisory Action mailed Jul. 24, 2008, 3 pages.Applicant
- U.S. Appl. No. 10/367,190, filed on Feb. 14, 2003 Final Office Action mailed May 12, 2008, 11 pages.Applicant
- U.S. Appl. No. 10/367,190, filed Feb. 14, 2003 Final Office Action mailed May 2, 2007, 10 pages.Applicant
- U.S. Appl. No. 10/367,190, filed Feb. 14, 2005 Final Office Action dated Dec. 19, 2005, 16 pages.Applicant
- U.S. Appl. No. 10/367,190, filed Feb. 14, 2005 Final Office Action dated Jun. 8, 2010, 15 pages.Applicant
- U.S. Appl. No. 10/367,462, filed Feb. 14, 2003 Final Office Action mailed on Jan. 19, 2005, 6 pages.Applicant
- U.S. Appl. No. 10/367,462, filed Feb. 14, 2003 Notice of Allowance mailed Feb. 10, 2005, 4 pages.Applicant
- U.S. Appl. No. 10/367,462, filed Feb. 14, 2003 Notice of Allowance mailed Feb. 18, 2005, 2 pages.Applicant
- U.S. Appl. No. 10/367,462, filed Feb. 14, 2003 Office Action mailed Jun. 21, 2004, 7 pages.Applicant
- U.S. Appl. No. 11/052,148, filed Feb. 14, 2003 Advisory Action mailed on Oct. 26, 2009; 3 pages.Applicant
- U.S. Appl. No. 11/052,148, filed Feb. 14, 2003 Final Office Action mailed on Mar. 16, 2010, 9 pages.Applicant
- U.S. Appl. No. 11/052,148, filed Feb. 14, 2003 Final Office Actionmailed on Jul. 13, 2009, 9 pages.Applicant
- U.S. Appl. No. 11/052,148, filed Feb. 14, 2003 Office Action mailed Oct. 7, 2008, 8pages.Applicant
- U.S. Appl. No. 11/052,148, filed Feb. 14, 2003 Office Action mailed Nov. 9, 2009, 9 pages.Applicant
- U.S. Appl. No. 11/052,148, filed Feb. 14, 2003 Office Action mailed Feb. 4, 2008, 9 pages.Applicant
- U.S. Appl. No. 11/052,148, filed Feb. 14, 2003 Advisory Action mailed May 24, 2010, 3 pages.Applicant
- U.S. Appl. No. 11/052,148, filed Feb. 14, 2003 Advisory Action mailed Aug. 5, 2008, 3 pages.Applicant
- U.S. Appl. No. 11/052,148, filed Feb. 14, 2003 Final Office Action mailed Apr. 29, 2008, 11 pages.Applicant
- U.S. Appl. No. 11/052,356, filed Feb. 14, 2003 Advisory Action mailed May 24, 2010, 2 pages.Applicant
- U.S. Appl.No. 11/052,356, filed Feb. 14, 2003 Final Office Action mailed on Mar. 16, 2010; 10 pages.Applicant
- U.S. Appl. No. 11/052,356, filed Feb. 14, 2003 Final Office Action mailed on Jul. 24, 2009, 19 pages.Applicant
- U.S. Appl. No. 11/052,356, filed Feb. 14, 2003 Office Action mailed Oct. 7, 2008, 9 pages.Applicant
- U.S. Appl. No. 11/052,356, filed Feb. 14, 2003 Office Action mailed Nov. 9, 2009, 10 pages.Applicant
- U.S. Appl. No. 11/052,356, filed Feb. 14, 2003 Office Action mailed Dec. 28, 2007, 9 pages.Applicant
- U.S. Appl. No. 11/052,356, filed Feb. 14, 2003 Advisory Action mailed Aug. 5, 2008, 3 pages.Applicant
- U.S. Appl. No. 11/052,356, filed Feb. 14, 2003 Final Office Action mailed Apr. 29, 2008, 12 pages.Applicant
- U.S. Appl. No. 11/052,356, filed Feb. 14, 2003 Advisory Action mailed Oct. 26, 2009; 3 pages.Applicant
- US DataCenters Chooses Baltimore SelectAccess to Enable Next Generation Security Solutions fo eBusiness, Business Wire, Apr. 4, 2001, p. 2079.Applicant
- Yao, Walt et al., “A Model of OASIS Role-Based Access Control and Its Support for Active Security,” ACM Workshop on Role Based Access Control, Proceedings of the Sixth ACM Symposium on Access Control Models and Technologies, SACMAT '01, May 3-4, 2001, Chantilly, Virginia USA, pp. 171-181.Applicant
- Zhang et al., “Designing a Robust Namespace for Distributed File Services,” Reliable Distributed System, 2001, Proceedings of the 20th IEEE Symposium on Oct. 28-31, 2001, pp. 162-171.Applicant