Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUSRE41546 E1
Publication typeGrant
Application numberUS 11/797,367
Publication date17 Aug 2010
Filing date2 May 2007
Priority date12 Dec 2001
Fee statusPaid
Publication number11797367, 797367, US RE41546 E1, US RE41546E1, US-E1-RE41546, USRE41546 E1, USRE41546E1
InventorsKlimenty Vainstein
Original AssigneeKlimenty Vainstein
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Method and system for managing security tiers
US RE41546 E1
Abstract
Techniques for reorganizing security levels without implicating accessibility to secured files classified in accordance to one of the security levels are disclosed. In a case of adding a new security level, the controllability or restrictiveness of the new security level is determined with respect to the most restrictive security level or the least security level in a set of existing security levels. A set of proper security parameters are then generated for the new security level and subsequently the existing security levels are reorganized to accommodate the new security level. In a case of removing a security level from the existing security levels, the security parameters for the security level to be deleted are either folded up or down to an immediate next security level, depending on implementation. As a result, the security parameters for the immediate next security level are updated to include those for the security level to be deleted such that the secured files classified at the security level to be deleted can still be accessed by those with proper clearance levels.
Images(13)
Previous page
Next page
Claims(35)
1. In a system for providing restrictive access to contents in secured files, each of the secured files classified in accordance with one of N security levels, aA method for reorganizing the N security levels without implicating accessibilities to the secured files, each of the secured files classified in accordance with one of the N security levels, the method comprising:
determining, using a computing device, a new security level with respect to the N security levels, wherein a 1st security level is most restrictive and an Nth security level is least restrictive inamong the N security levels;
generating, using the computing device, security parameters accordingly for the new security level, the new security level being ith less restrictive with respect to the 1st security level; and
mapping, using the computing device, an ith security level in the N security levels to an (i+1)th security level in the N security levels to accommodate the new security level such that there are now (N+1) security levels in the system,
wherein each of the secured files includes an encrypted data portion and a security portion that controls restrictive access to the encrypted data portion, the security portion including a file key encrypted by at least a first key and a second key and further protected by a set of rules, and
wherein both of the first key and the second key must be obtained by a user whose access privilege is satisfied by the rules before the contents of the each of the secured files can be accessed.
2. The method of claim 1, wherein the security parameters includes at least a clearance key and one or more of the parameters pertain to a designated group of users authorized to access the secured files classified at the new security level.
3. The method of claim 2, wherein the clearance key is associated with the designated group of users, and together with a user key associated with each of the users, allows access to files secured at the ith security level can now be accessed .
4. The method of claim 2, wherein, whenif a user authorized to access secured files classified at the new security level loginslogs into the system, the user is granted the clearance key, together with a user key authorizedauthorizing the user to access the secured files, thoseand secured files classified at the new security level can now be accessed by the users .
5. The method of claim 4, wherein, the clearance key is a private key in a pair of a public key and the private key, thoseand the secured files are classified at the new security level with the public key.
6. The method of claim 4, wherein, if the user is authorized atto access the ith security level in the original N security levels, the user is now granted a second user key and a second clearance key such that the contents in the secured files classified at the (i+1)th security level and below can be now accessed by the user.
7. The method of claim 6 1, wherein the first key determines if the user is authorized to access the secured files classified at one of the N security levels or one of the (N+1) security levels, and the second key is in accordance with the one of the N security levels or the one of the (N+1) security levels.
8. In a system for providing restrictive access to contents in secured files, at least some of the secured files classified in accordance with one of N security levels, aA method for reorganizing the N security levels without implicating accessibilities to the secured files, at least some of the secured files classified in accordance with one of the N security levels, the method comprising:
upon receiving a request to remove an ith security level out of the N security levels, determining, using a computing device, if an (i−1)th security level is a 1st security level or if an (i+1)th security level is an Nth security levels , wherein the 1st security level is most restrictive and the Nth security level is least restrictive inamong the N security levels;
whenif the (i−1)th security level is not the 1st security level and the (i+1)th security level is not the Nth security levels , merging, using the computing device, the ith security level with either the (i−1)th security level or the (i+1)th security level such that there are now (N−1) security levels in the system,
wherein each of the secured files includes an encrypted data portion and a security portion that controls restrictive access to the encrypted data portion, the security portion including a file key encrypted by at least a first key and a second key and further protected by a set of rules, and wherein both of the first key and the second key must be obtained by a user whose access privilege is satisfied by the rules before the contents of the each of the secured files can be accessed.
9. The method of claim 8, wherein users authorized to access secured files classified at the ith security level can now access secured files classified at the (i−1)th security level if the ith security level ishas been merged with the (i−1)th security level.
10. The method of claim 8, wherein users authorized to access secured files classified at the ith security level can now access secured files classified at the (i+1)th security level if the ith security level ishas been merged with the (i+1)th security level.
11. The method of claim 8, wherein at least two keys are needed to access secured files classified at the ith security level, and after the ith security level ishas been merged with the (i−1)th or (i+1)th security level, the at lest two keys are incorporated into the (i−1)th or (i+1)th security level as such that users authorized to access the secured files classified at the ith security level can still access the secured files.
12. The method of claim 11, wherein, at the same time, the users can access secured files classified at the (i−1)th or (i+1)th security level.
13. The method of claim 11, wherein the at least two keys include a first key associated with a designated group of users and a second key being a clearance key in accordance with the ith security level.
14. The method of claim 13, wherein, whenif the user loginslogs into the system, the user is granted the at least two keys.
15. The method of claim 8, further comprising:
whenif the (i−1)th security level is the 1st security level, denying the request to remove the ith security level out of the N security levels; or
always folding down the ith security level with (i−1)th security level.
16. The method of claim 8 further comprising:
whenif the (i−1)th security level is the N security level,
denying the request to remove the ith security level out of the N security levels; or
always folding up the ith security level with (i−1)th security level.
17. In aA system for providing restrictive access to contents in secured files, each of the secured files classified in accordance with one of N security levels, the system comprising:
a first machine loaded with a software module to reorganize the N security levels without implicating accessibilities to the secured files, wherein the 1st security level is most restrictive and the Nth security level is least restrictive in the N security levels, whenand wherein, if the software module is executed, the first machine performs operations of:
if a request offor deleting an ith security level out of the N security levels is received,
determining if an (i−1)th security level is a 1 st security level or if an (i+1)th security level is an Nth security levels , wherein the 1st security level is most restrictive and the Nth security level is least restrictive in the N security levels; and
whenif the (i−1)th security level is not the 1st security level and the (i+1)th security level is not the Nth security levels , merging the ith security level with either the (i−1)th security level or the (i+1)th security level such that there are now (N−1) security levels in the system; and
if a request of adding a new security level into the N security is received,
determining a new security level with respect to the N security levels, wherein a 1 st security level is most restrictive and an Nth security level is least restrictive in the N security levels;
generating security parameters accordingly for the new security level, the new security level being ith less restrictive with respect to the 1st security level; and
mapping an ith security level in the N security levels to an (i+1)th security level in the N security levels to accommodate the new security level such that there are now (N+1) security levels in the system; and
a second machine, coupled to the first machine over a network, associated with a user that is granted with at least two keys to access one of the secured files classified at one of the N security levels,
wherein each of the secured files includes an encrypted data portion and a security portion that controls restrictive access to the encrypted data portion, the security portion including a file key encrypted by at least a first key and a second key and further protected by a set of rules, and
wherein both of the first key and the second key must be obtained by a user whose access privilege is satisfied by the rules before the contents of the each of the secured files can be accessed.
18. The system of claim 17, wherein one of the two keys granted to the user is a clearance key in accordance with the one of the N security levels.
19. The system of claim 18, wherein the two keys granted to the user are folded to either the (i−1)th security level or the (i+1)th security level, whenif the user is authorized to access secured files classified at the ith security level.
20. A tangible computer-readable storage medium having stored thereon instructions that, if executed by a computing device, cause the computing device to perform a method comprising:
determining a new security level with respect to the N security levels, wherein a 1st security level is most restrictive and an Nth security level is least restrictive among the N security levels;
generating security parameters accordingly for the new security level, the new security level being ith less restrictive with respect to the 1st security level; and
mapping an ith security level in the N security levels to an (i+1 )th security level in the N security levels to accommodate the new security level such that there are (N+1) security levels in the system,
wherein each of the secured files includes an encrypted data portion and a security portion that controls restrictive access to the encrypted data portion, the security portion including a file key encrypted by at least a first key and a second key and further protected by a set of rules, and
wherein both of the first key and the second key must be obtained by a user whose access privilege is satisfied by the rules before the contents of the each of the secured files can be accessed.
21. The computer-readable storage medium according to claim 20 , wherein the security parameters include at least a clearance key and one or more of the parameters pertain to a designated group of users authorized to access the secured files classified at the new security level.
22. The computer-readable storage medium according to claim 21 , wherein the clearance key is associated with the designated group of users, and together with a user key associated with each of the users, allows access to files secured at the ith security level.
23. The computer-readable storage medium according to claim 21 , wherein, if a user authorized to access secured files classified at the new security level logs into the system, the user is granted the clearance key, together with a user key authorizing the user to access the secured files, and secured files classified at the new security level can be accessed by the user.
24. The computer-readable storage medium according to claim 23 , wherein the clearance key is a private key in a pair of a public key and the private key, and the secured files are classified at the new security level with the public key.
25. The computer-readable storage medium according to claim 23 , wherein, if the user is authorized to access the ith security level in the N security levels, the user is granted a second user key and a second clearance key such that the contents in the secured files classified at the (i+1 )th security level and below can be accessed by the user.
26. The computer-readable storage medium according to claim 25 , wherein the first key determines if the user is authorized to access the secured files classified at one of the N security levels or one of the (N+1 ) security levels, and the second key is in accordance with the one of the N security levels or the one of the (N+1 ) security levels.
27. A tangible computer-readable storage medium having stored thereon instructions that, if executed by a computing device, cause the computing device to perform a method comprising:
upon receiving a request to remove an ith security level out of the N security levels, determining if an (i−1 )th security level is a 1st security level or if an (i+1 )th security level is an Nth security level, wherein the 1st security level is most restrictive and the Nth security level is least restrictive among the N security levels;
if the (i−1 )th security level is not the 1st security level and the (i+1 )th security level is not the Nth security level, merging the ith security level with either the (i−1 )th security level or the (i+1 )th security level such that there are (N−1 ) security levels in the system,
wherein each of the secured files includes an encrypted data portion and a security portion that controls restrictive access to the encrypted data portion, the security portion including a file key encrypted by at least a first key and a second key and further protected by a set of rules, and
wherein both of the first key and the second key must be obtained by a user whose access privilege is satisfied by the rules before the contents of each of the secured files can be accessed.
28. The computer-readable storage medium according to claim 27 , wherein users authorized to access secured files classified at the ith security level can access secured files classified at the (i−1 )th security level if the ith security level has been merged with the (i−1 )th security level.
29. The computer-readable storage medium according to claim 27 , wherein users authorized to access secured files classified at the ith security level can access secured files classified at the (i+1 )th security level if the ith security level has been merged with the (i+1 )th security level.
30. The computer-readable storage medium according to claim 27 , wherein at least two keys are needed to access secured files classified at the ith security level, and after the ith security level has been merged with the (i−1 )th or (i+1 )th security level, the at lest two keys are incorporated into the (i−1 )th or (i+1 )th security level such that users authorized to access the secured files classified at the ith security level can access the secured files.
31. The computer-readable storage medium according to claim 30 , wherein the users can access secured files classified at the (i−1 )th or (i+1 )th security level.
32. The computer-readable storage medium according to claim 30 , wherein the at least two keys include a first key associated with a designated group of users and a second key being a clearance key in accordance with the ith security level.
33. The computer-readable storage medium according to claim 32 , wherein, if the user logs into the system, the user is granted the at least two keys.
34. The computer-readable storage medium according to claim 27 , further comprising computer code for: if the (i−1 )th security level is the 1st security level, denying the request to remove the ith security level out of the N security levels; or always folding down the ith security level with (i−1 )th security level.
35. The computer-readable storage medium according to claim 27 further comprising computer code for: if the (i−1 )th security level is the N security level, denying the request to remove the ith security level out of the N security levels; or always folding up the ith security level with (i−1 )th security level.
Description
CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation-in-part of co-pending U.S. patent application Ser. No. 10/076,254, filed Feb. 12, 2002, that claims the benefits of U.S. provisional application No. 60/339,634 filed Dec. 12, 2001. The application is also related to U.S. patent application Ser. No. 10/159,537 and entitled “Method and Apparatus for Securing Digital Assets”, which is hereby incorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to the area of protecting data in an enterprise environment, and more particularly, relates to a method and system for managing security tiers or levels without implicating accessibilities to secured files classified according to a security level.

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 increase 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 provides a way to transmit information across an insecure 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, remains available and vulnerable to improper access and usage by unauthorized users within or outside a supposedly protected perimeter.

