This application is related to U.S. patent application Ser. No. 10/075,194, filed Feb. 12, 2002, and entitled “SYSTEM AND METHOD FOR PROVIDING MULTI-LOCATION ACCESS MANAGEMENT TO SECURED ITEMS,” which is hereby incorporated by reference for all purposes.
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 a widely 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. Once an authorized party gains access to a secured resource, the resource is unsecured and presented to the authorized party. For example, the resource might be a document that the authorized party desires to read or modify. However, at this point, the authorized party may be permitted to save a copy of the resource elsewhere without any security measures. In effect, the saved copy becomes an unsecured resource. If such is permitted, then the robustness of the security system is jeopardized. Therefore, there is a need to provide more effective ways for security systems to secure and protect resources.
The invention relates to improved approaches for securing files that are derived from secured files. 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. These improved approaches can thus impose security on files that are derived from secured files. In one embodiment, files that are deemed derived from a secured file include files that are copies of the secured file. In another embodiment, files that are deemed derived from a secured file include files having content substantially similar to the content of the secured file.
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 securing a copy of a secured file, the secured file having a header portion and a data portion, the header portion including at least access rules, and the data portion including at least data of the secured file, one embodiment of the invention includes at least the acts of: determining whether a file being closed is a copy of an existing secured file; and modifying a header portion of the file being closed to include at least a part of the header portion for the existing secured file when it is determined that the file being closed is a copy of an existing secured file.
As a method for securing a copy of a secured file, the secured file having a header portion and a data portion, the header portion including at least access rules, and the data portion including at least data of the secured file, another embodiment of the invention includes at least the acts of: receiving a request to open the secured file, the request being initiated by a user having user privileges; computing a first file signature based on at least a portion of the data portion of the secured file; temporarily storing the first file signature for the secured file; providing the data portion of the secured file to the user; subsequently receiving a request to close another file; computing a second file signature based on at least a portion of the data portion of the another file; determining whether the first file signature substantially matches the second file signature; and modifying the header portion of the another file to include at least the access rules of the secured file when it is determined that the first file signature substantially matches the second file signature, thereby securing the another file.
As a method for securing copies of a secured file, the secured file having a header portion and a data portion, the header portion including at least access rules, and the data portion including at least data of the secured file, still another embodiment of the invention includes at least the acts of receiving, from a requestor, a request to access the secured file; and determining whether the requestor is authorized to access the secured file based on at least the access rules within the header portion of the secured file. Further, when it is determined that authorization is permitted, this embodiment of the invention includes the acts of: computing a file signature for at least a part of the data portion of the secured file, storing the file signature and at least a portion of the header portion in a security information table, decrypting data in the data portion, and returning the decrypted data to the requester. Alternatively, when it is determined that authorization is not permitted, this embodiment includes the act of denying the requestor access to the data portion. In addition, this embodiment can also include the act of determining whether a file being closed is a new file. When it is determined that the secured file is a new file, then this embodiment includes the acts of: computing a new file signature for at least a part of a data portion of the new file, and comparing the new file signature with file signatures stored in the security information table. Moreover, when the comparing indicates that the new file signature matches one of the file signatures in the security information table, this embodiment includes the act of securing the new file in the same manner by which the secured file is secured.
As a computer readable medium including at least computer program code for securing another file derived from a secured file, the secured file having a header portion and a data portion, the header portion including at least access rules, and the data portion including at least data of the secured file, one embodiment of the invention includes at least: computer program code for receiving a request to open the secured file, the request being initiated by a user having user privileges; computer program code for retrieving at least access rules from the header portion of the secured file; computer program code for determining whether the request to access the secured file by the user is permitted based on a comparison of the retrieved access rules with the user privileges; computer program code for providing the data portion of the secured file to the user when it is determined that the user is permitted to access the secured file; computer program code for computing a first file signature based on at least a portion of the data portion of the secured file; computer program code for temporarily storing the first file signature for the secured file; computer program code for subsequently receiving a request to close another file; computer program code for computing a second file signature based on at least a portion of the data portion of the another file; computer program code for comparing the second file signature to the first file signature to produce comparison information; computer program code for determining whether the another file should be secured based on the comparison information; and computer program code for securing the another file when it is determined that the another file should be secured.
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.
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:
The present invention relates to improved approaches for securing files that are derived from secured files. 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. These improved approaches can thus impose security on files that are derived from secured files. In one embodiment, files that are deemed derived from a secured file include files that are copies of the secured file. In another embodiment, files that are deemed derived from a secured file include files having content substantially similar to the content of the secured file.
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
According to one embodiment, the client computer 100 is loaded with a client module that is a linked and compiled, interpreted, or executable version of one embodiment of the present invention and 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.
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
A set of access rules 204 for the document 200 is received and associated with a 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. Typically, a header is a file structure, small in size and includes, or perhaps links to, security information about a resultant secured document. Depending on an exact implementation, the security information can be entirely included in a header or pointed to by a pointer that is included in the header. According to one embodiment, the access rules 204, as part of the security information, are included in the header 206. According to another embodiment, the access rules 204, as part of the security information, are separately stored from the document 200 but referenced therein. The security information or the header 206 further includes a file key. Some or all of the header 206 can then be encrypted by a cipher with a user key associated with an authorized user to an encrypted header 210. The encrypted header 210 is attached to the encrypted document 212 to generate a secured document 208.
It is understood that a cipher may be implemented based on one of many encryption/decryption schemes. Examples of such schemes may include, but are not 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 encryption/decryption scheme that is effective and reliable may be used. Hence, the details of encryption/decryption schemes are not further discussed herein so as to avoid obscuring aspects of the present invention.
According to one embodiment, to access the secured document 208, one needs to obtain the file key that is used to encrypt the document. To obtain the file key, one needs to be authenticated to get a user or group key and pass an access test in which the access rules in the security information are measured against the user's access privilege.
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 markup language, such as 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, a document is 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, 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.
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 (now abandoned), filed Apr. 26, 2002, and entitled “METHOD AND SYSTEM FOR PROVIDING MANAGEABILITY TO SECURITY INFORMATION FOR SECURED ITEMS,” which is hereby incorporated herein by reference.
The security layer 306 operates to monitor communications between the user application 302 and the file system 304. The security layer 306 can make a file being stored secure and can decide whether the user application (or its user) is permitted access to secured files. Moreover, subsequent to the security layer 306 determining that a secured file has been opened and the user application 302 has gained access to the secured file, the security layer 306 can detect when copies (exact, approximate or substantial copies) of the file have been made and stored to the file system 304. A security information table 314 can be stored in memory to assist the security layer 306 in determining when copies are being stored in the file system 304. When a copy of a secured file that is being made available to the user application 302 is stored to the file system 304, the copy can be stored such that it becomes secured in the same manner that the original secured file was secured. In one embodiment, the security information stored within the security information table 314 can be obtained and used when the copy is being stored to the file system 304. The copy may be stored by the file system 304 in the storage device 308 which may include a local volume or disk, or the storage device 312 which may include a remote volume or disk.
According to one embodiment which uses a Microsoft operating system (e.g., MS Windows NT), the user application 302 operates in a user mode while the security layer 306 and file system 304 are configured to operate in a kernel mode. Accordingly, one of the benefits or features in the present invention is that the security layer 306 can operate transparently with respect to a user who has activated the user application 302.
The secured file open processing 400 begins with a decision 402 that determines whether a request to open a secured file has been received. When the decision 402 determines that a request to open a secured file has not yet been received, the secured file open processing 400 awaits such a request. In other words, the secured file open processing 400 can be deemed invoked once a request to open a secured file has been received.
Once a request to open a secured file has been received, a decision 404 determines whether access is granted to the requestor. Typically, the requestor is a hit user of the user application (e.g., the user application 302) which initiated the open request. The requester can also be considered the user application acting on behalf of the user. When the decision 404 determines that access is not granted to the requestor, then the open request is denied 406.
On the other hand, when the decision 404 determines that access by the requestor is granted, then the data portion of the secured file is provided 408 to the requester. In addition, a first file signature for the secured file is computed 410. Here, the first file signature can be computed 410 in a variety of different ways. In one embodiment, a first block of the data portion of the secured file is used to compute the first file signature. In one example, the signature can be based on a Cyclical Redundancy Code (CRC). Next, the first file signature and security information pertaining to the secured file is stored 412 in memory. The security information being stored 412 includes at least the access rules for gaining access to the secured file. In one embodiment, the security information can be the security information 226 (encrypted or unencrypted) illustrated in
Once the decision 502 determines that a request to close a file has been received, the file is closed 504. The closing of the file can be performed in a conventional manner. In addition, a second file signature for the file is computed 506. The computation 506 of the second file signature would normally be performed in the same manner in which the first file signature was computed 410 by the secured file open processing 400. A decision 508 then determines whether the memory has a matching file signature. Here, the memory stores one or more of the first file signatures for secured files that have been opened. The memory is searched to determine whether any of the one or more stored file signatures matches the second file signature. When the decision 508 determines that there is no matching file signature in the memory, then the file close processing 500 is complete and ends with the file that has been closed not being secured. Here, the file close processing 500 does not secure the file being closed because that file is not considered to be a copy of a secured file previously opened.
Alternatively, when the decision 508 determines that the memory does have a matching file signature to that of the second file signature, the security information associated with the matching file signature is retrieved 510 from the memory. Then, the file (being closed) is secured 512 using the retrieved security information. Here, the file is deemed to be a copy of a secured file and thus the file is secured, preferably in the same manner in which the secured file was itself secured.
The secured file open processing 600 begins with a decision 602 that determines whether a request to open a secured file has been received. When the decision 602 determines that a request to open a secured file has not yet been received, the secured file open processing 600 awaits such a request. In other words, the secured file open processing 600 can be deemed invoked once a request to open a secured file has been received. In any case, once the decision 602 determines that a request to open a secured file has been received, access rules are retrieved 604 from a header portion of the secured file. Here, the secured file has a header portion and a data portion (see, e.g.,
Next, a decision 606 determines whether the open is trusted. The open is deemed to be trusted when the user application that issued the request to open can be trusted to protect the security of an open file. Typically, those user applications that are trusted are predetermined. When the decision 606 determines that the open is not trusted, then a trusted flag is cleared 608 and the open is successful regardless of the user's privileges or access rights.
Alternatively, when the decision 606 determines that the open is trusted, the trusted flag is set 610. Following the operation 610, the access rules (provided from the header portion of the secured file) are compared 612 with user privileges. Here, the requester is typically controlled by a user that has user privileges which define access rights to secured files. The comparison 612 of the user privileges with the access rules provided with the secured file is used to determine whether access to the secured file by the user is permitted. Namely, a decision 612 determines whether access to the secured file is permitted by the requestor (user) based on the results of the comparison 612. When the decision 614 determines that access to the secured file is not permitted, then the requestor is notified 616 that the open request has failed. Following the operation 616, the secured file open processing 600 is complete and ends with the open not having been performed.
On the other hand, when the decision 614 determines that access to the secured file is permitted or when the decision 606 determines that the open is not trusted, then the data portion of the secured file is decrypted 618. After the data portion has been decrypted 618, a file signature is computed 620. Here, some or all of the data portion of the secured file is being decrypted 618 so that a file signature can be computed 620. In one embodiment, the file signature is computed 620 from a first block of the data portion of the secured file. Then, the file signature and the header portion (e.g., security information) of the secured file is stored 622 in a security information table. For example, the security information table can be the security information table 314 illustrated in
With the open being successful, the data from the data portion of the secured file can then be read and supplied to the requestor (e.g., user application). In this regard, a decision 626 determines whether a read request has been received. Once the decision 626 determines that a read request has been received, then the data portion of the secured file is obtained 628. A decision 630 then determines whether the trusted flag is set. When the decision 630 determines that the trusted flag is set, then the data of the data portion of the secured file is decrypted 632. Note that the trusted flag is set when the user application that issued the request to open can be trusted to protect the security of the secured file. Alternatively, when the decision 630 determines that the trusted flag is not set, then the data of the data portion of the secured file is not decrypted. Following the operations 630 and 632, the data is returned 634 to the requester. Hence, the data being returned to the requestor may or may not be decrypted and thus usable by the requestor. Following the operation 634, the secured file open processing 600 is complete and ends.
After a request to close a file has been received, processing is performed 704 to close the file. Here, such processing is performed in a conventional manner to have a file system close a previously opened file. Next, a decision 706 determines whether the file being closed is deemed a “new” file. According to one embodiment, a new file is a file that at one point had a length of zero, meaning that it had no data at some point. When the decision 706 determines that the file being closed is “new,” then the file securing processing can be performed 708 on the file. The file securing processing that is performed 708 on the file serves to secure the file, if appropriate. More specifically, when the file to be closed is determined to be a copy of a secured file, the file securing processing that is performed 708 operates to secure the file being closed such that it is secured just as is the original secured file.
The file securing processing 750 begins with a decision 752 that determines whether the file is encrypted. When the decision 752 determines that the file is encrypted, then the file is decrypted 754 for signature purposes. In other words, the file can be decrypted 754 to the extent needed in order to compute a signature for the file. Following the operation 752 when the file is not encrypted, or following the operation 754 when the file is encrypted, a file signature is computed 756. In one embodiment, the file signature is computed from a block of the data portion of the file. The file signature is computed 756, preferably in the same manner that the file signature is computed 620 in the secured file open processing 600.
Next, a decision 758 determines whether there is a matching file signature within the security information table. When the decision 758 determines that there is no matching file signature within the security information table, then the file securing processing 750 is complete and ends with the file not being secured. In this case, the file being closed is not identified as being a copy of a previously opened secured file. As a result, the file being closed is not secured.
On the other hand, when the decision 758 determines that the security information table does have a matching file signature, the header portion associated with the matching file signature is retrieved 760. In one embodiment, the header portion associated with the matching file signature is stored in the security information table and thus can be retrieved 760 therefrom. A decision 762 then determines whether the file is already encrypted. When the decision 762 determines that the file is not already encrypted, then the file is encrypted 764 so as to secure at least the data portion of the file. Alternatively, the operation 764 is bypassed if the decision 762 determines that the file is already encrypted. Following the operations 762 and 764, the file is modified 766 to include the retrieved header portion. In other words, the file is modified 766 to include the header portion that serves to include security information in the file. The resulting file is a secured file that is not only has its data encrypted but also carries with it security information governing its access. Following the operation 766, the file securing processing 750 is complete and ends.
Optionally, in determining whether a matching signature is stored in memory, beside comparing signatures of the previously opened files and the file being closed, respective file lengths can also be used. For example, for a match to be found, not only must the signature for a portion of the file match but the respective file lengths must also match. For example, the decision 758 can seek a matching signature and a matching length in checking for a match in the security information table. In
Still further, the memory (e.g., the security information table) that stores the signatures (and possibly the file lengths) as well as the associated security information can be managed to ensure that memory resources are not overly utilized. For example, in one embodiment, each corresponding entry in the memory can be removed from the memory after a predetermined duration. For example, a few minutes after the associated file that placed the entry in the memory is closed, the entry can be eliminated from the memory. In another embodiment, an amount of memory can be allocated for storage of these entries, and when the allocated storage is full or nearly full, then entries can be expired (e.g., oldest entry first) and thus eliminated from the memory.
In the above description of the invention, a copy of a secured file is identified so as to be able to impose security on the copy. However, it should be understood that a copy in this regard is not limited to an exact copy but can include a substantial or approximate copy. As a result, not only can exact copies of secured files be secured, but also files that are substantially similar (i.e., substantial copies) to secured files can be secured. For example, in determining matching signatures, a comparison of two signatures can produce a difference value. Then, if the difference value is below a threshold level, the signatures can be said to match and thus identify a file that is a copy of a secured file. More generally, the comparison of signatures of files can use an approximate signature comparison technique. An approximate signature comparison technique is used to determining matching signatures even though the files are not exact copies. A plurality of different signature comparison techniques could also be used, such that the determination of matching signatures could be considered in different ways. For example, if one of a plurality of different signal comparison techniques were to indicate a match, then the files can be deemed copies. Still further, the particular approximate signature comparison technique being utilized can also vary with the type of file. For example, if the file being examined to determine if it is a copy is a text file, one particular approximate signature comparison technique could first translate non-English text into English, generate a signature, and then check for a match. One particular approximate signature comparison technique could allow a copy of a secured file to be detected when the difference between the files is only a difference in language.
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, and optical data storage devices. 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 copies of secured files are able to be secured. Another advantage of the invention is that exact or substantial copies of secured files are able to be secured. Still another advantage of the invention is that security can be transparently imposed on copies of secured files.
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.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4203166 | Eshram et al. | May 1980 | 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 |
| 4888800 | Marshall et al. | Dec 1989 | 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 |
| 5220657 | Bly et al. | Jun 1993 | A |
| 5235641 | Nozawa et al. | Aug 1993 | A |
| 5247575 | Sprague et al. | Sep 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 |
| 5418965 | Mahar | May 1995 | A |
| 5437012 | Mahajan | Jul 1995 | A |
| 5479654 | Squibb | Dec 1995 | A |
| 5495533 | Linehan et al. | Feb 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 |
| 5655119 | Davy | 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 |
| 5684987 | Mamiya et al. | Nov 1997 | A |
| 5689718 | Sakurai et al. | Nov 1997 | A |
| 5699428 | McDonnal et al. | Dec 1997 | A |
| 5708709 | Rose | Jan 1998 | A |
| 5715403 | Stefik | Feb 1998 | A |
| 5717755 | Shanton | 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 |
| 5748736 | Mittra | May 1998 | A |
| 5751287 | Hahn et al. | May 1998 | A |
| 5757920 | Misra et al. | May 1998 | A |
| 5765152 | Ericson | Jun 1998 | A |
| 5778065 | Hauser 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 |
| 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 |
| 5893086 | Schmuck et al. | Apr 1999 | A |
| 5898781 | Shanton | Apr 1999 | A |
| 5922073 | Shimada | Jul 1999 | A |
| 5923754 | Angelo et al. | Jul 1999 | A |
| 5933498 | Schneck et al. | Aug 1999 | A |
| 5944794 | Okamoto et al. | Aug 1999 | A |
| 5953419 | Lohstroh et al. | Sep 1999 | A |
| 5956729 | Goetz et al. | Sep 1999 | A |
| 5968177 | Batten-Carew et al. | Oct 1999 | A |
| 5970502 | Salkewicz et al. | Oct 1999 | A |
| 5987440 | O'Neil et al. | Nov 1999 | A |
| 5991879 | Still | Nov 1999 | A |
| 5999907 | Donner | Dec 1999 | A |
| 6012087 | Freivald et al. | Jan 2000 | A |
| 6014730 | Ohtsu | Jan 2000 | A |
| 6023506 | Ote et al. | Feb 2000 | A |
| 6032216 | Schmuck et al. | Feb 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 |
| 6069057 | Richards | 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 |
| 6158010 | Moriconi et al. | Dec 2000 | A |
| 6161139 | Win et al. | Dec 2000 | A |
| 6182142 | Win et al. | Jan 2001 | B1 |
| 6185684 | Pravetz et al. | Feb 2001 | B1 |
| 6192408 | Vahalia et al. | Feb 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 |
| 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 |
| 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 |
| 6292895 | Baltzley | Sep 2001 | B1 |
| 6292899 | McBride | Sep 2001 | B1 |
| 6295361 | Kadansky et al. | Sep 2001 | B1 |
| 6301614 | Najork et al. | Oct 2001 | B1 |
| 6308256 | Folmsbee | Oct 2001 | B1 |
| 6308273 | Goertzel et al. | Oct 2001 | B1 |
| 6314409 | Schneck 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 |
| 6356903 | Baxter et al. | Mar 2002 | B1 |
| 6356941 | Cohen | Mar 2002 | B1 |
| 6357010 | Viets et al. | Mar 2002 | B1 |
| 6363480 | Perlman | Mar 2002 | B1 |
| 6366930 | Parker et al. | Apr 2002 | B1 |
| 6370249 | Van Oorschot | Apr 2002 | B1 |
| 6381698 | Devanbu et al. | Apr 2002 | B1 |
| 6389433 | Bolosky et al. | May 2002 | B1 |
| 6389538 | Gruse et al. | May 2002 | B1 |
| 6393420 | Peters | May 2002 | B1 |
| 6393438 | Kathrow et al. | May 2002 | B1 |
| 6405315 | Burns et al. | 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 |
| 6466932 | Dennis et al. | Oct 2002 | B1 |
| 6477544 | Bolosky 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 |
| 6574657 | Dickinson | Jun 2003 | B1 |
| 6584466 | Serbinis et al. | Jun 2003 | B1 |
| 6587946 | Jakobsson | Jul 2003 | B1 |
| 6588673 | Chan et al. | Jul 2003 | B1 |
| 6594662 | Sieffert et al. | Jul 2003 | B1 |
| 6598161 | Kluttz et al. | Jul 2003 | B1 |
| 6603857 | Batten-Carew et al. | Aug 2003 | B1 |
| 6608636 | Roseman | 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 |
| 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 |
| 6687822 | Jakobsson | 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 |
| 6775779 | England et al. | 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 |
| 6816872 | Squibb | Nov 2004 | B1 |
| 6826698 | Minkin et al. | Nov 2004 | B1 |
| 6834333 | Yoshino et al. | Dec 2004 | B2 |
| 6834341 | Bahl et al. | Dec 2004 | B1 |
| 6845452 | Roddy et al. | Jan 2005 | B1 |
| 6851050 | Singhal et al. | Feb 2005 | B2 |
| 6865555 | Novak | Mar 2005 | B2 |
| 6874139 | Krueger et al. | Mar 2005 | B2 |
| 6877136 | Bess 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 |
| 6907034 | Begis | Jun 2005 | B1 |
| 6909708 | Krishnaswamy et al. | Jun 2005 | B1 |
| 6915434 | Kuroda et al. | Jul 2005 | B1 |
| 6920558 | Sames et al. | Jul 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 |
| 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 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 |
| 6957261 | Lortz | Oct 2005 | B2 |
| 6959308 | Gramsamer et al. | Oct 2005 | B2 |
| 6961849 | Davis et al. | Nov 2005 | B1 |
| 6968060 | Pinkas | Nov 2005 | B1 |
| 6971018 | Witt et al. | Nov 2005 | B1 |
| 6978376 | Giroux et al. | Dec 2005 | B2 |
| 6978377 | Asano et al. | Dec 2005 | B1 |
| 6988133 | Zavalkovsky et al. | Jan 2006 | B1 |
| 6988199 | Toh et al. | Jan 2006 | B2 |
| 6993135 | Ishibashi | Jan 2006 | B2 |
| 6996718 | Henry et al. | Feb 2006 | B1 |
| 7003117 | Kacker et al. | Feb 2006 | B2 |
| 7003560 | Mullen et al. | Feb 2006 | B1 |
| 7003661 | Beattie et al. | Feb 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 |
| 7051213 | Kobayashi et al. | May 2006 | B1 |
| 7055175 | Le Pennec et al. | May 2006 | B1 |
| 7058696 | Phillips et al. | Jun 2006 | B1 |
| 7058978 | Feuerstein et al. | Jun 2006 | B2 |
| 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 |
| 7107269 | Arlein et al. | Sep 2006 | B2 |
| 7107416 | Stuart et al. | Sep 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 |
| 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 |
| 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 |
| 7171557 | Kallahalla et al. | Jan 2007 | B2 |
| 7174563 | Brownlie et al. | Feb 2007 | B1 |
| 7177427 | Komuro 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 |
| 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 |
| 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 |
| 7287055 | Smith 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 |
| 7380120 | Garcia | May 2008 | B1 |
| 7383586 | Cross et al. | Jun 2008 | B2 |
| 7386529 | Kiessig et al. | Jun 2008 | B2 |
| 7401220 | Bolosky et al. | Jul 2008 | B2 |
| 7415608 | Bolosky et al. | Aug 2008 | B2 |
| 7454612 | Bolosky et al. | Nov 2008 | B2 |
| 7478243 | Bolosky et al. | Jan 2009 | B2 |
| 7539867 | Bolosky et al. | May 2009 | B2 |
| 20010011254 | Clark | Aug 2001 | A1 |
| 20010021926 | Schneck et al. | Sep 2001 | A1 |
| 20010032181 | Jakstadt et al. | Oct 2001 | A1 |
| 20010034839 | Karjoth et al. | Oct 2001 | A1 |
| 20010044903 | Yamamoto et al. | Nov 2001 | A1 |
| 20010056550 | Lee | Dec 2001 | A1 |
| 20020010679 | Felsher | Jan 2002 | A1 |
| 20020016922 | Richards et al. | Feb 2002 | A1 |
| 20020031230 | Sweet et al. | Mar 2002 | A1 |
| 20020035624 | Kim | Mar 2002 | A1 |
| 20020046350 | Lordemann et al. | Apr 2002 | A1 |
| 20020050098 | Chan | May 2002 | A1 |
| 20020056042 | Van Der Kaay et al. | May 2002 | A1 |
| 20020062240 | Morinville | May 2002 | A1 |
| 20020062245 | Niu 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 |
| 20020087479 | Malcolm | Jul 2002 | A1 |
| 20020099947 | Evans | Jul 2002 | A1 |
| 20020124180 | Hagman | Sep 2002 | A1 |
| 20020129235 | Okamoto et al. | Sep 2002 | A1 |
| 20020133699 | Pueschel | Sep 2002 | A1 |
| 20020138762 | Horne | Sep 2002 | A1 |
| 20020143710 | Liu | Oct 2002 | A1 |
| 20020143906 | Tormasov et al. | Oct 2002 | A1 |
| 20020156726 | Kleckner et al. | Oct 2002 | A1 |
| 20020157016 | Russell et al. | Oct 2002 | A1 |
| 20020169963 | Seder et al. | Nov 2002 | A1 |
| 20020169965 | Hale et al. | Nov 2002 | A1 |
| 20020172367 | Mulder et al. | Nov 2002 | A1 |
| 20020174109 | Chandy et al. | Nov 2002 | A1 |
| 20020176572 | Ananth | Nov 2002 | A1 |
| 20020178271 | Graham et al. | Nov 2002 | A1 |
| 20020194484 | Bolosky et al. | Dec 2002 | A1 |
| 20020198798 | Ludwig et al. | Dec 2002 | A1 |
| 20030009685 | Choo et al. | Jan 2003 | A1 |
| 20030014391 | Evans et al. | Jan 2003 | A1 |
| 20030023559 | Choi et al. | Jan 2003 | A1 |
| 20030028610 | Pearson | Feb 2003 | A1 |
| 20030033528 | Ozog et al. | Feb 2003 | A1 |
| 20030037133 | Owens | Feb 2003 | A1 |
| 20030037237 | Abgrall et al. | Feb 2003 | A1 |
| 20030037253 | Blank et al. | Feb 2003 | A1 |
| 20030046238 | Nonaka et al. | Mar 2003 | A1 |
| 20030051039 | Brown et al. | Mar 2003 | A1 |
| 20030056139 | Murray et al. | 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 |
| 20030081787 | Kallahalla et al. | May 2003 | A1 |
| 20030088517 | Medoff | May 2003 | A1 |
| 20030088783 | DiPierro | May 2003 | A1 |
| 20030101072 | Dick et al. | May 2003 | A1 |
| 20030110169 | Zuili | Jun 2003 | A1 |
| 20030110266 | Rollins et al. | Jun 2003 | A1 |
| 20030110397 | Supramaniam | Jun 2003 | A1 |
| 20030115146 | Lee 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 |
| 20030140049 | Radatti | Jul 2003 | A1 |
| 20030154381 | Ouye | Aug 2003 | A1 |
| 20030159066 | Staw et al. | Aug 2003 | A1 |
| 20030172280 | Scheidt et al. | Sep 2003 | A1 |
| 20030177070 | Viswanath et al. | Sep 2003 | A1 |
| 20030177378 | Wittkotter | Sep 2003 | A1 |
| 20030182579 | Leporini et al. | Sep 2003 | A1 |
| 20030197729 | Denoue et al. | Oct 2003 | A1 |
| 20030200202 | Hsiao et al. | Oct 2003 | A1 |
| 20030217264 | Martin et al. | Nov 2003 | A1 |
| 20030217281 | Ryan | Nov 2003 | A1 |
| 20030217333 | Smith et al. | Nov 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 |
| 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 |
| 20040133544 | Kiessig et al. | Jul 2004 | A1 |
| 20040158586 | Tsai | Aug 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 |
| 20040215956 | Venkatachary et al. | Oct 2004 | A1 |
| 20040215962 | Douceur et al. | Oct 2004 | A1 |
| 20040243853 | Swander 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 |
| 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 |
| 20050091484 | Thornton et al. | Apr 2005 | A1 |
| 20050120199 | Carter | Jun 2005 | A1 |
| 20050138371 | Supramaniam | Jun 2005 | A1 |
| 20050138383 | Vainstein | Jun 2005 | A1 |
| 20050177716 | Ginter et al. | Aug 2005 | A1 |
| 20050177858 | Ueda | Aug 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 |
| 20050273600 | Seeman | Dec 2005 | A1 |
| 20050283610 | Serret-Avila et al. | Dec 2005 | A1 |
| 20050288961 | Tabrizi | Dec 2005 | A1 |
| 20060005021 | Torrubia-Saez | Jan 2006 | A1 |
| 20060075465 | Ramanathan et al. | Apr 2006 | A1 |
| 20060093150 | Reddy et al. | May 2006 | A1 |
| 20060168147 | Inoue et al. | Jul 2006 | A1 |
| 20060230437 | Boyer et al. | Oct 2006 | A1 |
| 20070006214 | Dubal et al. | Jan 2007 | A1 |
| 20070067837 | Schuster | Mar 2007 | A1 |
| 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 107504 | Jun 2001 | EP |
| 1 130 492 | Sep 2001 | EP |
| 1 154 348 | Nov 2001 | EP |
| 1324565 | Jul 2003 | EP |
| 2 328 047 | Feb 1999 | GB |
| 2001-036517 | Feb 2001 | 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 |
| Number | Date | Country | |
|---|---|---|---|
| 20030217281 A1 | Nov 2003 | US |