Method and system for implementing changes to security policies in a distributed security system

Description

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to security systems for data and, more particularly, to security systems that protect data in an inter/intra enterprise environment.

2. Description of Related Art

The Internet is the fastest growing telecommunications medium in history. This growth and the easy access it affords have significantly enhanced the opportunity to use advanced information technology for both the public and private sectors. It provides unprecedented opportunities for interaction and data sharing among businesses and individuals. However, the advantages provided by the Internet come with a significantly greater element of risk to the confidentiality and integrity of information. The Internet is an open, public and international network of interconnected computers and electronic devices. Without proper security means, an unauthorized person or machine may intercept any information traveling across the Internet and even get access to proprietary information stored in computers that interconnect to the Internet, but are otherwise generally inaccessible by the public.

There are many efforts in progress aimed at protecting proprietary information traveling across the Internet and controlling access to computers carrying the proprietary information. Cryptography allows people to carry over the confidence found in the physical world to the electronic world, thus allowing people to do business electronically without worries of deceit and deception. Every day hundreds of thousands of people interact electronically, whether it is through e-mail, e-commerce (business conducted over the Internet), ATM machines, or cellular phones. The perpetual increase of information transmitted electronically has lead to an increased reliance on cryptography.

One of the ongoing efforts in protecting the proprietary information traveling across the Internet is to use one or more cryptographic techniques to secure a private communication session between two communicating computers on the Internet. The cryptographic techniques provide a way to transmit information across an unsecure communication channel without disclosing the contents of the information to anyone eavesdropping on the communication channel. Using an encryption process in a cryptographic technique, one party can protect the contents of the data in transit from access by an unauthorized third party, yet the intended party can read the data using a corresponding decryption process.

A firewall is another security measure that protects the resources of a private network from users of other networks. However, it has been reported that many unauthorized accesses to proprietary information occur from the inside, as opposed to from the outside. An example of someone gaining unauthorized access from the inside is when restricted or proprietary information is accessed by someone within an organization who is not supposed to do so. Due to the open nature of the Internet, contractual information, customer data, executive communications, product specifications, and a host of other confidential and proprietary intellectual property remain available and vulnerable to improper access and usage by unauthorized users within or outside a supposedly protected perimeter.

Many businesses and organizations have been looking for effective ways to protect their proprietary information. Typically, businesses and organizations have deployed firewalls, Virtual Private Networks (VPNs), and Intrusion Detection Systems (IDS) to provide protection. Unfortunately, these various security means have been proven insufficient to reliably protect proprietary information residing on private networks. For example, depending on passwords to access sensitive documents from within often causes security breaches when the password of a few characters long is leaked or detected.

Besides the difficulty in protecting resources on networks, security systems have transparently imposed security on documents while also permitting authorized parties to utilize the files as if there were no security. These security systems, however, are not robust systems capable of efficiently and reliably permitting changes to security criteria, which is particularly challenging with security systems operating in networked environments. Therefore, there is a need to provide more effective ways for security systems to secure and protect resources.

SUMMARY OF THE INVENTION

The invention relates to improved approaches for effectuating and communicating changes to security policies (or rules) in a distributed security system. The changes to security policies are distributed in a controlled manner to those users in the security system that are affected. As used herein, a user may mean a human user, a software agent, a group of users, a member of the group, a device and/or application. Besides a human user who needs to access a secured document, a software application or agent sometimes needs to access secured files in order to proceed forward. Accordingly, unless specifically stated, the “user” as used herein does not necessarily pertain to a human being. The distribution of such changes to security policies can be deferred for those affected users that are not activated (e.g., logged-in or on-line) with the security system.

The invention can be implemented in numerous ways, including as a method, system, device, and computer readable medium. Several embodiments of the invention are discussed below.

As a method for distributing a security policy change within a security system distributed over a computer network, the computer network having at least a server machine and a plurality of user computers, one embodiment of the invention includes at lest the acts of: receiving a security policy change at a server machine of the computer network; determining those one or more users that are affected by the security policy change; preparing a security policy message for the one or more users that are determined to be affected by the security policy change; and delivering the one or more security policy change messages to the user computers associated with the affected users.

As a security system for securing files from unauthorized access within a distributed computer network, one embodiment of the invention includes at least: a central server module operating on a central server; a local server module operating on a local server; and a plurality of client modules operating on user computers. The central server module stores security policy information that governs the type and extent of access to the secured files that are permitted by users via the user computers. The local server module receives at least a portion of the security policy information from the central server module. The client modules receive some or all of the portion of the security policy information from the local server module.

As a computer readable medium including at least computer program code for distributing a security policy change within a security system distributed over a computer network, the computer network having at least a server machine and a plurality of user computers, one embodiment of the invention includes at least computer program code for receiving a security policy change at a server machine of the computer network; computer program code for determining those one or more users that are affected by the security policy change; computer program code for preparing a security policy message for the one or more users that are determined to be affected by the security policy change; and computer program code for delivering the one or more security policy change messages to the user computers associated with the affected users.

Other objects, features, and advantages of the present invention will become apparent upon examining the following detailed description of an embodiment thereof, taken in conjunction with the attached drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other features, aspects, and advantages of the present invention will become better understood with regard to the following description, appended claims, and accompanying drawings wherein:

FIG. 1A shows a basic system configuration in which the invention may be practiced in accordance with an embodiment thereof.

FIG. 1B shows another system configuration in which the invention may be practiced in accordance with an embodiment thereof.

FIG. 1C shows still another system configuration in which the invention may be practiced in accordance with an embodiment thereof.

FIG. 1D shows internal construction blocks of a computing device in which the invention may be implemented and executed.

FIG. 2A is a block diagram of securing a created document according to one embodiment.

FIG. 2B is a diagram of a representative data structure for a secured file according to one embodiment.

FIG. 2C is a diagram of a representative directory structure including a clear folder and a secured folder according to one embodiment.

FIG. 3A is a diagram of a security system according to one embodiment of the invention.

FIG. 3B shows a functional block diagram of a server device according to one embodiment.

FIG. 3C shows a functional block diagram of a local server device according to one embodiment.

FIG. 3D shows a functional block diagram of a client machine according to one embodiment.

FIG. 4 is a flow diagram of security policy change processing according to one embodiment of the invention.

FIG. 5 is a flow diagram of security policy change message delivery processing according to one embodiment of the invention.

FIG. 6A is a flow diagram of security policy change queue storage processing according to one embodiment of the invention.

FIG. 6B is a flow diagram of efficiently delivering security policy change in a distributed network according to one embodiment of the invention.

FIG. 7 is a flow diagram of deferred delivery processing according to one embodiment of the invention.

DETAILED DESCRIPTION OF THE INVENTION

The present invention relates to improved approaches for effectuating and delivering changes to security policies in a distributed security system. The changes to security policies are distributed to those users in the security system that are affected. As used herein, the user may mean a human user, a software agent, a group of users, a device and/or application(s). Besides a human user who needs to access a secured document, a software application or agent sometimes needs to access the secured document in order to proceed forward. Accordingly, unless specifically stated, the “user” as used herein does not necessarily pertain to a human being. The distribution of such changes to security policies can be deferred for those affected users that are not activated (e.g., logged-in or on-line) with the security system.

The present invention is related to processes, systems, architectures and software products for providing pervasive security to digital assets. The present invention is particularly suitable in an enterprise environment. In general, pervasive security means that digital assets are secured (i.e., secured items) and can only be accessed by authenticated users with appropriate access rights or privileges. Digital assets may include, but not be limited to, various types of documents, multimedia files, data, executable code, images and texts.

In general, a secured file can only be accessed by authenticated users with appropriate access rights or privileges. Each secured file is provided with a header portion and a data portion, where the header portion contains, or points to, security information. The security information is used to determine whether access to associated data portions of secured files is permitted.

Secured files are files that require one or more keys, passwords, access privileges, etc. to gain access to their content. The security is often provided through encryption and access rules. The files, for example, can pertain to documents, multimedia files, data, executable code, images and text.

In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will become obvious to those skilled in the art that the present invention may be practiced without these specific details. The description and representation herein are the common meanings used by those experienced or skilled in the art to most effectively convey the substance of their work to others skilled in the art. In other instances, well-known methods, procedures, components, and circuitry have not been described in detail to avoid unnecessarily obscuring aspects of the present invention.

Reference herein to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Further, the order of blocks in process flowcharts or diagrams representing one or more embodiments of the invention do not inherently indicate any particular order nor imply any limitations in the invention.

Embodiments of the present invention are discussed herein with reference to FIGS. 1A-7. However, those skilled in the art will readily appreciate that the detailed description given herein with respect to these figures is for explanatory purposes as the invention extends beyond these limited embodiments.

FIG. 1A shows a basic system configuration in which the present invention may be practiced in accordance with one embodiment thereof. Documents or files may be created using an authoring tool executed on a client computer 100, which may be a desktop computing device, a laptop computer, or a mobile computing device. Exemplary authoring tools may include application programs such as Microsoft Office (e.g., Microsoft Word, Microsoft PowerPoint, and Microsoft Excel), Adobe FrameMaker and Adobe Photoshop.

According to one embodiment, the client computer 100 is loaded with a client module that is capable of communicating with a server 104 or 106 over a data network (e.g., the Internet or a local area network). According to another embodiment, the client computer 100 is coupled to the server 104 through a private link. As will be further explained below, a document or file created by an authoring tool can be secured by the client module. The client module, when executed, is configured to ensure that a secured document is secured at all times in a store (e.g., a hard disk or other data repository). The secured documents can only be accessed by users with proper access privileges. In general, an access privilege or access privileges for a user may include, but not be limited to, a viewing permit, a copying permit, a printing permit, an editing permit, a transferring permit, an uploading/downloading permit, and a location permit.

According to one embodiment, a created document is caused to go through an encryption process that is preferably transparent to a user. In other words, the created document is encrypted or decrypted under the authoring application so that the user is not aware of the process. A key (referred to herein as a user key) can be used to retrieve a file key to decrypt an encrypted document. Typically, the user key is associated with an access privilege for the user or a group of users. For a given secured document, only a user with a proper access privilege can access the secured document.

In one setting, a secured document may be uploaded via the network 110 from the computer 100 to a computing or storage device 102 that may serve as a central repository. Although not necessary, the network 110 can provide a private link between the computer 100 and the computing or storage device 102. Such link may be provided by an internal network in an enterprise or a secured communication protocol (e.g., VPN and HTTPS) over a public network (e.g., the Internet). Alternatively, such link may simply be provided by a TCP/IP link. As such, secured documents on the computer 100 may be remotely accessed.

In another setting, the computer 100 and the computing or storage device 102 are inseparable, in which case the computing or storage device 102 may be a local store to retain secured documents or receive secured network resources (e.g., dynamic Web contents, results of a database query, or a live multimedia feed). Regardless of where the secured documents or secured resources are actually located, a user, with proper access privilege, can access the secured documents or resources from the computer 100 or the computing or storage device 102 using an application (e.g., Internet Explorer, Microsoft Word or Acrobat Reader).

The server 104, also referred to as a local server, is a computing device coupled between a network 108 and the network 110. According to one embodiment, the server 104 executes a local version of a server module. The local version is a localized server module configured to service a group of designated users or client computers, or a location. Another server 106, also referred to as a central server, is a computing device coupled to the network 108. The server 106 executes the server module and provides centralized access control management for an entire organization or business. Accordingly, respective local modules in local servers, in coordination with the central server, form a distributed mechanism to provide distributed access control management. Such distributed access control management ensures the dependability, reliability and scalability of centralized access control management undertaken by the central server for an entire enterprise or a business location.

FIG. 1B shows a configuration in which a central server and local servers are employed. The configuration may correspond to a large enterprise having multiple geographic locations or offices. A central server 106 maintains a database managing the access privileges and the access rules in the entire enterprise. One of the features in this configuration is the underlying capability to provide fault tolerance and efficient AC (Access Control) management for a large group of users. Instead of having the central server 106 performing the AC management for each of the users at one single location, a number of local servers 104 (e.g., 104-A, 104-B, . . . and 104-N) are employed in a distributed manner to service the individual locations or offices. Each of local servers 104 executes a local module derived or duplicated from the server module being executed at the central server 106 to manage those users who are local to respective local servers 104. The central server 106 can centralize the AC management in addition to managing the users if necessary.

According to one embodiment, a local module can be a customized version of the server module that runs efficiently for only a few locations or a group of users. For example, a local server 104-A is only responsible for the users or computers 102-A in location A, while a local server 104-B is only responsible for the users or computers 102-B in location B. As a result, even if the central server 106 has to be taken down for maintenance or is not operative at the time a user needs to access secured documents, the access control will not be disrupted. The detailed operation of the local servers 104 in cooperation with the central server 106 will be further described below.

According to another embodiment, a local module is a replicated version of the server module and exchanges any updates with the server module when connected (e.g., periodically or at request). Depending on implementation, part or all of the server module can be duplicated in a local server to ensure that communications with users or their client machines are efficient and fault tolerance. As a result, even if the central server 106 has to be taken down for maintenance or is not operative at the time a user needs to access secured documents, the access control will not be disruptive. For example, in such a situation, any of the local servers 104 can step up and take the place of the central server. When the central server 106 is running or communicating with the local servers 104, information collected at the respective local servers about the users or their activities is sent back to the central server 106. The detailed operation of the local servers 104 in cooperation with the central server 106 in this regard will also be further provided below.