In fact, 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. Therefore, there is a need to provide more effective ways to secure and protect digital assets at all times.

When a security system is employed to secure files, it is sometimes desirable to classify the secured files according to a security level, for example, “top secret”, “secret” or “confidential”. When there is a need to add or delete additional security levels, the secured files originally classified should be still accessible. Thus there is a need for solutions that can manage the security levels dynamically without implicating accessibility to the secured files.

SUMMARY OF INVENTION

This section is for the purpose of summarizing some aspects of the present invention and to briefly introduce some preferred embodiments. Simplifications or omissions in this section as well as in the abstract may be made to avoid obscuring the purpose therefor. Such simplifications or omissions are not intended to limit the scope of the present invention.

The present invention is related to processes, systems, architectures and software products for providing pervasive security to digital assets at all times and is particularly suitable in an inter/intra enterprise environment. In general, pervasive security means that digital assets are secured at all times and can only be accessed by authenticated users with appropriate access rights or privileges, and proper security clearance in some cases, wherein the digital assets may include, but not be limited to, various types of documents, multimedia files, data, executable code, images and texts. According to one aspect of the present invention, secured files are in a secured form that only those with granted access rights can access. Even with the proper access privilege, when a secured file is classified, at least a security clearance key is needed to ensure those who have the right security clearance can ultimately access the contents in the classified secured file.

According to one aspect of the present invention, a new security level is to be inserted into a set of existing security levels. For example, a security level “secret” is added between the existing security levels “top secret” and “confidential”, resulting in a new set of security levels, “top secret”, “secret” and “confidential”. Without implicating the accessibility to secured files classified at one of the existing security levels, the controllability or restrictiveness of the new security level is determined with respect to the most restrictive security level or the least security level in the existing security levels. A set of proper security parameters are generated for the new security level and subsequently the existing security levels are mapped to accommodate the new security level.

According to another aspect of the present invention, a security level is removed from a set of existing security levels. For example, a security level “secret” is removed from the existing security levels “top secret”, “secret” and “confidential”, resulting in a new set of security levels including only “top secret” and “confidential”. Without implicating the accessibility to secured files classified at one of the existing security levels, the security parameters for the security level to be deleted are either folded up or down to an immediate next security level, depending on implementation. As a result, the security parameters for the immediate next security level are augmented to include those for the security level to be deleted such that the secured files classified at the security level to be deleted can still be accessed by those with proper clearance levels.

Depending on implementation and application, the present invention may be implemented in software, hardware or both in combination, and employed in a client machine or a server machine. According to one embodiment, the present invention is implemented in an executable form loaded in a computing device and activated when the security tiers or levels are changed to provide particular needs of an organization or organizations.

The present invention can be implemented as a method, a system, a process, software medium or other form, each yielding one or more of the following features, benefits and advantages. One of the features, benefits and advantages is the management mechanism of security levels in a security system, the mechanism provides flexibility in reorganizing security levels without implicating accessibility to secured files originally classified. Another one of the features, benefits and advantages is that secured files originally classified at a security level to be deleted can still be accessed by properly folding the security level to a next immediate security level.

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

BRIEF DESCRIPTION OF THE DRAWINGS

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

FIG. 1 shows a diagram of securing a created document according to one exemplary secured file form used in the present invention;

FIG. 2A shows a diagram of what is referred to herein as a two-pronged access scheme according to one embodiment of the present invention;

