US 7,206,851 B2Grant
Identifying dynamic groups
Issue Date:2007-04-17
•72 Claims
•11 Drawing Sheets
Abstract
Technology is disclosed for identifying dynamic groups that correspond to a user of a system. A system partitions a set of dynamic groups into multiple test sets of dynamic groups. The system selects a test set and determines whether the user corresponds to the test set. In one implementation, the system combines the filters for the dynamic groups in each test set into a single test set filter. The test set filter is satisfied if the filter of any dynamic group in the test set is satisfied. This allows the system to perform a single comparison between the resulting test set filter and the user's profile to determine whether the user is a member of any dynamic group in the test set. If the user is not a member of any dynamic group in the test set, the system eliminates all of the test set's dynamic groups from consideration, based on the single comparison. Otherwise, the dynamic groups in the test set remain in a list of groups that may include the user. This process is repeated for each test set. After each test set has been evaluated, new test sets are repeatedly generated and evaluated in the above-described fashion using the dynamic groups that are still in consideration. In each iteration, each test set contains fewer dynamic groups. This continues until each test set only contains one dynamic group. After performing an iteration with each test set containing one dynamic group, the only remaining dynamic groups are the ones that include the user as a member.
Metadata
Assignee
- Oracle International Corporation
Inventors
- Shawn P. Delaney
- Robert Summers
Application Information
Application Number:US 10/328,920
Filing Date:2002-12-23
Priority Date:2002-07-11
Art Unit:2155
Classifications
IPC:
G06F15/16G06F7/00
Patent Drawings (11 sheets)
Description
[0001] This application claims the benefit of U.S. Provisional Application No. 60/395,152, “Access and Identity System,” filed on Jul. 11, 2002, which is incorporated herein by reference.
Cross-Reference to Related Applications
[0002] This Application is related to U.S. patent application Ser. No. 09/998,926, entitled “Determining Group Membership,” filed on Nov. 30, 2001, and incorporated herein by reference in its entirety.
Background of the Invention
[0003] 1. Field of the Invention
[0004] The present invention is directed to technology for identifying dynamic groups that correspond to an entity, such as a user.
[0005] 2. Description of the Related Art
[0006] With the growth of the Internet, the use of networks and other information technologies, Identity Systems have become more popular. In general, an Identity System provides for the creation, removal, editing and other managing of identity information stored in various types of data stores. The identity information pertains to users, groups, organizations and/or things. For each entry in the data store, a set of attributes are stored. For example, the attributes stored for a user may include a name, address, employee number, telephone number, email address, user ID and password. The Identity System can also manage access privileges that govern what an entity can view, create, modify or use in the Identity System. Often, this management of access privileges is based on one or more specific attributes, membership in a group and/or association with an organization.
[0007] In many instances it is useful to identify the groups corresponding to a user. For example, an employee at a company may want to know all the groups that include the employee as a member. Ideally, an Identity System would be able to create a list of such groups for the employee. Providing such a list can be very computation intensive when all or some of the groups are dynamic groups—groups that identify membership with a filter instead of a static membership list. One implementation of a filter or rule specifies attribute values an employee profile must contain in order for the employee to qualify as a group member.
[0008] The Identity System may need to determine a user's dynamic groups by comparing the user's profile to each dynamic group's filter, even though users typically belong to much less than all of the groups. This comparison can consume substantial processing time and memory bandwidth. In a directory based Identity System, each dynamic group comparison requires a separate directory access of the user's profile. It would be desirable for a user's corresponding dynamic groups to be identified more efficiently in some circumstances.
[0009] In order to avoid the identification of dynamic groups, some systems maintain dynamic filters for group membership in user profiles. The group filter in a user profile dynamically defines one or more groups that include the user. In this scheme, all of a user's groups can be identified by a single directory access of the user profile. This solution, however, does not allow system administrators to organize users through the implementation of group profiles. This can be a significant drawback. The use of dynamic group profiles is a popular scheme for grouping large numbers of entities, such as users. Without the use of dynamic groups, the creation of a new group may require the updating of each group member's profile.
[0010] Some Identity System users also employ an Access Systems. An Access System provides for the authentication and authorization of users attempting to access resources. For efficiency purposes, there is an advantage to integrating the Identity System and the Access System. For example, both systems may utilize a single set of group objects that identify user membership in various groups. Additionally, integrating the Identity System and the Access System allows for single-sign-on functionality across multiple resources. Thus, there is also a need to efficiently support the identification of a user's dynamic groups for Access Systems and integrated Identity/Access Systems. Systems other than Identity and Access Systems can also benefit from the efficient identification of a user's groups.
Summary of the Invention
[0011] The present invention, roughly described, pertains to technology for identifying dynamic groups that correspond to a user. In many instances, users and other entities only belong to a small percentage of the dynamic groups being maintained in a system. Embodiments of the present invention reduce the number of data accesses and dynamic group filter comparisons under these circumstances.
[0012] In one embodiment, an Identity System partitions a set of dynamic groups into multiple test sets. Each test set contains a subset of the dynamic groups. The system selects a test set and determines whether a user corresponds to the test set. In one example, the system determines whether the attributes in the user's profile meets the criteria established by any of the filters for the dynamic groups in the test set.
[0013] One implementation of the Identity System combines the filters for each dynamic group in each test set into a single filter that represents each dynamic group filter's criteria. For example, the test set filter is a logical OR of the test set's dynamic group filters in one embodiment. This enables the system to perform a single comparison between the resulting test set filter and the user profile—determining whether the user is a member of any dynamic group in the test set. If the user is not a member of any dynamic group in the test set, the system eliminates all of the test set's dynamic groups from consideration, based on the single comparison. Otherwise, the dynamic groups in the test set remain in a list of groups that may include the user. This process is repeated for each test set.
[0014] In one embodiment, user profiles and dynamic group profiles are maintained in a Lightweight Directory Access Protocol (“LDAP”) directory. The system implements the above-described comparison as a base object search of the entity's profile using the test set filter. This allows a single directory access to yield the simultaneous elimination of multiple dynamic groups that do not include the user, as opposed to requiring separate directory accesses for each dynamic group. In alternate embodiments, protocols other than LDAP can be employed.
[0015] After each test set has been evaluated, the remaining list of dynamic groups is partitioned again into a new set of test sets. Each new test set contains a subset of the remaining dynamic groups. In one embodiment, the new test sets contain half as many dynamic groups as the previous set of test sets contained. Each of the new test sets is evaluated as described above. After the evaluation, new test sets are repeatedly generated and evaluated in the above-described fashion, until each test set only contains one dynamic group. After performing an iteration with each test set containing one dynamic group, the only remaining dynamic groups are the ones that include the entity as a member.
[0016] In an alternate implementation, the system drills down into each test set after the initial partitioning. For each test set, the system removes each dynamic group that does not include the user. In drilling down, the system repeatedly partitions the test set and forms a filter for each partition that represents all of the dynamic group filters in the partition. The system uses these filters to determine whether the user's profile satisfies any of the dynamic group filters in the partition, similar to the process above.
[0017] The present invention can be accomplished using hardware, software, or a combination of both hardware and software. The software used for the present invention is stored on one or more processor readable storage media including hard disk drives, CD-ROMs, DVDs, optical disks, floppy disks, tape drives, RAM, ROM or other suitable storage devices. In alternative embodiments, some or all of the software can be replaced by dedicated hardware including custom integrated circuits, gate arrays, FPGAs, PLDs, and special purpose computers. In one embodiment, software implementing the present invention is used to program one or more processors. The processors can be in communication with one or more storage devices, peripherals and/or communication interfaces.
[0018] These and other objects and advantages of the present invention will appear more clearly from the following description in which the preferred embodiment of the invention has been set forth in conjunction with the drawings.
Brief Description of the Drawings
[0019] FIG. 1 is a block diagram depicting the components of one embodiment of the present invention.
[0020] FIG. 2 is a flow chart describing one embodiment of a process for authenticating and authorizing.
[0021] FIG. 3 is an example of a directory tree structure.
[0022] FIG. 4 is a block diagram depicting the User Manager.
[0023] FIG. 5 is a block diagram depicting the Group Manager.
[0024] FIG. 6 is a block diagram depicting the Organization Manager.
[0025] FIG. 7 is a flow chart describing one embodiment of a process for viewing all groups corresponding to an entity.
[0026] FIG. 8 is a flow chart describing a second embodiment of a process for viewing all groups corresponding to an entity.
[0027] FIG. 9 is a flow chart describing one embodiment of a process for identifying dynamic groups corresponding to an entity.
[0028] FIG. 10 is a flow chart describing one embodiment of a process for identifying a set of dynamic groups.
[0029] FIG. 11 is a flow chart describing one embodiment of a process for determining whether an entity corresponds to a test set including at least one dynamic group.
[0030] FIG. 12 is a flow chart describing an alternate embodiment of a process for identifying dynamic groups corresponding to an entity.
Detailed Description
[0031] FIG. 1 depicts an example of an access management system that provides identity management services and/or access management services for a network. The identity management portion of the system (hereinafter “the Identity System”) manages identity profiles, while the access management portion of the system (hereinafter “the Access System”) provides security for resources across one or more Web Servers (or other components). A key feature of one embodiment of this system is the centralization of the repositories for policies and identity profiles, while decentralizing their administration. That is, one embodiment of the system centralizes the policy and identity repositories by building them on a directory service technology. The system decentralizes their administration by hierarchy delegating administrative roles. Although the system of FIG. 1 includes an Identity System and an Access System, other embodiments may only include an Identity System or only include an Access System.
[0032] FIG. 1 is a block diagram depicting one embodiment for deploying an integrated Identity System and Access System. FIG. 1 shows web browsers 12 and 14 accessing Web Server 18 and/or Web Server 20 via network 16. One example of a network is the Internet. In one embodiment, web browsers 12 and 14 are standard web browsers known in the art running on any suitable type of computer. FIG. 1 depicts web browsers 12 and 14 communicating with Web Server 18 and Web Server 20 using HTTP over the Internet; however, other protocols and networks can also be used.
[0033] Web Server 18 is a standard Web Server known in the art and provides an end user with access to various resources via network 16. One embodiment includes two firewalls. A first firewall (see dotted lines) is connected between network 16 and Web Server 18. A second firewall (see dotted lines) is connected between Web Servers 16 and 18 and Access Server 34/Identity Server 40.
[0034] FIG. 1 shows two types of resources: resource 22 and resource 24. Resource 22 is external to Web Server 18 but can be accessed through Web Server 18. Resource 24 is located on Web Server 18. A resource can be anything that is possible to address with a uniform resource locator (URL, see RFC 1738). A resource can include a web page, software application, file, database, directory, data unit, etc. In one embodiment, a resource is anything accessible to a user via a network. The network could be the Internet, a LAN, a WAN, or any other type of network.
[0035] FIG. 1 shows Web Server 18 including Web Gate 28, which is a software module. In one embodiment, Web Gate 28 is a plug-in to Web Server 18. Web Gate 28 communicates with Access Server 34. Access Server 34 communicates with Directory 36.
[0036] The Access System includes Access Server 34, Web Gate 28, and Directory 36. Access Server 34 provides authentication, authorization, auditing and logging services. It further provides for identity profiles to be used across multiple domains and for access based on a single web-based authentication (sign-on). Web Gate 28 acts as an interface between Web Server 18 and Access Server 34. Web Gate 28 intercepts requests from users for resources 22 and 24, and authorizes them via Access Server 34. Access Server 34 is able to provide centralized authentication, authorization, and auditing services for resources hosted on or available to Web Server 18 and other Web Servers.
[0037] The Identity System includes Web Pass 38, Identity Server 40 and Directory 36. Identity Server 40 manages identity profiles. An identity profile is a set of information associated with a particular entity (e.g. user, group, organization, etc.). The data elements of the identity profile are called attributes. An attribute may include a name, a value and access criteria. The Identity Server includes three main applications, which effectively handle the identity profiles and privileges of the user population: User Manager 42, Group Manager 44, and Organization Manager 46. User Manager 42 manages the identity profiles for individual users. Group Manager 44 manages identity profiles for groups. Organization Manager 46 manages identity profiles for organizations. Identity Server 40 also includes Publisher 48, an application that enables entities to quickly locate and graphically view information stored by Directory 36. In one embodiment, Web Pass 38 is a Web Server plug-in that sends information back and forth between Identity Server 40 and the Web Server 20, creating a three-tier architecture. The Identity System also provides a Certificate Processing Server (not shown in FIG. 1 ) for managing digital certificates.
[0038] User Manager 42 handles the functions related to user identities and access privileges, including creation and deletion of user identity profiles, modification of user identity profile data, determination of access privileges, and credentials management of both passwords and digital certificates. With User Manager 42, the create, delete, and modify functions of user identity management can be set as flexible, multi-step workflows. Each business can customize its own approval, setup, and management processes and have multiple processes for different kinds of users.
[0039] Group Manager 44 allows entities to create, delete and manage groups of users who need identical access privileges to a specific resource or set of resources. Managing and controlling privileges for a group of related people—rather than handling their needs individually—yield valuable economies of scale. Group Manager 44 meets a wide range of e-business needs: easy creation, maintenance, and deletion of permanent and ad hoc groups of users who may be allowed or denied access to particular resources; modification and adaptation of groups and their access privileges with minimal disruption to the directory server's underlying schema; efficient addition and deletion of users from established groups; and delegation of administrative responsibility for group membership and subscription requests and approvals.
[0040] With Group Manager 44, companies (or other entities) can allow individual users to do the following: (1) self-subscribe to and unsubscribe from groups, (2) view the groups that they are eligible to join or have joined, and (3) request subscription to groups that have access to the applications they need. Multi-step workflows can then define which users must obtain approval before being added to a group and which can be added instantly. Group Manager 44 also lets organizations form dynamic groups specified by an LDAP filter. The ability to create and use dynamic groups is extremely valuable because it eliminates the administrative headache of continually keeping individual, static membership up-to-date. With dynamic group management features, users can be automatically added or removed if they meet the criteria specified by the LDAP filter. Dynamic groups also greatly enhance security since changes in user identities that disqualify someone from membership in a group are automatically reflected in the dynamic group membership.
[0041] The third application in the Identity System, Organization Manager 46, streamlines the management of large numbers of organizations within an e-business network, including partners, suppliers, or even major internal organizations such as sales offices and business units. Certain infrastructure security and management operations are best handled—or can only be handled—at the highest organizational unit level rather than at the individual or group level. Like User Manager and Group Manager, this application relies on multi-step workflow and delegation capabilities. Organization Manager handles the following administrative tasks: (1) organization lifecycle management, whereby companies can create, register, and delete organizations in their systems using customizable workflows; (2) maintenance of organization profiles on an attribute-by-attribute basis through self-service, delegated administration and system-initiated activities; (3) organization self-registration, whereby organizations such as business partners, customers and suppliers can self-generate a request to be added to the e-business network; and (4) creation of reusable rules and processes through multi-step workflows.
[0042] The various components of FIG. 1 can be implemented by software running on computing devices. Many different types of computing devices can be used, including servers, mainframes, minicomputers, personal computers, mobile computing devices, etc. Typically, such computing devices will have one or more processors that are programmed by code that is stored in one or more processor readable storage devices. The one or more processors are in communication with the processor readable storage devices, peripherals (e.g. keyboards, monitors, pointing devices, printers, etc.) and communication interfaces (e.g. network interfaces, modems, wireless transmitters/receivers, etc.).
[0043] The system of FIG. 1 is scalable. There can be many Web Servers, many Access Servers, and many Identity Servers. In one embodiment, Directory 36 is a Directory Server and communicates with other servers/modules using LDAP or LDAP over SSL. In other embodiments, Directory 36 can implement other protocols or can be other types of data repositories (e.g. relational database using SQL, etc.). Many variations of the system of FIG. 1 can be used with the present invention. For example, instead of accessing the system with a web browser, an API can be used. Alternatively, portions of functionality of the system at FIG. 1 can be separated into independent programs that can be accessed with a URL.
[0044] To understand how the system of FIG. 1 protects a resource, first consider the operation of unprotected resources. With a typical unprotected resource, end users cause their browsers to send a request to a Web Server. The request is usually an HTTP request, which includes a URL. The Web Server then translates, or maps, the URL into a file system's name space and locates the matching resource. The resource is then returned to the browser.
[0045] With the system of FIG. 1 deployed, Web Server 18 (enabled by Web Gate 28, Access Server 34, and Directory 36) can make informed decisions based on default and/or specific rules about whether to return requested resources to an end user. The rules are evaluated based on the end user's identity profile, which is managed by the Identity System. In one embodiment of the present invention, the general method proceeds as follows. An end user enters a URL or an identification of a requested resource residing in a protected policy domain. The user's browser sends the URL as part of an HTTP request to Web Server 18. Web Gate 28 intercepts the request. If the end user has not already been authenticated, Web Gate 28 causes Web Server 18 to issue a challenge to the browser for log-on information.
[0046] The received log-on information is passed back to Web Server 18 and on to Web Gate 28. Web Gate 28 in turn makes an authentication request to Access Server 34, which determines whether the user's supplied log-on information is authentic or not. Access Server 34 performs the authentication by accessing attributes of the user's identity profile and the resource's authentication criteria stored on Directory 36. If the user's supplied log-on information satisfies the authentication criteria, the process flows as described below; otherwise, the end user is notified that access to the requested resource is denied and the process halts.
[0047] After authenticating the user, Web Gate 28 queries Access Server 34 about whether the user is authorized to access the resource requested. Access Server 34 in turn queries Directory 36 for the appropriate authorization criteria for the requested resource. Access Server 34 retrieves the authorization criteria for the resource and answers Web Gate 28's authorization query, based on the resource's authorization criteria and the user's identity profile. If the user is authorized, the user is granted access to the resource; otherwise, the user's request is denied. Various alternatives to the above described flow are also within the spirit and scope of the present invention.
[0048] Authentication and Authorization decisions are based on policy domains and policies. A policy domain is a logical grouping of Web Server host ID's, host names, URL prefixes, and rules. Host names and URL prefixes specify the course-grain portion of the web name space a given policy domain protects. Rules specify the conditions in which access to requested resources is allowed or denied, and to which end users these conditions apply. Policy domains contain two levels of rules: first level default rules and second level rules contained in policies. First level default rules apply to any resource in a policy domain not associated with a policy.
[0049] A policy is a grouping of a URL pattern, resource type, operation type (such as a request method), and policy rules. These policy rules are the second level rules described above. Policies are always attached to a policy domain and specify the fine-grain portion of a web name space that a policy protects. In practice, the host names and URL prefixes from the policy's policy domain are logically concatenated with the policy's URL pattern. The resulting overall pattern is compared to the incoming URL. If there is a match, then the policy's various rules are evaluated to determine whether the request should be allowed or denied; if there is not a match, then default policy domain rules are used.
[0050] FIG. 2 provides a flow chart for one embodiment of a method for authenticating and authorizing. A user's browser 12 requests a web-enabled resource 22 or 24 (step 50). The request is intercepted by Web Gate 28 (step 52). The method then determines whether the requested resource is protected by an authentication and/or authorization rule (step 53). If the resource is not protected, then access is granted to the requested resource (step 95). If the requested resource is protected, however, the method proceeds to step 54. If the user was previously authenticated for a protected resource in the same domain, a valid authentication cookie is passed by browser 12 with the request in step 50. The authentication cookie is intercepted by Web Gate 28 in step 52. If a valid cookie is received (step 54), the method attempts to authorize the user (step 56). If no valid authentication cookie is received (step 54), the method attempts to authenticate the user for the requested resource (step 60).
[0051] If the user successfully authenticates for the requested resource (step 62), then the method proceeds to step 74. Otherwise, the unsuccessful authentication is logged (step 64). After step 64, the system performs authentication failure actions and Web Gate 28 denies the user access to the requested resource (step 66). In step 74, the successful authentication of the user for the resource is logged. The method then performs authentication success actions (step 76). In response to the successful authentication, Web Gate 28 then passes a valid authentication cookie to browser 12 (step 80), which stores the cookie. After passing the cookie in step 80, the system attempts to authorize (step 56).
[0052] In step 56, the method determines whether the user is authorized to access the requested resource. If the user is authorized (step 90), the method proceeds to step 92. Otherwise, the unsuccessful authorization is logged (step 96). After step 96, the method performs authorization failure actions (step 98) and Web Gate 28 denies the user access to the requested resource. If authorization is successful (step 90), then the successful authorization of the user is logged (step 92). Authorization success actions are performed in step 94. The user is granted access to the requested resource (step 95). In one embodiment of step 95, some or all of HTTP request information is provided to the resource. In one or more scenarios, the resource being accessed is the Identity System.
[0053] More information about authorization, authentication, an Access System and an Identity System can be found in U.S. patent application Ser. No. 09/998,926, “Determining Group Membership,” filed on Nov. 30, 2001, which is incorporated herein by reference in its entirety.
[0054] Both the Identity System and the Access System make use of Directory 36. The basic unit of information store in Directory 36 is called an entry or identity profile, which is a collection of information about an object. The information in an entry often describes a real-world object such as a person, but this is not required. A typical directory includes many entries that correspond to people, departments, groups and other objects in the organization served by the directory. An entry is composed of a set of attributes, each of which describes one particular trait of the object. Each attribute has a type, one or more values, and associated access criteria. The type describes the kind of information contained in the attribute, and the value contains the actual data.
[0055] An entry in the directory has a set of attributes that are required and a set of attributes that are allowed. For example, an entry describing a person is required to have a cn (common name) attribute and an sn (surname) attribute. One example of an allowed attribute may be a nickname. Any attribute not explicitly required or allowed is prohibited.
[0056] Examples of attributes stored in a user identity profile include: first name, middle name, last name, title, email address, telephone number, fax number, mobile telephone number, pager number, pager email address, identification of work facility, building number, floor number, mailing address, room number, mail stop, manager, direct reports, administrator, organization that the user works for, department number, department URL, skills, projects currently working on, past projects, home telephone, home address, birthday, previous employers and anything else desired to be stored by an administrator. Examples of attributes stored in a group identity profile include: owner, name, description, static members, dynamic member rule, subscription policies, etc. Examples of attributes stored in a user organization identity profile include: owner, name, description, business category, address, country, etc. In other embodiments, less or more than the above-listed information is stored.
[0057] FIG. 3 depicts an exemplar directory tree that can be stored in Directory 36. Each node on the tree is an entry in the directory structure that includes an identity profile. In one embodiment, the entity can be a user, group or organization. Node 230 is the highest node on the tree and represents an entity responsible for the directory structure. In one example, an entity may set up an Extranet and grant Extranet access to many different companies. The entity setting up the Extranet is node 130. Each of the companies with Extranet access would have a node at a level below node 130. For example, company A (node 132) and company B (node 134) are directly below node 130. Each company may be broken up into organizations. The organizations could be departments in the company or logical groups to help manage the users. For example, FIG. 3 shows company A broken up into two organizations: organization A with node 136 and organization B with node 138. Company B is shown to be broken up into two organizations: organization C with node 140 and organization D with node 142. FIG. 3 shows organization A having two end users: employee 1 with node 150 and employee 2 with node 152. Organization B is shown with two end users: employee 3 with node 154 and employee 4 with node 156. Organization C is shown with two end users: employee 5 with node 158 and employee 6 with node 160. Organization D is shown with two end users: employee 7 with node 162 and employee 8 with node 164.
[0058] Each entity has a distinguished name (DN), which uniquely identifies the node. In one embodiment, each entry also has a relative name, which is different from all other relative names on the same level of the hierarchy. In one implementation, the distinguished name (DN) comprises a union of the relative names up the tree. For example, the distinguished name of employee 1 (node 150) is
DN=CN=Empl, OU=OrgA, O=CompanyA, DC=entity,
where:
DN=CN=Empl, OU=OrgA, O=CompanyA, DC=entity,
where:
-
- [0059] DC=Domain Component
- [0060] O=Organization
- [0061] OU=Organizational Unit
- [0062] CN=common name.
[0063] FIG. 3 shows a hierarchical tree. Some organizations employ fat or flat trees for ease of maintenance. A flat directory tree may be a directory information tree that does not have any hierarchy or a shallow tree structure with a higher ratio of leaves to total nodes. A fat directory tree is a tree that has a large number of nodes at any given level in a directory information tree. One advantage of a fat or flat tree is user maintenance. For example, if an employee moves to a new group, the node must be moved to a new container if the tree is not flat or fat. By moving the node to a new container, the distinguished name for the node changes and all certificates become void. One drawback of flat or fat trees is that the organization loses the benefits of having a logical directory structure mirrored in the physical directory structure, such as using the physical directory structure to determine who has access to which nodes. To remedy this, the Identity System includes partition support for fat and flat tree directories using filters. From a configuration page, an attribute can be configured to be accessible (read, modify, etc.,) based on a two part filter. The first component in the filter identifies a top node in the directory. The filter will only apply to those entities at or below that top node. The second component of the filter is an LDAP filter which defines who can access the attribute. This two component filter can be applied on an attribute by attribute basis.
[0064] There are many ways for an entity to access and use the Identity System. In one embodiment, the entity can access the Identity System's services using a browser. In other embodiments, XML documents and API's can be used to access the services of the Identity System. For example, an entity can use a browser by pointing the browser to Identity Server 40. The user will then be provided with a login page to enter the user's ID, password, type of user and application requested (optional). Upon filling out that information, the user will be authenticated and authorized (by the Access System) to use the Identity System. Alternatively, the Access System can be bypassed (or there may be no Access System) and the Identity System authenticates the user.
[0065] As described above, the Identity System of FIG. 1 includes User Manager 42, Group Manager 44 and Organization Manager 46. User Manager 42 manages identity profiles for users. Group Manager 44 manages identity profiles for groups. Organization Manager 46 manages identity profiles for organizations. Each of these components will now be described in more detail.
[0066] FIG. 4 graphically depicts the various services provided by User Manager 42. Each of these services can be accessed from a User Manager home page. For example, in one embodiment, the home page will include application selector 202, search tool 204, My Identity tab 206, Create User Identity tab 208, Deactivate User Identity tab 210, Substitute Rights tab 212, Requests tab 214 and Configure tab 216. Application selector 202 lets the user change applications from the User Manager to either the Group Manager, Object Manager or Publisher. In one embodiment, application selector 202 is a drop down menu. Search tool 204 enables a user to provide search information in order to search the directory for a set of one or more user identity profiles.
[0067] By selecting My Identity tab 206, a user is provided with the information stored in that user's identity profile. Create User Identity tab 208 allows a user with the appropriate privileges to create a new user identity profile (e.g. with a workflow). Deactivate User Identity tab 210 allows a user with proper privileges to remove an identity profile from the directory. Substitute Rights tab 212 allows the user to indicate who can proxy that user and allows the user to be a proxy for someone else. Request tab 214 allows a user to monitor workflows that are in progress or recently completed. Depending on the user's privileges, by selecting request tab 214, the user can see all workflows that involve that user, that are started by that user, that affect that user or that the user has privileges to view. Request tab 214 will indicate workflows for which there is an outstanding action to be done by the current user. The user can select that workflow and perform the task.
[0068] Configure tab 216 allows a user to configure various options for User Manger 42. The user must have sufficient privileges to access Configure tab 216. The user can perform attribute access control, delegate administration, define workflows and set the search base. Attribute access control includes controlling who has view and modify permissions for each attribute. Attributes can be set at any and all levels in an organization. The configuration also allows the specification of an e-mail notification list when a change to an attribute is requested. Delegation administration includes delegating administrative tasks to local administrators. An entity can choose what rights to delegate, whom to delegate to, and the scope to delegate. Workflow definition includes defining workflows for a particular organization, defining who will be responsible for the workflow actions and/or defining who will be receiving notifications for the workflow actions. Setting the search base includes setting the search base for a particular organization, person or set of persons. This will localize access to ensure security.
[0069] FIG. 5 depicts the various services provided by Group Manager 44. Once an entity is at the Group Manager home page, the entity can access application selector 230, search tool 232, My Groups tab 234, Create Groups tab 236, Request tab 238, Manage Subscriptions tab 239, Configure tab 240, and Manage Members tab 241. My Groups tab 234 indicates the groups of which the entity is a member. By selecting any of the groups identified by My Groups tab 234 or Search Tool 232, the user will be provided with the identity profile page for that particular group. From the profile page, the group can be modified or deleted. Create groups tab 236 allows the user to create a new group. Request tab 238 provides the user with access to currently pending and recently finished workflows that involve groups. Configure tab 240 allows the user to configure various information about groups in the Group Manager. While viewing the identity profile for a group, the entity can modify that profile if the entity has appropriate privileges.
[0070] Configure tab 240 allows an entity to provide attribute access control, delegate rights, define workflows and expand dynamic groups. Attribute access control includes controlling who has view and modify permissions for each attribute in group identity profiles. Additionally, e-mail notification lists can be created which are used to notify entities when a change to an attribute is requested. Administration tasks can be delegated to local administrators. An entity can choose what rights to delegate, who to delegate to, and what the scope of the delegation is. Workflow definition includes defining the workflows for a particular group. This includes defining who is responsible for the workflow actions and who will be receiving notifications for workflow actions. Note that some of the tabs and services may not be available to all entities, depending upon the privileges of those entities. Manage Subscriptions tab 239 allows users to subscribe to groups or unsubscribe from groups. Manage Members tab 241 allows users to view, add, remove, and search members of a group.
[0071] FIG. 6 depicts the services provided by Organization Manager 46. Organization manager 46 provides functionality to create, modify, delete and manage organizational objects. From the home page for Organization Manager 46, a user is provided with application selector 242, search tool 244, Create Organizational Profile tab 246, Request tab 248 and Configure tab 250. Application selector 242 allows the user to select a different application to access. Search tool 244 provides a user with the ability to enter search terms in order to search for one or more organizational objects. After performing a search, the user will be provided with a list of organizational objects meeting the search requirements. User can select any of these objects to view, modify or delete, if the user has sufficient privileges.
[0072] Create Organizational Profile tab 246 allows a user to create new organizational objects, if the user has sufficient privileges. Request tab 248 allows a user to access pending workflows and workflows that have recently been finished that relate to organizational objects. Access to Request tab 248 can be restricted and/or limited depending upon users privileges. If a user has a step to perform for a workflow, it will be indicated by Request tab 248.
[0073] Configure tab 250 allows the entity to perform attribute access control, delegate administration, define workflows and define container limits. Attribute access control includes controlling who has view and modify permissions for each attribute of an organizational identity profile. In addition, an entity can specify an e-mail notification list when a change to an attribute is requested. Delegating administration includes delegating administrative tasks to local administrators. An entity can choose what rights to delegate, whom to delegate to, and the scope of the delegation. Workflow definition includes defining the workflows for a particular organization, including who will be responsible for the workflow actions and who will be receiving notifications for the workflow. Container limits includes controlling how many objects can be created in an organization. This would also include defining who will be receiving notifications that a container limit has been met, has been violated or is close to being met.
[0074] Looking back at FIG. 5 , one of the services provided by Group Manager 44 is to the ability to view a list of all groups of which a user is a member. A user can be a static member of a group, a dynamic member of a group or a nested member of a group. A user is a static member if the user is explicitly listed as a member. For example, the user can be identified in a membership attribute of the group identity profile. A user is a dynamic member if the user's identity profile satisfies the LDAP rule that specifies the group's dynamic membership. The LDAP rule is stored in an attribute of the group identity profile. A user is a nested member of Group A if the user is a member of Group B and Group B is a member of Group A. The number of levels of nesting is not limited. A nested member of a group receives the privileges of being a member, including receiving access to resources available to the group.
[0075] When a user selects the My Groups tab 234, the user is provided with a list of the groups for which the user is a static member, dynamic member or nested member. In one embodiment, My Groups tab 234 visualizes the containment relationship of all groups in which the user is a member. This relationship is displayed as a tree on its side, with the roots on the left and the leaves on the right. The display allows the user to tunnel down from a particular group to display the groups contained in (e.g. that are a member of) that group, and so on.
[0076] FIG. 7 is a flowchart describing one embodiment of a process for determining all the groups of which a user is a member, including static membership, dynamic membership and nested membership. The process can be used to build a tree structure in which the nodes are groups that contain the user as a member. The leaf nodes of the tree are those groups in which the user is a static or dynamic member. All other nodes are groups in which the user is a nested member. The process of FIG. 7 assumes the following:
-
- [0077] Let u denote the target user;
- [0078] Let g denote a single group;
- [0079] Let G denote a set of groups, where the gi denotes the ith group in the set;
- [0080] Let Gs denote the set of groups in which u is a static member;
- [0081] Let Gd denote the set of groups in which u is a dynamic member; and
- [0082] Let Gt denote the set of groups in which each gi has a reference to each of its containing groups.
[0083] The process of FIG. 7 starts at step 300 when a user requests to view groups of which the user is a member. One example of performing step 310 is the selection of My Groups tab 234 (see FIG. 5 ). The system determines all groups of which the user is a static member (step 302). Each group identity profile has an attribute defining static membership. The system determines all groups for which the user is specifically listed in the static membership attribute. The system determines all groups of which the user is a dynamic member (step 304). A group can have an attribute that defines a dynamic membership in terms of an LDAP filter/rule. In one embodiment, the system compares the user's identity profile with the LDAP filter for each group to determine which filters are satisfied by the user's identity profile. Those LDAP filters that are satisfied are groups in which the user is a dynamic member. Further details regarding the identification of dynamic groups for a user are presented below.
[0084] The set of groups that the user is a static member of and the set of groups that the user is a dynamic member of are combined to determine the set of groups in which the user is either a dynamic or static member (step 306). The final set of groups Gt is initialized to the set of groups in which the user is either a static member or dynamic member (step 308). For each group in which the user is a static or dynamic member, the system calls the function Find_Containing_Groups (step 310). The results of the function are added to the set Gt. The resulting set Gt is reported as an identification of all the groups in which the user is either a static, dynamic or nested member (step 314). The resulting set can be reported in various ways including reporting the groups in a GUI for the user (e.g. a tree on its side), reporting the groups to the user in a non-graphical format, storing a list of the groups in a file, providing identifications of the groups to another process, etc. In one example, the Access System requests that the Identity System determine a user's groups so that the Access System can authorize a user to access a resource based on membership in a particular group.
[0085] The function Find_Containing_Groups (shown as step 312) includes three sub-steps. In the first sub-step (substep 1 in step 312), the system finds all groups that contain gj as a member. These are the containing groups of gj. In the second sub-step, the system iterates over the set of containing groups. In sub-step 2.i. (step 312), the system marks gi as a containing group gj. The markings are provided in order to graphically show the nesting relationship in My Groups tab 234. In sub-step 2.ii. (step 312), the system recursively finds the containing groups of gi. In sub-step 3 (step 312), the system returns the closure of the set of containing groups.
[0086] FIG. 8 is a second embodiment of a process for determining the groups in which the user is a member. The process of FIG. 8 is a more optimized method than FIG. 7 . The process of FIG. 8 utilizes the following assumptions:
-
- [0087] Let u denote the target user;
- [0088] Let g denote a single group;
- [0089] Let G denote a set of groups where gi denotes the ith group in the set;
- [0090] Let Gs denote the set of groups in which u is a static member;
- [0091] Let Gd denote the set of groups in which u is a dynamic member;
- [0092] Let Gni denote the set of groups in which u is a nested member, where i denotes the ith level of nesting;
- [0093] Let Gn denote the set of Gni where i is the ith set of groups;
- [0094] Let Gc be a set of groups, where gj denotes the jth group in the set; and
- [0095] Let Gm be a set of groups, where gk denotes the kth group in the set, such that for all gk, there exists gj such that gk is a static member of gj.
[0096] In step 340 of FIG. 8 , the system receives a request to view groups of which a user is a member. One example of performing step 340 is the user selecting My Groups tab 234. The system determines the set of groups Gs in which the user is a static member (step 342). The system determines the set of groups Gd in which the user is a dynamic member (step 344). The variable i is initialized to nesting level 0 (step 346). Gni is initialized to be the union of Gs and Gd (step 348). The system iterates until the set of groups for the ith level of nesting is empty, finding the (i+1th) set of groups which contain groups that have a static member that is in the ith set of groups (step 350).
[0097] The system iterates over the set of groups in Gn (step 352). In step a, Gc is set to Gni+1. In step b, Gm is assigned to equal Gni. In step c, the system iterates over the containing set of groups Gc. In step d, the system iterates over the contained set of groups Gm. In step e, the system determines if group gk (the contained group under consideration) is a static member of the group gj (the containing group under consideration). In step f, the containing group gj is marked as a containing group of gk, if gk is a static member of gj. The system iterates over the set of Gni, adding each set of groups to the final set Gt (step 354). The resulting set of groups Gt is reported back to the requester (step 356).
[0098] FIG. 9 is a flowchart describing one embodiment of a process for identifying all of the dynamic groups that include a user (step 304, FIG. 7 and step 344, FIG. 8 ). This process is described with reference to the Identity System, but in alternate embodiments, the process can be carried out by the Access System, an integrated Access System and Identity System, or another type of system. In one embodiment, the user is represented in the Identity System by a user profile, which may also be referred to as a user object. In further embodiments, dynamic groups are identified for an entity other than a user. Embodiments of the invention can also be implemented for dynamic profiles other than group profiles. For example, dynamic organization profiles can be employed. In another example, a role is defined by a dynamic profile, and the present invention is used to determine the roles that correspond to an entity, such as a user. An example role is a job type, such as manager.
[0099] The Identity System identifies a set of dynamic groups that have the potential for including the user as a member (step 400). In one implementation, the set may include all dynamic groups accessible by the Identity System. In alternate implementations, the identified set of dynamic groups is a subset of all the dynamic groups accessible by the Identity System. Greater details regarding the selection of a subset are provided below. The Identity System sets a partition size (step 402). The partition size is less than the number of dynamic groups in the set of dynamic groups identified in step 400. In one example, the partition size is set to 20.
[0100] The Identity System partitions the set of dynamic groups into test sets (step 404). In one embodiment, the Identity System assigns each dynamic group to a test set, so that each test set contains the number of dynamic groups specified by the partition size. For example, when the partition size is 20, the Identity System partitions a set of 100 dynamic groups into 5 test sets with each test set containing 20 dynamic groups. If the set of dynamic groups cannot be evenly divided into test sets of the partition size, the Identity System can use various methods for resolving the dilemma. In one example, the Identity System provides for all but one of the test sets to contain the number of dynamic groups specified by the partition size. The remaining one test set contains less than the partition size. For example, when the partition size is 20, the Identity System partitions a set of 98 dynamic groups into 4 test sets of 20 dynamic groups and 1 test set of 18 dynamic groups. In further embodiments, multiple test sets can have less than the partition size of dynamic groups. Alternatively, one or more test sets may have more dynamic groups than specified by the partition size. In another embodiment, partitioning is not based on size. An alternate mechanism is employed, such as filter similarity.
[0101] The Identity System selects one of the test sets (step 406) and determines whether the user corresponds to the test set (step 408). In one implementation, the Identity System determines correspondence (step 408) by determining whether the user satisfies the requirements of any of the filters for the test set's dynamic groups. For example, the Identity System determines whether the attributes in the user's profile meet the requirements of any of the filters for the test set's dynamic groups. In order to make this determination, the Identity System employs a test set filter in one embodiment. The test set filter is satisfied if any of the filters from the test set's dynamic group are satisfied. In one example, the test set filter is a logical OR of the filters for the dynamic groups in the test set.
[0102] Using a single test set filter is beneficial when the user and dynamic group profiles are maintained in a directory server. The Identity System evaluates the user's attributes through a single comparison access of the user's profile using the test set filter—eliminating the need to access the user profile for each dynamic group in the test set. Greater details about determining whether the user corresponds to a test set (step 408) are provided below.
[0103] If the user does not correspond to the test set (step 408), the Identity System removes the dynamic groups in the test set from the set of dynamic groups identified in step 400 (step 410). Otherwise, the Identity System does not alter the list of dynamic groups in the identified set. The Identity System goes on to determine whether any of the test sets have not yet been selected (step 412). If an unselected test remains, another test set is selected (step 406) and the above-described process is repeated. Otherwise, the Identity System determines whether to perform further partitioning (step 414). If not, the process is complete. Otherwise, the Identity System sets a new partition size (step 402) and repeats the above-described process.
[0104] In one implementation, the Identity System proceeds with further partitioning, unless the last partition size employed was 1. In this implementation, further partitioning causes the remaining dynamic groups in the initial set to be partitioned again (step 404) using a newly selected partition size. The new partition size is less than the previous partition size in one embodiment. In one example, the partition size is half of the prior partition size. When the partition size reaches a value of 1, the Identity System partitions each of the remaining dynamic groups into its own test set. As a result, the correspondence evaluation is step 408 and subsequent removal of non-corresponding dynamic groups in step 410 leave a final list of dynamic groups. The final list of dynamic groups are all of the dynamic groups from the initial set that include the user as a member.
[0105] FIG. 10 is a flow chart describing one embodiment of a process for identifying a set of dynamic groups (step 400, FIG. 9 ). The Identity System selects a dynamic group that is accessible by the Identity System (step 430). The Identity System determines whether the user's searchbase is within the searchbase of the rule of the dynamic group (step 432). In one such embodiment, the user and dynamic group profiles are maintained in an LDAP directory server. In step 432, the Identity System determines whether the distinguished name of the user has the potential for falling within the directory tree path specified by the LDAP rule governing the dynamic group's membership. In LDAP implementations, the user's distinguished name is frequently maintained in a local memory, making it accessible without the need for a directory server access. This can enable the elimination of many non-corresponding dynamic groups without the need for multiple directory server accesses.
[0106] For example, the entity may be employee 1 (node 150) shown in FIG. 3 . The Identity System determines whether the dynamic group's LDAP rule has the potential for accepting a user in Org A (node 136, FIG. 3 ) of Company A (node 132, FIG. 3 ). If so, the user searchbase falls within the searchbase of the rule of the dynamic group. If not, the user searchbase is considered not to fall within the searchbase of the rule of the dynamic group. As an example, if the dynamic group's filter only calls for users in Company B (node 134, FIG. 3 ), the user searchbase is considered not to fall within the searchbase of the rule of the dynamic group.
[0107] If the user searchbase is within the searchbase of the rule of the dynamic group, Identity System includes the dynamic group in the set of dynamic groups identified in step 400 of FIG. 9 (step 434). Otherwise, the dynamic group is not added to the set. The Identity System goes on to determine whether any accessible dynamic groups have not yet been selected (step 436). If all accessible dynamic groups have been selected, the process is complete. Otherwise, a new dynamic group is selected and the process in FIG. 10 is repeated.
[0108] In an alternate embodiment, an LDAP directory is not employed. Various other data management solutions can be implemented. For example, the LDAP directory server can be replaced by a relational database.
[0109] FIG. 11 is a flow chart describing one embodiment of a process for determining whether a user corresponds to a test set including at least one dynamic group (step 408, FIG. 9 ). The process shown in FIG. 11 can be employed in embodiments where the user and group profiles are maintained in a directory server. The Identity System sets the matching criteria for the test set (step 450). In one implementation, the matching criteria is an LDAP rule with 3 components set by the Identity System.
[0110] The 3 components include a filter, searchbase, and scope. The Identity System sets the filter component, so that the filter is satisfied if the filter of any dynamic group in the test set is satisfied. In one implementation, the test set's filter is a logical OR of the filters from the test set's dynamic groups. The Identity System sets the searchbase component to the distinguished name of the user and the scope to base object. A base object scope is a standard LDAP scope that restricts searching to the identified searchbase. In alternate embodiments, the scope can be set differently, such as single level or whole subtree. In further embodiments, LDAP is not employed. For example, a relational database can be implemented with matching criteria defined by an SQL query.
[0111] After setting the matching criteria, the Identity System performs a search of the directory server based on the matching criteria from step 450 (step 452). In the LDAP environment, the Identity System employs the 3 component rule to perform the search. If the search is successful, the user profile is recognized as a match—indicating that the user corresponds to the test set (step 454). Otherwise, an unsuccessful search yields a failed result—indicating that the user does not correspond to the test set (step 454).
[0112] In an alternate embodiment, a test filter is employed to determine whether a user corresponds to a test set including at least one dynamic group (step 408, FIG. 9 ). This avoids the need to access Directory Server 36 when making the determination. The test filter maintains a local copy of the user profile and compares the local copy to the matching criteria.
[0113] FIG. 12 is a flowchart describing an alternate embodiment of a process for identifying dynamic groups corresponding to a user. Each step in FIG. 12 with the same reference number as a step in FIG. 9 operates in the same manner as described above for the step in FIG. 9 . In FIG. 12 , the Identity System drills down into each initial test set to remove all dynamic groups from the initial test set that do not correspond to the user (step 470). The Identity System performs this operation if the user is found to correspond to the initial test set in step 408. In drilling down, the Identity System repeatedly partitions the initial test set and evaluates the partitions for matches to the user—employing the same operation described above for partitioning and evaluating correspondence of the initially identified set of dynamic groups. The process shown in FIG. 12 allows multiple threads of operation to conceivably drill down into multiple initial test sets—potentially increasing the speed of identifying dynamic groups that correspond to a user.
[0114] The foregoing detailed description of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. The described embodiments were chosen in order to best explain the principles of the invention and its practical application to thereby enable others skilled in the art to best utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims appended hereto.
Claims
We claim:
1. A method of identifying dynamic groups corresponding to a user, the method comprising:
partitioning a set of dynamic groups into multiple test sets, wherein each test set in said multiple test sets includes at least one dynamic group from said set of dynamic groups; and
for each test set in said multiple test sets, determining whether said user corresponds to said test set, wherein said test set includes multiple dynamic groups from said set of dynamic groups;
eliminating from said set of dynamic groups all dynamic groups in each test set in which it is determined that said user does not correspond to said test set;
partitioning said set of dynamic groups into multiple second test sets, wherein each test set in said multiple second test sets includes at least one dynamic group from said set of dynamic groups; and
determining whether said user corresponds to a test set in said multiple second test sets.
2. A method according to claim 1, wherein determining whether said user corresponds to a test set in said multiple test sets comprises:
setting matching criteria for said test set; and
determining whether said user satisfies said matching criteria.
3. A method according to claim 2, wherein each dynamic group in said test set corresponds to at least a portion of said matching criteria.
4. A method according to claim 2, wherein said matching criteria includes a logical OR of at least one filter from each dynamic group in said test set.
5. A method according to claim 2, wherein said matching criteria is satisfied if a filter for any dynamic group in said test set is satisfied.
6. A method according to claim 2, wherein:
said matching criteria is a rule including a filter component, and
said filter component is satisfied if any filter from a dynamic group in said test set is satisfied.
7. A method according to claim 6, wherein said filter component is a logical OR of a filter from each dynamic group in said test set.
8. A method according to claim 6, wherein:
said filter component is a logical OR of a filter defining each dynamic group in said test set.
9. A method according to claim 6, wherein:
said rule includes a searchbase component, and
said searchbase component corresponds to a subtree containing said user.
10. A method according to claim 6, wherein:
said rule includes a searchbase component, and
said searchbase component corresponds to said user.
11. A method according to claim 10, wherein said user is represented by a user profile in a directory.
12. A method according to claim 11, wherein determining whether said user satisfies said matching criteria comprises:
searching said directory using said rule.
13. A method according to claim 12, wherein searching said directory comprises a LDAP search.
14. A method according to claim 11, wherein said directory employs LDAP.
15. A method according to claim 14, wherein:
said rule includes a scope component; and
said scope component corresponds to a base object scope.
16. A method according to claim 15, wherein determining whether said user satisfies said matching criteria comprises:
searching said directory using said rule.
17. A method according to claim 11, wherein said directory is in communication with an Identity System.
18. A method according to claim 1, wherein determining whether said user corresponds to a test set in said multiple test sets comprises:
determining that all dynamic groups in a test set do not correspond to said user, based on a single directory search.
21. A method according to claim 1, wherein:
said method is performed as part of an integrated Access System and Identity System.
22. A method according to claim 1, wherein determining whether said user corresponds to a test set is performed without accessing a directory server.
23. A method according to claim 22, wherein determining whether said user corresponds to a test set is performed using a filter tester.
24. A method according to claim 1, wherein determining whether said user corresponds to a test set is performed using an SQL command.
25. A method of identifying dynamic groups corresponding to a user, the method comprising:
partitioning a set of dynamic groups into multiple test sets, wherein each test set in said multiple test sets includes at least one dynamic group from said set of dynamic groups;
for each test set in said multiple test sets, determining whether said user corresponds to said test set, wherein said test set includes multiple dynamic groups from said set of dynamic groups;
if it is determined that said user does not correspond to a first test set, removing from said first test set all dynamic groups that do not correspond to said user;
partitioning said first test set into multiple second test sets, wherein each test set in said multiple second test sets includes at least one dynamic group from said first test set; and
determining whether said user corresponds to a test set in said multiple second test sets.
26. A method according to claim 25, wherein said method further comprises:
eliminating all dynamic groups in said first test set from said set of dynamic groups, if it is determined that said user does not correspond to said test set.
27. A method according to claim 26, wherein determining whether said user corresponds to a test set, removing from said test set all dynamic groups in said test set that do not correspond to said user, and eliminating all dynamic groups in said test set from said set of dynamic groups are performed for each test set in said multiple test sets.
28. One or more processor readable storage devices having processor readable code embodied on said one or more processor readable storage devices, said processor readable code for programming one or more processors and comprising:
code for partitioning a set of dynamic groups into multiple test sets, wherein each test set in said multiple test sets includes at least one dynamic group from said set of dynamic groups;
for each test set in said multiple test sets, code for determining whether a user corresponds to said test set, wherein said test set includes multiple dynamic groups from said set of dynamic groups;
code for eliminating from said set of dynamic groups all dynamic groups in each test set in which it is determined that said user does not correspond to said test set;
code for partitioning said set of dynamic groups into multiple second test sets, wherein each test set in said multiple second test sets includes at least one dynamic group from said set of dynamic groups; and
code for determining whether said user corresponds to a test set in said multiple second test sets.
29. One or more processor readable storage devices according to claim 28, wherein said code for determining whether a user corresponds to a test set comprises:
code for setting matching criteria for said test set; and
code for determining whether said user satisfies said matching criteria.
30. One ore more processor readable storage devices according to claim 29, wherein:
said matching criteria is a rule including a filter component, and
said filter component is satisfied if a filter for any dynamic group in said test set is satisfied.
31. One or more processor readable storage devices according to claim 30, wherein:
said rule includes a searchbase component, and
said searchbase component corresponds to said user.
32. One or more processor readable storage devices according to claim 31, wherein said user is represented by a user profile in a directory.
33. One or more processor readable storage devices according to claim 32, wherein said code for determining whether said user satisfies said matching criteria comprises:
code for searching said directory using said rule.
34. One or more processor readable storage devices according to claim 33, wherein said code for searching said directory using said rule comprises code for performing a LDAP search.
35. One or more processor readable storage devices according to claim 32, wherein:
said rule includes a scope component, and
said scope component corresponds to a base object scope.
36. One or more processor readable storage devices according to claim 35, wherein said code for determining whether said user satisfies said matching criteria comprises:
code for searching said directory using said rule.
37. One or more processor readable storage devices according to claim 28, wherein said processor readable code further comprises:
code for removing from a test set all dynamic groups in said test set that do not correspond to said user, if it is determined that said user does correspond to said test set.
38. One or more processor readable storage devices according to claim 37, wherein said code for removing from said test set all dynamic groups in said test set that do not correspond to said user
code for removing from said set of dynamic groups said all dynamic groups in said test set that do not correspond to said user.
39. One or more processor readable storage devices according to claim 28, wherein said processor readable code comprises:
code for removing all dynamic groups that do not correspond to said user from each test set in which it is determined that said user does not correspond to the test set.
40. One or more processor readable storage devices according to claim 28, wherein said code for determining whether a user corresponds to a test set comprises:
code for determining that all dynamic groups in said test set do not correspond to said user, based on a single directory search.
41. One or more processor readable storage devices according to claim 28, wherein:
said processor readable code is executable by an Identity System.
42. One or more processor readable storage devices according to claim 28, wherein:
said processor readable code is executable by an Access System.
43. One or more processor readable storage devices according to claim 28, wherein:
said processor readable code is executable by an integrated Access System and Identity System.
44. An apparatus, comprising:
one or more storage devices; and
one or more processors in communication with said one or more storage devices, said one or more storage devices comprising processor readable code for programming said one or more processors, said processor readable code comprising:
code for partitioning a set of dynamic groups into multiple test sets, wherein each test set in said multiple test sets includes at least one dynamic group from said set of dynamic groups;
for each test set in said multiple test sets, code for determining whether a user corresponds to said test set, wherein said test set includes multiple dynamic groups from said set of dynamic groups;
code for eliminating from said set of dynamic groups all dynamic groups in each test set in which it is determined that said user does not correspond to said test set;
code for partitioning said set of dynamic groups into multiple second test sets, wherein each test set in said multiple second test sets includes at least one dynamic group from said set of dynamic groups; and
code for determining whether said user corresponds to a test set in said multiple second test sets.
45. An apparatus according to claim 44, wherein said code for determining whether a user corresponds to a test set comprises:
code for setting matching criteria for said test set; and
code for determining whether said user satisfies said matching criteria.
46. An apparatus according to claim 45, wherein:
said matching criteria is a rule including a filter component, and
said filter component is satisfied if a filter for any dynamic group in said test set is satisfied.
47. An apparatus according to claim 46, wherein:
said rule includes a searchbase component, and
said searchbase component corresponds to said user.
48. An apparatus according to claim 47, wherein said user is represented by a user profile in a directory.
49. An apparatus according to claim 48, wherein said code for determining whether said user satisfies said matching criteria comprises:
code for searching said directory using said rule.
50. An apparatus according to claim 48, wherein:
said rule includes a scope component; and
said scope component corresponds to a base object scope.
51. An apparatus according to claim 50, wherein said code for determining whether said user satisfies said matching criteria comprises:
code for searching said directory using said rule.
52. An apparatus according to claim 44, wherein said processor readable code further comprises:
code for removing all dynamic groups that do not correspond to said user from each test set in which it is determined that said user does correspond to the test set.
53. An apparatus according to claim 44, wherein said code for determining whether a user corresponds to a test set comprises:
code for determining that all dynamic groups in said test set do not correspond to said user, based on a single directory search.
54. An apparatus according to claim 44, wherein:
said processor readable code is executable by an Identity System.
55. An apparatus according to claim 44, wherein:
said processor readable code is executable by an Access System.
56. A method of identifying dynamic profiles corresponding to an entity, the method comprising:
partitioning a set of dynamic profiles into multiple test sets, wherein each test set in said multiple test sets includes at least one dynamic profile from said set of dynamic profiles;
for each test said in said multiple test sets, determining whether said entity corresponds to said test set, wherein said test set includes multiple dynamic profiles from said set of dynamic profiles;
eliminating from said set of dynamic profiles all dynamic profiles in each test set in which it is determined that said entity does not correspond to said test set;
partitioning said set of dynamic profiles into multiple second test sets, wherein each test set in said multiple second test sets includes at least one dynamic profile from said set of dynamic profiles; and
determining whether said entity corresponds to a test set in said multiple second test sets.
57. A method according to claim 56, wherein determining whether an entity corresponds to a test set comprises:
setting matching criteria for said test set; and
determining whether said entity satisfies said matching criteria.
58. A method according to claim 57, wherein said matching criteria is satisfied if a filter for any dynamic profile in said test set is satisfied.
59. A method according to claim 57, wherein:
said matching criteria is a rule including a filter component, and
said filter component is satisfied if any filter from a dynamic group in said test set is satisfied.
60. A method according to claim 59, wherein:
said rule includes a searchbase component;
said searchbase component corresponds to said entity;
said rule includes a scope component; and
said scope component corresponds to a base object scope.
61. A method according to claim 60, wherein said entity is represented by a profile in a directory, wherein determining whether said entity satisfies said matching criteria comprises:
searching said directory using said rule.
62. A method according to claim 56, wherein said entity is represented by a user profile and said set of dynamic profiles includes dynamic group profiles.
63. A method according to claim 56, wherein determining whether an entity corresponds to a test set comprises:
determining that all dynamic profiles in said test set do not correspond to said entity, based on a single directory search.
64. One or more processor readable storage devices having processor readable code embodied on said one or more processor readable storage devices, said processor readable code for programming one or more processors and comprising:
code for partitioning a set of dynamic profiles into multiple test sets, wherein each test set in said multiple test sets includes at least one dynamic profile from said set of dynamic profiles;
for each test said in said multiple test sets, code for determining whether said entity corresponds to said test set, wherein said test set includes multiple dynamic profiles from said set of dynamic profiles;
code for eliminating from said set of dynamic profiles all dynamic profiles in each test set in which it is determined that said entity does not correspond to said test set;
code for partitioning said set of dynamic profiles into multiple second test sets, wherein each test set in said multiple second test sets includes at least one dynamic profile from said set of dynamic profiles; and
code for determining whether said entity corresponds to a test set in said multiple second test sets.
65. One or more processor readable storage devices according to claim 64, wherein said code for determining whether an entity corresponds to a test set comprises:
code for setting matching criteria for said test set; and
code for determining whether said entity satisfies said matching criteria, wherein said matching criteria is satisfied if a filter for any dynamic profile in said test set is satisfied.
66. One or more processor readable storage devices according to claim 65, wherein:
said matching criteria is a rule;
said rule includes a filter component;
said filter component is satisfied if a filter for any dynamic profile in said test set is satisfied;
said rule includes a searchbase component;
said searchbase component corresponds to said entity;
said rule includes a scope component; and
said scope component corresponds to a base object scope.
67. One or more processor readable storage devices according to claim 66, wherein said entity is represented by a profile in a directory, wherein said code for determining whether said entity satisfies said matching criteria,
code for searching said directory using said rule.
68. One or more processor readable storage devices according to claim 64, wherein said code for determining whether an entity corresponds to a test set comprises:
determining that all dynamic profiles in said test set do not correspond to said entity, based on a single directory search.
69. An apparatus, comprising:
one or more storage devices; and
one or more processors in communication with said one or more storage devices, said one or more storage devices comprising processor readable code for programming said one or more processors, said processor readable code comprising:
code for partitioning a set of dynamic groups into multiple test sets, wherein each test set in said multiple test sets includes at least one dynamic group from said set of dynamic groups;
for each test set in said multiple test sets, code for determining whether said user corresponds to said test set, wherein said test set includes multiple dynamic groups from said set of dynamic groups;
if it is determined that said user does not correspond to a first test set, code for removing from said first test set all dynamic groups that do not correspond to said user;
code for partitioning said first test set into multiple second test sets, wherein each test set in said multiple second test sets includes at least one dynamic group from said first test set; and
code for determining whether said user corresponds to a test set in said multiple second test sets.
70. One or more processor readable storage devices having processor readable code embodied on said one or more processor readable storage devices, said processor readable code for programming one or more processors and comprising:
code for partitioning a set of dynamic groups into multiple test sets, wherein each test set in said multiple test sets includes at least one dynamic group from said set of dynamic groups;
for each test set in said multiple test sets, code for determining whether said user corresponds to said test set, wherein said test set includes multiple dynamic groups from said set of dynamic groups;
if it is determined that said user does not correspond to a first test set, code for removing from said first test set all dynamic groups that do not correspond to said user;
code for partitioning said first test set into multiple second test sets, wherein each test set in said multiple second test sets includes at least one dynamic group from said first test set; and
code for determining whether said user corresponds to a test set in said multiple second test sets.
71. An apparatus, comprising:
one or more storage devices; and
one or more processors in communication with said one or more storage devices, said one or more storage devices comprising processor readable code for programming said one or more processors, said processor readable code comprising:
code for partitioning a set of dynamic profiles into multiple test sets, wherein each test set in said multiple test sets includes at least one dynamic profile from said set of dynamic profiles;
for each test said in said multiple test sets, code for determining whether said entity corresponds to said test set, wherein said test set includes multiple dynamic profiles from said set of dynamic profiles;
code for eliminating from said set of dynamic profiles all dynamic profiles in each test set in which it is determined that said entity does not correspond to said test set;
code for partitioning said set of dynamic profiles into multiple second test sets, wherein each test set in said multiple second test sets includes at least one dynamic profile from said set of dynamic profiles; and
code for determining whether said entity corresponds to a test set in said multiple second test sets.
72. One or more processor readable storage devices having processor readable code embodied on said one or more processor readable storage devices, said processor readable code for programming one or more processors and comprising:
code for partitioning a set of dynamic profiles into multiple test sets, wherein each test set in said multiple test sets includes at least one dynamic profile from said set of dynamic profiles;
for each test said in said multiple test sets, code for determining whether said entity corresponds to said test set, wherein said test set includes multiple dynamic profiles from said set of dynamic profiles;
code for eliminating from said set of dynamic profiles all dynamic profiles in each test set in which it is determined that said entity does not correspond to said test set;
code for partitioning said set of dynamic profiles into multiple second test sets, wherein each test set in said multiple second test sets includes at least one dynamic profile from said set of dynamic profiles; and
code for determining whether said entity corresponds to a test set in said multiple second test sets.
Patent Citations (68)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5077666(A) | 1991-12-01 | Brimm et al. | Applicant |
| US5455953(A) | 1995-10-01 | Russell | Applicant |
| US5530861(A) | 1996-06-01 | Diamant et al. | Applicant |
| US5581691(A) | 1996-12-01 | Hsu et al. | Applicant |
| US5664154(A) | 1997-09-01 | Purcell et al. | Applicant |
| US5678041(A) | 1997-10-01 | Baker et al. | Applicant |
| US5692125(A) | 1997-11-01 | Schloss et al. | Applicant |
| US5708780(A) | 1998-01-01 | Levergood et al. | Applicant |
| US5721900(A) | 1998-02-01 | Banning et al. | Examiner |
| US5724595(A) | 1998-03-01 | Gentner | Applicant |
| US5732408(A) | 1998-03-01 | Takahashi | Applicant |
| US5764890(A) | 1998-06-01 | Glasser et al. | Applicant |
| US5848273(A) | 1998-12-01 | Fontana et al. | Applicant |
| US5944824(A) | 1999-08-01 | He | Applicant |
| US5991810(A) | 1999-11-01 | Shapiro et al. | Applicant |
| US5999911(A) | 1999-12-01 | Berg et al. | Applicant |
| US6073109(A) | 2000-06-01 | Flores et al. | Applicant |
| US6098056(A) | 2000-08-01 | Rusnak et al. | Applicant |
| US6131120(A) | 2000-10-01 | Reid | Applicant |
| US6134634(A) | 2000-10-01 | Marshall, Jr. et al. | Applicant |
| US6138104(A) | 2000-10-01 | Marchak et al. | Applicant |
| US6141778(A) | 2000-10-01 | Kane et al. | Applicant |
| US6151531(A) | 2000-11-01 | Frankel et al. | Applicant |
| US6158010(A) | 2000-12-01 | Moriconi et al. | Applicant |
| US6182142(B1) | 2001-01-01 | Win et al. | Applicant |
| US6208986(B1) | 2001-03-01 | Schneck et al. | Applicant |
| US6212558(B1) | 2001-04-01 | Antur et al. | Applicant |
| US6253239(B1) | 2001-06-01 | Shklar et al. | Applicant |
| US6256739(B1) | 2001-07-01 | Skopp et al. | Applicant |
| US6266420(B1) | 2001-07-01 | Langford et al. | Applicant |
| US6278993(B1) | 2001-08-01 | Kumar et al. | Applicant |
| US6338097(B1) | 2002-01-01 | Krenzke et al. | Applicant |
| US6347312(B1) | 2002-02-01 | Byrne et al. | Applicant |
| US6349306(B1) | 2002-02-01 | Malik et al. | Applicant |
| US6366913(B1) | 2002-04-01 | Fitler et al. | Examiner |
| US6401101(B1) | 2002-06-01 | Britton et al. | Applicant |
| US6434531(B1) | 2002-08-01 | Lancelot et al. | Applicant |
| US6442567(B1) | 2002-08-01 | Retallick et al. | Applicant |
| US6490655(B1) | 2002-12-01 | Kershaw | Applicant |
| US6499023(B1) | 2002-12-01 | Dong et al. | Applicant |
| US6523022(B1) | 2003-02-01 | Hobbs | Applicant |
| US6539379(B1) | 2003-03-01 | Vora et al. | Applicant |
| US6611840(B1) | 2003-08-01 | Baer et al. | Applicant |
| US6671695(B2) | 2003-12-01 | McFadden | Examiner |
| US6721804(B1) | 2004-04-01 | Rubin et al. | Applicant |
| US6732178(B1) | 2004-05-01 | Van Horne et al. | Applicant |
| US6741853(B1) | 2004-05-01 | Jiang et al. | Applicant |
| US6768988(B2) | 2004-07-01 | Boreham et al. | Examiner |
| US6785686(B2) | 2004-08-01 | Boreham et al. | Applicant |
| US6839701(B1) | 2005-01-01 | Baer et al. | Applicant |
| US2002/0032684(A1) | 2002-03-01 | Kobayashi et al. | Applicant |
| US2002/0038306(A1) | 2002-03-01 | Griffin et al. | Applicant |
| US2002/0049749(A1) | 2002-04-01 | Helgeson et al. | Applicant |
| US2003/0028752(A1) | 2003-02-01 | Fu et al. | Applicant |
| US2003/0037052(A1) | 2003-02-01 | Kitain et al. | Applicant |
| US2003/0055806(A1) | 2003-03-01 | Wong et al. | Applicant |
| US2003/0088708(A1) | 2003-05-01 | Lewallen | Applicant |
| US2003/0105733(A1) | 2003-06-01 | Boreham et al. | Applicant |
| US2003/0105742(A1) | 2003-06-01 | Boreham et al. | Applicant |
| US2003/0115196(A1) | 2003-06-01 | Boreham et al. | Applicant |
| US2003/0115548(A1) | 2003-06-01 | Melgar | Applicant |
| US2003/0120593(A1) | 2003-06-01 | Bansal et al. | Applicant |
| US2003/0120601(A1) | 2003-06-01 | Ouye et al. | Examiner |
| US2003/0144982(A1) | 2003-07-01 | Reulein et al. | Applicant |
| US2003/0145074(A1) | 2003-07-01 | Penick | Applicant |
| US2003/0204481(A1) | 2003-10-01 | Lau | Applicant |
| US2003/0217127(A1) | 2003-11-01 | Sinn | Applicant |
| US2004/0024762(A1) | 2004-02-01 | Agarwal et al. | Applicant |
Non-Patent Literature (23)
- U.S. Appl. No. 10/314,888, Office Action dated Jan. 26, 2006, 31 pages.Applicant
- U.S. Appl. No. 10/327,607, Office Action dated Feb. 13, 2006, 5 pages.Applicant
- U.S. Appl. No. 10/345,873, Office Action dated Sep. 9, 2006, 13 pages.Applicant
- U.S. Appl. No. 10/345,873, Office Action dated Mar. 10, 2006, 7 pages.Applicant
- U.S. Appl. No. 10/354,913, Office Action dated Sep. 9, 2003, 19 pages.Applicant
- U.S. Appl. No. 10/354,913, Final Oction Action dated Apr. 6, 2004, 22 pages.Applicant
- U.S. Appl. No. 10/354,913, Office Action dated Apr. 15, 2005, 20 pages.Applicant
- U.S. Appl. No. 10/354,913, Final Office Action dated Dec. 5, 2005, 15 pages.Applicant
- U.S. Appl. No. 10/354,914, Office Action dated Aug. 1, 2005, 15 pages.Applicant
- U.S. Appl. No. 10/354,914, Final Office Action dated Feb. 10, 2006, 16 pages.Applicant
- U.S. Appl. No. 10/327,607, Office Action dated Apr. 18, 2006, 33 pages.Applicant
- U.S. Appl. No. 10/354,913, Office Action dated May 12, 2005, 16 pages.Applicant
- Leon, McAfee's NetTools Promises to Ease Network Desktop Diagnosis, InfoWorld, San Mateo, Jul. 24, 1995, vol. 17, Iss. 30, p. 53.Applicant
- Cooney, IBM rolls out host- and server-based mgmt. apps, Network World, Framingham, Feb. 6, 1995, vol. 12, Iss. 6, pp. 6-7.Applicant
- Walsh, Remedy releases three applications for help-desk suite, InfoWorld, San Mateo, Apr. 21, 1997, vol. 19, Iss. 16, p. 34.Applicant
- Schmersal, Testing to maintain service standards, Communications News, Nokomis, Mar. 1998, vol. 35, Iss. 3, pp. 22-23.Applicant
- Musthaler, The trouble with help desk selection, Network World, Framingham, Feb. 20, 1995, vol. 12, Iss. 8, pp. 35-39.Applicant
- Clear Trust, Unified Access Management, Securant Technologies, Inc., pp. 1-23, 1997.Applicant
- SiteMinder Agent Operations, Verson 4.0, Netegrity Inc., 1997.Applicant
- SiteMinder Deployment Guide, Version 4.0, Netegrity Inc., 1997.Applicant
- SiteMinder Policy Server Operations Guide, Version 4.0, Netegrity Inc., 1997.Applicant
- SiteMinder Developer's API Guide, Version 4.0, Netegrity Inc., 1997.Applicant
- SiteMinder Installation Guide, Version 4.0, Netegrity Inc., 1997.Applicant