FIG. 1C shows a configuration suitable for a small group of users. In this configuration, no local servers are employed. A server computer 112 is loaded with the server module and each of the users or terminal computers 116 (only one is shown therein) is loaded with a client module. As a result, the server computer 112 performs the AC management for each of the users or the terminal computers 116.

It should be noted that there is no clear distinction between a small group and a large group of users as far as the number is concerned. Given the description herein, those skilled in the art will understand how to distribute or balance the AC management among one or more other computing devices. To facilitate the following description of the present invention, the setting shown in FIG. 1B will be assumed. Those skilled in the art will understand that the description herein is equally applicable to FIG. 1C or situations in which other possible settings between one or more central servers and one or more local servers are desired.

FIG. 1D shows internal construction blocks of a computing device 118 in which one embodiment of the present invention may be implemented and executed. The computing device 118 may correspond to a client device (e.g., computer 100, computing or storage device 102 in FIG. 1A) or a server device (e.g., server 104, 106 in FIG. 1A). As shown in FIG 1D, the computing device 118 includes a central processing unit (CPU) 122 interfaced to a data bus 120. CPU 122 executes instructions to process data and perhaps manage all devices and interfaces coupled to data bus 120 for synchronized operations. The instructions being executed can, for example, pertain to drivers, operating system, utilities or applications. Device interface 124 may be coupled to an external device, such as the computing device 102 of FIG. 1A; hence, the secured documents there from can be received into memory 132 or storage 136 through data bus 120. Also interfaced to data bus 120 is a display interface 126, a network interface 128, a printer interface 130 and a floppy disk drive interface 138. Generally, a client module, a local module or a server module of an executable version of one embodiment of the present invention can be stored to storage 136 through floppy disk drive interface 138, network interface 128, device interface 124 or other interfaces coupled to data bus 120. Execution of such module by CPU 122 can cause the computing device 118 to perform as desired in the present invention. In one embodiment, the device interface 124 provides an interface for communicating with a capturing device 125 (e.g., a fingerprint sensor, a smart card reader or a voice recorder) to facilitate the authentication of a user of the computing device 118.

Main memory 132, such as random access memory (RAM), is also interfaced to data bus 120 to provide CPU 122 with instructions and access to memory storage 136 for data and other instructions. In particular, when executing stored application program instructions, such as for document securing or document accessing, CPU 122 is caused to manipulate the data to achieve results contemplated by the program instructions. Read-only memory (ROM) 134 is provided for storing executable instructions, such as a basic input/output operation system (BIOS) for operation of keyboard 140, display 126 and pointing device 142 which may be present.

In one embodiment, the computing or storage device 102 is capable of storing secured items (e.g., secured files) in the main memory 132 or the storage 136. The main memory 132 provides non-persistent (i.e., volatile) storage for the secured items and the storage 136 provides persistent (i.e., non-volatile) storage for the secured items. Hence, the computing or storage device 102, or more particularly, the main memory 132 and/or the storage 136 can act as a storage device for the secured items.

Referring now to FIG. 2A, a block diagram of securing a created document 200 is shown according to one embodiment of the invention. For example, the created document 200 is a created file. After the document 200 is created, edited or opened with an application or authoring tool (e.g., Microsoft WORD), upon an activation of a command, such as “Save,” “Save As” or “Close”, or automatic saving invoked by an operating system, the application itself, or an approved application, the created document 200 is caused to undergo a securing process 201. The securing process 201 starts with an encryption process 202, namely the document 200 that has been created or is being written into a store is encrypted by a cipher (e.g., an encryption process) with a file key (i.e., a cipher key). In other words, the encrypted data portion 212 could not be opened without the file key. For the purpose of controlling the access to the contents in the document 200 or the resultant secured file 208, the file key or keys may be the same or different keys for encryption and decryption and are included as part of security information contained in or pointed to by a header 206. The file key or keys, once obtained, can be used to decrypt the encrypted data portion 212 to reveal the contents therein.

To ensure that only authorized users or members of an authorized group can access the secured file 208, a set of access rules 204 for the document 200 is received or created and associated with the header 206. In general, the access rules 204 determine or regulate who and/or how the document 200, once secured, can be accessed. In some cases, the access rules 204 also determine or regulate when or where the document 200 can be accessed.

In addition, security clearance information 207 can be added to the header 206 if the secured file 208 is classified. In general, the security clearance information 207 is used to determine a level of access privilege or security level of a user who is attempting to access the contents in the secured file 208. For example, a secured file may be classified as “Top secret”, “Secret”, “Confidential”, and “Unclassified”. According to one embodiment, the security clearance information 207 includes another layer of encryption of the file key with another key referred to herein as a clearance key. An authorized user must have a clearance key of proper security level in addition to an authenticated user key and proper access privilege to retrieve the file key. As used herein, a user key or a group key is a cipher key associated with an authenticated user and may be used to access a secured file or secure a file, or create a secured file. Additional detail on obtaining such a user key upon a user being authenticated is provided in U.S. patent application Ser. No. 10/074,194.

According to another embodiment, the security clearance information 207 includes a set of special access rules to guard the file key. The retrieval of the file key requires that the user passes an access rule measurement. Since access privilege of a user may be controlled via one or more system parameters (e.g., rules or policies), the access rule measurement can determine if the user has sufficient access privilege to retrieve the file key in conjunction with the corresponding user key.

In accordance with the security clearance information 207, a user may be assigned a hierarchical security clearance level based on, perhaps, a level of trust assigned to the user. A level of trust implies that one user may be more trusted than another and hence the more trusted user may access more classified files. Depending on implementation, a level of trust may be based on job responsibility of the user or a role of the user in a project or an organization background checks; psychological profiles, length of service, etc. In any case, a level of trust assigned to the user augments additional aspect to the access privilege of the user such that the user must have proper security clearance to access a classified secured file even if the user is permitted by the access rules to access the file.

In general, a header is a file structure, preferably small in size, and includes, or perhaps links to, security information about a resultant secured document. Depending on implementation, the security information can be entirely included in a header or pointed to by a pointer that is included in the header. The security information further includes the file key and/or one or more clearance keys, in some cases, an off-line access permit (e.g., in the access rules) should such access be requested by an authorized user. The security information is then encrypted by a cipher (i.e., an en/decryption scheme) with a user key associated with an authorized user to produce encrypted security information 210. The encrypted header 206, if no other information is added thereto, is attached to or integrated with the encrypted data portion 212 to generate the resultant secured file 208. In a preferred embodiment, the header is placed at the beginning of the encrypted document (data portion) to facilitate an early detection of the secured nature of a secured file. One of the advantages of such placement is to enable an access application (i.e., an authoring or viewing tool) to immediately activate a document securing module (to be described where it deems appropriate) to decrypt the header if permitted. Nevertheless, there is no restriction as to where the encrypted header 206 is integrated with the encrypted data portion 212.

It is understood that a cipher may be implemented based on one of many available encryption/decryption schemes. Encryption and decryption generally require the use of some secret information, referred to as a key. For some encryption mechanisms, the same key is used for both encryption and decryption; for other mechanisms, the keys used for encryption and decryption are different. In any case, data can be encrypted with a key according to a predetermined cipher (i.e., encryption/decryption) scheme. Examples of such schemes may include, but not be limited to, Data Encryption Standard algorithm (DES), Blowfish block cipher and Twofish cipher. Therefore, the operations of the present invention are not limited to a choice of those commonly-used encryption/decryption schemes. Any cipher scheme that is effective and reliable may be used. Hence, the details of a particular scheme are not further discussed herein so as to avoid obscuring aspects of the present invention.

In essence, the secured document 208 includes two parts, the encrypted data portion 212 (i.e., encrypted version of the document itself) and the header 210 that may point to or include encrypted security information for the secured document 208. To access the contents in the encrypted data portion 212, one needs to obtain the file key to decrypt the encrypted data portion 212. To obtain the file key, one needs to be authenticated to get a user or group key and pass an access test in which at least the access rules in the security information are measured against the user's access privilege (i.e., access rights). If the secured file is classified, it further requires a security level clearance on the user. In general, the security clearance level of the user must be high enough before the file key can be retrieved.

To facilitate the description of the present invention, it is assumed in the following that the secured item is not classified. Those skilled in the art can appreciate that the decryption in the following can be equally applied to secured items that are classified.

It should be noted that the header in a secured document may be configured differently than noted above without departing from the principles of the present invention. For example, a secured document may include a header with a plurality of encrypted headers, each can be accessible only by one designated user or a group users. Alternatively, a header in a secured document may include more than one set of security information or pointers thereto, each set being for one designated user or a group of users while a single file key can be used by all. Some or all of the access rules may be viewed or updated by users who can access the secured document.

As will be further described below, to access a secured document (or a secured file), a user needs a user key or keys to decrypt the encrypted security information or at least a portion of the header first. In one embodiment, the key or keys are associated with a user's login to a local server or a central server. Appropriate access privileges associated with the user are validated if the user has been authenticated or previously registered with the server and properly logged in. Depending on the permission or the access privileges, the access rules for the secured document determine whether the contents of the document shall be revealed to the user.

According to one embodiment, the access rules are present in a descriptive language such as text or a markup language (e.g., HTML, SGML and XML). In a preferred embodiment, the markup language is Extensible Access Control Markup Language (XACML) that is essentially an XML specification for expressing policies for information access. In general, XACML can address fine-grained control of authorized activities, the effect of characteristics of the access requestor, the protocol over which the request is made, authorization based on classes of activities, and content introspection (i.e., authorization based on both the requestor and attribute values within the target where the values of the attributes may not be known to the policy writer). In addition, XACML can suggest a policy authorization model to guide implementers of the authorization mechanism.

In general, the data portion of a secured item is a document or file encrypted with a cipher (e.g., a symmetric or asymmetric encryption scheme). Encryption is the transformation of data into a form that is impossible to read without appropriate knowledge (e.g., a key). Its purpose is to ensure privacy by keeping information hidden from anyone to whom it is not intended, even those who have access to other encrypted data. Decryption is the reverse of encryption. Encryption and decryption generally require the use of some secret information, referred to as a key. For some encryption mechanisms, the same key is used for both encryption and decryption; for other mechanisms, the keys used for encryption and decryption are different.

For the purpose of controlling the access to the document, the key or keys, referred collectively to as a file key, may be the same or different keys for encryption and decryption and are preferably included in the security information contained in, or pointed to by, the header and, once obtained, can be used to decrypt the encrypted document. To ensure that the key is not to be retrieved or accessible by anyone, the key itself is guarded by the access privileges and rules. If a user requesting the document has the proper access privileges that can be granted by the access rules and system policies if there are any, the key will be retrieved to proceed with the decryption of the encrypted document.

To ensure that the security information or the header is not readily revealed, at least a portion of the header itself can be encrypted with a cipher. Depending on an exact implementation, the cipher for the header may or may not be identical to the one used for the document. The key (referred to as a user key) to decrypt the encrypted header can, for example, be stored in a local store of a terminal device and activated only when the user associated with it is authenticated. As a result, only an authorized user can access the secured document. Optionally, the two portions (i.e., the header possibly encrypted) and the encrypted document) can be encrypted again and only decrypted by a user key. In another option, the encrypted portions (either one or all) can be error-checked by an error-checking portion, such as using a cyclical redundancy check to ensure that no errors have been incurred to the encrypted portion(s) of the secured document.

FIG. 2B is a diagram of a representative data structure 220 for a secured file according to one embodiment. For example, the secured file can be the secured document 208 illustrated in FIG. 2A. The data structure 220 includes a header (or header portion) 222 and an encrypted data (or encrypted data portion) 224. The data structure 220 may also include an error-checking portion 225 that stores one or more error-checking codes, for example, a separate error-checking code for each block of data. For example, these error-checking codes can be associated with a Cyclical Redundancy Check (CRC) for the header 222 and/or the encrypted data. The header 222 includes a flag bit 227 and encrypted security information 226. The flag bit 227 indicates whether or not the data structure pertains to a file that is secured. The security information 226 can vary depending upon implementation. However, as shown in FIG. 2B, the security information 226 includes a user identifier (ID) 228, rules (access rules) 229, a file key 230 and other 231. The other 231 is additional space for other information to be stored within the security information 226. For example, the other information 231 may be used to include other information facilitating secure access to the secured file, such as version number or author identifier. The file key 230 is used to decrypt the encrypted data portion 214 so as to access the content or data of the secured file.

In an alternative data structure for a secured file, the header can include at least one pointer which points to a remote data structure stored in a storage device.