FIG. 2B shows a flowchart of a process for granting a proper security clearance level (i.e., a clearance key) according to one embodiment of the present invention;

FIG. 2C shows a diagram of generating a clearance key according to one embodiment of the present invention;

FIG. 2D shows a diagram of generating a clearance key according to another embodiment of the present invention;

FIG. 3A illustrates a set of security levels in a security system employed in an enterprise, a new security level being inserted to the existing security level;

FIG. 3B and FIG. 3C each illustrate a case in which a security level is folded into another security level;

FIG. 4A shows a flowchart or process of inserting a new security level into N security levels according to one embodiment of the present invention;

FIG. 4B shows a flowchart or process of deleting a security level out of N security levels according to one embodiment of the present invention;

FIG. 4C shows a flowchart or process of deleting a security level out of N security levels according to one embodiment of the present invention;

FIG. 5A shows an exemplary implementation of dropping an ith level out of N existing level by folding the ith level to (i—i)th level and may be understood in conjunction with FIG. 5B and FIG. 5C;

FIG. 5B shows a table listing identifiers, levels, clearance keys and corresponding literal meanings according to one embodiment; and

FIG. 5C shows a clearance mapping table being entered and updated.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The present invention pertains to a process, a system, a method and a software product for securing electronic data or digital assets. According to one aspect of the present invention, a new security level is to be inserted into a set of existing security levels. Without implicating the accessibility to secured files classified at one of the existing security levels, the controllability or restrictiveness of the new security level is determined with respect to the most restrictive security level or the least security level in the existing security levels. A set of proper security parameters are generated for the new security level and subsequently the existing security levels are mapped to accommodate the new security level. According to another aspect of the present invention, a security level is removed from a set of existing security levels. The security parameters for the security level to be deleted are either folded up or down to an immediate next security level, depending on implementation. As a result, the security parameters for the immediate next security level are augmented to include those for the security level to be deleted such that the secured files classified at the security level to be deleted can still be accessed by those with proper clearance levels.

There are numerous advantages, benefits, and features in the present invention. One of them is the mechanism contemplated herein capable of providing pervasive security to digital assets sought to be protected at all times. Another one is that the digital assets are presented in such a way that only those with proper access privilege as well as sufficient security clearance level can access information in the digital assets. Other advantages, benefits, and features in the present invention can be readily appreciated by those skilled in the art from the detailed description of the invention provided herein.

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 means used by those experienced or skilled in the art to most effectively convey the substance of their work to others skilled in the art. In other instances, well-known methods, procedures, components, and circuitry have not been described in detail to avoid unnecessarily obscuring aspects of the present invention.

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

Embodiments of the present invention are discussed herein with reference to FIGS. 1-4B. 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.

Generally, a content created by a creator for the purpose of an entity is an intellectual property belonging to the creator or the entity. In an enterprise, any kind of information or intellectual property can be content, though it is commonly referred to as “information” instead of “content”. In either case, content or information is independent of its format, it may be in a printout or an electronic document. As used herein, content or information exists in a type of electronic data that is also referred to as a digital asset. A representation of the electronic data may include, but not be limited to, various types of documents, multimedia files, streaming data, dynamic or static data, executable code, images and texts.

To prevent contents in electronic data from an unauthorized access, the electronic data is typically stored in a form that is as close to impossible as possible to read without a priori knowledge. Its purpose is to ensure privacy by keeping the content hidden from anyone for whom it is not intended, even those who have access to the electronic data. Example of a priori knowledge may include, but not be limited to, a password, a secret phase, biometric information or one or more keys.

FIG. 1 shows an illustration diagram of securing a created document 100 according to one embodiment of the present invention. One of the purposes of creating a secured file 108 is to ensure that the contents in the document 100 can be only accessed by or revealed to an authorized user with proper access privilege. As used herein, the user may mean a human user, a software agent, a group of users or a member thereof, a device and/or application(s). Besides a human user who needs to access a secured document, a software application or agent sometimes needs to access the secured document in order to proceed forward. Accordingly, unless specifically stated, the “user” as used herein does not necessarily pertain to a human being.

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

To ensure that only authorized users or members of an authorized group can access the secured file 108, a set of access rules 104 (an example is shown in the figure) for the document 100 is received or created and associated with the header 106. In general, the access rules 104 determine or regulate who and/or how the document 100, once secured, can be accessed. In some cases, the access rules 104 also determine or regulate when or where the document 100 can be accessed. In addition, security clearance information 107 is added to the header 106 if the secured file 108 is classified. In general, the security clearance information 107 is used to determine a level of access privilege or security level of a user who is attempting to access the contents in the secured file 108. For example, a secured file may be classified as “Top secret”, “Secret”, “Confidential”, and “Unclassified”.

According to one embodiment, the security clearance information 107 includes another layer of encryption of the file key with another key referred to herein as a clearance key. An authorized user must have a clearance key of proper security level in addition to an authenticated user key and proper access privilege to retrieve the file key. As used herein, a user key or a group key is a cipher key assigned to an authenticated user and may be used to access a secured file or secure a file, or create a secured file. The detail of obtaining such a user key upon a user being authenticated is provided in U.S. patent application Ser. No. 10/074,804.

According to another embodiment, the security clearance information 107 includes a set of special access rules to guard the file key. The retrieval of the file key requires that the user passes an access rule measurement. Since access privilege of a user may be controlled via one or more system parameters (e.g., a policy), the access rule measurement can determine if the user has sufficient access privilege to retrieve the file key in conjunction with the corresponding user key. With the detailed description to follow, those skilled in the art can appreciate that other forms of the security clearance information 107 may be possible. Unless otherwise specified, the following description is based on the security clearance information 107 being another layer of encryption with one or more clearance keys.

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

As will be further described in detail below, unless the level of security clearance of the user permits, a secured classified file (i.e., the file that is both secured and classified) may not be accessed even if the user has an authenticated user (or group) key and permitted by the access rules in the secured classified file. In one embodiment, the level of security clearance of the user is determined by one or more clearance keys assigned thereto. In general, a clearance key permits a user to access a secured file classified as “top secret”, the same clearance key may permit the user to access all secured files classified less secure, such as “secret” or “confidential”, where it has been assumed that the user has proper access privilege to be granted by the access rules in the file. In one embodiment, a clearance key is further secured by means of secondary authentication, such as re-login, biometric information verification and a second password. In other words, a clearance key may not be automatically released to or activated for a user upon an authenticated login, unless the user provides additional information.

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

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

In essence, the secured document 108 includes two parts, the encrypted data portion 112 (i.e., encrypted version of the document itself) and the header 110 that may point to or include security information for the secured document 108. To access the contents in the encrypted data portion 112, one needs to obtain the file key to decrypt the encrypted data portion 112. To obtain the file key, one needs to be authenticated to get a user or group key and pass an access test in which at least the access rules in the security information are measured against the user's access privilege (i.e., access rights). If the secured file is classified, it further requires a security level clearance on the user. In general, the security clearance level of the user must be high enough before the file key can be retrieved. Alternatively, part of the access rules may be left non-encrypted for users authorized or non-authorized alike to view embedded access permissions of a secured file in a display application or markup language interpreter (e.g., a browser).

