US 7,707,427 B1Grant
Multi-level file digests
Issue Date:2010-04-27
•21 Claims
•8 Drawing Sheets
Abstract
Multi-level file digests for electronic files are disclosed. A top level digest represents a single digest for the associated electronic file. Lower level digests represent digests for portions of the associated electronic file. The top level digest is derived from the lower level digests. The top level digest is useful for facilitating rapid comparison to determine whether electronic files are the same. In one embodiment, electronic files are encrypted with a block encryption scheme, and digests are efficiently calculated and stored on a block-by-block basis. Advantageously, when modifications to an encrypted electronic file occurs, only those modified blocks need to be processed to undergo decryption and re-encryption to determine the appropriate digest.
Metadata
Inventors
- Michael Frederick Kenrich
- Yevgeniy Gutnik
Application Information
Application Number:US 10/894,493
Filing Date:2004-07-19
Priority Date:2004-07-19
Art Unit:2432
Classifications
IPC:
H04L9/18H04L9/20
Patent Drawings (8 sheets)
Description
Cross-Reference to Related Applications
[0001] This application is related to: (i) U.S. patent application Ser. No. 10/815,251, filed Mar. 30, 2004, now allowed, and entitled “METHOD AND SYSTEM FOR PROVIDING DOCUMENT RETENTION USING CRYPTOGRAPHY,” which is hereby incorporated herein by reference; (ii) U.S. patent application Ser. No. 10/186,203, filed Jun. 26, 2002, and entitled “METHOD AND SYSTEM FOR IMPLEMENTING CHANGES TO SECURITY POLICIES IN A DISTRIBUTED SECURITY SYSTEM,” which is hereby incorporated herein by reference; (iii) U.S. patent application Ser. No. 10/159,537, filed May 5, 2002, now U.S. Pat. No. 7,178,033 that issued Feb. 13, 2007, and entitled “METHOD AND APPARATUS FOR SECURING DIGITAL ASSETS,” which is hereby incorporated herein by reference; and (iv) U.S. patent application Ser. No. 10/127,109, filed Apr. 22, 2002, and entitled “DYNAMIC EVALUATION OF ACCESS RIGHTS,” which is hereby incorporated herein by reference.
Background of the Invention
[0002] 1. Field of the Invention
[0003] The present invention relates to digests for electronic files and, more particularly, to use of digests in file management systems.
[0004] 2. Description of Related Art
[0005] File management systems can make use of hash or digest values when managing electronic files. The management of electronic files can vary depending on the application. For example, the management may provide document retention for electronic files. As another example, the management may provide file security to restrict access to electronic files.
[0006] Hash or digest values are often used to identify electronic files or as a representation (e.g., signature) of their contents. Hash or digest values are also often used to identify or authenticate files. Unfortunately, whenever an electronic file is changed the hash or digest values must again be determined. Computation of hash or digest values can be burdensome when the electronic documents are changed because the computations must be repeated each time. In the case of encrypted documents, the overhead associated with providing hash or digest values can be particularly burdensome. For example, it is inefficient to have to decrypt an entire encrypted file and then subsequently produce the hash or digest values as well as again encrypt the electronic file when only a part of the electronic file has been modified.
[0007] Therefore, there is a need for improved approaches to produce hash or digest values for electronic documents.
Summary of the Invention
[0008] The invention relates to inventive approaches to efficiently produce a digest (digest value) for an electronic file. According to the invention, a digest is arranged to have multiple levels, i.e., a hierarchy. The hierarchy has a top level and at least one lower level. The digest at the top level can be referred to as a super digest, and the digests at the at least one lower level can be referred to as block digests or intermediate digests. The top level digest represents a single digest for the associated electronic file. The lower level digests represent digests for portions of the associated electronic file. The top level digest is derived from the lower level digests. The top level digest is useful for facilitating rapid comparison to determine whether electronic files are the same.
[0009] In one embodiment, electronic files are encrypted with a block encryption scheme. Block encryption schemes are advantageous because they permit encryption of an electronic file on a block-by-block basis so that individual blocks can be selectively read or written without decrypting or encrypting the entire electronic file. Additionally, block encryption can provide greater security for an electronic file because the entire electronic file is typically not ever completely in the clear. Hence, according to one embodiment of the invention, digests are calculated and stored on a block-by-block basis. Advantageously, when modifications to an encrypted electronic file occur, only those modified blocks need to be processed to undergo decryption and re-encryption to determine the appropriate digest. Hence, the overhead associated with the re-calculation of the digest following a modification to the electronic file can be reduced according to one embodiment of the invention. The invention is thus particularly advantageous for electronic files that utilize block encryption. Two encrypted electronic files, or one encrypted file and one non-encrypted file, can be efficiently compared using the top level digests without having to perform any decryption.
[0010] 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.
[0011] As a method for forming an encrypted electronic file, one embodiment of the invention includes at least the acts of: identifying an electronic file to be encrypted; obtaining a block of data from the identified electronic file; computing a block digest for the block of data; encrypting the block of data; storing the encrypted block and the block digest to an encrypted electronic file; repeating the obtaining, the computing, the encrypting and the storing acts for at least another block of data from the identified electronic file; computing a super digest for the identified electronic file; and storing the super digest to the encrypted data file.
[0012] As a method for storing a modification to an encrypted electronic file having encrypted blocks of data, block digests and a super digest, one embodiment of the invention includes at least the acts of: providing a modified block of data of the encrypted electronic file, the modified block of data being unencrypted; computing a block digest for the modified block of data; encrypting the modified block of data; storing the encrypted block and the block digest to the encrypted electronic file; computing a super digest for the electronic file; and storing the super digest to the encrypted data file.
[0013] As a method for comparing electronic files, one embodiment of the invention includes at least the acts of: obtaining a first super digest for a first file, the first super digest being previously determined from a plurality of digests corresponding to portions of the first file; obtaining a second super digest for a second file, the second super digest being previously determined from a plurality of digests corresponding to portions of the second file; comparing the first super digest with the second super digest; and concluding that the first file is the same as the second file if the comparing indicates that the first super digest is the same as the second super digest.
[0014] As a computer readable medium including at least computer program code for forming an encrypted electronic file, one embodiment of the invention includes at least: computer program code for identifying an electronic file to be encrypted; computer program code for obtaining blocks of data from the identified electronic file; computer program code for computing a block digest for each of the blocks of data; computer program code for encrypting the blocks of data; computer program code for storing the encrypted blocks and the block digests to an encrypted electronic file; computer program code for computing a top level digest of a multi-level digest for the electronic file; and computer program code for storing the top level digest to the encrypted data file.
[0015] 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
[0016] The present invention will be readily understood by the following detailed description in conjunction with the accompanying drawings, wherein like reference numerals designate like structural elements, and in which:
[0017] FIG. 1 is a flow diagram of a file encryption process according to one embodiment of the invention.
[0018] FIG. 2 is a diagram of a two-level file digest arrangement according to one embodiment of the invention.
[0019] FIG. 3 is a diagram of a three-level file digest arrangement according to one embodiment of the invention.
[0020] FIG. 4A is a diagram of a file format according to one embodiment of the invention.
[0021] FIG. 4B is a diagram of a file format according to another embodiment of the invention.
[0022] FIG. 5 is a flow diagram of an encrypted file modification process according to one embodiment of the invention.
[0023] FIG. 6 is a block diagram of a file security system according to one embodiment of the invention.
[0024] FIG. 7 shows a basic security system in which the invention may be practiced in accordance with one embodiment thereof.
[0025] FIG. 8 shows an exemplary data structure of a secured file that may be used in one embodiment of the invention.
Detailed Description of the Invention
[0026] The invention relates to inventive approaches to efficiently produce a digest (digest value) for an electronic file. According to the invention, a digest is arranged to have multiple levels, i.e., a hierarchy. The hierarchy has a top level and at least one lower level. The digest at the top level can be referred to as a super digest, and the digests at the at least one lower level can be referred to as block digests or intermediate digests. The top level digest represents a single digest for the associated electronic file. The lower level digests represent digests for portions of the associated electronic file. The top level digest is derived from the lower level digests. The top level digest is useful for facilitating rapid comparison to determine whether electronic files are the same.
[0027] In one embodiment, electronic files are encrypted with a block encryption scheme. Block encryption schemes are advantageous because they permit encryption of an electronic file on a block-by-block basis so that individual blocks can be selectively read or written without decrypting or encrypting the entire electronic file. Additionally, block encryption can provide greater security for an electronic file because the entire electronic file is typically not ever completely in the clear. Hence, according to one embodiment of the invention, digests are calculated and stored on a block-by-block basis. Advantageously, when modifications to an encrypted electronic file occur, only those modified blocks need to be processed to undergo decryption and re-encryption to determine the appropriate digest. Hence, the overhead associated with the re-calculation of the digest following a modification to the electronic file can be reduced according to one embodiment of the invention. The invention is thus particularly advantageous for electronic files that utilize block encryption. Two encrypted electronic files, or one encrypted file and one non-encrypted file, can be efficiently compared using the top level digests without having to perform any decryption.
[0028] The invention is related to processes, systems, architectures and software products for providing hierarchical digests of digital assets (e.g., electronic files). The invention is particularly suitable in an enterprise environment. In one embodiment, the invention can be implemented by a security system that additionally secures digital assets (i.e., secured data) so that only authenticated users with appropriate access rights or privileges can gain access thereto. In another embodiment, the invention can be implemented by a file retention system that manages retention of digital assets in accordance with retention policies. Digital assets may include, but not be limited to, various types of electronic files, documents, data, executable code, images and text.
[0029] In the following description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However, it will become obvious to those skilled in the art that the 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 invention.
[0030] 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.
[0031] Embodiments of the invention are discussed herein with reference to FIGS. 1-8 . 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.
[0032] FIG. 1 is a flow diagram of a file encryption process 100 according to one embodiment of the invention. The file encryption process 100 can be part of a file management system. The file encryption process 100 initially identifies 102 a file to be encrypted. A first block of data is then read 104 from the identified file. Here, the identified file is processed a block at a time. A block digest is then computed 106 for the block. Digests are well known in the art. One example of a suitable digest is Message Digest 5 (MD5). MD5 is a popular algorithm that produces a 128-bit message digest from a data input (message). The resulting message digest is useful for verification of data integrity or for use with digital signature applications. Another example of a block digest is Secure Hash Algorithm (SHA-1).
[0033] Next, the block is encrypted 108. For example, a private key of a public-private key pair can be used to encrypt the block. At this point, the encrypted block and the block digest can be written 110 to an encrypted file. The encrypted file represents the resulting encrypted file that stores the content of the identified file in an encrypted format.
[0034] The file encryption process 100 operates on a block-by-block basis. Hence, following the operation 110, a decision 112 determines whether there are more blocks in the identified file that are to be processed. When the decision determines that there is at least one additional block to be processed, the file encryption process 100 returns to repeat the operation 104 so that a next block of data can be read from the identified file and then similarly processed. On the other hand, when the decision 112 determines that there are no more additional blocks of the identified file to be processed, a super digest for the identified file is computed 114. The super digest for the identified file represents a single digest value for the file. The super digest is computed 114 from a plurality of lower level digests as explained in more detail below. The super digest is unique for each different file. In other words, non-identical files will have different super digests, while identical files will have the same super digests.
[0035] After the super digest is computed 114, the super digest is written 116 to the encrypted file. Hence, the encrypted file includes not only the encrypted data from the identified file but also the super digest as well as the block digests for each of the blocks. Following the operation 116, the file encryption process 100 is complete and ends.
[0036] The digests can have a hierarchy such that there is a top level, or super digest, that represents a single digest for the associated electronic document. The super digest permits efficient comparison of two electronic documents to determine whether they are the same. In particular, two electronic documents with the same super digests are the same electronic document. The super digests can also be used to compare one encrypted file with a non-encrypted file to determine whether they are the same. The super digest can also act as an identifier for the electronic document.
[0037] FIG. 2 is a diagram of a two-level file digest arrangement 200 according to one embodiment of the invention. The two-level file digest arrangement 200 derives a super digest 212 directly from block digests 202-210. In this embodiment, the block digests 202-210 form the first level of digests, and the super digest 212 forms a top level digest.
[0038] FIG. 3 is a diagram of a three-level file digest arrangement 300 according to one embodiment of the invention. The three-level file digest arrangement 300 includes block digests 302-318, intermediate digests 320-324, and a super digest 326. In this embodiment, the block digests 302-318 form the first level of digests, the intermediate digests 320-324 form a second level digest, and the super digest 326 forms a top level digest. As shown in FIG. 3 , the intermediate digest 320 is derived directly from the block digests 302-306; the intermediate digest 322 is derived directly from the block digests 308-312; and the intermediate digest 324 is derived directly from the block digests 314-318. Similarly, the super digest 326 is derived directly from the intermediate digests 320-324.
[0039] FIG. 4A is a diagram of a file format 400 according to one embodiment of the invention. The file format 400 includes a file header 402 and a data portion 404. The data portion 404 includes N data blocks. The file header 402 includes file management information as is typical. For example, the file management information can include the number (N) of data blocks, the size of the file or data blocks, etc. In addition, the file header 402 includes a digest portion 406. The digest portion 406 includes not only a super digest but also block digests for each of the N data blocks.
[0040] In the embodiment shown in FIG. 4A , all of the digests, including the super digest and the block digests, are stored in the file header 402. However, as file size increases, the amount of digest data to be stored becomes larger. Hence, in other embodiments, some or all of the digest data can be distributed elsewhere in the file format.
[0041] FIG. 4B is a diagram of a file format 450 according to another embodiment of the invention. The file format 450 includes a file header 452 and a data portion 454. The file header 452 typically will store a super digest and possibly any intermediate digests being utilized. However, block digests corresponding to data blocks are stored in the data portion 454. More particularly, the data portion 454 stores a plurality of data blocks 456 and a plurality of digest table blocks 458. As an example, the digest table blocks 458 can be associated one to one with the data blocks 456. As another example, the digest table blocks 458 can, more generally, appear at regular intervals in the data portion 454.
[0042] Still further, electronic files using the file format 400 or 450 can be secured through use of encryption. In such case, the data blocks can be separately encrypted using a block encryption scheme. The electronic files, such as the file header 402 or 452, can further include security information. The security information is information used to unsecure the secure electronic files. For example, the security information might include an encryption key and/or an encryption policy for the electronic file.
[0043] In yet other embodiments, the digest data can be stored remotely from the file. For example, the file might not include some or all of the digest data and instead contain a reference or link to the digest data.
[0044] FIG. 5 is a flow diagram of an encrypted file modification process 500 according to one embodiment of the invention. The encrypted file modification process 500 is a process that is utilized when an encrypted file, such as an encrypted file produced by the file encryption process 100 shown in FIG. 1 , is subsequently modified. That is, when the data of the encrypted file is modified, one or more of the various digests utilized and stored in the encrypted file will also need to be modified.
[0045] The encrypted file modification process 500 begins with a decision 502 that determines whether a block of an encrypted file has been modified. Here, the modification is assumed to be to a single block of an encrypted file. However, it should be understood that the same process can be performed when multiple blocks of the encrypted file have been modified. However, if all of the blocks of the encrypted file have been modified, then the file encryption process 100 can instead be performed given that the entire file needs to be updated.
[0046] Once the decision 502 determines that a block of the encrypted file has been modified, a block digest for the modified block is computed 504. The modified block is not encrypted at this point. After the block digest for the modified block is computed 504, the modified block is encrypted 506. The encrypted modified block (encrypted block) and the block digest can then be written 508 to the encrypted file. It should be noted that, in some cases, the encrypted block after the modification is the same size as the encrypted block prior to the modification, such that subsequently stored blocks in the encrypted file are not affected. On the other hand, in the case in which the encrypted block following the modification is larger (or possibly smaller) than the encrypted block prior to the modification, subsequent blocks in the file format may be affected. When other blocks have been modified, the operations 504-508 can repeat for each of the other blocks that have been modified.
[0047] In any case, after the encrypted block and the block digest have been written 508, a super digest is computed 510. Here, since at least one block digest has been altered, the previous super digest is no longer useful. Hence, the super digest must be computed 510 any time at least one block has been modified. Thereafter, the super digest is written 512 to the encrypted file. Following the operation 512, the encrypted file modification process 500 is complete and ends.
[0048] 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 general, a secured file can only be accessed by authenticated users with appropriate access rights or privileges. In one embodiment, 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.
[0049] 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. Accordingly, unless specifically stated, the “user” as used herein does not necessarily pertain to a human being.
[0050] FIG. 6 is a block diagram of a file security system 600 according to one embodiment of the invention. The file security system 600 includes an access server 602 that provides central management for the file security system 600. The access server 602 can store or retrieve files from a server file store 604. The access server 602 can control the distribution of cryptographic keys from a key store 606. In addition, the access server 602 can generate cryptographic keys that are stored to the key store 606. Alternatively, the access server 602 can store cryptographic keys in the key store 606 that have been received by the access server 602.
[0051] The file security system 600 also includes user machines 608 and user file stores 612. The user machines 608 couple to the access server 602 via a network 610. The network 610 can be a private network or a public network. The user machine 608 also has a user file store 612 coupled thereto. The user file store 612 can store electronic files locally for the user of the corresponding user machine 608. On the other hand, the server file store 604 can provide centralized, remote storage of electronic files for any of the users of the user machines 608.
[0052] The file security system 600 enables a user at the user machine 608 to secure an electronic file (document) such that access to the secured electronic file is restricted. In one embodiment of the invention, the access restriction is or includes a document retention restriction. As an example, the document retention restriction could permit subsequent access to the secured electronic file only during the retention period. After the retention period, the secured electronic file would be unable to be unsecured and thus subsequent access would be cryptographically prevented. In one embodiment, the retention period is specified or associated with a document retention policy that is assigned to the secured electronic file.
[0053] Once an electronic file has been secured, a user at a user machine can attempt to access the secured electronic file. In doing so, the user machine for the user would need to access the access server 602 and retrieve the appropriate one or more cryptographic keys from the key store 606 that are needed to unsecure the secured electronic file. Such requires that the user machine be connected to the network 610 (i.e., on-line). Alternatively, the user machine could have previously acquired the appropriate one or more cryptographic keys needed to unsecure the secured electronic file and, in such case, the user machine can unsecure the secured electronic file without connecting to the network (i.e., off-line). Regardless, after expiration of the retention period for the secured electronic document, the appropriate one or more cryptographic keys needed to unsecure the secured electronic file are expired (e.g., at both the access server 602/key store 606 and the user machines). Consequently, following the expiration of the retention period, the appropriate one or more cryptographic keys are no longer usable, thus access to the secured electronic document is prevented. The access server 602 and/or the user machine normally also require the user to be authorized to access the electronic file prior to delivery or usage of at least certain cryptographic keys from the key store 606. Typically, the cryptographic keys needed to unsecure a secured electronic file are private keys.
[0054] Nevertheless, once the restrictions and/or authorizations have been satisfied and the private keys have been supplied, the private keys are usable to unsecure the secured electronic files, provided the private keys have not expired.
[0055] FIG. 7 shows a basic security system 700 in which the invention may be practiced in accordance with one embodiment thereof. The security system 700 may be employed in an enterprise or inter-enterprise environment. It includes a first server 706 (also referred to as a central server) providing centralized access management for the enterprise. The first server 706 can control restrictive access to files secured by the security system 700 as well as file (e.g., document) retention. To provide dependability, reliability and scalability of the system, one or more second servers 704 (also referred to as local servers, of which one is shown) may be employed to provide backup or distributed access management for users or client machines serviced locally. The server 704 is coupled to a network 708 and a network 710. For illustration purposes, there are two client machines 701 and 702 being serviced by the local server 704. Alternatively, one of the client machines 701 and 702 may be considered as a networked storage device.
[0056] Secured files may be stored in any one of the devices 701, 702, 704 and 706. When a user of the client machine 701 attempts to exchange a secured file with a remote destination 712 being used by an external user, the processes discussed above can be utilized to ensure that the requested secure file is delivered without compromising the security imposed on the secured file.
[0057] 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. One or more keys, such as a user key and a document retention access 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, and the document retention access key is associated with a retention period imposed on the created document. For a given secured document, only a user with proper access privileges can access the secured document and then only after a time restriction, if present, is satisfied.
[0058] In one setting, a secured document may be uploaded via the network 710 from the client computer 701 to a computing or storage device 702 that may serve as a central repository. Although not necessary, the network 710 can provide a private link between the computer 701 and the computing or storage device 702. 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 computing or storage device 702 may be remotely accessed.
[0059] In another setting, the computer 701 and the computing or storage device 702 are inseparable, in which case the computing or storage device 702 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 privileges and within retention periods, can access the secured documents or resources from the client computer 701 or the computing or storage device 702 using an application (e.g., Microsoft Internet Explorer, Microsoft Word or Adobe Acrobat Reader).
[0060] Accordingly, respective local modules in local servers, in coordination with the central server, form a distributed mechanism to provide not only distributed access control enforcement but also file (e.g., document) retention. Such distributed access control enforcement ensures the dependability, reliability and scalability of centralized access control management undertaken by the central server for an entire enterprise or a business location.
[0061] FIG. 8 shows an exemplary data structure 820 of a secured file that may be used in one embodiment of the invention. The data structure 820 includes two portions: a header (or header portion) 822 and encrypted data (or an encrypted data portion) 824. The header 822 can be generated in accordance with a security template associated with a data store and thus provides restrictive access to the data portion 824 which, for example, is an encrypted version of a plain file. Optionally, the data structure 820 may also include an error-checking portion 825 that stores one or more error-checking codes, for example, a separate error-checking code for each block of encrypted data 824. These error-checking codes may also be associated with a Cyclical Redundancy Check (CRC) for the header 822 and/or the encrypted data 824. The header 822 includes a flag bit or signature 827 and security information 826 that is in accordance with the security template for the data store. According to one embodiment, the security information 826 is encrypted and can be decrypted with a user key associated with an authenticated user (or requester).
[0062] The security information 826 can vary depending upon implementation. However, as shown in FIG. 8 , the security information 826 includes a user identifier (ID) 828, access policy (access rules) 829, keys (cryptographic keys) 830, digests 831, and other information 832. Although multiple user identifiers may be used, a user identifier 828 is used to identify a user or a group that is permitted to access the secured file. The access rules 829 provide restrictive access to the encrypted data portion 824. The keys 830 are cipher keys (and/or pointers or identifiers therefor) that, once obtained, can be used to decrypt the encrypted data portion 824 and thus, in general, are protected. The digests 831 are digests for the secured file, such as a super digest and a plurality of lower level digests. In one implementation of the data structure 820, at least one of the keys 830 is encrypted in conjunction with the access rules 829. In another implementation of the data structure 820, at least one of the keys 830 is a file retention access key or is a key encrypted with a file retention access key, either of which can possibly be further protected by the access rules 829. The other information 831 is an additional space for other information to be stored within the security information 826. For example, the other information 831 may be used to include other information facilitating secure access to the secured file, such as version number or author identifier.
[0063] 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 tangible media such as read-only memory, random-access memory, CD-ROMs, DVDs, magnetic tape, and optical 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.
[0064] 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 various other settings with respect to different combinations, embodiments, implementations or features as provided in the description herein.
[0065] 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 re-calculation of a digest following a modification to an electronic file can be reduced by utilizing the multi-level digest techniques associated with the invention. Another advantage of the invention is that multi-level digests can be used to compare files having a proprietary format. For example, files having an encrypted file format can be compared by using the top level digest, without having to decrypt any portion of the electronic file. As another example, the top level digest can also be used to compare a non-encrypted electronic file with an encrypted electronic file to see if the content of the electronic files is the same.
[0066] The foregoing description of embodiments is illustrative of various aspects/embodiments of the present invention. Various modifications to the 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
What is claimed is:
1. A method for generating an encrypted electronic file, said method comprising:
identifying, using a processing device, an electronic file to be encrypted;
obtaining, using the processing device, a first block of data from the identified electronic file;
determining, using the processing device, a first block digest for the first block of data;
encrypting, using the processing device, the first block of data;
storing, using the processing device, the encrypted first block of data and the first block digest to an encrypted electronic file;
repeating said obtaining, said determining, said encrypting and said storing for each block of data from the identified electronic file until additional block digests have been determined for the each block of data from the identified electronic file;
determining, using the processing device, a super digest for the identified electronic file from the first block digest and the additional block digests; and
storing, using the processing device, the super digests to the encrypted electronic file.
2. A method as recited in claim 1, wherein storing the super digest comprises:
storing the super digest in a header portion of the encrypted electronic file.
3. A method as recited in claim 1, wherein storing the super digest comprises:
storing at least the super digest in a header portion of the encrypted electronic file; and
storing the block digests in a data portion of the encrypted electronic file in a manner such that the block digests are interspersed throughout the data portion.
4. A method as recited in claim 1, wherein the determining a super digest comprises:
determining intermediate digests from the block digests; and
determining the super digests from the intermediate digests.
5. A method for determining a super digest for an encrypted electronic file that has been modified, comprising:
determining, using a processing device, a first block digest for an unencrypted modified block of data;
encrypting, using the processing device, the modified block of data;
storing, using the processing device, the encrypted modified block of data and the first block digest to the encrypted electronic file;
determining, using the processing device, the super digest for the electronic file from the first block digest and additional block digests; and
storing, using the processing device, the super digest to the encrypted file.
6. A method as recited in claim 5, wherein the modification to the encrypted electronic file affects at least one but not all of the blocks of data of the encrypted electronic file.
7. A method as recited in claim 5, wherein the determining the super digest comprises:
determining intermediate digests from the block digests; and
determining the super digest from the intermediate digests.
8. A method for comparing electronic files, said method comprising:
obtaining, using a processing device, a first super digest for a first file, the first super digest being previously determined from a first plurality of digests determined from each block of data from the first file;
obtaining, using the processing device, a second super digest for a second file, the second super digest being previously determined from a second plurality of digests determined from each block of data from the second file;
comparing, using the processing device, the first super digest with the second super digest; and
concluding, using the processing device, that the first file is the same as the second file if said comparing indicates that the first super digest is the same as the second super digest.
9. A method as recited in claim 8, wherein the first super digest is provided within the first file, and wherein the second super digest is provided within the second file.
10. A method as recited in claim 8, wherein the first super digest is stored in a header of the first file, and wherein the second super digest is stored in a header of the second file.
11. A method as recited in claim 8, wherein the first file and the second file are encrypted data files, the encrypted data files being encrypted using a block encryption technique.
12. A method as recited in claim 11, wherein the first super digest is based on a plurality of block digests corresponding to portions of the first file, and wherein the second super digest is based on a plurality of block digests corresponding to portions of the second file.
13. A method as recited in claim 11, wherein the first super digest is determined from a plurality of first intermediate digests that are determined from a plurality of block digests determined from blocks of data from the first file, and wherein the second super digest is determined from a plurality of second intermediate digests that are determined from a plurality of block digests determined from blocks of data from the second file.
14. A tangible computer-readable medium having stored thereon computer-executable instructions that, in response to execution by a computing device, cause the computing device to perform a method of encrypting an electronic file, the method comprising:
identifying, using a processing device, an electronic file to be encrypted;
obtaining, using the processing device, a first block of data from the identified electronic file;
determining, using the processing device, a first block digest for the first block of data;
encrypting, using the processing device, the first block of data;
storing, using the processing device, the encrypted first block of data and the first block digest to an encrypted electronic file;
repeating said obtaining, said determining, said encrypting, and said storing for each block of data from the identified electronic file until additional block digests have been determined for the each block of data;
determining, using the processing device, a super digest for the identified electronic file from the first block digest and the additional block digests; and
storing, using the processing device, the super digest to the encrypted electronic file.
15. A tangible computer-readable medium as recited in claim 14, wherein the determining a super digest comprises:
determining one or more levels of intermediate digests from the block digests; and
determining the super digest from the upper-most level of the intermediate digests.
16. The method of claim 1, further comprising using the super digest to uniquely identify the electronic file.
17. The method of claim 8, further comprising using the first super digest to uniquely identify the first file and the second super digest to uniquely identify the second file.
18. A method as recited in claim 5, wherein the modification to the encrypted electronic file affects only one block of data, that is, the modified block of data to the encrypted electronic file.
19. The method of claim 5, further comprising repeating said determining, said encrypting, and said storing for additional unencrypted modified blocks of data before said determining the super digest is performed.
20. The method of claim 5, further comprising using the super digest to uniquely identify the modified electronic file.
21. A computer program product comprising a computer useable medium having computer program logic recorded thereon, the computer program logic comprising:
first computer code means for identifying an electronic file to be encrypted;
second computer code means for obtaining a first block of data from the identified electronic file;
third computer code means for determining a first block digest for the first block of data;
fourth computer code means for encrypting the first block of data;
fifth computer code means for storing the encrypted first block and the first block digest to an encrypted electronic file;
sixth computer code means for repeating said obtaining, said determining, said encrypting and said storing for each block of data from the identified electronic file until additional block digests have been determined for the each block of data;
seventh computer code means for determining a super digest for the identified electronic file from the first block digest and the additional block digests; and
eighth computer code means for storing the super digest to the encrypted data file.
Patent Citations (468)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4203166(A) | 1980-05-01 | Eshram et al. | Applicant |
| US4734568(A) | 1988-03-01 | Watanabe | Applicant |
| US4757533(A) | 1988-07-01 | Allen et al. | Applicant |
| US4796220(A) | 1989-01-01 | Wolfe | Applicant |
| US4799258(A) | 1989-01-01 | Davies | Applicant |
| US4827508(A) | 1989-05-01 | Shear | Applicant |
| US4888800(A) | 1989-12-01 | Marshall et al. | Applicant |
| US4972472(A) | 1990-11-01 | Brown et al. | Applicant |
| US5032979(A) | 1991-07-01 | Hecht et al. | Applicant |
| US5052040(A) | 1991-09-01 | Preston et al. | Applicant |
| US5058164(A) | 1991-10-01 | Elmer et al. | Applicant |
| US5144660(A) | 1992-09-01 | Rose | Applicant |
| US5204897(A) | 1993-04-01 | Wyman | Applicant |
| US5220657(A) | 1993-06-01 | Bly et al. | Applicant |
| US5235641(A) | 1993-08-01 | Nozawa et al. | Applicant |
| US5247575(A) | 1993-09-01 | Sprague et al. | Applicant |
| US5276735(A) | 1994-01-01 | Boebert et al. | Applicant |
| US5301247(A) | 1994-04-01 | Rasmussen et al. | Applicant |
| US5319705(A) | 1994-06-01 | Halter et al. | Applicant |
| US5369702(A) | 1994-11-01 | Shanton | Applicant |
| US5375169(A) | 1994-12-01 | Seheidt et al. | Applicant |
| US5404404(A) | 1995-04-01 | Novorita | Applicant |
| US5406628(A) | 1995-04-01 | Beller et al. | Applicant |
| US5414852(A) | 1995-05-01 | Kramer et al. | Applicant |
| US5495533(A) | 1996-02-01 | Linehan et al. | Applicant |
| US5499297(A) | 1996-03-01 | Boebert | Applicant |
| US5502766(A) | 1996-03-01 | Boebert et al. | Applicant |
| US5535375(A) | 1996-07-01 | Eshel et al. | Applicant |
| US5557765(A) | 1996-09-01 | Lipner et al. | Applicant |
| US5570108(A) | 1996-10-01 | McLaughlin et al. | Applicant |
| US5584023(A) | 1996-12-01 | Hsu | Applicant |
| US5600722(A) | 1997-02-01 | Yamaguchi et al. | Applicant |
| US5606663(A) | 1997-02-01 | Kadooka | Applicant |
| US5655119(A) | 1997-08-01 | Davy | Applicant |
| US5661806(A) | 1997-08-01 | Nevoux et al. | Applicant |
| US5671412(A) | 1997-09-01 | Christiano | Applicant |
| US5673316(A) | 1997-09-01 | Auerbach et al. | Applicant |
| US5677953(A) | 1997-10-01 | Dolphin | Applicant |
| US5680452(A) | 1997-10-01 | Shanton | Applicant |
| US5684987(A) | 1997-11-01 | Mamiya et al. | Applicant |
| US5689718(A) | 1997-11-01 | Sakurai et al. | Applicant |
| US5699428(A) | 1997-12-01 | McDonnal et al. | Applicant |
| US5708709(A) | 1998-01-01 | Rose | Applicant |
| US5715403(A) | 1998-02-01 | Stefik | Applicant |
| US5717755(A) | 1998-02-01 | Shanton | Applicant |
| US5720033(A) | 1998-02-01 | Deo | Applicant |
| US5729734(A) | 1998-03-01 | Parker et al. | Applicant |
| US5732265(A) | 1998-03-01 | Dewitt et al. | Applicant |
| US5745573(A) | 1998-04-01 | Lipner et al. | Applicant |
| US5748736(A) | 1998-05-01 | Mittra | Applicant |
| US5751287(A) | 1998-05-01 | Hahn et al. | Applicant |
| US5757920(A) | 1998-05-01 | Misra et al. | Applicant |
| US5765152(A) | 1998-06-01 | Ericson | Applicant |
| US5778065(A) | 1998-07-01 | Hauser et al. | Applicant |
| US5787169(A) | 1998-07-01 | Eldridge et al. | Applicant |
| US5787173(A) | 1998-07-01 | Seheidt et al. | Applicant |
| US5787175(A) | 1998-07-01 | Carter | Applicant |
| US5790789(A) | 1998-08-01 | Suarez | Applicant |
| US5790790(A) | 1998-08-01 | Smith et al. | Applicant |
| US5813009(A) | 1998-09-01 | Johnson et al. | Applicant |
| US5821933(A) | 1998-10-01 | Keller et al. | Applicant |
| US5825876(A) | 1998-10-01 | Peterson | Applicant |
| US5835592(A) | 1998-11-01 | Chang et al. | Applicant |
| US5835601(A) | 1998-11-01 | Shimbo et al. | Applicant |
| US5857189(A) | 1999-01-01 | Riddle | Applicant |
| US5862325(A) | 1999-01-01 | Reed et al. | Applicant |
| US5870468(A) | 1999-02-01 | Harrison | Applicant |
| US5870477(A) | 1999-02-01 | Sasaki et al. | Applicant |
| US5881287(A) | 1999-03-01 | Mast | Applicant |
| US5892900(A) | 1999-04-01 | Ginter et al. | Applicant |
| US5893084(A) | 1999-04-01 | Morgan et al. | Applicant |
| US5898781(A) | 1999-04-01 | Shanton | Applicant |
| US5922073(A) | 1999-07-01 | Shimada | Applicant |
| US5923754(A) | 1999-07-01 | Angelo et al. | Applicant |
| US5933498(A) | 1999-08-01 | Schnek et al. | Applicant |
| US5944794(A) | 1999-08-01 | Okamoto et al. | Applicant |
| US5953419(A) | 1999-09-01 | Lohstroh et al. | Applicant |
| US5968177(A) | 1999-10-01 | Batten-Carew et al. | Applicant |
| US5970502(A) | 1999-10-01 | Salkewicz et al. | Applicant |
| US5987440(A) | 1999-11-01 | O'Neil et al. | Applicant |
| US5991879(A) | 1999-11-01 | Still | Applicant |
| US5999907(A) | 1999-12-01 | Donner | Applicant |
| US6014730(A) | 2000-01-01 | Ohtsu | Applicant |
| US6023506(A) | 2000-02-01 | Ote et al. | Applicant |
| US6032216(A) | 2000-02-01 | Schmuck et al. | Applicant |
| US6038322(A) | 2000-03-01 | Harkins | Applicant |
| US6044155(A) | 2000-03-01 | Thomlinson et al. | Applicant |
| US6055314(A) | 2000-04-01 | Spies et al. | Applicant |
| US6058424(A) | 2000-05-01 | Dixon et al. | Applicant |
| US6061790(A) | 2000-05-01 | Bodnar | Applicant |
| US6069957(A) | 2000-05-01 | Richards | Applicant |
| US6085323(A) | 2000-07-01 | Shimizu et al. | Applicant |
| US6088717(A) | 2000-07-01 | Reed et al. | Applicant |
| US6088805(A) | 2000-07-01 | Davis et al. | Applicant |
| US6098056(A) | 2000-08-01 | Rusnak et al. | Applicant |
| US6101507(A) | 2000-08-01 | Cane et al. | Applicant |
| US6105131(A) | 2000-08-01 | Carroll | Applicant |
| US6122630(A) | 2000-09-01 | Strickler et al. | Applicant |
| US6134327(A) | 2000-10-01 | Van Oorschot | Applicant |
| US6134658(A) | 2000-10-01 | Multerer et al. | Applicant |
| US6134660(A) | 2000-10-01 | Boneh et al. | Applicant |
| US6134664(A) | 2000-10-01 | Walker | Applicant |
| US6141754(A) | 2000-10-01 | Choy | Applicant |
| US6145084(A) | 2000-11-01 | Zuili | Applicant |
| US6158010(A) | 2000-12-01 | Moriconi et al. | Applicant |
| US6161139(A) | 2000-12-01 | Win et al. | Applicant |
| US6182142(B1) | 2001-01-01 | Win et al. | Applicant |
| US6185684(B1) | 2001-02-01 | Pravetz et al. | Applicant |
| US6192408(B1) | 2001-02-01 | Vahalia et al. | Applicant |
| US6205549(B1) | 2001-03-01 | Pravetz et al. | Applicant |
| US6212561(B1) | 2001-04-01 | Sitaraman et al. | Applicant |
| US6223285(B1) | 2001-04-01 | Komuro et al. | Applicant |
| US6226618(B1) | 2001-05-01 | Downs et al. | Applicant |
| US6226745(B1) | 2001-05-01 | Wiederhold et al. | Applicant |
| US6240188(B1) | 2001-05-01 | Dondeti et al. | Applicant |
| US6249873(B1) | 2001-06-01 | Richard et al. | Applicant |
| US6253193(B1) | 2001-06-01 | Ginter et al. | Applicant |
| US6260040(B1) | 2001-07-01 | Kauffman et al. | Applicant |
| US6260141(B1) | 2001-07-01 | Park | Applicant |
| US6263348(B1) | 2001-07-01 | Kathrow et al. | Applicant |
| US6272631(B1) | 2001-08-01 | Thomlinson et al. | Applicant |
| US6272632(B1) | 2001-08-01 | Carman et al. | Applicant |
| US6282649(B1) | 2001-08-01 | Lambert et al. | Applicant |
| US6289450(B1) | 2001-09-01 | Pensak et al. | Applicant |
| US6292895(B1) | 2001-09-01 | Baltzley | Applicant |
| US6292899(B1) | 2001-09-01 | McBride | Applicant |
| US6295361(B1) | 2001-09-01 | Kadansky et al. | Applicant |
| US6301614(B1) | 2001-10-01 | Najork et al. | Applicant |
| US6308256(B1) | 2001-10-01 | Folmsbee | Applicant |
| US6308273(B1) | 2001-10-01 | Goertzel et al. | Applicant |
| US6314409(B2) | 2001-11-01 | Schnek et al. | Applicant |
| US6317777(B1) | 2001-11-01 | Skarbo et al. | Applicant |
| US6332025(B2) | 2001-12-01 | Takahashi et al. | Applicant |
| US6336114(B1) | 2002-01-01 | Garrison | Applicant |
| US6339423(B1) | 2002-01-01 | Sampson et al. | Applicant |
| US6339825(B2) | 2002-01-01 | Pensak et al. | Applicant |
| US6341164(B1) | 2002-01-01 | Dilkie et al. | Applicant |
| US6343316(B1) | 2002-01-01 | Sakata | Applicant |
| US6347374(B1) | 2002-02-01 | Drake et al. | Applicant |
| US6349337(B1) | 2002-02-01 | Parsons et al. | Applicant |
| US6351813(B1) | 2002-02-01 | Mooney et al. | Applicant |
| US6356903(B1) | 2002-03-01 | Baxter et al. | Applicant |
| US6356941(B1) | 2002-03-01 | Cohen | Applicant |
| US6357010(B1) | 2002-03-01 | Viets et al. | Applicant |
| US6363480(B1) | 2002-03-01 | Perlman | Applicant |
| US6370249(B1) | 2002-04-01 | Van Oorschot | Applicant |
| US6381698(B1) | 2002-04-01 | Devanbu et al. | Applicant |
| US6389433(B1) | 2002-05-01 | Bolosky et al. | Applicant |
| US6389538(B1) | 2002-05-01 | Gruse et al. | Applicant |
| US6393420(B1) | 2002-05-01 | Peters | Applicant |
| US6405315(B1) | 2002-06-01 | Burns et al. | Applicant |
| US6421714(B1) | 2002-07-01 | Rai et al. | Applicant |
| US6442688(B1) | 2002-08-01 | Moses et al. | Applicant |
| US6442695(B1) | 2002-08-01 | Dutcher et al. | Applicant |
| US6446090(B1) | 2002-09-01 | Hart | Applicant |
| US6449721(B1) | 2002-09-01 | Pensak et al. | Applicant |
| US6453353(B1) | 2002-09-01 | Win et al. | Applicant |
| US6466932(B1) | 2002-10-01 | Dennis et al. | Applicant |
| US6477544(B1) | 2002-11-01 | Bolosky et al. | Applicant |
| US6490680(B1) | 2002-12-01 | Scheidt et al. | Applicant |
| US6505300(B2) | 2003-01-01 | Chan et al. | Applicant |
| US6510349(B1) | 2003-01-01 | Schnek et al. | Applicant |
| US6519700(B1) | 2003-02-01 | Ram et al. | Applicant |
| US6529956(B1) | 2003-03-01 | Smith et al. | Applicant |
| US6530020(B1) | 2003-03-01 | Aoki | Applicant |
| US6530024(B1) | 2003-03-01 | Proctor | Applicant |
| US6542608(B2) | 2003-04-01 | Scheidt et al. | Applicant |
| US6549623(B1) | 2003-04-01 | Scheidt et al. | Applicant |
| US6550011(B1) | 2003-04-01 | Sims | Applicant |
| US6557039(B1) | 2003-04-01 | Leong et al. | Applicant |
| US6567914(B1) | 2003-05-01 | Just et al. | Applicant |
| US6571291(B1) | 2003-05-01 | Chow | Applicant |
| US6584466(B1) | 2003-06-01 | Serbinis et al. | Applicant |
| US6587946(B1) | 2003-07-01 | Jakobsson | Applicant |
| US6588673(B1) | 2003-07-01 | Chan et al. | Applicant |
| US6594662(B1) | 2003-07-01 | Sieffert et al. | Applicant |
| US6598161(B1) | 2003-07-01 | Kluttz et al. | Applicant |
| US6603857(B1) | 2003-08-01 | Batten-Carew et al. | Applicant |
| US6608636(B1) | 2003-08-01 | Roseman | Applicant |
| US6611599(B2) | 2003-08-01 | Natarajan | Examiner |
| US6611846(B1) | 2003-08-01 | Stoodley | Applicant |
| US6615349(B1) | 2003-09-01 | Hair | Applicant |
| US6615350(B1) | 2003-09-01 | Schell et al. | Applicant |
| US6625650(B2) | 2003-09-01 | Stelliga | Applicant |
| US6629243(B1) | 2003-09-01 | Kleinman et al. | Applicant |
| US6633311(B1) | 2003-10-01 | Douvikas et al. | Applicant |
| US6640307(B2) | 2003-10-01 | Viets et al. | Applicant |
| US6646515(B2) | 2003-11-01 | Jun et al. | Applicant |
| US6647388(B2) | 2003-11-01 | Numao et al. | Applicant |
| US6678835(B1) | 2004-01-01 | Shah et al. | Applicant |
| US6687822(B1) | 2004-02-01 | Jakobsson | Applicant |
| US6711683(B1) | 2004-03-01 | Laczko et al. | Applicant |
| US6718361(B1) | 2004-04-01 | Basani et al. | Applicant |
| US6735701(B1) | 2004-05-01 | Jacobson | Applicant |
| US6738908(B1) | 2004-05-01 | Bonn et al. | Applicant |
| US6775779(B1) | 2004-08-01 | England et al. | Applicant |
| US6782403(B1) | 2004-08-01 | Kino et al. | Applicant |
| US6801999(B1) | 2004-10-01 | Venkatesan et al. | Applicant |
| US6807534(B1) | 2004-10-01 | Erickson | Applicant |
| US6807636(B2) | 2004-10-01 | Hartman et al. | Applicant |
| US6810389(B1) | 2004-10-01 | Meyer | Applicant |
| US6810479(B1) | 2004-10-01 | Barlow et al. | Applicant |
| US6816871(B2) | 2004-11-01 | Lee | Applicant |
| US6826698(B1) | 2004-11-01 | Minkin et al. | Applicant |
| US6834333(B2) | 2004-12-01 | Yoshino et al. | Applicant |
| US6834341(B1) | 2004-12-01 | Bahl et al. | Applicant |
| US6845452(B1) | 2005-01-01 | Roddy et al. | Applicant |
| US6851050(B2) | 2005-02-01 | Singhal et al. | Applicant |
| US6865555(B2) | 2005-03-01 | Novak | Applicant |
| US6874139(B2) | 2005-03-01 | Krueger et al. | Applicant |
| US6877136(B2) | 2005-04-01 | Bess et al. | Applicant |
| US6889210(B1) | 2005-05-01 | Vainstein | Applicant |
| US6891953(B1) | 2005-05-01 | DeMello et al. | Applicant |
| US6892201(B2) | 2005-05-01 | Brown et al. | Applicant |
| US6892306(B1) | 2005-05-01 | En-Seung et al. | Applicant |
| US6907034(B1) | 2005-06-01 | Begis | Applicant |
| US6909708(B1) | 2005-06-01 | Krishnaswamy et al. | Applicant |
| US6915434(B1) | 2005-07-01 | Kuroda et al. | Applicant |
| US6920558(B2) | 2005-07-01 | Sames et al. | Applicant |
| US6931450(B2) | 2005-08-01 | Howard et al. | Applicant |
| US6931530(B2) | 2005-08-01 | Pham et al. | Applicant |
| US6931597(B1) | 2005-08-01 | Prakash | Applicant |
| US6938042(B2) | 2005-08-01 | Aboulhosn et al. | Applicant |
| US6941355(B1) | 2005-09-01 | Donaghey et al. | Applicant |
| US6941456(B2) | 2005-09-01 | Wilson | Applicant |
| US6941472(B2) | 2005-09-01 | Moriconi et al. | Applicant |
| US6944183(B1) | 2005-09-01 | Iyer et al. | Applicant |
| US6947556(B1) | 2005-09-01 | Matyas, Jr. et al. | Applicant |
| US6950818(B2) | 2005-09-01 | Dennis et al. | Applicant |
| US6950936(B2) | 2005-09-01 | Subramaniam et al. | Applicant |
| US6950941(B1) | 2005-09-01 | Lee et al. | Applicant |
| US6950943(B1) | 2005-09-01 | Bacha et al. | Applicant |
| US6952780(B2) | 2005-10-01 | Olsen et al. | Applicant |
| US6957261(B2) | 2005-10-01 | Lortz | Applicant |
| US6959308(B2) | 2005-10-01 | Gramsamer et al. | Applicant |
| US6961849(B1) | 2005-11-01 | Davis et al. | Applicant |
| US6968060(B1) | 2005-11-01 | Pinkas | Applicant |
| US6971018(B1) | 2005-11-01 | Witt et al. | Applicant |
| US6978376(B2) | 2005-12-01 | Giroux et al. | Applicant |
| US6978377(B1) | 2005-12-01 | Asano et al. | Applicant |
| US6988133(B1) | 2006-01-01 | Zavalkovsky et al. | Applicant |
| US6988199(B2) | 2006-01-01 | Toh et al. | Applicant |
| US6993135(B2) | 2006-01-01 | Ishibashi | Applicant |
| US6996718(B1) | 2006-02-01 | Henry et al. | Applicant |
| US7003117(B2) | 2006-02-01 | Kacker et al. | Applicant |
| US7003560(B1) | 2006-02-01 | Mullen et al. | Applicant |
| US7003661(B2) | 2006-02-01 | Beattie et al. | Applicant |
| US7013332(B2) | 2006-03-01 | Friedel et al. | Applicant |
| US7013485(B2) | 2006-03-01 | Brown et al. | Applicant |
| US7020645(B2) | 2006-03-01 | Bisbee et al. | Applicant |
| US7024427(B2) | 2006-04-01 | Bobbitt et al. | Applicant |
| US7035854(B2) | 2006-04-01 | Hsiao et al. | Applicant |
| US7035910(B1) | 2006-04-01 | Dutta et al. | Applicant |
| US7046807(B2) | 2006-05-01 | Hirano et al. | Applicant |
| US7051213(B1) | 2006-05-01 | Kobayashi et al. | Applicant |
| US7058696(B1) | 2006-06-01 | Phillips et al. | Applicant |
| US7058978(B2) | 2006-06-01 | Feuerstein et al. | Applicant |
| US7073063(B2) | 2006-07-01 | Peinado | Applicant |
| US7073073(B1) | 2006-07-01 | Nonaka et al. | Applicant |
| US7076067(B2) | 2006-07-01 | Raike et al. | Applicant |
| US7076312(B2) | 2006-07-01 | Law et al. | Applicant |
| US7076469(B2) | 2006-07-01 | Schreiber et al. | Applicant |
| US7076633(B2) | 2006-07-01 | Tormasov et al. | Applicant |
| US7080077(B2) | 2006-07-01 | Ramamurthy et al. | Applicant |
| US7095853(B2) | 2006-08-01 | Morishita | Applicant |
| US7096266(B2) | 2006-08-01 | Lewin et al. | Applicant |
| US7099926(B1) | 2006-08-01 | Ims et al. | Applicant |
| US7107269(B2) | 2006-09-01 | Arlein et al. | Applicant |
| US7107416(B2) | 2006-09-01 | Stuart et al. | Applicant |
| US7117322(B2) | 2006-10-01 | Hochberg et al. | Applicant |
| US7120635(B2) | 2006-10-01 | Bhide et al. | Applicant |
| US7120757(B2) | 2006-10-01 | Tsuge | Applicant |
| US7124164(B1) | 2006-10-01 | Chemtob | Applicant |
| US7130964(B2) | 2006-10-01 | Ims et al. | Applicant |
| US7131071(B2) | 2006-10-01 | Gune et al. | Applicant |
| US7134041(B2) | 2006-11-01 | Murray et al. | Applicant |
| US7136903(B1) | 2006-11-01 | Phillips et al. | Applicant |
| US7145898(B1) | 2006-12-01 | Elliott | Applicant |
| US7146388(B2) | 2006-12-01 | Stakutis et al. | Applicant |
| US7146498(B1) | 2006-12-01 | Takechi et al. | Applicant |
| US7159036(B2) | 2007-01-01 | Hinchliffe et al. | Applicant |
| US7171557(B2) | 2007-01-01 | Kallahalla et al. | Applicant |
| US7174563(B1) | 2007-02-01 | Brownlie et al. | Applicant |
| US7177427(B1) | 2007-02-01 | Komuro et al. | Applicant |
| US7178033(B1) | 2007-02-01 | Garcia | Applicant |
| US7181017(B1) | 2007-02-01 | Nagel et al. | Applicant |
| US7185364(B2) | 2007-02-01 | Knouse et al. | Applicant |
| US7187033(B2) | 2007-03-01 | Pendharkar | Applicant |
| US7188181(B1) | 2007-03-01 | Squier et al. | Applicant |
| US7194764(B2) | 2007-03-01 | Martherus et al. | Applicant |
| US7200747(B2) | 2007-04-01 | Riedel et al. | Applicant |
| US7203317(B2) | 2007-04-01 | Kallahalla et al. | Applicant |
| US7203968(B2) | 2007-04-01 | Asano et al. | Applicant |
| US7219230(B2) | 2007-05-01 | Riedel et al. | Applicant |
| US7224795(B2) | 2007-05-01 | Takada et al. | Applicant |
| US7225256(B2) | 2007-05-01 | Villavicencio | Applicant |
| US7227953(B2) | 2007-06-01 | Shida | Applicant |
| US7233948(B1) | 2007-06-01 | Shamoon et al. | Applicant |
| US7237002(B1) | 2007-06-01 | Estrada et al. | Applicant |
| US7249044(B2) | 2007-07-01 | Kumar et al. | Applicant |
| US7260555(B2) | 2007-08-01 | Rossmann et al. | Applicant |
| US7265764(B2) | 2007-09-01 | Alben et al. | Applicant |
| US7266684(B2) | 2007-09-01 | Jancula | Applicant |
| US7280658(B2) | 2007-10-01 | Amini et al. | Applicant |
| US7287055(B2) | 2007-10-01 | Smith et al. | Applicant |
| US7290148(B2) | 2007-10-01 | Tozawa et al. | Applicant |
| US7308702(B1) | 2007-12-01 | Thomsen et al. | Applicant |
| US7313824(B1) | 2007-12-01 | Bala et al. | Applicant |
| US7319752(B2) | 2008-01-01 | Asano et al. | Applicant |
| US7340600(B1) | 2008-03-01 | Corella | Applicant |
| US7380120(B1) | 2008-05-01 | Garcia | Applicant |
| US7383586(B2) | 2008-06-01 | Cross et al. | Applicant |
| US7386529(B2) | 2008-06-01 | Kiessig et al. | Applicant |
| US2001/0011254(A1) | 2001-08-01 | Clark | Applicant |
| US2001/0021926(A1) | 2001-09-01 | Schnek et al. | Applicant |
| US2001/0032181(A1) | 2001-10-01 | Jakstadt et al. | Applicant |
| US2001/0034839(A1) | 2001-10-01 | Karjoth et al. | Applicant |
| US2001/0044903(A1) | 2001-11-01 | Yamamoto et al. | Applicant |
| US2001/0056550(A1) | 2001-12-01 | Lee | Applicant |
| US2002/0010679(A1) | 2002-01-01 | Felsher | Applicant |
| US2002/0016922(A1) | 2002-02-01 | Richards et al. | Applicant |
| US2002/0031230(A1) | 2002-03-01 | Sweet et al. | Applicant |
| US2002/0035624(A1) | 2002-03-01 | Kim | Applicant |
| US2002/0046350(A1) | 2002-04-01 | Lordemann et al. | Applicant |
| US2002/0050098(A1) | 2002-05-01 | Chan | Applicant |
| US2002/0056042(A1) | 2002-05-01 | Van Der Kaay et al. | Applicant |
| US2002/0062240(A1) | 2002-05-01 | Morinville | Applicant |
| US2002/0062245(A1) | 2002-05-01 | Niu et al. | Applicant |
| US2002/0069077(A1) | 2002-06-01 | Brophy et al. | Applicant |
| US2002/0069272(A1) | 2002-06-01 | Kim et al. | Applicant |
| US2002/0069363(A1) | 2002-06-01 | Winburn | Applicant |
| US2002/0073320(A1) | 2002-06-01 | Rinkevich et al. | Applicant |
| US2002/0077986(A1) | 2002-06-01 | Kobata et al. | Applicant |
| US2002/0077988(A1) | 2002-06-01 | Sasaki et al. | Applicant |
| US2002/0087479(A1) | 2002-07-01 | Malcolm | Applicant |
| US2002/0091928(A1) | 2002-07-01 | Bouchard et al. | Examiner |
| US2002/0099947(A1) | 2002-07-01 | Evans | Applicant |
| US2002/0124180(A1) | 2002-09-01 | Hagman | Applicant |
| US2002/0129235(A1) | 2002-09-01 | Okamoto et al. | Applicant |
| US2002/0133699(A1) | 2002-09-01 | Pueschel | Applicant |
| US2002/0138762(A1) | 2002-09-01 | Horne | Applicant |
| US2002/0143710(A1) | 2002-10-01 | Liu | Applicant |
| US2002/0143906(A1) | 2002-10-01 | Tormasov et al. | Applicant |
| US2002/0150239(A1) | 2002-10-01 | Carny et al. | Examiner |
| US2002/0156726(A1) | 2002-10-01 | Kleckner et al. | Applicant |
| US2002/0157016(A1) | 2002-10-01 | Russell et al. | Applicant |
| US2002/0169963(A1) | 2002-11-01 | Seder et al. | Applicant |
| US2002/0169965(A1) | 2002-11-01 | Hale et al. | Applicant |
| US2002/0172367(A1) | 2002-11-01 | Mulder et al. | Applicant |
| US2002/0174109(A1) | 2002-11-01 | Chandy et al. | Applicant |
| US2002/0176572(A1) | 2002-11-01 | Ananth | Examiner |
| US2002/0178271(A1) | 2002-11-01 | Graham et al. | Applicant |
| US2002/0194484(A1) | 2002-12-01 | Bolosky et al. | Applicant |
| US2002/0198798(A1) | 2002-12-01 | Ludwig et al. | Applicant |
| US2003/0009685(A1) | 2003-01-01 | Choo et al. | Applicant |
| US2003/0014391(A1) | 2003-01-01 | Evans et al. | Applicant |
| US2003/0023559(A1) | 2003-01-01 | Choi et al. | Applicant |
| US2003/0028610(A1) | 2003-02-01 | Pearson | Applicant |
| US2003/0033528(A1) | 2003-02-01 | Ozog et al. | Applicant |
| US2003/0037133(A1) | 2003-02-01 | Owens | Applicant |
| US2003/0037237(A1) | 2003-02-01 | Abgrall et al. | Applicant |
| US2003/0037253(A1) | 2003-02-01 | Blank et al. | Applicant |
| US2003/0046238(A1) | 2003-03-01 | Nonaka et al. | Applicant |
| US2003/0051039(A1) | 2003-03-01 | Brown et al. | Applicant |
| US2003/0056139(A1) | 2003-03-01 | Murray et al. | Applicant |
| US2003/0074580(A1) | 2003-04-01 | Knouse et al. | Applicant |
| US2003/0078959(A1) | 2003-04-01 | Yeung et al. | Applicant |
| US2003/0079175(A1) | 2003-04-01 | Limantsev | Applicant |
| US2003/0081784(A1) | 2003-05-01 | Kallahalla et al. | Applicant |
| US2003/0081787(A1) | 2003-05-01 | Kallahalla et al. | Applicant |
| US2003/0088517(A1) | 2003-05-01 | Medoff | Applicant |
| US2003/0088783(A1) | 2003-05-01 | DiPierro | Applicant |
| US2003/0101072(A1) | 2003-05-01 | Dick et al. | Applicant |
| US2003/0110169(A1) | 2003-06-01 | Zuili | Applicant |
| US2003/0110266(A1) | 2003-06-01 | Rollins et al. | Applicant |
| US2003/0110397(A1) | 2003-06-01 | Supramaniam | Applicant |
| US2003/0115146(A1) | 2003-06-01 | Lee et al. | Applicant |
| US2003/0115570(A1) | 2003-06-01 | Bisceglia | Applicant |
| US2003/0120601(A1) | 2003-06-01 | Ouye | Applicant |
| US2003/0120684(A1) | 2003-06-01 | Zuili et al. | Applicant |
| US2003/0126434(A1) | 2003-07-01 | Lim et al. | Applicant |
| US2003/0154381(A1) | 2003-08-01 | Ouye | Applicant |
| US2003/0159066(A1) | 2003-08-01 | Staw et al. | Applicant |
| US2003/0172280(A1) | 2003-09-01 | Scheidt et al. | Applicant |
| US2003/0177070(A1) | 2003-09-01 | Viswanath et al. | Applicant |
| US2003/0177378(A1) | 2003-09-01 | Wittkotter | Applicant |
| US2003/0182579(A1) | 2003-09-01 | Leporini et al. | Applicant |
| US2003/0196096(A1) | 2003-10-01 | Sutton | Examiner |
| US2003/0197729(A1) | 2003-10-01 | Denoue et al. | Applicant |
| US2003/0200202(A1) | 2003-10-01 | Hsiao et al. | Applicant |
| US2003/0217264(A1) | 2003-11-01 | Martin et al. | Applicant |
| US2003/0217281(A1) | 2003-11-01 | Ryan | Applicant |
| US2003/0217333(A1) | 2003-11-01 | Smith et al. | Applicant |
| US2003/0226013(A1) | 2003-12-01 | Dutertre | Applicant |
| US2003/0233650(A1) | 2003-12-01 | Zaner et al. | Applicant |
| US2004/0022390(A1) | 2004-02-01 | McDonald et al. | Applicant |
| US2004/0025037(A1) | 2004-02-01 | Hair | Applicant |
| US2004/0039781(A1) | 2004-02-01 | LaVallee et al. | Applicant |
| US2004/0064710(A1) | 2004-04-01 | Vainstein | Applicant |
| US2004/0068524(A1) | 2004-04-01 | Aboulhosn et al. | Applicant |
| US2004/0068664(A1) | 2004-04-01 | Nachenberg et al. | Applicant |
| US2004/0073660(A1) | 2004-04-01 | Toomey | Applicant |
| US2004/0073718(A1) | 2004-04-01 | Johannessen et al. | Applicant |
| US2004/0088548(A1) | 2004-05-01 | Smetters et al. | Applicant |
| US2004/0098580(A1) | 2004-05-01 | DeTreville | Applicant |
| US2004/0103202(A1) | 2004-05-01 | Hildebrand et al. | Applicant |
| US2004/0103280(A1) | 2004-05-01 | Balfanz et al. | Applicant |
| US2004/0133544(A1) | 2004-07-01 | Kiessig et al. | Applicant |
| US2004/0158586(A1) | 2004-08-01 | Tsai | Applicant |
| US2004/0193602(A1) | 2004-09-01 | Liu et al. | Applicant |
| US2004/0193905(A1) | 2004-09-01 | Lirov et al. | Applicant |
| US2004/0193912(A1) | 2004-09-01 | Li et al. | Applicant |
| US2004/0199514(A1) | 2004-10-01 | Rosenblatt et al. | Applicant |
| US2004/0215956(A1) | 2004-10-01 | Venkatachary et al. | Applicant |
| US2004/0215962(A1) | 2004-10-01 | Douceur et al. | Applicant |
| US2004/0243853(A1) | 2004-12-01 | Swander et al. | Applicant |
| US2005/0021467(A1) | 2005-01-01 | Franzdonk | Applicant |
| US2005/0021629(A1) | 2005-01-01 | Cannata et al. | Applicant |
| US2005/0028006(A1) | 2005-02-01 | Leser et al. | Applicant |
| US2005/0039034(A1) | 2005-02-01 | Doyle et al. | Applicant |
| US2005/0071275(A1) | 2005-03-01 | Vainstein et al. | Applicant |
| US2005/0071657(A1) | 2005-03-01 | Ryan | Applicant |
| US2005/0071658(A1) | 2005-03-01 | Nath et al. | Applicant |
| US2005/0081029(A1) | 2005-04-01 | Thornton et al. | Applicant |
| US2005/0086531(A1) | 2005-04-01 | Kenrich | Applicant |
| US2005/0091484(A1) | 2005-04-01 | Thornton et al. | Applicant |
| US2005/0120199(A1) | 2005-06-01 | Carter | Applicant |
| US2005/0138371(A1) | 2005-06-01 | Supramaniam | Applicant |
| US2005/0138383(A1) | 2005-06-01 | Vainstein | Applicant |
| US2005/0177716(A1) | 2005-08-01 | Ginter et al. | Applicant |
| US2005/0177858(A1) | 2005-08-01 | Ueda | Examiner |
| US2005/0198326(A1) | 2005-09-01 | Schlimmer et al. | Applicant |
| US2005/0223242(A1) | 2005-10-01 | Nath | Applicant |
| US2005/0223414(A1) | 2005-10-01 | Kenrich et al. | Applicant |
| US2005/0235154(A1) | 2005-10-01 | Serret-Avila | Applicant |
| US2005/0256909(A1) | 2005-11-01 | Aboulhosn et al. | Applicant |
| US2005/0273600(A1) | 2005-12-01 | Seeman | Applicant |
| US2005/0283610(A1) | 2005-12-01 | Serret-Avila et al. | Examiner |
| US2005/0288961(A1) | 2005-12-01 | Tabrizi | Applicant |
| US2006/0005021(A1) | 2006-01-01 | Torrubia-Saez | Applicant |
| US2006/0075465(A1) | 2006-04-01 | Ramanathan et al. | Applicant |
| US2006/0093150(A1) | 2006-05-01 | Reddy et al. | Applicant |
| US2006/0168147(A1) | 2006-07-01 | Inoue et al. | Applicant |
| US2006/0230437(A1) | 2006-10-01 | Boyer et al. | Applicant |
| US2007/0006214(A1) | 2007-01-01 | Dubal et al. | Applicant |
| US2007/0067837(A1) | 2007-03-01 | Schuster | Applicant |
| EP672991(A2) | 1995-09-01 | Applicant | |
| EP674253(A1) | 1995-09-01 | Applicant | |
| EP809170(A1) | 1997-11-01 | Applicant | |
| EP913966(A2) | 1999-05-01 | Applicant | |
| EP913967(A2) | 1999-05-01 | Applicant | |
| EP950941(A2) | 1999-10-01 | Applicant | |
| EP950941(A3) | 1999-10-01 | Applicant | |
| EP1107504(B1) | 2001-06-01 | Applicant | |
| EP1107504(A2) | 2001-06-01 | Applicant | |
| EP1130492(A2) | 2001-09-01 | Applicant | |
| EP1154348(A2) | 2001-11-01 | Applicant | |
| EP1324565(A1) | 2003-07-01 | Applicant | |
| GB2328047(A) | 1999-02-01 | Applicant | |
| JP2001-036517 | 2001-02-01 | Applicant | |
| WO96/41288(A1) | 1996-12-01 | Applicant | |
| WO/56028(A2) | 2000-09-01 | Applicant | |
| WO1/61438(A2) | 2001-08-01 | Applicant | |
| WO1/63387(A2) | 2001-08-01 | Applicant | |
| WO1/63387(A3) | 2001-08-01 | Applicant | |
| WO1/77783(A2) | 2001-10-01 | Applicant | |
| WO1/78285(A1) | 2001-10-01 | Applicant | |
| WO1/84271(A2) | 2001-11-01 | Applicant |
Non-Patent Literature (62)
- Expiration Mechanism for Chipcards, IBM Technical Disclosure Bulletin, Oct. 1, 2001, UK.Applicant
- McDaniel et al. “Antigone: A Flexible Framework for Secure Group Communication,” Proceedings of the 8th USENIX Security Symposium, Aug. 23, 1999.Applicant
- Stallings, William, “Cryptography and Network Security: Principles and Practice,” 1999, pp. 333-337, Second Edition, Prentice Hall, Upper Saddle River, New Jersey.Applicant
- “Affect,” The American Heritage Dictionary of the English Language, Fourth Edition, Houghton Mifflin Company, 2002. Retrieved May 4, 2006 from http://dictionary.reference.com/search?q=affect.Applicant
- “Inside Encryping file system,” Part 1, from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.Applicant
- “Inside Encryping file system,” Part 2, from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.Applicant
- “Security with Encryping File System,” from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.Applicant
- “How EFS work,” from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.Applicant
- “Encryping File System,” from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.Applicant
- “Features of EFS” from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.Applicant
- “Windows 2000 EFS” in the Apr. 1999 issue of Windows NT magazine.Applicant
- Microsoft Windows 200 server. Windows 2000 Group Policy White Paper, 2000.Applicant
- Symantec. Norton Antivirus Corporate Edition Implementation Guide, 1999.Applicant
- Crocker, Steven Toye, “Multi-level cryptographic transformations for securing digital assets,” U.S. Appl. No. 10/404,566, filed Mar. 31, 2003.Applicant
- Crocker, Steven Toye, “Effectuating access policy changes to designated places for secured files,” U.S. Appl. No. 10/259,075, filed Sep. 27, 2002.Applicant
- Kenrich, Michael Frederick, “Multi-Level File Digest”, U.S. Appl. No. 10/894,493, filed Jul. 19, 2004.Applicant
- Kinghorn, Gary Mark, “Method and system for protecting electronic data in enterprise environment,” U.S. Appl. No. 10/159,220, filed May 31, 2002.Applicant
- Nath, Satyajit, “Method and system for securing digital assets using content type designations,” U.S. Appl. No. 10/405,587, filed Apr. 1, 2003.Applicant
- Prakash, Nalini J., “Method and apparatus for securing/unsecuring files by file crawling,” U.S. Appl. No. 10/325,102, filed Dec. 20, 2002.Applicant
- Rossmann, Alain, “Hybrid systems for securing digital assets,” U.S. Appl. No. 10/325,013, filed Dec. 20, 2002.Applicant
- A Real-Time Push-Pull Communications Model for Distributed Real-Time and Multimedia Systems, Jan. 1999, School of Computer Sciences Carnegie Mellon University, Kanaka Juvva, Raj Rajkumar.Applicant
- U.S. Appl. No. 10/889,685, entitled “Method and Apparatus for Controlling the Speed Ranges of a Machine” inventor Thomas, filed Jul. 13, 2004, 18 pgs.Applicant
- U.S. Appl. No. 10/028,397, entitled “Method and system for restricting use of a clipboard application,” inventor Zuili, filed Dec. 21, 2001, 38 pgs.Applicant
- U.S. Appl. No. 10/368,277, entitled “Method and apparatus for uniquely identifying files,” inventor Ouye, filed Feb. 18, 2003,25 pgs.Applicant
- U.S. Appl. No. 10/327,320, entitled “Security system with staging capabilities” inventor Vainstein, filed Dec. 20, 2002, 39 pgs.Applicant
- U.S. Appl. No. 10/286,524, entitled “Security system that uses indirect password-based encryption,” inventor Gutnik, filed Nov. 1, 2002, 38 pgs.Applicant
- U.S. Appl. No. 10/242,185, entitled “Method and system for protecting encrypted files transmitted over a network” inventor Ryan, filed Sep. 11, 2002, 33 pgs.Applicant
- U.S. Appl. No. 10/642,041, entitled “Method and system for fault-tolerant transfer of files across a network” inventor Kenrich, filed Aug. 15, 2003, 32 pgs.Applicant
- U.S. Appl. No. 10/610,832, entitled “Method and system for enabling users of a group shared across multiple file security systems to access secured files” inventor Ryan, filed Jun. 30, 2003, 33 pgs.Applicant
- U.S. Appl. No. 10/448,806, entitled “Method and System for Using Remote Headers to Secure Electronic Files” inventor Ryan, filed May 30, 2003, 35 pgs.Applicant
- U.S. Appl. No. 10/074,194, entitled “Methods for idnetifying compunds that inhibit or reduce PTP1B expressions” inventor Rondinone, filed Feb. 12, 2002, 69 pgs.Applicant
- U.S. Appl. No. 10/074,804, entitled “Secured Data Format for Access Control,” inventor Garcia, filed Feb. 12, 2002, 108 pgs.Applicant
- U.S. Appl. No. 10/075,194, entitled “System and Method for Providing Multi-location Access Management to Secured Items,” inventor Vainstein et al., filed Feb. 12, 2002, 110 pgs.Applicant
- U.S. Appl. No. 10/074,996, entitled “Method and Apparatus for Securing Electronic Data,” inventor Lee et al., filed Feb. 12, 2002, 111 pgs.Applicant
- U.S. Appl. No. 10/074,825, entitled “Method and Apparatus for Accessing Secured Electronic Data Off-line,” inventor Lee et al., filed Feb. 12, 2002, 108 pgs.Applicant
- U.S. Appl. No. 10/105,532, entitled “System and Method for Providing Different Levels of Key Security for Controlling Access to Secured Items,” inventor Hildebrand et al., filed Mar. 20, 2002, 86 pgs.Applicant
- U.S. Appl. No. 10/186,203, entitled “Method and System for Implementing Changes to Security Policies in a Distributed Security System,” inventor Huang, filed Jun. 26, 2002, 65 pgs.Applicant
- U.S. Appl. No. 10/201,756, entitled “Managing Secured Files in Designated Locations,” inventor Alain, filed Jul. 22, 2002, 121 pgs.Applicant
- U.S. Appl. No. 10/206,737, entitled “Method and System for Updating Keys in a Distributed Security System,” inventor Hildebrand, filed Jul. 26, 2002, 60 pgs.Applicant
- U.S. Appl. No. 10/246,079, entitled “Security System for Generating Keys from Access rules in a Decentralized Manner and Methods Therefor,” inventor Hildebrand, filed Sep. 17, 2002, 78 pgs.Applicant
- U.S. Appl. No. 10/259,075, entitled “Effectuating Access Policy Changes to Designated Places for Secured Files,” inventor Crocker, filed Sep. 27, 2002, 60 pgs.Applicant
- U.S. Appl. No. 10/286,575, entitled “Method and Architecture for Providing Access to Secured Data from Non-Secured Clients,” inventor Vainstein, filed Nov. 1, 2002, 46 pgs.Applicant
- U.S. Appl. No. 10/295,363, entitled “Security System Using Indirect Key Generation from Access Rules and Methods Therefor,” inventor Vainstein, filed Nov. 15, 2002, 70 pgs.Applicant
- U.S. Appl. No. 11/889,310, entitled “Methods and Systems for Providing Access Control to Electronic Data,” inventor Rossmann, filed Aug. 10, 2007, 90 pgs.Applicant
- U.S. Appl. No. 11/797,367, entitled “Method and System for Managing Security Tiers,” inventor Vainstein, filed May 2, 2007, 11 pgs.Applicant
- Adobe Acrobat 5.0 Classroom in a Book, Adobe Press, Jun. 26, 2001, pp. 1-4.Applicant
- Adobe Acrobat Security Settings, Acrobat 7.0, Nov. 15, 2004, pp. 1-4.Applicant
- “Security Options”. Dec. 20, 2001. DC & Co. pp. 1-2.Applicant
- Microsoft Press Computer Dictionary, 1997, Microsoft Press, Third Edition, p. 426.Applicant
- Search Report, completion date May 8, 2003, for European Patent Application No. EP 02 25 8530, 2 pages.Applicant
- Search Report, completion date Oct. 2, 2003, for European Patent Application No. EP 02 25 8531, 2 pages.Applicant
- Search Report, completion date Apr. 14, 2005, for European Patent Application No. EP 02 25 8533, 2 pages.Applicant
- Search Report, completion date Mar. 16, 2005, for European Patent Application No. EP 02 25 8534, 2 pages.Applicant
- Search Report, completion date Mar. 2, 2005, for European Patent Application No. EP 02 25 8535, 2 pages.Applicant
- Search Report, completion date Mar. 3, 2005, for European Patent Application No. EP 02 25 8537, 2 pages.Applicant
- Search Report, completion date May 12, 2005, for European Patent Application No. EP 02 25 8539, 2 pages.Applicant
- Search Report, completion date Jul. 6, 2005, for European Patent Application No. EP 02 25 8529, 4 pages.Applicant
- Search Report, completion date Oct. 8, 2003, for European Patent Application No. EP 02 25 8536, 2 pages.Applicant
- Search Report, completion date May 8, 2003, for European Patent Application No. EP 02 25 8540, 2 pages.Applicant
- Examination Report, completion date Jun. 18, 2008, for European Patent Application No. EP 02 258 532.7-1244, 6 pgs.Applicant
- Boneh et al., “Hierarchical Identity Based Encryption with Constant Size Ciphertext,” Advances in Cryptology-EUROCRYPT 2005, vol. 3493, Jun. 20, 2005, pp. 440-456.Applicant
- Boneh et al., “IBE Secure E-mail,” Stanford University, Apr. 8, 2002, http://crypto.stanford.edu/ibe/.Applicant