The remote data structure can store some or all of the security information, thereby shortening the size of the header and improving manageability of security information. The storage device is typically a local storage device. In other words, the alternative data structure and the remote data structure are typically stored on a common machine (e.g., desktop or portable computer). The data structure 292 stores security information 294. Additional details on the alternative data structure can be found in U.S. application Ser. No. 10/132,712, filed Apr. 26, 2002, and entitled “SYSTEM AND METHOD FOR PROVIDING MANAGEABILITY TO SECURITY INFORMATION FOR SECURED ITEMS,” which is hereby incorporated herein by reference.

One advantage of setting up a set of access rules for a particular place or folder is to provide a securing mechanism for users to create secured documents without specifying as to who/how/when/where the documents can be accessed. Folders are commonly available with operating systems utilized with computers (e.g., servers and user computers). FIG. 2C shows a directory structure 280 including a clear folder 281 and a secured folder 282. The clear folder 281 is generally for storing system files or files that are not intended to be protected (secured). The secured folder 282 can include multiple subfolders that can be structured respectively for each different access level. For example, a document “employee list” can be accessed by anyone who has access privilege to access level A. Similarly, documents “product milestone” can be accessed by anyone who has access privilege to access level B, and “product specification” or “product schedule” can be accessed by anyone who has access privilege to access level C, respectively. Likewise, a created document, if placed in folder “design team 2”, will be automatically encrypted with the corresponding access rules that will permit only those who has access privileges to access level B. In this embodiment the access levels are hierarchical, meaning that a user with access level A authorization can access not only access A items but also the lower access levels B and C which are subsets of access level A. Similarly, the access level C is a subset of the access level B. Consequently, the access level A is a high access level, the access level B is an intermediate access level, and the access level C is a low access level.

Further, once a folder has been assigned, its access level or the access privileges needed by users to access the folder may change. For example, initially the folder 286 has an access level C and is associated with an authorized group known as “design team 3.” A policy change may occur that causes the users within the “design team 3” to change. In the example shown in FIG. 2C, the group “design team 3” initially includes users 1, 2, X and N. However, a modification to the group occurs such that the group “design team 3” subsequently includes users 1, 2 and N, noting that user X has been removed from the group. Hence, unless user X was moved up to access levels A or B, user X is no longer permitted access to the documents in the folder 286.

In real applications, various types of policy or updates changes are possible. The policy changes can affect system policies, access rules, various keys, groups or users. Some examples of policy changes include: (i) changes to group membership; (ii) addition, removal or modification to document access rules; (iii) changes to user keys; and (iv) addition, removal or modification to group access rights. In any case, once a policy change occurs, the policy change must be carried out by the security system in a reliable fashion without affecting others that are not subject to the change. The processing detailed below explains how policy changes are effectuated.

FIG. 3A is a diagram of a security system 300 according to one embodiment of the invention. The security system 300 operates to restrict access and/or usage to items (e.g., files, documents, etc.) residing within a computer network. By restricting access and/or usage of items, the items are secured or protected from unauthorized access or usage.

The security system 300 includes a central server 302. The central server 302 couples to a local server 304 through a link 306. The local server 304 couples to a user computer 308 over a link 310 and couples to a user computer 312 over a link 314. The central server 302 is a computer that performs centralized access control management or security processing for the security system 300. The local server 304 performs semi-centralized security processing for the security system 300. The user computers 308 and 312 perform localized security processing. The links 306, 310 and 314 can be provided by a network infrastructure which may utilize wired and/or wireless components.

In general, the security system 300 provides security to items in accordance with security policies. The security policies govern the nature and extent to which security is provided for the items. One representative operation of a security system 300 pertains to implementing changes to security policies and is as follows. An administrator interacts with the central server 302 to implement a change to the security policies being maintained by the security system 300. In this regard, the administrator would request that a security policy change be implemented for the security system 300. After the security policy change has been requested by the administrator, the central server 302 would inform the local server 304 of the security policy change. In one embodiment, the central server 302 would inform the local server 304 of the security policy change by sending a security policy update from the central server 302 to the local server 304 over the link 306. The local server 304 can then send a security policy change message to those of the user computers 308, 312 within the security system 300 that are affected by the security policy change. As illustrated in FIG. 3, the local server 304 sends a security policy change message to the user computer 312 over the link 314. Here, it is assumed that User X, whom is using the user computer 312, is affected by the security policy change. Hence, the local server 304 informs the user computer 312 of the security policy change by sending the security policy change message to the user computer 312. It should be noted that the local server 304 does not provide a security policy change message to the user computer 308 because its user, User A, is not affected by the security policy change.

Although the security system 300 is shown as including the central server 302 and the local server 304, it should be understood that the security system 300 can be implemented in a variety of different ways. For example, the security system according to the invention need not include any local servers. Alternatively, the security system could use a plurality of local servers. In any case, each server (e.g., a central server or a local server) is able to support one or more users and/or computers.

The security system according to the invention can, in general, include or make use of one to many user computers and at least one central server. The security system can also include or make use of one or more local servers as desired. In other words, the security systems operate in a distributed fashion. Nevertheless, according to the invention, security policy changes are able to be reliably effectuated in such distributed systems.

Referring now to FIG. 3B, there is shown a functional block diagram of a server device 320 in which a server module 322 resides in a memory space 323 and is executable by one or more processors 321. The server device 320 also includes a network interface 324 to facilitate the communication between the server 320 and other devices on a network and a local storage space 325. The server module 322 is an executable version of one embodiment of the present invention and delivers, when executed, features/results contemplated in the present invention. According to one embodiment, the server module 322 comprises an administration interface 326, an account manager 328, a system parameter manager 330, a user monitor 332, a local server manager 334, a partner access manager 336, an access report manager 338, and a rules manager 339.

Administration Interface 326:

As the name suggests, the administration interface 326 facilitates a system administrator to register users and grant respective access privileges to the users and is an entry point to the server module from which all sub-modules or the results thereof can be initiated, updated and managed. In one embodiment, the system administrator sets up hierarchy access levels for various active folders, storage locations, users or group of users. The privileges may include, but not be limited to: open, edit write, print, copy, download and others. Examples of the other privileges are: altering access privileges for other users, accessing secured documents from one or more locations, and setting up a set of access rules for a folder different from those previously set up (perhaps by the system administrator). The respective user IDs assigned to the users facilitate the management of all the users. Unless specifically stated differently, a user or a corresponding user ID is interchangeably used herein to identify a human user, a software agent, or a group of users and/or software agents. Besides a human user who needs to access a secured document, a software application or agent sometimes needs to access the secured document in order to proceed forward. Accordingly, unless specifically stated, the “user” as used herein does not necessarily pertain to a human being. In general, a user who will access a secured document is associated with a user key to allow an encrypted header in a secured document to be unlocked (decrypted). The expiration or regeneration of a user key may be initiated by the system administrator. According to one embodiment, the administration interface 326 is a user graphic interface showing options for various tasks that an authenticated system administrator or operator may need to perform.

Account Manager 328:

Essentially, the account manager is a database or an interface to a database 327 (e.g., an Oracle database) maintaining all the registered users and their respective access privileges, and perhaps corresponding user keys (e.g., private and public keys). In operation, the account manager 328 authenticates a user when the user logs onto the server 320 and also determines if the user can access secured documents from the location the user is currently at.

System Parameters Manager 330:

This module is configured to manage system parameters within the server module 322. These system parameters include, for example, user access privileges, system rules, and user keys. The system parameters manager 330 can be used to add, delete or modify any of the system parameters. The system parameters manager 330 can also interact with local modules and client modules to supply the system parameters to these distributed modules. For example, a user key can be expired (deleted) for security reasons when a user leaves the organization or when its time to replace the user key. The system parameters can be supplied to local modules and client modules by a “push” of system parameters to the other distributed modules or by a response to a “pull” request for updated system parameters.

User Monitor 332:

This module is configured to monitor user's requests and whereabouts. Typically, a user is granted to access secured documents from one or more designated locations or networked computers. If a user has a higher access privilege (e.g., to permit to access from other than the locations or networked computers), the user monitor 332 may be configured to ensure that the user can have only one access from one of the registered locations or computers at all times. In addition, the user monitor 332 may be configured and scheduled to interact with the system parameters manager 330 to “push” an update of system parameters or respond to a “pull” request for an update of system parameters.

Local Server Manager 334:

This module is designed to be responsible for distributing an appropriate local module for a local server servicing a predetermined location or a predetermined group of users. According to one embodiment, the local server manager 334 replicates some or all of the server module 322 being executed on the server 320 and distributes the replicated copy to all the local servers. As a result, a user can access secured documents anywhere within the network premises covered by the local servers without being authenticated at a single central server, namely the server 320. According to another embodiment, the local server manager 334 replicates some of the server module 322 being executed on the server 320 and distributes the replicated copy to a corresponding local server. In this embodiment, each of the local servers will have its own customized replication from the server module 322.

Partners Access Manager 336:

A special module to manage non-employees accounts. The non-employees may be consultants to a business that requires the consultants to access certain secured documents. The partners access manager 336 generally works in accordance with other modules in the server but puts additional restrictions on such users being directly managed by the partners access manager 336. In one application, the partners access manager 336 generates a request to the user key manager 330 to expire a key or key pair for a consultant when an engagement with the consultant ends.

Access Report Manager 338:

A module is configured to record or track possible access activities and primarily works with a corresponding sub-module in a client module being executed in a client machine. The access report manager 338 is preferably activated by the system administrator and the contents gathered in the access report manager 338 and is typically only accessible by the system administrator.

Rules Manager 339:

In general, the rules manager 339 is an enforcement mechanism of various access rules. According to one aspect, the rules manager 339 is configured to specify rules based on i) data types (e.g., Microsoft Word), ii) group users or individual, iii) applicable rights, and iv) duration of access rules. Typically, a set of rules is a policy (namely, a security policy). A policy can be enabled, disabled, edited, deployed and undone (e.g., one or two levels). Policies managed by the rules manager 339 operate preferably on a global level. The rules (as well as other system parameters) are typically downloaded to the client machine during the login process (after the user is authenticated) and can be updated dynamically. In addition, respective policies may be associated with active folders (i.e., those designated places to store secured documents). These polices are also downloaded and updated on the client machine. Simple policies can also be embedded in the document and provide document specific policies.

According to one embodiment, a header is received by a local server from a client and the access rules from the header are retrieved. The key manager 330 can be called upon to decrypt the encrypted security information in the header. The rules manager 339 can then parse the access rules from the security information and evaluate or measure the access rules against the access privileges of the user to determine whether the secured document can be accessed by the user. If the evaluation or measurement succeeds, a file key is retrieved and sent back to the client.

It should be pointed out that the server module 322 in FIG. 3B lists some exemplary modules according to one embodiment of the present invention and not every module in the server module 322 has to be implemented in order to practice the present invention. Those skilled in the art can understand that given the description herein, various combinations of the modules as well as modifications thereof without departing the spirits of the present invention, may achieve various desired functions, benefits and advantages contemplated in the present invention.

FIG. 3C shows a functional block diagram of a local server device 340. The local server device 340 executes a module, referred herein as a local module 342 which is configured to be a complete or partial replication of the server module 322 of FIG. 3B. The local server device 340 is generally similar to that of a server as illustrated in FIG. 3B. Namely, the local server device 340 includes one or more processors 341, a memory space 343, a network interface 344, and a local storage space 345. Given the similarity, many parts illustrated in FIG. 3C are not to be described again to avoid obscuring aspects of the present invention. As one of the features in the present invention, the local module 342 provides the dependability, reliability and scalability of the centralized access control management being undertaken by the central server 320 of FIG. 3B. As such, not all authentication requests need to be handled at one central point without losing control of the access control management. As another feature of the present invention, the users are not affected if the central server is brought down for maintenance and the connection to the central server is not available. If a number of local servers are used and each has a replication of the server module, the reliability of servicing the users is greatly enhanced. As a result, the local users need only to check with the corresponding local server and none of the users would be affected if other local servers are down for whatever reasons or disconnected from the central server.

The configuration of a user's access to secured documents is sometimes referred to as a provisioning process. The dynamic provisioning that has been described above is believed to provide the necessary security means needed by a large enterprise having employees in several locations without the loss of the centralized access control management at a central server. Further, the use of multiple local servers to support the central server can provide increased dependability, reliability and scalability.

Referring now to FIG. 3D, there is shown a functional block diagram of a client machine 360. As used herein, the client machine 360 is a computing device primarily used by a user to access secured documents. The client machine 360 can, for example, be a desktop computer, a mobile device or a laptop computer.

According to one embodiment, the client machine 360 includes a processor 361, a client module 362, a memory space 363, a network interface 365 and a local store 367. The client module 362 resides in the memory space 363 and, when executed by the processor 361, delivers features, advantages and benefits contemplated in the present invention. Through the network interface 365, the client machine 360 is capable of communicating over a data network with other computers, such as a server. From the client machine 360, a user can access secured documents located in a repository (store) 366 that may be in the client machine 360, another networked device, or other storage means. According to one embodiment, the client module 362 includes a number of sub-modules including an access report module 364, a user verifying module 370, a key manager 368, a document securing module 371 and an off-line access manager 374.

Access Report Module 364:

This module is a software agent configured to record access activity and associated with an authenticated user. It reports to an access report module in the central server so that a record may be established as to what secured document has been accessed by which user during what time. In particular, the access report module 364 can be activated to capture access activities of the user when the client machine is not networked. The access activities will be later synchronized with the counterpart in the server to facilitate the access control management for the offline access.

Key Manager 368:

One of the purposes for the key manager 368 is to ensure that a secured document is still usable when the secured document is being accessed by an application that suddenly crashes. According to one embodiment, after the encrypted header is decrypted, the file key is then copied or a copy thereof is stored (cached) into the key manager 368. The file key is then used to decrypt the encrypted document. A clear document is now available to the application. If the application crashes due to power outage or interfered by another application or OS, the file key in the header could be damaged. If no copy of the file key is available, the secured document may not be usable any more because the encrypted document would not be decrypted without the file key. In this case, the reserved key maintained in the key manager 368 can be used to replace the damaged key and decrypt the encrypted document. After the user saves the file again, the file key is put back into the header. Another purpose for the key manager 368 is to cache a user key or keys of an authenticated user.

User Verifying Module 370:

This module is responsible for determining if a user who is accessing a secured document has been authenticated otherwise it will initiate a request for authentication with a local server or a central server. In other words, the user verifying module 370 is always consulted before a permission is granted to the user seeking access to a secured document. According to one embodiment, a user key or keys of an authenticated user are stored (cached) in the key manager 368 once the user is authenticated by the user verifying module 370 via the server. When a secured document is accessed, the user key must be retrieved from the key manager 368 to decrypt the encrypted security information in the header of the secured document.

Document Securing Module 371:

As described above, the DSM 371 includes a cipher 372 that is used to generate a file/user key and encrypt/decrypt a document/header. In addition, other securing means may be implemented in the DSM 371, for example, a filter to block copying contents in a secured document into a non-secured document or a link from a secured document/original source to another document or recipient source.

Off-Line Access Manager 374:

This module becomes effective only when the networked client machine is off the network, namely, the communication with a local server or a central server is not currently available. For example, a user is on the road and still needs to access some secured documents in a laptop computer. When live consultation is not available, the off-line access manager 374 is activated to ensure that the authorized user still can access the secured document but only for a limited time and perhaps with a limited privilege.

It should be pointed out that the client module 362 in FIG. 3D lists some exemplary sub-modules according to one embodiment of the present invention and not every module in the server module 362 has to be implemented in order to practice the present invention. Those skilled in the art can understand that given the description herein, various combinations of the sub-modules, may achieve certain functions, benefits and advantages contemplated in the present invention.

FIG. 4 is a flow diagram of security policy change processing 400 according to one embodiment of the invention. The security policy change processing 400 can, for example, be performed by a security system, such as the security system 300 illustrated in FIG. 3.

A security policy change processing 400 begins with a security policy change 402. Here, typically, an administrator would interact with the security system to change a security policy, for example, via the administrative interface 326 of FIG. 3B. Next, those users that are affected by the changed security policy are determined 404. Unless to be applied to all users or user computers in the system, the changed security policy is targeted to applicable users. In other words, the changed security policy may be applied to only one user or a group of users or the terminals to be used by the user or the group of users. Depending on the changed security policy, the affected users may be determined in accordance with the account manager 328 of FIG. 3B. Then, security policy change messages are prepared 406 for the affected users, which can be performed in either the central server or the local server. In one embodiment, a changed security policy is pushed to a destination address identifying a computer being used by a user affected by the changed security policy. In another embodiment, a changed security policy is multicast to a plurality addresses respectively identifying computers being used by a number of identified users. In still another embodiment, a changed security policy is cached in a queue and pending a detected presence of an affected user (e.g., from a user monitor 332). In any case, after the security policy change messages have been prepared 406, the security policy change messages can be delivered 408 to the affected users. Here, the security policy change messages are normally delivered 408 to computers (i.e., user computers) that are being utilized by the affected users. In one embodiment, the security policy change messages can be delivered together with or in other routing messages. For example, a user state message can be downloaded into a user machine when a user logs into a security system (e.g., a local server). The user state message may include user account information and various customized system policies to facilitate access by the user to electronic data secured in the security system. In this case, a security policy change can be effectuated in the user state message. If the user is on-line, an updated user state message is immediately pushed to the affected user. If the user is not on-line, the security policy change takes effect in the user state message that is to be delivered next time the user logs on. Following the operation 408, the security policy change processing 400 is complete and ends.

FIG. 5 is a flow diagram of security policy change message delivery processing 500 according to one embodiment of the invention. The security policy change message delivery processing 500, for example, is detailed processing associated with the delivery 408 of the security policy change messages to the affected users (i.e., computers of the affected users). In other words, the security policy change message delivery processing 500 is, for example, suitable for use as the operation 408 illustrated in FIG. 4 according to one embodiment of the invention.

The security policy change message delivery processing 500 initially selects 502 a first (next) affected user. Here, it is assumed that it has previously been determined that there are one or more affected users. After the first affected user has been selected 502, a decision 504 determines whether the user is presently logged in. A user is logged in when the user has been authenticated by the system and approved for certain access rights to items being secured by the security system. When the decision 504 determines that the user is not presently logged in, the appropriate security policy change message is stored 506 to a delivery queue or effectuated in the user state message associated with the user for subsequent delivery. Here, the delivery queue is a buffer that is able to store a plurality of security policy change messages that are to be subsequently delivered. Alternatively, the delivery queue may be viewed as a user state message that receives the appropriate security policy change message and subsequent changes, if there are any.

On the other hand, when the decision 504 determines that the user is logged in, a location (e.g., computer) of the selected affected user is determined 508 within the security system. Next, the appropriate security policy change message is then forwarded 510 to the selected affected user at the determined location (e.g., computer). Following the operation 506 as well as following the operation 510, a decision 512 determines whether there are more affected users to be processed. When the decision 512 determines that there are more affected users, the security policy change message delivery processing 500 returns to repeat the operation 502 and subsequent operations so that security policy change messages for other of the affected users can be similarly processed. Alternatively, when the decision 512 determines that there are no more affected users, the security policy change message delivery processing 500 is complete and ends.

FIG. 6A is a flow diagram of security policy change queue storage processing 600 according to one embodiment of the invention. The security policy change queue storage processing 600 is, for example, performed by the operation 506 illustrated in FIG. 5. According to the security policy change queue storage processing 600, security policy change messages are able to be manipulated while they await delivery such that stale or erroneous security policy change messages can be altered. As a result, security policy change messages destined for the same affected user can be consolidated for improved efficiency and reliability.

The security policy change queue storage processing 600 begins with a decision 602. The decision 602 determines whether the security policy change message being stored to a delivery queue affects any of the other queued messages already stored in the delivery queue. When the decision 602 determines that the security policy change message does affect other previously queued messages, then the other queued messages that are affected can be modified 604. Alternatively, when the decision 602 determines that the security policy change message does not affect the other queued messages, then the operation 604 can be bypassed. Thereafter, following the operation 604 as well as following the operation 602 when the decision has determined that there are no other queued messages that are affected, the security policy change message is stored 606 to the delivery queue. Following the operation 606, the security policy change message is stored 606 to the delivery queue. Following the operation 606, the security policy change queue storage processing 600.

An example of a simplified delivery queue is as follows:

UserID
Stored Message

12345
M34; M33; M32; M21

12678
M40

34267
M99; M87; M34

Note that the simplified delivery queue stores messages that are deferred in their delivery to the corresponding users. Each user has a unique user identifier (UserID). The messages deferred for particular users are affiliated with one another. For example, for the user having the UserID of “12345”, the simplified delivery queue stores four message (M21; M32; M33 and M34). Note that the order of the messages is retained in the simplified delivery queue using a first-in-first-out approach, such that the message M21 is first sent to the user having the UserID of “12345”. However, the earlier queued massages within the simplified delivery queue can be modified due to subsequent messages. For example, as to the messages for the user having the UserID of “12345”, when the fourth queued message M34 is about to be stored to the simplified delivery queue, the security system (e.g., the processing of FIG. 6) can operate to modify one or more of the queued messages M33, M32 or M21. As a simple example, assume that message M21 removed the user having the UserID of “12345” from the engineering team 3. If the subsequent message M33 adds the user having the UserID of “12345” back to the engineering design team 3, then the earlier message M21 can be deleted or replaced with the message M33. As a result, the messages M21 and M33 are able to be collapsed into a single message, which improves bandwidth utilization and minimize unnecessary interruption to the user and provides that the affected user receives the most updated policy change.

Security policies including system policies and access rules protect or secure electronic data. In general, the access rules are provided in a secured item and have been previously described. The system policies are rules that provide restrictions imposed by the system. Examples of the various levels of rules may include one or more system rule sets at a server machine and/or a client machine, a special rule set imposed by a system operator and the rule set associated with or embedded in a secured file. In dealing with highly sensitive files, a system rule can limit a user to accessing certain secured documents from only certain designated computers. In a distributed system in which a number of local servers are used, some of the changes to the system rules may only originate from a central server to one or more of the local servers being affected. Similarly, some of the changes to the system rules may only originate from one or more of the local servers to one or more of the user computers being affected.

FIG. 6B is a flow diagram of how to efficiently effectuate a security policy change in a distributed network according to one embodiment of the invention. The security policy change pertains to changes between two entities. In other words, an update or change command is initiated from a central server to a local server. The local server is then activated to generate a change for the affected users in accordance with the change command received from the central server. One of the features in the operation 620 is that the network efficiency is achieved. The update commands or update messages are distributed only to those involved. In general, the operation 620 can be, for example, performed in the local server 304 of FIG. 3A or in accordance with the operation 400 illustrated in FIG. 4.

The operation 620 is activated when a command including a policy change or a policy change request is received 622 from a server (e.g., a central server or another server). For example, a command, e.g., notifyAddedUserGenSysRight meaning that a specific system right has been added to the user, is received. Upon receiving the command, the local server generates a corresponding command (e.g., notifyAddedGroupGenSysRight) in accordance with the command from the central server. Depending on the affected user that may be present or absent in the system, the corresponding command may be pushed 626 to the user to effectuate the policy change or queued in a queue, or take effect in the user state message.

In general, there is a plurality of local servers to a central server. To achieve the network efficiency, the server needs first to determine which local servers may be activated to carry on a policy change being initiated. Since each of the local servers is configured to manage its own users while the local servers are being managed by the central server, a local server that serves an affected user can be readily identified. Additional details on identifying affected users is provided in U.S. patent application Ser. No. 10/074,194. When such local server is identified, the command to effect the policy change needs to be pushed only to the local server. Subsequently, the local server needs to generate a command to affect the policy change and deliver such command only to the effected users. As a result, no other local servers are affected, and nor other users are affected by the policy change but served by the same local server.

The following table illustrates some exemplary commands to carry out a system policy update or change originated from a central server to a local server:

void
notifyAddedGroupGenSysRight

(String groupId, int rightKey)

notifies a local server that a general system

right has been added to the group

void
notifyAddedGroupSpecSysRight

(String groupId, int rightKey,

String pertinentGroupId)

notifies a local server that a specific

system right has been added to the group

void
notifyAddedUserAllowedHost

(String userId, String host)

notifies a local server that a host

has been allowed for a user

void
notifyAddedUserGenSysRight

(String userId, int rightKey)

notifies a local server that a general

system right has been added to the user

void
notifyAddedUserSpecSysRight

(String userId, int rightKey,

String pertinentGroupId)

notifies a local server that a specific

system right has been added to the user

void
notifyAddedUsersToGroup

(ArrayList userlds, String groupId)

notifies a local server that users

have been added to a group

void
notifyChangedFolder(String

invokerId, String path,

ArrayList affectedGroups)

notifies a local server that an active

folder has been changed

void
notifyChangedFolderAccesser

Groups(StringactiveFolderld,

ArrayList accesserGrouplds,

ArrayList affectedGroups)

notifies a local server that an active folder's

access groups have been changed

void
notifyChangedGroupFolders(String

groupId, ArrayList folderlds)

notifies a local server that the group's

active folders have been changed

void
notifyChangedGroupKeyPair(String

groupId, byte[ ] newGroupPubKey,

byte[ ] newGroupPrivKey)

void
notifyChangedGroupRulesets(String

groupId, ArrayList rulesetIds)

notifies a local server that a group's

rule sets have been changed.

void
notifyChangedRule(String

ruleId, HashMap rule,

ArrayList affectedGroups)

notifies a local server that a rule

has been changed

void
notifyChangedRuleSet

(String rulesetId, String name,

ArrayList affectedGroups)

notifies a local server that

a rule set has changed

void
notifyChangedRuleSetRulea

(String rulesetId, ArrayList ruleIds,

ArrayList affectedGroups)

notifies a local server that a rule set's

member rules have been changed

void
notifyChangedUserDefaultGroup

(String userId,

String newDefaultGroupld)

notifies a local server that a

user's default group has changed

void
notifyChangedUserLS(String userld)

notifies a local server that the

user's local server has been switched

void
notifyChangedUserUIPref(String userId,

byte[ ] newUlPref)

notifies a local server that a user's

user interface (UI) preference has changed.

void
notifyDroppedGroup(String

droppedGroupId)