FIG. 2A shows a diagram 200 of what is referred to herein as a two-pronged access scheme according to one embodiment of the present invention. To access a secured file 201, a user needs to have access privilege based on a condition of “need to know” 202 that is to be measured against by the access rules 204 embedded in the secured file 201. If the secured file 201 is classified, the user must also have a higher security clearance level 206 that is measured against by the security clearance information 206 (e.g., one or more clearance keys. In other words, there are at least two key holes 210 that must be “inserted” with two proper keys before the secured classified file can be accessed.

FIG. 2B shows a flowchart 220 of process for granting a proper security clearance level (i.e., a clearance key) according to one embodiment of the present invention. The process 220 can be initiated with a request for a clearance key. Depending on implementation, the process 220 may be implemented in a machine (e.g., a central server, a local server or a client machine) that provides access control management to all secured files, perhaps, in an inter/intra enterprise environment, or a combination of a local client machine used by users and the machine.

At 222, the process 220 awaits a request for a clearance key. It is described that a secured file can be classified or unclassified. When it is determined that a user needs to access a secured file that is classified at a security level, such request is provided to activate the process 220. In general, the request pertains to a specific user or some members in a group. At 224, a corresponding account for the user is retrieved, provided there is the account for the user. If the account is not available, then the account shall be opened accordingly. Alternatively, the process 220 may be part of the process of opening an appropriate account for a user who has the need-to-know basis to access secured files at certain security or confidential level(s). Depending on implementation, the corresponding account information may include a username or identifier, membership information, designated access privilege, and a corresponding user key (which sometimes is a pair of a private key and a public key). At 226, a security level for the user is determined, which is usually done by the necessity. For example, an executive of an enterprise may be assigned the highest security clearance level and a front desk receptionist may be assigned the lowest security clearance level. Once the security level is determined, a clearance key is generated at 228.

Referring now to FIG. 2C, there is shown a diagram 240 of generating a clearance key according to one embodiment of the present invention. A key generator 244 receives one or more parameters 242 controlling the security level determined at 226 of FIG. 2B to generate a sequence of alpha-numeric characters or binary numbers as a key. Whether using a secret-key cryptosystem or a public-key cryptosystem, one needs a good source of random numbers for key generation. The main features of a good source are that it produces numbers that are unknown and unpredictable by potential adversaries. There are many ways to generate such numbers, for example, random numbers can be obtained from a physical process. Another approach is to use a pseudo-random number generator fed by a random seed. In any case, depending on the input 242, the generator 244 is configured to generate a clearance key of proper security level. In one embodiment, the key generator 244 generates keys 246 of different lengths or forms, each of the keys 246 corresponds to a security level, such as level 1 (highest security), level 2, . . . , level N (lowest security). In another embodiment, each of the keys 246 generated by the key generator 244 is embedded with a signature signifying a security level. Other methods of specifying a security level of a clearance key are possible. Although it is possible to implement in such a way that each clearance key with a certain security level can only access secured files classified in the same security level, it is preferable to permit a clearance key with a higher security level to access secured files classified in the lower security levels. In other words, a clearance key in level 1 (i.e., the highest security level primarily designated to secured files classified as “top secret”) can be used to access all secured classified files 248, while a clearance key in level 2 can be used to access all secured classified files 248 except for those classified as “top secret”. Likewise, a clearance key in level N can be only used to access secured files in security level N. One of the advantages for such arrangement is that a user needs only to have one clearance key, if the user has the need to access those secured classified files.

FIG. 2D shows a diagram of generating a clearance key according to another embodiment of the present invention. The key generator 244 receives one or more parameters 242 controlling the security level determined at 226 of FIG. 2B to generate a number of sets of alphanumeric or binary numbers as a primary key 246 and auxiliary keys 247. The primary key 246 is the one being requested, generated in accordance with the determined security level and can be used to facilitate the access to a secured file classified at a security or confidentiality level. The auxiliary keys are those keys generated to facilitate the access to secured files classified less than the security or confidentiality level. As shown in the figure, it is assumed that the primary key 246 is for accessing a secured file classified at level 2. Accordingly, the auxiliary keys 247 can be respectively used to access secured files classified level 3, level 4, . . . to level N, all less than level 2 in terms of security or confidentiality. To facilitate the description of the present invention, the following description is based on FIG. 2C and can be readily applied to FIGS. 2D.

Returning to FIG. 2B, after a proper clearance key is generated at 228, the clearance key is associated with the account at 230 so that the user will use the correct key to access a secured file that requires a clearance key. The process 220 now awaits any call for the clearance key at 232. Depending on implementation, the clearance key may be stored locally or remotely and retrievlable only when there is a need for it to access a classified secured file. In some cases, the clearance key can only be retrievlable when a user passes a secondary authentication means. For example, a user is entitled to access certain secured files classified at least at a security level. The clearance key associated with the user may be configured to be protected by means of secondary authentication, such as biometric information verification or a second password, to increase security level of the clearance key. When a non-secured classified file is accessed, the clearance key is not needed and therefore will not be released to or activated for the user. When a secured classified file is accessed, the process 220 goes to 234, wherein the clearance key is released to the user to facilitate the retrieval of the file key in the secured file, provided the user has furnished necessary information or passed secondary authentication if needed.

Clearance keys provide flexibilities for a security system to control access by authorized users to secured files that are classified accordingly. However, when levels of the security are fixed, the flexibilities are limited. As one of the features in the present invention, the levels of security can be added or adjusted up or down in a security system without compromising the security of the secured files that have been previously classified.

FIG. 3A illustrates security levels 302 in a security system employed in an enterprise. In general, there are N levels of security for secured files under the security system, where N is a finite integer, each level requires a set of security parameters to access secured files classified to the level or other levels below this level. For example, a secured file SF is classified at security level 2. To access the secured file, users in a designated group G2 shall posses at least two keys, a user key (e.g., UK2) and a clearance key (e.g., CK2) corresponding to the security level 2. The designated group includes a user or users authorized to access the secured files classified at this level or levels below this level. The user key for each of the users, if there are more than one users in the designated group, may not be necessary identical, as one user may be from one user group and another user may be from a different group. To facilitate the description of the present invention, the access relationship may be expressed as: SF ∀ (group, security-level, CK), which means a secured and classified file SF can be accessed with valid parameters of a designated group, a security-level, a clearance key. In particular, SF ∀ (G2, level2, C<) means that users in a group designated as G2 can access secured file classed at level 2 with a clearance key CK2, provided that each of the users in G2 has a valid user key. Alternatively, SF ∀ (G2, level1, level2, CK2) means that users in a group designated as G2 can access secured files classified at level 1 or level 2 with a clearance key CK2, provided that each of the users in G2 has a valid user key. The first access relationship indicates that the secured file SF can only be accessed by users in a group G2 authorized to access secured files classified at the security level 2. The second access relationship indicates that secured files classified at the security level 2 or one level below the security level 2 can be accessed by users authorized to access secured files classified at the security level 2. Depending on implementation, either one of the access relationships may be implemented.

For simplified illustration purpose, the first access relationship is shown in the figures and the following description is based on the first access relationship. Those skilled in the art can understand the implementation of the second access relationship given the detailed description herein. When an additional security level 304 is added between the security levels 1 and 2, the groups and corresponding keys have to be reassigned without affecting the accessibility to other secured files originally classified. According to one embodiment, the security level 1 is the most restrictive level. Since the added level 304 is less restrictive than the security level 1 but more restrictive than level 2, as shown in FIG. 3A, the added level 304 is thus classified as a new security level 2 308. As a result, the rest of the original security levels, except for the security level 1, are reorganized, creating N+1 levels of security 310 and a new access relationship SF ∀ (GX, level 2, CKX), where GX is a newly authorized group to be permitted to access secured files at the security level 2 with a user key and the newly created clearance key CKX.

To maintain the accessibility of the originally authorized groups, the security levels are renumbered or remapped. If the original access relationship is SF ∀ (G2, level 2, CK2), there is now SF ∀ (G3, level 3, CK2), namely the original security level 2 is mapped to as security level 3.

FIG. 3B and FIG. 3C each illustrate a case in which a security level is folded into another security level. Originally, there are three security levels 320. Now the three security levels 320 are to be folded into two security levels 322 or 324. FIG. 3B shows the security levels 320 being folded up to an immediate next security level above, and FIG. 3C shows the security levels 322 being folded down to an immediate next security level below. In particular, in FIG. 3B, the security level 2 is to be folded into the security level 1, a higher security level. As a result of one security level being folded up, there are now two security levels 322. The authorization (i.e., security parameters) designated for the deleted security level (i.e., security level 2) need be merged with that for the security level 1. In other words, the original access relationships:

SF ∀ (G1, level 1, CK1);

SF ∀ (G2, level 2, CK2);

SF ∀ (G3, level 3, CK3);

are now correspondingly mapped to:

SF ∀ (G1, level 1, CK1, G2, level 2, CK2);

SF ∀ (G3, level 3, CK3).

In other words, those secured files classified at security level 2 can still be accessed by those with proper access privilege.

One the other hand, FIG. 3C shows the security level 2 is being folded to the security level 3. The authorization (i.e., security parameters) designated for the deleted security level (i.e., security level 2) need be merged with that for the security level 3. In other words, the original access relationships:

SF ∀ (G1, level 1, CK1);

SF ∀ (G2, level 2, CK2);

SF ∀ (G3, level 3, CK3);

are now correspondingly mapped to:

SF ∀ (G1, level 1, CK1);

SF ∀ (G3, level 3, CK3, G2, level 2, CK2).

In other words, those secured files classified at security level 2 can still be accessed by those with proper access privilege.

FIG. 4A shows a flowchart or process 400 of inserting a new security level into N security levels according to one embodiment of the present invention. The process 400 can be implemented in software, hardware or both of software and hardware. In a typical application, the process 400 is executed in a security system employed to manage secured files for an enterprise or a group of collaborative business entities.

At 402, the process 400 awaits a request to insert a new security level into N existing security levels. For example, a system was configured to manage secured files classified respectively in accordance with one of N security levels. In other words, there are N security levels in the system. For some reason, the system needs to be configured to manage N+1 security levels, namely a security level is to be added into the N security levels. Upon receiving a request to insert the new security level, the process 400 determines how restrictive the new security level is with respect to the N security level at 404. It is assumed that the 1 st security level in the N security levels is most restrictive while the Nth security level is least restrictive. The relative restrictiveness of the new security level is a relative position in the stack of the N security levels, indicating how less or more restrictive with respect to the 1 st security level or the Nth security level.

At 406, a set of security parameters is generated for the new security level. The security parameters include at least a clearance key and a relative security level (e.g., a tier rank). The clearance key may be respectively generated in accordance with FIG. 2C or FIG. 2D or other means known to those skilled in the art. The clearance key is associated with the new security level, and a group of users are then authorized to access secured files classified at this new security level.

At 408, the new security level is now created in the original N security levels, resulting N+1 security levels. Without implicating the accessibility to secured files classified at other security levels, the security levels below the new security level are mapped accordingly. For example, an ith security level in the original N security levels now becomes an (i+1) security level and the corresponding security parameters are also shifted accordingly. In another perspective, SF ∀ (Gi, level i, CKi) is now SF ∀ (G(i+1), level (i+1), CKi). At 410, a new set of security levels is created, which does not implicate the accessibility to secured files originally classified and the originally authenticated users are still able to access the secured files they are entitled to.

FIG. 4B is provided to further understand FIG. 4A with respect to one embodiment of the present invention and shows that a table 420 include clearance keys, each for a security level. A set of parameters 422 for a new security level X is generated. It is assumed that the new security level X is to be inserted between security levels 1 and 2. The table 424 shows the relative position of the new security level in the original N security levels in a system. The table 426 shows reordering of the security levels to accommodate the new level that is now with a tier rank being 2 and the corresponding clearance keys are respectively associated with their original ranks. As a result, the secured files classified per the original security levels are still accessible.

According to one embodiment, when an authorized user logins into the system, with the login information in reference to a group, the user is granted at least two keys (a corresponding clearance key and a user key) such that the user can access secured files classified at the granted security level or any levels below this security level. According to another embodiment, when an authorized user logins into the system, with the login information in reference to a group, the user is granted all keys pairs the user is entitled to such that the user can access secured files classified at this security level or any levels below this security level. It should be noted that “granting” herein does not necessarily means only that the user receives the keys from the system. Depending on implementation, one or more of the keys or part or whole of the keys may be stored in a local or remote machine and caused to be activated for use only after the user is authenticated.

FIG. 4C shows a flowchart or process 420 of deleting a security level out of N security levels according to one embodiment of the present invention. One of the features of the process 420 is to fold the deleted security level up or down to a next immediate security level so that users originally authorized to access secured files classified at the deleted security level can still access these secured files. The process 420 can be implemented in software, hardware or both of software and hardware. In a typical application, the process 420 is executed in a security system employed to manage secured files for an enterprise or a group of collaborative business entities.

At 422, the process 420 awaits a request to delete a security level out of N existing security levels. For example, a system was configured to manage secured files classified respectively in accordance with one of N security levels. In other words, there are N security levels in the system. For some reason, the system needs to be configured to manage N−1 security levels, namely one of the N security levels is to be deleted. Upon receiving the request to delete, for example, an ith security level, the process 420 determines at 424 whether the ith security level is the most restrictive. It is assumed that the 1st security level in the N security levels is most restrictive while the Nth security level is least restrictive. Accordingly, the process 420 determines at 424 whether the security level to be removed is the 1st security level. If it is indeed the 1st security level, the request is denied.

It should be noted that 424 is not a limitation in the present invention and it can be folded down to a next immediate level. According to one embodiment, it is designed to suit in a more practical situation. In general, it is just not desirable to have a most restrictive security level to be deleted. In some other case, it is also not desirable to have a least restrictive security level to be deleted as well. Optionally, another checking may be employed in the process 420 to determine at 424 whether the security level to be removed is the Nth security level.

Depending on implementation, at 426, the security level to be deleted is to be folded up or down to a next immediate security level. For example, an ith security level to be deleted can be merged with (i−1)th security level or (i+1)th security level. By merging the ith security level with its next immediate security level, it is possible to access those secured files classified at the ith security level even if this level is deleted.

To access those secured files classified at the ith security level, the security parameters, such as the keys and the group designations shall be retained. As a result, at 428, the security parameters for the ith security level are transferred or updated accordingly. In general, for the case of folding up, the security parameters for the ith security level are merged with those for the (i−1)th security level, for the case of folding down, the security parameters for the ith security level are merged with those for the (i+1)th security level. At 430, the security levels are reordered, for example from security levels 1 to N to 1 to (N−1).

FIG. 5A shows an exemplary implementation 500 of dropping an ith level out of N existing levels by folding the ith level to (i—i)th level and may be understood in conjunction with FIG. 5B and FIG. 5C. A table 510 in FIG. 5B shows that there are N security levels labeled as Level 1, 2, . . . , N, where Level 1 is most restricted and Level N is least restricted. A security clearance key is associated with one of the security levels. Each of the security levels may mean literally a type of security, such as “top secret”, “very secret”, . . . “insignificant”. Each of the N security levels is also identified by an identifier. According to one embodiment, the identifier is a sequence of digits (e.g. a hexadecimal number) generated in a system. For example in table 510, the identifier B5C indicates security level 1, and the identifier CD7 indicates security level 4. To facilitate the description of FIG. 5A, it is assumed that the ith security level to be dropped is the security level 4.

At 502, an identifier of the security level above the one being dropped is located, namely the identifier of the (i−1)th security level. According to the table 510, the identifier of the 3rd security level is FF5 (i.e., currentID=FF5). Given the two identifiers FF5 and C07, at 504, these two identifiers are entered in a mapping table at 504. FIG. 5C shows a corresponding mapping table 512 which may be referred to as clearance mapping table, in which two IDs (deletedID and currentD) now have two entries, each being one of the two identifiers.

At 506, the mapping table 512 is updated. There is no operation since there are any entries previously in the table 512. At 508, the user who is previously authorized to access secured files classified at CD7 is updated. According to one embodiment, a notification is sent to the user or users who may have been affected by dropping CD7 to cause the original clearance key (i.e., CK4) to be updated or exchanged with another clearance key (e.g., CD3 for FF5). According to another embodiment, when a secured file classified at CD7 is accessed, the original clearance key is used to access the file. At the time, the file is stored, saved or written back to a storage space, an updated clearance key (i.e., the key for FF5) is effectuated in accordance with CurrentID. In any case, the updating at 508 can be configured to be carried out transparently.

Next, it is assumed that another security level, Level 3, is to be dropped. Accordingly, at 502, the identifier (A92) of the security level above Level 3 is located. At 504, these two identifiers are entered, namely deletedID=FF5 and currentD=A92. At 506, the table 512 needs to be updated. Since there is are entries from a previous deletion of one security level, these entries are preferably updated, thus the CurrentID is assigned to be A92 as well as shown in FIG. 5C. The affected user or users are updated at 508 so that these users can still access the secured files classified at FF5.

FIGS. 5A, 5B and 5C show one exemplary implementation of folding up one deleted security level. Given the detailed description herein, other implementations including those to fold down a deleted security level can be readily developed by those skilled in art.

There are numerous features, advantages and benefits in the present invention. One of them is the mechanism provided to regroup security levels per a specific requirement without implicating the accessibility to secured files classified in accordance with the existing security levels. Another one of them is that a security level can be removed from a set of existing security levels while the security parameters for the security level to be deleted are either folded up or down to an immediate next security level. As a result, the security parameters for the immediate next security level are augmented to include those for the security level to be deleted such that the secured files classified at the security level to be deleted can still be accessed by those with proper clearance levels. Other features, advantages and benefits may be appreciated by those skilled in the art in the foregoing descriptions.

The present invention has been described in sufficient details with a certain degree of particularity. It is understood to those skilled in the art that the present disclosure of embodiments has been made by way of examples only and that numerous changes in the arrangement and combination of parts may be resorted without departing from the spirit and scope of the invention as claimed. Accordingly, the scope of the present invention is defined by the appended claims rather than the foregoing description of embodiments.

Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US42031665 Dec 197713 May 1980International Business Machines CorporationCryptographic file security for multiple domain networks
US473456830 Jul 198629 Mar 1988Toppan Moore Company, Ltd.IC card which can set security level for every memory area
US475753311 Sep 198512 Jul 1988Computer Security CorporationSecurity system for microcomputers
US479622015 Dec 19863 Jan 1989Pride Software Development Corp.Method of controlling the copying of software
US47992587 Feb 198517 Jan 1989National Research Development CorporationApparatus and methods for granting access to computers
US482750814 Oct 19862 May 1989Personal Library Software, Inc.Database usage metering and protection system and method
US48888001 Mar 198819 Dec 1989Hewlett-Packard CompanySecure messaging systems
US497247215 Mar 198520 Nov 1990Tandem Computers IncorporatedMethod and apparatus for changing the master key in a cryptographic system
US503297922 Jun 199016 Jul 1991International Business Machines CorporationDistributed security auditing subsystem for an operating system
US505204025 May 199024 Sep 1991Micronyx, Inc.Multiple user stored data cryptographic labeling system and method
US50581643 May 199015 Oct 1991National Semiconductor Corp.Encryption of streams of addressed information to be used for program code protection
US514466031 Aug 19891 Sep 1992Rose Anthony MSecuring a computer against undesired write operations to or read operations from a mass storage device
US520489714 Jul 199220 Apr 1993Digital Equipment CorporationManagement interface for license management system
US522065715 Apr 199115 Jun 1993Xerox CorporationUpdating local copy of shared data in a collaborative system
US523564112 Mar 199110 Aug 1993Hitachi, Ltd.File encryption method and file cryptographic system
US524757524 Apr 199221 Sep 1993Sprague Peter JInformation distribution system
US527673517 Apr 19924 Jan 1994Secure Computing CorporationData enclave and trusted path system
US530124723 Jul 19925 Apr 1994Crest Industries, Inc.Method for ensuring secure communications
US531970521 Oct 19927 Jun 1994International Business Machines CorporationMethod and system for multimedia access control enablement
US536970218 Oct 199329 Nov 1994Tecsec IncorporatedDistributed cryptographic object method
US537516928 May 199320 Dec 1994Tecsec, IncorporatedCryptographic key management method and apparatus
US54044041 Jul 19934 Apr 1995Motorola, Inc.Method for updating encryption key information in communication units
US54066282 Aug 199311 Apr 1995Bell Communications Research, Inc.Public key authentication and key agreement for low-cost terminals
US541485230 Oct 19929 May 1995International Business Machines CorporationMethod for protecting data in a computer system
US549553329 Apr 199427 Feb 1996International Business Machines CorporationComputing system for managing keys to encrypt/decrypt stored data
US549929720 Dec 199412 Mar 1996Secure Computing CorporationSystem and method for trusted path communications
US550276626 Oct 199326 Mar 1996Secure Computing CorporationData enclave and trusted path system
US553537511 Oct 19949 Jul 1996International Business Machines CorporationComputer
US555776521 Feb 199517 Sep 1996Trusted Information Systems, Inc.System and method for data recovery
US557010815 Dec 199529 Oct 1996Radius Inc.Method and apparatus for display calibration and control
US558402327 Dec 199310 Dec 1996Hsu; Mike S. C.Computer system including a transparent and secure file transform mechanism
US56007226 Oct 19944 Feb 1997Nippon Telegraph & Telephone Corp.System and scheme of cipher communication
US560666315 Nov 199425 Feb 1997Nec CorporationPassword updating system to vary the password updating intervals according to access frequency
US565511912 Feb 19965 Aug 1997Axent Technologies, Inc.Method for moving an open file being accessed by at least one user
US566180627 Mar 199526 Aug 1997France TelecomProcess of combined authentication of a telecommunication terminal and of a user module
US567141228 Jul 199523 Sep 1997Globetrotter Software, IncorporatedLicense management system for software applications
US567331629 Mar 199630 Sep 1997International Business Machines CorporationCreation and distribution of cryptographic envelope
US56779537 Jun 199514 Oct 1997Spyrus, Inc.System and method for access control for portable data storage media
US568045224 Feb 199521 Oct 1997Tecsec Inc.Distributed cryptographic object method
US568498722 Dec 19944 Nov 1997Canon Kabushiki KaishaManagement system of multimedia
US568971830 Jan 199618 Nov 1997Mitsubishi Denki Kabushiki KaishaSystem and method for processing document information using password protected icons that represent document content
US569942816 Jan 199616 Dec 1997Symantec CorporationSystem for automatic decryption of file data on a per-use basis and automatic re-encryption within context of multi-threaded operating system under which applications run in real-time
US57087098 Dec 199513 Jan 1998Sun Microsystems, Inc.Program usage management system
US571540323 Nov 19943 Feb 1998Xerox CorporationSystem for controlling the distribution and use of digital works having attached usage rights where the usage rights are defined by a usage rights grammar
US571775513 Sep 199410 Feb 1998Tecsec,Inc.Distributed cryptographic object method
US572003325 Jul 199517 Feb 1998Lucent Technologies Inc.Security platform and method using object oriented rules for computer-based systems using UNIX-line operating systems
US57297343 Nov 199517 Mar 1998Apple Computer, Inc.In a computer network
US57322652 Nov 199524 Mar 1998Microsoft CorporationStorage optimizing encoder and method
US574557310 Jan 199728 Apr 1998Trusted Information Systems, Inc.Data recovery center
US574873614 Jun 19965 May 1998Mittra; SuvoSystem and method for secure group communications via multicast or broadcast
US57512876 Nov 199512 May 1998Documagix, Inc.System for organizing document icons with suggestions, folders, drawers, and cabinets
US575792013 Mar 199726 May 1998Microsoft CorporationLogon certification
US576515213 Oct 19959 Jun 1998Trustees Of Dartmouth CollegeSystem and method for managing copyrighted electronic media
US57780658 Feb 19967 Jul 1998International Business Machines CorporationMethod and system for changing an authorization password or key in a distributed communication network
US578716928 Dec 199528 Jul 1998International Business Machines Corp.Method and apparatus for controlling access to encrypted data files in a computer system
US578717312 Mar 199728 Jul 1998Tecsec IncorporatedSecure communication system
US578717523 Oct 199528 Jul 1998Novell, Inc.Method and apparatus for collaborative document control
US57907892 Aug 19964 Aug 1998Suarez; LarryMethod and architecture for the creation, control and deployment of services within a distributed computer environment
US579079024 Oct 19964 Aug 1998Tumbleweed Software CorporationElectronic document delivery system in which notification of said electronic document is sent to a recipient thereof
US581300928 Jul 199522 Sep 1998Univirtual Corp.Computer based records management system method
US582193314 Sep 199513 Oct 1998International Business Machines CorporationComputer system
US582587612 Feb 199620 Oct 1998Northern TelecomTime based availability to content of a storage medium
US583559228 Sep 199510 Nov 1998Chang; Chung NanSecure, swift cryptographic key exchange
US583560115 Mar 199510 Nov 1998Kabushiki Kaisha ToshibaFile editing system and shared file editing system with file content secrecy, file version management, and asynchronous editing
US58571898 May 19965 Jan 1999Apple Computer, Inc.File sharing in a teleconference application
US586232527 Sep 199619 Jan 1999Intermind CorporationComputer-based communication system and method using metadata defining a control structure
US58704681 Mar 19969 Feb 1999International Business Machines CorporationEnhanced data privacy for portable computers
US587047729 Sep 19949 Feb 1999Pumpkin House IncorporatedEnciphering/deciphering device and method, and encryption/decryption communication system
US588128725 Mar 19979 Mar 1999Mast; Michael B.Method and apparatus for copy protection of images in a computer system
US589290030 Aug 19966 Apr 1999Intertrust Technologies Corp.Systems and methods for secure transaction management and electronic rights protection
US58930844 Oct 19966 Apr 1999Gemini Systems, Inc.Method for creating specific purpose rule-based n-bit virtual machines
US589878110 Sep 199727 Apr 1999Tecsec IncorporatedDistributed cryptographic object method
US592207327 Dec 199613 Jul 1999Canon Kabushiki KaishaSystem and method for controlling access to subject data using location data associated with the subject data and a requesting device
US59237542 May 199713 Jul 1999Compaq Computer CorporationCopy protection for recorded media
US59334985 Nov 19973 Aug 1999Mrj, Inc.System for controlling access and distribution of digital property
US59447942 Oct 199531 Aug 1999Kabushiki Kaisha ToshibaUser identification data management scheme for networking computer systems using wide area network
US59534196 May 199614 Sep 1999Symantec CorporationCryptographic file labeling system for supporting secured access by multiple users
US596817714 Oct 199719 Oct 1999Entrust Technologies LimitedMethod and apparatus for processing administration of a secured community
US597050223 Apr 199619 Oct 1999Nortel Networks CorporationMethod and apparatus for synchronizing multiple copies of a database
US598744022 Jul 199716 Nov 1999Cyva Research CorporationPersonal information security and exchange tool
US599187923 Oct 199723 Nov 1999Bull Hn Information Systems Inc.Method for gradual deployment of user-access security within a data processing system
US59999076 Dec 19937 Dec 1999Donner; Irah H.Intellectual property audit system
US601473018 Dec 199711 Jan 2000Nec CorporationDynamic adding system for memory files shared among hosts, dynamic adding method for memory files shared among hosts, and computer-readable medium recording dynamic adding program for memory files shared among hosts
US602350628 Oct 19968 Feb 2000Hitachi, Ltd.Data encryption control apparatus and method
US603221611 Jul 199729 Feb 2000International Business Machines CorporationParallel file system with method using tokens for locking modes
US603832220 Oct 199814 Mar 2000Cisco Technology, Inc.Group key distribution
US604415523 Dec 199728 Mar 2000Microsoft CorporationMethod and system for securely archiving core data secrets
US605531422 Mar 199625 Apr 2000Microsoft CorporationSystem and method for secure purchase and delivery of video content programs
US605842417 Nov 19972 May 2000International Business Machines CorporationSystem and method for transferring a session from one application server to another without losing existing resources
US606179024 Feb 19979 May 2000Starfish Software, Inc.Network computer system with remote user data encipher methodology
US60699577 Mar 199730 May 2000Lucent Technologies Inc.Method and apparatus for providing hierarchical key system in restricted-access television system
US608532314 Apr 19974 Jul 2000Kabushiki Kaisha ToshibaInformation processing system having function of securely protecting confidential information
US608871731 Aug 199811 Jul 2000Onename CorporationComputer-based communication system and method using metadata defining a control-structure
US608880513 Feb 199811 Jul 2000International Business Machines CorporationSystems, methods and computer program products for authenticating client requests with client certificate information
US609805624 Nov 19971 Aug 2000International Business Machines CorporationSystem and method for controlling access rights to and security of digital content in a distributed information system, e.g., Internet
US610150710 Feb 19988 Aug 2000Connected CorporationFile comparison for data backup and file synchronization
US610513126 Nov 199715 Aug 2000International Business Machines CorporationSecure server and method of operation for a distributed information system
US61226308 Jun 199919 Sep 2000Iti, Inc.Bidirectional database replication scheme for controlling ping-ponging
US613432724 Oct 199717 Oct 2000Entrust Technologies Ltd.Method and apparatus for creating communities of trust in a secure communication system
US7362868 *20 Oct 200022 Apr 2008Eruces, Inc.Hidden link dynamic key manager for use in computer systems with database structure for storage of encrypted data and method for storage and retrieval of encrypted data
JP2006244044A * Title not available
Non-Patent Citations
Reference
1"Affect," The American Hertage Dictionary of the English Language, Fourth Edition, Houghton Mifflin Company, 2002. Retrieved May 4, 2006 from http://dictionary.reference.com/search?q=affect.
2"Encryping File System," from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.
3"Features of EFS" from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.
4"How EFS work," from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.
5"Inside Encryping file system," Part 1, from MSDN Oct. 2001, version, exact publication date is unknown but believed prior to Dec. 12, 2001.
6"Inside Encryping file system," Part 2, from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.
7"Security Options". Dec. 20, 2001. DC & Co. pp. 1-2.
8"Security with Encryping File System," from MSDN Oct. 2001 version, exact publication date is unknown but believed prior to Dec. 12, 2001.
9"Windows 2000 EFS" in the Apr. 1999 issue of Windows NT magazine.
10A 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 Rajkurmar.
11Adobe Acrobat 5.0 Classroom in a Book, Adobe Press, Jun. 26, 2001, pp. 1-4.
12Adobe Acrobat Security Settings, Acrobat 7.0, Nov. 15, 2004, pp. 1-4.
13Boneh et al., "Hierarchical Identity Based Encryption with Constant Size Ciphertext," Advances in Cryptology-EUROCRYPT 2005, vol. 3493, Jun. 20, 2005, pp. 440-456.
14Boneh et al., "IBE Secure E-Mail," Stanford University, Apr. 8, 2002.
15Boneh et al., "Hierarchical Identity Based Encryption with Constant Size Ciphertext," Advances in Cryptology—EUROCRYPT 2005, vol. 3493, Jun. 20, 2005, pp. 440-456.
16Crocker, Steven Toye, "Effectuating access policy changes to designated places for secured files," U.S. Appl. No. 10/259,075, filed Sep. 27, 2002.
17Crocker, Steven Toye, "Multi-level cryptographic transformations for securing digital assets," U.S. Appl. No. 10/404,566,, filed Mar. 31, 2003.
18Examination Report, completion date Jun. 18, 2008, for European Patent Application No. EP 02 258 532.7-1244, 6 pgs.
19Expiration Mechanism for Chipcards, IBM Technical Disclosure Bulletin, Oct. 1, 2001, UK.
20 *IBM Technical Disclosure bulletin; Oct. 2001 UK; Expiration mechanism for chipcards.
21Kenrich, Michael Frederick, "Multi-Level File Digest", U.S. Appl. No. 10/894,493, filed Jul. 19, 2004.
22Kinghorn, Gary Mark, "Method and system for protecting electronic data in enterprise environment," U.S. Appl. No. 10/159,220, filed May 31, 2002.
23McDaniel et al. "Antigone: A Flexible Framework for Secure Group Communication," Proceedings of the 8th USENIX Security Symposium, Aug. 23, 1999.
24Microsoft Press Computer Dictionary, 1997, Microsoft Press, Third Edition, p. 426.
25Microsoft Windows 200 server. Windows 2000 Group Policy White Paper, 2000.
26Nath, Satyajit, "Method and system for securing digital assets using content type designations," U.S. Appl. No. 10/405,587, filed Apr. 1, 2003.
27Office Action, dated Dec. 5, 2006, for European Patent Application No. 02258532.7, 5 pgs.
28Office Action, dated May 10, 2005, for European Patent Application No. 02258532.7, 5 pgs.
29Prakash, Nalini J., "Method and apparatus for securiting/unsecuring files crawling," U.S. Appl. No. 10/325,102, filed Dec. 20, 2002.
30Rossmann, Alain, "Hybrid systems for securing digital assets," U.S Appl. No. 10/325,013, filed Dec. 20, 2002.
31Search Report, completion date Apr. 14, 2005, for European Patent Application No. EP 02 25 8533, 2 pages.
32Search Report, completion date Jul. 6, 2005, for European Patent Application No. EP 02 25 8529, 4 pages.
33Search Report, completion date Mar. 16, 2005, for European Patent Application No. EP 02 25 8534, 2 pages.
34Search Report, completion date Mar. 2, 2005, for European Patent Application No. EP 02 25 8535, 2 pages.
35Search Report, completion date Mar. 3, 2005, for European Patent Application No. EP 02 25 8537, 2 pages.
36Search Report, completion date May 12, 2005, for European Patent Application No. EP 02 25 8539, 2 pages.
37Search Report, completion date May 8, 2003, for European Patent Application No. EP 02 25 8530, 2 pages.
38Search Report, completion date May 8, 2003, for European Patent Application No. EP 02 25 8540, 2 pages.
39Search Report, completion date Oct. 2, 2003, for European Patent Application No. EP 02 25 8531, 2 pages.
40Search Report, completion date Oct. 8, 2003, for European Patent Application No. EP 02 25 8536, 2 pages.
41Stallings, William, "Cryptography and Network Security: Principles and Practice" 1999, pp. 333-337, Second Edition, Prentice Hall, Upper Saddle River, New Jersey.
42Symantec. Norton Antivirus Corporate Edition Implementation Guide, 1999.
43U.S. Appl. No. 10/028,397, entitled "Method and system for resisting use of a clipboard application," inventor Zuili, Dec. 21, 2001, 38 pgs.
44U.S. Appl. No. 10/074,194, entitled "Methods for identifying compunds that inhibit or reduce PTP1B expressions" inventor Rondinone, Feb. 12, 2002, 69 pgs.
45U.S. Appl. No. 10/074,804, entitled "Secured Data Format for Access Control," inventor Garcia, Feb. 12, 2002, 108 pgs.
46U.S. Appl. No. 10/074,825, entitled "Method and Apparatus for Accessing Secured Electronic Data Off-line, " inventor Lee et al., Feb. 12, 2002, 108 pgs.
47U.S. Appl. No. 10/074,996, entitled "Method and Apparatus for Securing Electronic Data," inventor Lee et al., Feb. 12, 2002, 111 pgs.
48U.S. Appl. No. 10/075,194, entitled "System and Method for Providing Multi-location Access Management to Secured Items," inventor Vainstein et al., Feb. 12, 2002, 110 pgs.
49U.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., Mar. 20, 2002, 86 pgs.
50U.S. Appl. No. 10/186,203, entitled "Method and System for Implementing Changes to Security Policies in a Distributed Security System," inventor Huang, Jun. 26, 2002, 65 pgs.
51U.S. Appl. No. 10/201,756, entitled "Managing Secured Files in Designated Locations," inventor Alain, Jul. 22, 2002, 121 pgs.
52U.S. Appl. No. 10/206,737, entitled "Method and System for Updating Keys in a Distributed Security System," inventor Hildebrand, Jul. 26, 2002, 60 pgs.
53U.S. Appl. No. 10/242,185, entitled "Method and system for protecting encrypted files transmitted over a network " inventor Ryan, Sep. 11, 2002, 23 pgs.
54U.S. Appl. No. 10/246,079, entitled "Security System for Generating Keys from Access rules in a Decentralized Manner and Methods Therefor," inventor Hildebrand, Sep. 17, 2002, 78 pgs.
55U.S. Appl. No. 10/259,075, entitled "Effectuating Access Policy Changes to Designated Places for Secured Files," inventor Crocker, Sep. 27, 2002, 60 pgs.
56U.S. Appl. No. 10/286,524, entitled "Security system that uses indirect password-based encryption, " inventor Gutnik, Nov. 1, 2002, 38 pgs.
57U.S. Appl. No. 10/286,575, entitled "Method and Architecture for Providing Acess to Secured Data from Non-Secured Clients," inventor Vainstein, Nov. 1, 2002, 46 pgs.
58U.S. Appl. No. 10/295,363, entitled "Security System Using Indirect Key Generation from Access Rules and Methods Therefor," inventor Vainstein, Nov. 15, 2002, 70 pgs.
59U.S. Appl. No. 10/327,320, entitled "Security system with staging capabilities" inventor Vainstein, Dec. 20, 2002, 39 pgs.
60U.S. Appl. No. 10/368,277, entitled "Method and apparatus for uniquely identifying files," inventor Ouye, Feb. 18, 2003, 25 pgs.
61U.S. Appl. No. 10/448,806, entitled "Method and System for Using Remote Headers to Secure Electronic Files" inventor Ryan, May 30, 2003, 35 pgs.
62U.S. Appl. No. 10/610,832, entitled "Method and system for enabling users of a group shared across multiple security systems to access secured files" inventor Ryan, Jun. 30, 2003, 33 pgs.
63U.S. Appl. No. 10/642,041, entitled "Method and system for fault-tolerant transfer of files across a network" inventor Kenrich, Aug. 15, 2003, 32 pgs.
64U.S. Appl. No. 10/889,685, entitled "Method and Apparatus for Controlling the Speed Ranges of a Machine" inventor Thomas, Jul. 13, 2004, 18 pgs.
65U.S. Appl. No. 11/889,310, entitled "Methods and Systems for Providing Access Control to Electronic Data, " inventor Rossmann, Aug. 10, 2007, 90 pgs.
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US8068811 *31 Jul 200629 Nov 2011Fujitsu Toshiba Mobile Communications LimitedMobile communication terminal device
US821982224 Oct 200510 Jul 2012Anakam, Inc.System and method for blocking unauthorized network log in using stolen password
US82965621 May 200923 Oct 2012Anakam, Inc.Out of band system and method for authentication
US85280782 Jul 20073 Sep 2013Anakam, Inc.System and method for blocking unauthorized network log in using stolen password
US853379119 Jun 200810 Sep 2013Anakam, Inc.System and method for second factor authentication services
US20100100967 *29 May 200922 Apr 2010Douglas James ESecure collaborative environment
Classifications
U.S. Classification705/57, 705/50, 380/228, 705/51, 380/200, 705/64, 705/71, 705/75, 713/166, 380/202, 705/52, 380/201, 705/58
International ClassificationH04L9/08, H04L29/06, G06F12/00, G06F21/24, G06F12/14, G09C1/00, G06F21/20, H04L9/32, G06F21/00
Cooperative ClassificationH04L67/42, G06F2221/2111, G06F2221/2107, H04L63/105, G06F21/6227, G06F21/6209, H04L63/04, G06F2221/2137, H04L63/102, H04L63/08, G06F2221/2141, G06F2221/2113, H04L63/12
European ClassificationG06F21/62B1, G06F21/62A, H04L63/12, H04L63/04, H04L63/08, H04L63/10D, H04L29/06C8
Legal Events
DateCodeEventDescription
18 Jun 2013ASAssignment
Effective date: 20130304
Owner name: INTELLECTUAL VENTURES I LLC, DELAWARE
Free format text: MERGER;ASSIGNOR:GUARDIAN DATA STORAGE, LLC;REEL/FRAME:030638/0219
4 Oct 2012FPAYFee payment
Year of fee payment: 8
19 Apr 2011CCCertificate of correction
16 Nov 2007ASAssignment
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PSS SYSTEMS, INC.;REEL/FRAME:020121/0848
Effective date: 20070124
Owner name: GUARDIAN DATA STORAGE, LLC, DELAWARE
Free format text: CHANGE OF NAME;ASSIGNOR:PERVASIVE SECURITY SYSTEMS, INC.;REEL/FRAME:020123/0240
Owner name: PSS SYSTEMS, INC., CALIFORNIA
Effective date: 20030228
15 Nov 2007ASAssignment
Owner name: SECRETSEAL INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ROSSMANN, ALAIN;ZUILI, PATRICK;OUYE, MICHAEL MICHIO;AND OTHERS;SIGNING DATES FROM 20020212 TO 20020305;REEL/FRAME:020120/0817
Owner name: PERVASIVE SECURITY SYSTEMS, INC., DELAWARE
Free format text: CHANGE OF NAME;ASSIGNOR:SECRETSEAL INC.;REEL/FRAME:020120/0883
Effective date: 20020603