notifies a local server that a

group has been dropped

void
notifyDroppedGroupGenSysRight

(String groupId, int rightKey)

notifies a local server that a general system

right has been dropped from the group

void
notifyDroppedGroupSpecSysRight

(String groupId, int rightKey,

String pertinentGroupId)

notifies a local server that a specific system

right has been dropped from the group

void
notifyDroppedUser(String userId)

notifies a local server that a user has

been dropped

void
notifyDroppedUserAllowedHost

(String userId, String host)

notifies a local server that a host

has been disallowed for a user

void
notifyDroppedUserGenSysRight

(String userId, int rightKey)

notifies a local server that a general

system right has been dropped from the user

void
notifyDroppedUsersFromGroup

(ArrayList userIds, String groupId)

notifies a local server that users have been

dropped from the group, in case of

dropGroupMember

void
notifyDroppedUserSpecSysRight

(String userId, int rightKey,

String pertinentGroupId)

notifies a local server that a specific

system right has been dropped from the user

String
notifyNewCentralServerLiat(ArrayList newUrls)

notifies a local server about a new

central server URL list

The following table illustrates some exemplary commands to carry out a system policy update or change originated from a local server to a user computer or client machine (CM):

int
notifyAddedDocRule(int policyId,

int docRuleId, byte[ ] docRuleText)

notifies the CM that a doc rule

has been added to a policy

int
notifyAddedGroupGenSysRight(String

userId, String groupId, int rightKey)

notifies a CM that a general system

right has been added to the group

int
notifyAddedGroupSpecSysRight(String userId,

String groupId, int rightKey, String pertinentGroupId)

notifies a CM that a specific

system right has been added to the group

int
notifyAddedPolicy (int policyID,

String policyName)

notifies a CM that a new policy

has been created

int
notifyAddedUserGenSysRight(String

userId, int rightKey)

notifies a CM that a general system

right has been added to the user

int
notifyAddedUserSpecSysRight(String

userId, int rightKey, String pertinentGroupId)

notifies a CM that a specific system

right has been added to the user

int
notifyAddedUserToGroup(String userId,

String newGroupId, HashMap newGroupinfo)

notifies a CM that the user now

belongs to a new group

int
notifyChangedActiveFolderTree(String

userId, String newTree)

notifies a CM that the active

folder tree has been changed

int
notifyChangedDocRuleText(int policyId,

int docRuleId, byte[ ] newDocRuleText)

notifies a CM that a document

rule has been modified

int
notifyChangedGroupKeyPair(String userId,

String groupId, byte( ) groupPubKey, byte[ ]

groupPrivKey)

notifies a CM that a group key pair

has been changed

int
notifyChangedSystemRules(String userId,

String newRules)

notifies a CM that the system

rules have been changed

int
notifyChangedUserDefaultGroup(String

userId, String newDefaultGroup)

notifies a CM that the user's

default group has changed

int
notifyDroppedDocRule(int

policyId, int docRuleld)

notifies a CM that a document

rule has been dropped from a policy

int
notifyDroppedGroupGenSysRight(String

userId, String groupId, int rightKey)

notifies a CM that a general system right

has been dropped from the group

int
notifyDroppedGroupSpecSysRight(String

userId, String groupId, int rightKey, String

pertinentGroupId)

notifies a CM that a specific system

right has been dropped from the group

int
notifyDroppedPolicy(int policyId)

notifies a CM that a new

policy has been dropped

int
notifyDroppedUserFromGroup(String

userId, String groupId)

notifies a CM that the user

has been dropped from a group

int
notifyDroppedUserGenSysRight(String

userId, int rightKey)

notifies a CM that a general system

right has been dropped from the user

int
notifyDroppedUserSpecSysRight(String

userId, int rightKey, String pertinentGroupId)

notifies a CM that a specific system

right has been dropped from the user

int
notifyUserForcedLogout(String userId, int flag)

notifies that the user needs to be logged

out, for various reasons.

According to one embodiment, the access control management is performed in a distributed fashion to ensure that an update or change is guaranteed to be delivered to an affected user even if an affected local server is not operative at the time an update shall be effectuated. Namely, a number of local server servers are employed to operate largely on behalf of a central server responsible for the centralized access control management. Such distributed fashion ensures the dependability, reliability and scalability of the access control management undertaken by the central server, the detail of which is provided in U.S. patent application Ser. No. 10/074,194.

In operation, according to one embodiment, every update to an affected user or a user computer is assigned an identifier. A server (e.g., a local or central server) can be configured to keep track of all identifiers for the updates it has generated or responded to. If, for some reason, a local server is not operative at the time an update command shall be received or an update message (or contained in a state message) should be released to an affected user, the central server can be configured to keep track of the update that is meant for that local server up to a certain limit. When the local server comes up again, it will get the appropriate updates that were saved on its behalf from the central server. Alternatively, since user information may be in one or more of the local servers being serviced by the central server, the central server can be configured to send a copy of that update command or update message to the local servers that maintain the user information for the affected user. When the affected user needs to get on the originally designed local server that is now inoperative, the affected user (i.e., the computer being used) is redirected to another local server that has the user information of the user, accordingly, the user receives the update. Since the updates are identified with respective identifiers, the same updates would not be applied more than once but guaranteed to be delivered to the affected user(s).

In any case, all applicable system rules as well as access rules embedded in a secure file are individually evaluated in an access right evaluation process when a user is attempting to access a secured item or secured area (e.g., a storage device). If there is a single logic failure from the evaluation of any of the system rules or the access rules, an access right to the secured file is denied. On the other hand, if each of the system rules and the access rules is respectively evaluated and all produce a logic pass, an access right to the secured file or area is granted.

In one embodiment, a system rule set may be classified as Regular and Super. A system rule set is Regular when the rule set is to be evaluated together with other system rules, if there are any. On the other hand, a system rule set is Super when the rule set is to be evaluated without considering the system rules that are Regular. In other words, a Super system rules provide an override mechanism used to force either a grant or a denial of the access right regardless of the other Regular rule(s). Typically, a Super rule is used by a system administrator to grant a special access right to a user who otherwise would not get in a normal setting.

FIG. 7 is a flow diagram of deferred delivery processing 700 according to one embodiment of the invention. The deferred delivery processing 700 is utilized to deliver messages (i.e., security policy change messages) from a delivery queue to their destinations. In this embodiment, the deferred delivery processing 700 is performed during a login by an affected user.

The deferred delivery processing 700 begins with a decision 702 that determines whether a login request has been received. Here, a login request is initialed by a user attempting to access an item maintained or secured by the security system. When the decision 702 determines that a login request has not yet been received, then the deferred delivery processing 700 awaits such a request. Once the decision 702 determines that the login request has been received, the login request is evaluated 704. Additional details on the evaluation of login request can be found in U.S. application Ser. No. 10/074,194, which was previously hereby incorporated herein by reference.

After the login request is evaluated 704, a decision 706 determines whether the login is permitted. When the decision 706 determines that the login is not permitted, then the requestor (i.e., requesting user) is informed 708 that the login was unsuccessful. On the other hand, when the decision 706 determines that the login is permitted, then a decision 710 determines whether there are any queued messages for the requestor. Here, when the login is permitted, the deferred delivery processing 700 determines 710 whether there are any queued messages for the requestor that have not yet been delivered. Accordingly, when the decision 710 determines that there are queued messages for the requestor, the queued messages are delivered 712 to the requestor. Here, the queued messages for the requestor are retrieved from the delivery queue and forwarded to the requestor (i.e., forwarded to the computer used by the requester). The messages contain security policy changes (or possibly other system parameters) that are stored, installed or effectuated on the computer used by the requestor (user computer or client machine). These system parameters can be stored in an encrypted manner or stored in a hidden cache memory. Alternatively, when the decision 710 determines that there are no queued messages for the requester, then the operation 712 is bypassed. Next, following the operation 712 (or following the decision when the operation 712 is bypassed), the requestor is informed 714 that the login was successful. Following the operations 708 and 714, the deferred delivery processing 700 is complete and ends.

The invention is preferably implemented by software, but can also be implemented in hardware or a combination of hardware and software. The invention can also be embodied as computer readable code on a computer readable medium. The computer readable medium is any data storage device that can store data which can thereafter be read by a computer system. Examples of the computer readable medium include read-only memory, random-access memory, CD-ROMs, DVDs, magnetic tape, optical data storage devices, and carrier waves. The computer readable medium can also be distributed over network-coupled computer systems so that the computer readable code is stored and executed in a distributed fashion.

The various embodiments, implementations and features of the invention noted above can be combined in various ways or used separately. Those skilled in the art will understand from the description that the invention can be equally applied to or used in other various different settings with respect to various combinations, embodiments, implementations or features provided in the description herein.

The advantages of the invention are numerous. Different embodiments or implementations may yield one or more of the following advantages. One advantage of the invention is that policy changes are distributed only to those user computers (clients) that are affected by the policy changes. Another advantage of the invention is that policy changes are implemented timely, transparently and without user interaction. Still another advantage of the invention is that informing user computers about policy changes can be deferred until associated users are on-line (i.e., logged into security system).

The foregoing description of embodiments is illustrative of various aspects/embodiments of the present invention. Various modifications to the present invention can be made to the preferred embodiments by those skilled in the art without departing from the true spirit and scope of the invention as defined by the appended claims. Accordingly, the scope of the present invention is defined by the appended claims rather than the foregoing description of embodiments.

Claims

1. A security system for securing files from unauthorized access within a distributed computer network, the security system comprising: a processor; anda memory storing a plurality of client modules, comprising at least computer program code stored on a computer readable medium, the plurality of client modules configured to operate on respective user computers, and configured to control access to secured files having access rules in a header portion thereof, wherein some or all of at least a portion of security policy information that governs a type, a location, a duration, and an extent of access to the secured files that are permitted by users via the respective user computers is received at respective ones of the plurality of client modules from a central service module via a local service module comprising a delivery queue for temporarily storing security policy change messages to be delivered to client modules determined to be inactive and affected by a security colic change received at the central service module.
2. The security system as recited in claim 1, wherein if a security policy change is received at the central service module, the central service module is configured to update the portion of the security policy information at the local service module based on the security policy change.
3. The security system as recited in claim 2, wherein after the local service module has been updated, the central service module is configured to identify those of the plurality of client modules that are affected by the security policy change, and configured to thereafter inform affected client modules.
4. The security system as recited in claim 3, wherein the affected client modules are configured to thereafter update security information at the client modules that are affected.
5. The security system as recited in claim 2, wherein after the central service module has been updated, the central service module is configured to identify those of the affected diem modules and then determine which of the affected client modules are active, and configured to thereafter inform active client modules of the security policy change.
6. The security system as recited in claim 5, wherein the local service module is further configured to defer informing the affected client modules that are not active of the security policy change.
7. The security system as recited in claim 6, wherein each of the affected but not active client modules are subsequently informed of the security policy change by the local service module if the corresponding one of the client modules becomes active.
8. The security system as recited in claim 1, wherein the security policy change messages in the delivery queue are subsequently delivered to the client modules if the affected client modules become active, and wherein the subsequently delivered security policy change messages inform the client modules of the security policy change in a deferred manner.
9. The security system as recited in claim 1 wherein in storing the security policy change messages in the delivery queue, one or more of the security policy change messages being stored or those security policy change messages previously stored arc modified or consolidated.
10. The security system as recited in claim 9, wherein the security policy change messages in the delivery queue are subsequently delivered to the client modules if the affected client modules become active, thereby informing such client modules of the security policy change in a deferred manner.
11. The security system as recited in claim 1, wherein in storing the security policy change messages in the delivery queue, the local service module is configured to determine whether one or more of the security policy change messages being stored in the delivery queue are affected by any other security policy change messages residing in the delivery queue, and configured to then modify at least one of the security policy change messages being stored or those security policy change messages previously stored.
12. The security system as recited in claim 11, wherein the security policy change messages in the delivery queue are subsequently delivered to the client modules if the affected client modules become active, thereby informing such client modules of the security policy change in a deferred manner.
13. A security system for securing files from unauthorized access within a distributed computer network, the security system comprising: a processor; anda memory storing a server module comprising at least computer program code stored on a computer readable medium and configured to operate on a server computer and configured to control access to secured files having access rules in a header portion thereof, wherein at least a portion of security policy information that governs a type, a location, a duration, and an extent of access to the secured files that are permitted by users via the server computer is received at the server module from a central service module via a local service module comprising a delivery queue for temporarily storing security policy change messages to he delivered to client modules determined to be inactive and affected by a security policy change received at the central service module.
14. The security system as recited in claim 13, wherein if a security policy change is received at the central service module, the central service module is configured to update the portion of the security policy information at the local service module based on the security policy change.
15. The security system as recited in claim 14, wherein after the local service module has been updated, the central service module is configured to identify the server module that is affected by the security policy change, and configured to thereafter inform an affected server module.
16. The security system as recited in claim 15, wherein the affected server module is configured to thereafter update security information at the affected server module.
17. The security system as recited in claim 14, wherein after the central service module has been updated, the central service module is configured to identify those of the affected server module and then determine if the affected server module is active, and configured to thereafter inform an active server module of the security policy change.
18. The security system as recited in claim 17, wherein the local service module is further configured to defer informing the affected server module that is not active of the security policy change.
19. The security system as recited in claim 18, wherein the affected but not the active server module is subsequently informed of the security policy change by the local service module if the server module becomes active.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of U.S. patent application Ser. No.: 10/186,203, filed Jun. 26, 2002 (now U.S. Pat. No. 7,565,683), and entitled “METHOD AND SYSTEM FOR IMPLEMENTING CHANGES TO SECURITY POLICIES IN A DISTRIBUTED SECURITY SYSTEM,” which is a continuation in part of U.S. patent application Ser. No.: 10/075,194, filed Feb. 12, 2002, now U.S. Pat. No. 8,065,713 and entitled “SYSTEM AND METHOD FOR PROVIDING MULTI-LOCATION ACCESS MANAGEMENT TO SECURED ITEMS,” which claims the benefits of U.S. Provisional Application No. 60/339,634, filed Dec. 12, 2001, and entitled “PERVASIVE SECURITY SYSTEMS,” which are hereby incorporated by reference for all purposes.

US Referenced Citations (694)

Number	Name	Date	Kind
4203166	Ehrsam et al.	May 1980	A
4238854	Ehrsam et al.	Dec 1980	A
4423287	Zeidler	Dec 1983	A
4423387	Zeidler	Dec 1983	A
4734568	Watanabe	Mar 1988	A
4757533	Allen et al.	Jul 1988	A
4796220	Wolfe	Jan 1989	A
4799258	Davies	Jan 1989	A
4827508	Shear	May 1989	A
4887204	Johnson et al.	Dec 1989	A
4888800	Marshall et al.	Dec 1989	A
4912552	Allison et al.	Mar 1990	A
4972472	Brown et al.	Nov 1990	A
5032979	Hecht et al.	Jul 1991	A
5052040	Preston et al.	Sep 1991	A
5058164	Elmer et al.	Oct 1991	A
5144660	Rose	Sep 1992	A
5204897	Wyman	Apr 1993	A
5212788	Lomet et al.	May 1993	A
5220657	Bly et al.	Jun 1993	A
5235641	Nozawa et al.	Aug 1993	A
5247575	Sprague et al.	Sep 1993	A
5267313	Hirata	Nov 1993	A
5276735	Boebert et al.	Jan 1994	A
5301247	Rasmussen et al.	Apr 1994	A
5319705	Halter et al.	Jun 1994	A
5369702	Shanton	Nov 1994	A
5375169	Seheidt et al.	Dec 1994	A
5404404	Novorita	Apr 1995	A
5406628	Beller et al.	Apr 1995	A
5414852	Kramer et al.	May 1995	A
5434918	Kung et al.	Jul 1995	A
5461710	Bloomfield et al.	Oct 1995	A
5467342	Logston et al.	Nov 1995	A
5495533	Linehan et al.	Feb 1996	A
5497422	Tysen et al.	Mar 1996	A
5499297	Boebert	Mar 1996	A
5502766	Boebert et al.	Mar 1996	A
5535375	Eshel et al.	Jul 1996	A
5557765	Lipner et al.	Sep 1996	A
5570108	McLaughlin et al.	Oct 1996	A
5584023	Hsu	Dec 1996	A
5600722	Yamaguchi et al.	Feb 1997	A
5606663	Kadooka	Feb 1997	A
5619576	Shaw	Apr 1997	A
5638501	Gough et al.	Jun 1997	A
5640388	Woodhead et al.	Jun 1997	A
5655119	Davy	Aug 1997	A
5661668	Yemini et al.	Aug 1997	A
5661806	Nevoux et al.	Aug 1997	A
5671412	Christiano	Sep 1997	A
5673316	Auerbach et al.	Sep 1997	A
5677953	Dolphin	Oct 1997	A
5680452	Shanton	Oct 1997	A
5682537	Davies et al.	Oct 1997	A
5684987	Mamiya et al.	Nov 1997	A
5689688	Strong et al.	Nov 1997	A
5689718	Sakurai et al.	Nov 1997	A
5693652	Barrus et al.	Dec 1997	A
5699428	McDonnal et al.	Dec 1997	A
5708709	Rose	Jan 1998	A
5715403	Stefik	Feb 1998	A
5717755	Shanton	Feb 1998	A
5719941	Swift et al.	Feb 1998	A
5720033	Deo	Feb 1998	A
5729734	Parker et al.	Mar 1998	A
5732265	Dewitt et al.	Mar 1998	A
5745573	Lipner et al.	Apr 1998	A
5745750	Porcaro	Apr 1998	A
5748736	Mittra	May 1998	A
5751287	Hahn et al.	May 1998	A
5757920	Misra et al.	May 1998	A
5765152	Ericson	Jun 1998	A
5768381	Hawthorne	Jun 1998	A
5778065	Hauser et al.	Jul 1998	A
5778350	Adams et al.	Jul 1998	A
5781711	Austin et al.	Jul 1998	A
5787169	Eldridge et al.	Jul 1998	A
5787173	Seheidt et al.	Jul 1998	A
5787175	Carter	Jul 1998	A
5790789	Suarez	Aug 1998	A
5790790	Smith et al.	Aug 1998	A
5813009	Johnson et al.	Sep 1998	A
5821933	Keller et al.	Oct 1998	A
5825876	Peterson	Oct 1998	A
5835592	Chang et al.	Nov 1998	A
5835601	Shimbo et al.	Nov 1998	A
5850443	Van Oorschot et al.	Dec 1998	A
5857189	Riddle	Jan 1999	A
5862325	Reed et al.	Jan 1999	A
5870468	Harrison	Feb 1999	A
5870477	Sasaki et al.	Feb 1999	A
5881287	Mast	Mar 1999	A
5892900	Ginter et al.	Apr 1999	A
5893084	Morgan et al.	Apr 1999	A
5898781	Shanton	Apr 1999	A
5922073	Shimada	Jul 1999	A
5923754	Angelo et al.	Jul 1999	A
5933498	Schnek et al.	Aug 1999	A
5944794	Okamoto et al.	Aug 1999	A
5953419	Lohstroh et al.	Sep 1999	A
5968177	Batten-Carew et al.	Oct 1999	A
5970502	Salkewicz et al.	Oct 1999	A
5978802	Hurvig	Nov 1999	A
5987440	O'Neil et al.	Nov 1999	A
5991879	Still	Nov 1999	A
5999907	Donner	Dec 1999	A
6011847	Follendore, III	Jan 2000	A
6014730	Ohtsu	Jan 2000	A
6023506	Ote et al.	Feb 2000	A
6031584	Gray	Feb 2000	A
6032216	Schmuck et al.	Feb 2000	A
6035404	Zhao	Mar 2000	A
6038322	Harkins	Mar 2000	A
6044155	Thomlinson et al.	Mar 2000	A
6055314	Spies et al.	Apr 2000	A
6058424	Dixon et al.	May 2000	A
6061790	Bodnar	May 2000	A
6061797	Jade et al.	May 2000	A
6069057	Wu	May 2000	A
6069957	Richards	May 2000	A
6070244	Orchier et al.	May 2000	A
6085323	Shimizu et al.	Jul 2000	A
6088717	Reed et al.	Jul 2000	A
6088805	Davis et al.	Jul 2000	A
6098056	Rusnak et al.	Aug 2000	A
6101507	Cane et al.	Aug 2000	A
6105131	Carroll	Aug 2000	A
6122630	Strickler et al.	Sep 2000	A
6134327	Van Oorschot	Oct 2000	A
6134658	Multerer et al.	Oct 2000	A
6134660	Boneh et al.	Oct 2000	A
6134664	Walker	Oct 2000	A
6141754	Choy	Oct 2000	A
6145084	Zuili	Nov 2000	A
6148338	Lachelt et al.	Nov 2000	A
6158010	Moriconi et al.	Dec 2000	A
6161139	Win et al.	Dec 2000	A
6170060	Mott et al.	Jan 2001	B1
6182142	Win et al.	Jan 2001	B1
6185612	Jensen et al.	Feb 2001	B1
6185684	Pravetz et al.	Feb 2001	B1
6192408	Vahalia et al.	Feb 2001	B1
6199070	Polo-Wood et al.	Mar 2001	B1
6205549	Pravetz et al.	Mar 2001	B1
6212561	Sitaraman et al.	Apr 2001	B1
6223285	Komuro et al.	Apr 2001	B1
6226618	Downs et al.	May 2001	B1
6226745	Wiederhold et al.	May 2001	B1
6240188	Dondeti et al.	May 2001	B1
6249755	Yemini et al.	Jun 2001	B1
6249873	Richard et al.	Jun 2001	B1
6253193	Ginter et al.	Jun 2001	B1
6260040	Kauffman et al.	Jul 2001	B1
6260141	Park	Jul 2001	B1
6263348	Kathrow et al.	Jul 2001	B1
6266420	Langford et al.	Jul 2001	B1
6272631	Thomlinson et al.	Aug 2001	B1
6272632	Carman et al.	Aug 2001	B1
6282649	Lambert et al.	Aug 2001	B1
6289450	Pensak et al.	Sep 2001	B1
6289458	Garg et al.	Sep 2001	B1
6292895	Baltzley	Sep 2001	B1
6292899	McBride	Sep 2001	B1
6295361	Kadansky et al.	Sep 2001	B1
6299069	Shona	Oct 2001	B1
6301614	Najork et al.	Oct 2001	B1
6308256	Folmsbee	Oct 2001	B1
6308273	Goertzel et al.	Oct 2001	B1
6314408	Salas et al.	Nov 2001	B1
6314409	Schnek et al.	Nov 2001	B2
6317777	Skarbo et al.	Nov 2001	B1
6332025	Takahashi et al.	Dec 2001	B2
6336114	Garrison	Jan 2002	B1
6339423	Sampson et al.	Jan 2002	B1
6339825	Pensak et al.	Jan 2002	B2
6341164	Dilkie et al.	Jan 2002	B1
6343316	Sakata	Jan 2002	B1
6347374	Drake et al.	Feb 2002	B1
6349337	Parsons et al.	Feb 2002	B1
6351813	Mooney et al.	Feb 2002	B1
6353859	McKeehan et al.	Mar 2002	B1
6356903	Baxter et al.	Mar 2002	B1
6356941	Cohen	Mar 2002	B1
6357010	Viets et al.	Mar 2002	B1
6363480	Perlman	Mar 2002	B1
6366298	Haitsuka et al.	Apr 2002	B1
6370249	Van Oorschot	Apr 2002	B1
6381698	Devanbu et al.	Apr 2002	B1
6385644	Devine et al.	May 2002	B1
6389433	Bolosky et al.	May 2002	B1
6389538	Gruse et al.	May 2002	B1
6393420	Peters	May 2002	B1
6405315	Burns et al.	Jun 2002	B1
6405318	Rowland	Jun 2002	B1
6408404	Ladwig	Jun 2002	B1
6421714	Rai et al.	Jul 2002	B1
6442688	Moses et al.	Aug 2002	B1
6442695	Dutcher et al.	Aug 2002	B1
6446090	Hart	Sep 2002	B1
6449721	Pensak et al.	Sep 2002	B1
6453353	Win et al.	Sep 2002	B1
6453419	Flint et al.	Sep 2002	B1
6466476	Wong et al.	Oct 2002	B1
6466932	Dennis et al.	Oct 2002	B1
6477544	Bolosky et al.	Nov 2002	B1
6487662	Kharon et al.	Nov 2002	B1
6490680	Scheidt et al.	Dec 2002	B1
6505300	Chan et al.	Jan 2003	B2
6510349	Schnek et al.	Jan 2003	B1
6519700	Ram et al.	Feb 2003	B1
6529956	Smith et al.	Mar 2003	B1
6530020	Aoki	Mar 2003	B1
6530024	Proctor	Mar 2003	B1
6542608	Scheidt et al.	Apr 2003	B2
6549623	Scheidt et al.	Apr 2003	B1
6550011	Sims	Apr 2003	B1
6557039	Leong et al.	Apr 2003	B1
6567914	Just et al.	May 2003	B1
6571291	Chow	May 2003	B1
6574733	Langford	Jun 2003	B1
6584466	Serbinis et al.	Jun 2003	B1
6587878	Merriam	Jul 2003	B1
6587946	Jakobsson	Jul 2003	B1
6588673	Chan et al.	Jul 2003	B1
6591295	Diamond et al.	Jul 2003	B1
6594662	Sieffert et al.	Jul 2003	B1
6598161	Kluttz et al.	Jul 2003	B1
6601170	Wallace, Jr.	Jul 2003	B1
6603857	Batten-Carew et al.	Aug 2003	B1
6608636	Roseman	Aug 2003	B1
6609115	Mehring et al.	Aug 2003	B1
6611599	Natarajan	Aug 2003	B2
6611846	Stoodley	Aug 2003	B1
6615349	Hair	Sep 2003	B1
6615350	Schell et al.	Sep 2003	B1
6625650	Stelliga	Sep 2003	B2
6625734	Marvit et al.	Sep 2003	B1
6629140	Fertell et al.	Sep 2003	B1
6629243	Kleinman et al.	Sep 2003	B1
6633311	Douvikas et al.	Oct 2003	B1
6640307	Viets et al.	Oct 2003	B2
6646515	Jun et al.	Nov 2003	B2
6647388	Numao et al.	Nov 2003	B2
6678835	Shah et al.	Jan 2004	B1
6683954	Searle et al.	Jan 2004	B1
6687822	Jakobsson	Feb 2004	B1
6693652	Barrus et al.	Feb 2004	B1
6698022	Wu	Feb 2004	B1
6711683	Laczko et al.	Mar 2004	B1
6718361	Basani et al.	Apr 2004	B1
6735701	Jacobson	May 2004	B1
6738908	Bonn et al.	May 2004	B1
6751573	Burch	Jun 2004	B1
6754657	Lomet	Jun 2004	B2
6754665	Futagami et al.	Jun 2004	B1
6775779	England et al.	Aug 2004	B1
6779031	Picher-Dempsey	Aug 2004	B1
6782403	Kino et al.	Aug 2004	B1
6801999	Venkatesan et al.	Oct 2004	B1
6807534	Erickson	Oct 2004	B1
6807636	Hartman et al.	Oct 2004	B2
6810389	Meyer	Oct 2004	B1
6810479	Barlow et al.	Oct 2004	B1
6816871	Lee	Nov 2004	B2
6816969	Miyazaki et al.	Nov 2004	B2
6826698	Minkin et al.	Nov 2004	B1
6834333	Yoshino et al.	Dec 2004	B2
6834341	Bahl et al.	Dec 2004	B1
6842825	Geiner et al.	Jan 2005	B2
6845452	Roddy et al.	Jan 2005	B1
6851050	Singhal et al.	Feb 2005	B2
6862103	Miura et al.	Mar 2005	B1
6865555	Novak	Mar 2005	B2
6870920	Henits	Mar 2005	B2
6874139	Krueger et al.	Mar 2005	B2
6877010	Smith-Semedo et al.	Apr 2005	B2
6877136	Bess et al.	Apr 2005	B2
6882994	Yoshimura et al.	Apr 2005	B2
6889210	Vainstein	May 2005	B1
6891953	DeMello et al.	May 2005	B1
6892201	Brown et al.	May 2005	B2
6892306	En-Seung et al.	May 2005	B1
6898627	Sekiguchi	May 2005	B1
6907034	Begis	Jun 2005	B1
6909708	Krishnaswamy et al.	Jun 2005	B1
6915425	Xu et al.	Jul 2005	B2
6915434	Kuroda et al.	Jul 2005	B1
6915435	Merriam	Jul 2005	B1
6920558	Sames et al.	Jul 2005	B2
6922785	Brewer et al.	Jul 2005	B1
6924425	Naples et al.	Aug 2005	B2
6931450	Howard et al.	Aug 2005	B2
6931530	Pham et al.	Aug 2005	B2
6931597	Prakash	Aug 2005	B1
6938042	Aboulhosn et al.	Aug 2005	B2
6938156	Wheeler et al.	Aug 2005	B2
6941355	Donaghey et al.	Sep 2005	B1
6941456	Wilson	Sep 2005	B2
6941472	Moriconi et al.	Sep 2005	B2
6944183	Iyer et al.	Sep 2005	B1
6947556	Matyas, Jr. et al.	Sep 2005	B1
6950818	Dennis et al.	Sep 2005	B2
6950936	Subramaniam et al.	Sep 2005	B2
6950941	Lee et al.	Sep 2005	B1
6950943	Bacha et al.	Sep 2005	B1
6952780	Olsen et al.	Oct 2005	B2
6954753	Jeran et al.	Oct 2005	B1
6957261	Lortz	Oct 2005	B2
6959308	Gramsamer et al.	Oct 2005	B2
6961849	Davis et al.	Nov 2005	B1
6961855	Rich et al.	Nov 2005	B1
6968060	Pinkas	Nov 2005	B1
6968456	Tripathi et al.	Nov 2005	B1
6971018	Witt et al.	Nov 2005	B1
6976259	Dutta et al.	Dec 2005	B1
6978366	Ignatchenko et al.	Dec 2005	B1
6978376	Giroux et al.	Dec 2005	B2
6978377	Asano et al.	Dec 2005	B1
6987752	Falco et al.	Jan 2006	B1
6988133	Zavalkovsky et al.	Jan 2006	B1
6988199	Toh et al.	Jan 2006	B2
6990441	Bolme et al.	Jan 2006	B1
6993135	Ishibashi	Jan 2006	B2
6996718	Henry et al.	Feb 2006	B1
7000150	Zunino et al.	Feb 2006	B1
7003116	Riedel et al.	Feb 2006	B2
7003117	Kacker et al.	Feb 2006	B2
7003560	Mullen et al.	Feb 2006	B1
7003661	Beattie et al.	Feb 2006	B2
7010689	Matyas et al.	Mar 2006	B1
7010809	Hori et al.	Mar 2006	B2
7013332	Friedel et al.	Mar 2006	B2
7013485	Brown et al.	Mar 2006	B2
7020645	Bisbee et al.	Mar 2006	B2
7024427	Bobbitt et al.	Apr 2006	B2
7035854	Hsiao et al.	Apr 2006	B2
7035910	Dutta et al.	Apr 2006	B1
7043637	Bolosky et al.	May 2006	B2
7046807	Hirano et al.	May 2006	B2
7047404	Doonan et al.	May 2006	B1
7051213	Kobayashi et al.	May 2006	B1
7058696	Phillips et al.	Jun 2006	B1
7058978	Feuerstein et al.	Jun 2006	B2
7062642	Langrind et al.	Jun 2006	B1
7073063	Peinado	Jul 2006	B2
7073073	Nonaka et al.	Jul 2006	B1
7076067	Raike et al.	Jul 2006	B2
7076312	Law et al.	Jul 2006	B2
7076469	Schreiber et al.	Jul 2006	B2
7076633	Tormasov et al.	Jul 2006	B2
7080077	Ramamurthy et al.	Jul 2006	B2
7095853	Takuya	Aug 2006	B2
7096266	Lewin et al.	Aug 2006	B2
7099926	Ims et al.	Aug 2006	B1
7103911	Spies et al.	Sep 2006	B2
7107185	Yemini et al.	Sep 2006	B1
7107269	Arlein et al.	Sep 2006	B2
7107416	Stuart et al.	Sep 2006	B2
7113594	Boneh et al.	Sep 2006	B2
7116785	Okaue	Oct 2006	B2
7117322	Hochberg et al.	Oct 2006	B2
7120635	Bhide et al.	Oct 2006	B2
7120757	Tsuge	Oct 2006	B2
7124164	Chemtob	Oct 2006	B1
7126957	Isukapalli et al.	Oct 2006	B1
7130964	Ims et al.	Oct 2006	B2
7131071	Gune et al.	Oct 2006	B2
7134041	Murray et al.	Nov 2006	B2
7136903	Phillips et al.	Nov 2006	B1
7139399	Zimmermann	Nov 2006	B1
7140044	Redlich et al.	Nov 2006	B2
7145898	Elliott	Dec 2006	B1
7146388	Stakutis et al.	Dec 2006	B2
7146498	Takechi et al.	Dec 2006	B1
7159036	Hinchliffe et al.	Jan 2007	B2
7168094	Fredell	Jan 2007	B1
7171557	Kallahalla et al.	Jan 2007	B2
7174563	Brownlie et al.	Feb 2007	B1
7177427	Komuro et al.	Feb 2007	B1
7177839	Claxton et al.	Feb 2007	B1
7178033	Garcia	Feb 2007	B1
7181017	Nagel et al.	Feb 2007	B1
7185364	Knouse et al.	Feb 2007	B2
7187033	Pendharkar	Mar 2007	B2
7188181	Squier et al.	Mar 2007	B1
7194764	Martherus et al.	Mar 2007	B2
7197638	Grawrock et al.	Mar 2007	B1
7200747	Riedel et al.	Apr 2007	B2
7203317	Kallahalla et al.	Apr 2007	B2
7203968	Asano et al.	Apr 2007	B2
7219230	Riedel et al.	May 2007	B2
7224795	Takada et al.	May 2007	B2
7225256	Villavicencio	May 2007	B2
7227953	Shida	Jun 2007	B2
7233948	Shamoon et al.	Jun 2007	B1
7237002	Estrada et al.	Jun 2007	B1
7249044	Kumar et al.	Jul 2007	B2
7249251	Todd et al.	Jul 2007	B2
7260555	Rossmann et al.	Aug 2007	B2
7265764	Alben et al.	Sep 2007	B2
7266684	Jancula	Sep 2007	B2
7280658	Amini et al.	Oct 2007	B2
7281272	Rubin et al.	Oct 2007	B1
7287055	Smith et al.	Oct 2007	B2
7287058	Loveland et al.	Oct 2007	B2
7290148	Tozawa et al.	Oct 2007	B2
7308702	Thomsen et al.	Dec 2007	B1
7313824	Bala et al.	Dec 2007	B1
7319752	Asano et al.	Jan 2008	B2
7340600	Corella	Mar 2008	B1
7343488	Yadav	Mar 2008	B2
7359517	Rowe	Apr 2008	B1
7362868	Madoukh et al.	Apr 2008	B2
7380120	Garcia	May 2008	B1
7383586	Cross et al.	Jun 2008	B2
7386529	Kiessig et al.	Jun 2008	B2
7386599	Piersol et al.	Jun 2008	B1
7401220	Bolosky et al.	Jul 2008	B2
7406596	Tararukhina et al.	Jul 2008	B2
7415608	Bolosky et al.	Aug 2008	B2
7434048	Shapiro et al.	Oct 2008	B1
7454612	Bolosky et al.	Nov 2008	B2
7461157	Ahlard et al.	Dec 2008	B2
7461405	Boudreault et al.	Dec 2008	B2
7478243	Bolosky et al.	Jan 2009	B2
7478418	Supramaniam et al.	Jan 2009	B2
7484245	Friedman et al.	Jan 2009	B1
7496959	Adelstein et al.	Feb 2009	B2
7509492	Boyen et al.	Mar 2009	B2
7512810	Ryan	Mar 2009	B1
7539867	Bolosky et al.	May 2009	B2
7555558	Kenrich et al.	Jun 2009	B1
7562232	Zuili et al.	Jul 2009	B2
7565683	Huang et al.	Jul 2009	B1
7631184	Ryan	Dec 2009	B2
7681034	Lee et al.	Mar 2010	B1
7698230	Brown et al.	Apr 2010	B1
7702909	Vainstein	Apr 2010	B2
7703140	Nath et al.	Apr 2010	B2
7707427	Kenrich et al.	Apr 2010	B1
7729995	Zheng et al.	Jun 2010	B1
7730543	Nath et al.	Jun 2010	B1
7748045	Kenrich et al.	Jun 2010	B2
RE41546	Vainstein	Aug 2010	E
7783765	Hildebrand et al.	Aug 2010	B2
7890990	Vainstein et al.	Feb 2011	B1
7913311	Alain et al.	Mar 2011	B2
7917938	Jacobson	Mar 2011	B2
7921284	Kinghorn et al.	Apr 2011	B1
7921288	Hildebrand	Apr 2011	B1
7921450	Vainstein et al.	Apr 2011	B1
7930756	Crocker et al.	Apr 2011	B1
8006280	Hildebrand et al.	Aug 2011	B1
8065713	Vainstein et al.	Nov 2011	B1
20010000265	Schreiber et al.	Apr 2001	A1
20010011254	Clark	Aug 2001	A1
20010014882	Stefik et al.	Aug 2001	A1
20010018743	Takuya	Aug 2001	A1
20010021255	Ishibashi	Sep 2001	A1
20010021926	Schnek et al.	Sep 2001	A1
20010023421	Numao et al.	Sep 2001	A1
20010032181	Jakstadt et al.	Oct 2001	A1
20010033611	Grimwood et al.	Oct 2001	A1
20010034839	Karjoth et al.	Oct 2001	A1
20010042110	Furusawa et al.	Nov 2001	A1
20010044903	Yamamoto et al.	Nov 2001	A1
20010056541	Matsuzaki et al.	Dec 2001	A1
20010056550	Lee	Dec 2001	A1
20020003886	Hillegass et al.	Jan 2002	A1
20020007335	Millard et al.	Jan 2002	A1
20020010679	Felsher	Jan 2002	A1
20020013772	Peinado	Jan 2002	A1
20020016921	Olsen et al.	Feb 2002	A1
20020016922	Richards et al.	Feb 2002	A1
20020023208	Jancula	Feb 2002	A1
20020026321	Faris et al.	Feb 2002	A1
20020027886	Fischer et al.	Mar 2002	A1
20020029340	Pensak et al.	Mar 2002	A1
20020031230	Sweet et al.	Mar 2002	A1
20020035624	Kim	Mar 2002	A1
20020036984	Chiussi et al.	Mar 2002	A1
20020041391	Bannai	Apr 2002	A1
20020042756	Kumar et al.	Apr 2002	A1
20020046350	Lordemann et al.	Apr 2002	A1
20020050098	Chan	May 2002	A1
20020052981	Yasuda	May 2002	A1
20020056042	Van Der Kaay et al.	May 2002	A1
20020062240	Morinville	May 2002	A1
20020062245	Niu et al.	May 2002	A1
20020062451	Scheidt et al.	May 2002	A1
20020069077	Brophy et al.	Jun 2002	A1
20020069272	Kim et al.	Jun 2002	A1
20020069363	Winburn	Jun 2002	A1
20020073320	Rinkevich et al.	Jun 2002	A1
20020077986	Kobata et al.	Jun 2002	A1
20020077988	Sasaki et al.	Jun 2002	A1
20020078239	Howard et al.	Jun 2002	A1
20020078361	Giroux et al.	Jun 2002	A1
20020087479	Malcolm	Jul 2002	A1
20020089602	Sullivan	Jul 2002	A1
20020091532	Viets et al.	Jul 2002	A1
20020091745	Ramamurthy et al.	Jul 2002	A1
20020091928	Bouchard et al.	Jul 2002	A1
20020093527	Sherlock et al.	Jul 2002	A1
20020099947	Evans	Jul 2002	A1
20020112035	Carey et al.	Aug 2002	A1
20020112048	Gruyer et al.	Aug 2002	A1
20020120851	Clarke	Aug 2002	A1
20020124180	Hagman	Sep 2002	A1
20020129158	Zhang et al.	Sep 2002	A1
20020129235	Okamoto et al.	Sep 2002	A1
20020133500	Arlein et al.	Sep 2002	A1
20020133699	Pueschel	Sep 2002	A1
20020138571	Trinon et al.	Sep 2002	A1
20020138726	Samson et al.	Sep 2002	A1
20020138762	Horne	Sep 2002	A1
20020143710	Liu	Oct 2002	A1
20020143906	Tormasov et al.	Oct 2002	A1
20020147746	Lee	Oct 2002	A1
20020150239	Carny et al.	Oct 2002	A1
20020152302	Motoyama et al.	Oct 2002	A1
20020156726	Kleckner et al.	Oct 2002	A1
20020157016	Russell et al.	Oct 2002	A1
20020162104	Raike et al.	Oct 2002	A1
20020165870	Chakraborty et al.	Nov 2002	A1
20020166053	Wilson	Nov 2002	A1
20020169963	Seder et al.	Nov 2002	A1
20020169965	Hale et al.	Nov 2002	A1
20020172367	Mulder et al.	Nov 2002	A1
20020174030	Praisner et al.	Nov 2002	A1
20020174109	Chandy et al.	Nov 2002	A1
20020174415	Hines	Nov 2002	A1
20020176572	Ananth	Nov 2002	A1
20020178271	Graham et al.	Nov 2002	A1
20020184217	Bisbee et al.	Dec 2002	A1
20020184488	Amini et al.	Dec 2002	A1
20020194484	Bolosky et al.	Dec 2002	A1
20020198798	Ludwig et al.	Dec 2002	A1
20030005168	Leerssen et al.	Jan 2003	A1
20030009685	Choo et al.	Jan 2003	A1
20030014391	Evans et al.	Jan 2003	A1
20030023559	Choi et al.	Jan 2003	A1
20030026431	Hammersmith	Feb 2003	A1
20030028610	Pearson	Feb 2003	A1
20030033528	Ozog et al.	Feb 2003	A1
20030037029	Holenstein et al.	Feb 2003	A1
20030037133	Owens	Feb 2003	A1
20030037237	Abgrall et al.	Feb 2003	A1
20030037253	Blank et al.	Feb 2003	A1
20030046176	Hynes	Mar 2003	A1
20030046238	Nonaka et al.	Mar 2003	A1
20030046270	Leung et al.	Mar 2003	A1
20030050919	Brown et al.	Mar 2003	A1
20030051039	Brown et al.	Mar 2003	A1
20030056139	Murray et al.	Mar 2003	A1
20030061482	Emmerichs	Mar 2003	A1
20030061506	Cooper	Mar 2003	A1
20030074580	Knouse et al.	Apr 2003	A1
20030078959	Yeung et al.	Apr 2003	A1
20030079175	Limantsev	Apr 2003	A1
20030081784	Kallahalla et al.	May 2003	A1
20030081785	Boneh et al.	May 2003	A1
20030081787	Kallahalla et al.	May 2003	A1
20030081790	Kallahalla et al.	May 2003	A1
20030088517	Medoff	May 2003	A1
20030088783	DiPierro	May 2003	A1
20030093457	Goldick	May 2003	A1
20030095552	Bernhard et al.	May 2003	A1
20030099248	Speciner	May 2003	A1
20030101072	Dick et al.	May 2003	A1
20030108883	Rondinone	Jun 2003	A1
20030110131	Alain et al.	Jun 2003	A1
20030110169	Zuili	Jun 2003	A1
20030110266	Rollins et al.	Jun 2003	A1
20030110280	Hinchliffe et al.	Jun 2003	A1
20030110397	Supramaniam	Jun 2003	A1
20030115146	Lee et al.	Jun 2003	A1
20030115218	Bobbitt et al.	Jun 2003	A1
20030115570	Bisceglia	Jun 2003	A1
20030120601	Ouye	Jun 2003	A1
20030120684	Zuili et al.	Jun 2003	A1
20030126434	Lim et al.	Jul 2003	A1
20030132949	Fallon et al.	Jul 2003	A1
20030154296	Noguchi et al.	Aug 2003	A1
20030154381	Ouye	Aug 2003	A1
20030154396	Godwin et al.	Aug 2003	A1
20030154401	Hartman et al.	Aug 2003	A1
20030159048	Matsumoto et al.	Aug 2003	A1
20030159066	Staw et al.	Aug 2003	A1
20030163704	Dick et al.	Aug 2003	A1
20030165117	Garcia-Luna-Aceves et al.	Sep 2003	A1
20030172280	Scheidt et al.	Sep 2003	A1
20030177070	Viswanath et al.	Sep 2003	A1
20030177378	Wittkotter	Sep 2003	A1
20030182310	Charnock et al.	Sep 2003	A1
20030182579	Leporini et al.	Sep 2003	A1
20030182584	Banes et al.	Sep 2003	A1
20030191938	Woods et al.	Oct 2003	A1
20030196096	Sutton	Oct 2003	A1
20030197729	Denoue et al.	Oct 2003	A1
20030200202	Hsiao et al.	Oct 2003	A1
20030204692	Tamer et al.	Oct 2003	A1
20030208485	Castellanos	Nov 2003	A1
20030217264	Martin et al.	Nov 2003	A1
20030217281	Ryan	Nov 2003	A1
20030217282	Henry	Nov 2003	A1
20030217333	Smith et al.	Nov 2003	A1
20030220999	Emerson	Nov 2003	A1
20030222141	Vogler et al.	Dec 2003	A1
20030226013	Dutertre	Dec 2003	A1
20030233650	Zaner et al.	Dec 2003	A1
20040022390	McDonald et al.	Feb 2004	A1
20040025037	Hair	Feb 2004	A1
20040039781	LaVallee et al.	Feb 2004	A1
20040041845	Alben et al.	Mar 2004	A1
20040049702	Subramaniam et al.	Mar 2004	A1
20040064507	Sakata et al.	Apr 2004	A1
20040064710	Vainstein	Apr 2004	A1
20040068524	Aboulhosn et al.	Apr 2004	A1
20040068664	Nachenberg et al.	Apr 2004	A1
20040073660	Toomey	Apr 2004	A1
20040073718	Johannessen et al.	Apr 2004	A1
20040088548	Smetters et al.	May 2004	A1
20040098580	DeTreville	May 2004	A1
20040103202	Hildebrand et al.	May 2004	A1
20040103280	Balfanz et al.	May 2004	A1
20040117371	Bhide et al.	Jun 2004	A1
20040131191	Chen et al.	Jul 2004	A1
20040133544	Kiessig et al.	Jul 2004	A1
20040158586	Tsai	Aug 2004	A1
20040186845	Fukui	Sep 2004	A1
20040193602	Liu et al.	Sep 2004	A1
20040193905	Lirov et al.	Sep 2004	A1
20040193912	Li et al.	Sep 2004	A1
20040199514	Rosenblatt et al.	Oct 2004	A1
20040205576	Chikirivao et al.	Oct 2004	A1
20040215956	Venkatachary et al.	Oct 2004	A1
20040215962	Douceur et al.	Oct 2004	A1
20040243853	Swander et al.	Dec 2004	A1
20040254884	Haber et al.	Dec 2004	A1
20050021467	Franzdonk	Jan 2005	A1
20050021629	Cannata et al.	Jan 2005	A1
20050028006	Leser et al.	Feb 2005	A1
20050039034	Doyle et al.	Feb 2005	A1
20050050098	Barnett	Mar 2005	A1
20050071275	Vainstein et al.	Mar 2005	A1
20050071657	Ryan	Mar 2005	A1
20050071658	Nath et al.	Mar 2005	A1
20050081029	Thornton et al.	Apr 2005	A1
20050086531	Kenrich	Apr 2005	A1
20050091289	Shappell et al.	Apr 2005	A1
20050091484	Thornton et al.	Apr 2005	A1
20050097061	Shapiro et al.	May 2005	A1
20050120199	Carter	Jun 2005	A1
20050138371	Supramaniam	Jun 2005	A1
20050138383	Vainstein	Jun 2005	A1
20050168766	Troyansky et al.	Aug 2005	A1
20050177716	Ginter et al.	Aug 2005	A1
20050177858	Ueda	Aug 2005	A1
20050193397	Corenthin et al.	Sep 2005	A1
20050198326	Schlimmer et al.	Sep 2005	A1
20050223242	Nath	Oct 2005	A1
20050223414	Kenrich et al.	Oct 2005	A1
20050235154	Serret-Avila	Oct 2005	A1
20050256909	Aboulhosn et al.	Nov 2005	A1
20050268033	Ogasawara et al.	Dec 2005	A1
20050273600	Seeman	Dec 2005	A1
20050283610	Serret-Avila et al.	Dec 2005	A1
20050288961	Tabrizi	Dec 2005	A1
20060005021	Torrubia-Saez	Jan 2006	A1
20060075258	Adamson et al.	Apr 2006	A1
20060075465	Ramanathan et al.	Apr 2006	A1
20060093150	Reddy et al.	May 2006	A1
20060101285	Chen et al.	May 2006	A1
20060149407	Markham et al.	Jul 2006	A1
20060168147	Inoue et al.	Jul 2006	A1
20060184637	Hultgren et al.	Aug 2006	A1
20060230437	Boyer et al.	Oct 2006	A1
20060277316	Wang et al.	Dec 2006	A1
20070006214	Dubal et al.	Jan 2007	A1
20070067837	Schuster	Mar 2007	A1
20070083575	Leung et al.	Apr 2007	A1
20070192478	Louie et al.	Aug 2007	A1
20070193397	Corenthin et al.	Aug 2007	A1
20070294368	Bomgaars et al.	Dec 2007	A1
20080034205	Alain et al.	Feb 2008	A1
20080075126	Yang	Mar 2008	A1
20090100268	Garcia et al.	Apr 2009	A1
20090254843	Van Wie et al.	Oct 2009	A1
20100047757	McCurry et al.	Feb 2010	A1
20100199088	Nath	Aug 2010	A1
20110258438	Hildebrand	Oct 2011	A1
20110296199	Kinghorn et al.	Dec 2011	A1

Foreign Referenced Citations (25)

Number	Date	Country
0 672 991	Sep 1995	EP
0 674 253	Sep 1995	EP
0 809 170	Nov 1997	EP
0 913 966	May 1999	EP
0 913 967	May 1999	EP
0 950 941	Oct 1999	EP
0 950 941	Oct 1999	EP
1 107 504	Jun 2001	EP
1 107 504	Jun 2001	EP
1 130 492	Sep 2001	EP
1 154 348	Nov 2001	EP
1 320 012	Nov 2002	EP
1 324 565	Jul 2003	EP
2 328 047	Feb 1999	GB
2001-036517	Feb 2001	JP
2006-244044	Sep 2006	JP
2009-020720	Jan 2009	JP
WO 9641288	Dec 1996	WO
WO 0056028	Sep 2000	WO
WO 0161438	Aug 2001	WO
WO 0163387	Aug 2001	WO
WO 0163387	Aug 2001	WO
WO 0177783	Oct 2001	WO
WO 0178285	Oct 2001	WO
WO 0184271	Nov 2001	WO

Related Publications (1)

	Number	Date	Country
	20090254972 A1	Oct 2009	US

Provisional Applications (1)

	Number	Date	Country
	60339634	Dec 2001	US

Continuations (1)

	Number	Date	Country
Parent	10186203	Jun 2002	US
Child	12487796		US

Continuation in Parts (1)

	Number	Date	Country
Parent	10075194	Feb 2002	US
Child	10186203		US

Method and system for implementing changes to security policies in a distributed security system

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

International Classifications

Abstract