|Publication number||US7346769 B2|
|Application number||US 10/692,142|
|Publication date||Mar 18, 2008|
|Filing date||Oct 23, 2003|
|Priority date||Oct 23, 2003|
|Also published as||US8140857, US8364980, US8683223, US20050091499, US20080168277, US20120117388, US20130073868|
|Publication number||10692142, 692142, US 7346769 B2, US 7346769B2, US-B2-7346769, US7346769 B2, US7346769B2|
|Inventors||Randolph Michael Forlenza, Viktors Berstis|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (7), Referenced by (56), Classifications (10), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention provides a method and system for protecting and securing electronic documents and in particular to a method and system for selectively concealing portions of a document while leaving the remaining portions of the document unchanged.
The present day computer systems can enable a user to create various types of documents. These documents can contain text, graphics, images or a combination of each. Many times the creator of a document for various reasons desires to keep secret the contents of a document. Often times the secrecy is for security reasons. In many businesses, various types of documents that exist on computer systems contain confidential information that can be related to the company's trade secrets and business strategies. Most technology related companies maintain much of their research and product development information on computer systems that are protected by elaborate security systems. Governmental agencies also maintain much of their documented information on a confidential basis. Even individuals keep important records and other information in confidential files.
Often, it is necessary to share documentation that contains confidential information with persons. Presently, there are various ways to secure the documents and prevent unauthorized persons from viewing the contents of a document. One way to protect documents is zip the document in a secured file that can be password protected. In this approach, when someone desires to access the document, that person must first submit the proper password. If the password is correct, the document is retrieved and displayed for the requesting viewer. During transmission of a document over a computing network such as the Internet, the document can be attached to an electronic message and transmitted with the message. The receiver of the message can download the attachment and with the proper password, retrieve the attached and secured document.
In other situations, a person must show that they have authority to access a computing network from which one can access certain confidential information. These systems typically exist in financial settings such as accessing bank or credit accounts.
A third technique used today to secure the contents of a document is to encrypt the document contents. In this approach, the document would be encrypted and stored by the document creator. To access the document, one would need to have the proper decryption key(s). In many cases, the documents would be transmitted over a computing network to a destination location. The encryption would serve to secure the document during the transmission of the document over the network. Again, at the destination location, decryption would occur using the appropriate decryption keys.
One disadvantage is that the current document security systems are all or nothing propositions. With reference to document encryption, today, the only known means of encrypting certain elements of a document is to encrypt the entire document. Encryption currently may be accomplished only during a transmission (HTTPS) or permanently (via RSC, for example). Regardless, the entire document is encrypted. The drawback to this approach is that encryption imposes a serious performance impact and usability impact. HTTPS transmissions, for example, are in the neighborhood of 20%-30% slower than decrypted HTTP transmissions. Similarly, encrypting an entire document locally is costly, especially when only certain parts of the document (for example, personal user name, telephone, address, and credit card numbers in an order) actually need the security that encryption provides. Furthermore, the process of encrypting the document is usually inconvenient, at best, requiring the user isolate it as a separate file and then invoking a suitable tool for encrypting it.
As mentioned, currently, document security is an all or nothing task. There remains a need for a document security system in which a user could select only specified portions of a document for concealment, while displaying other portions unconcealed portions of the document.
It is an objective of the present invention to provide a method for selectively concealing portions of a document.
It is a second objective of the present invention to provide a method for concealment of selective portions of a document through encryption techniques.
It is a third objective of the present invention is to provide a method for securing the confidential contents of a document through selective concealment of the confidential contents.
It is a fourth objective of the present invention is to provide for selective decryption of encrypted sections of a document.
The present invention allows the user (author or creator) of a document to select certain portions of a document for concealment while other portions of the document remain displayed as created. The user would use a standard word processing editor technique to highlight (or swipe) portions of a document that the user desires to be concealed. The highlighted area would then be ‘tagged’ with a surrounding attribute indicating to the word processor that highlighted area is to be concealed. This process is similar to the existing word processor capability to highlight areas on a document and then assign rich text attributes, such as BOLD, ITALICS, etc., to those areas. The concealed areas could then be dispositioned in at least two formats:
One format could be document encryption. In this method, the selected areas could be encrypted in place. I.e., the target areas are encrypted and stored within the document itself. When the document is displayed if the appropriate decryption keys are offered, the encrypted areas are converted back to text and displayed as they were originally written. If the decryption keys are not offered or are incorrect, the target areas are displayed as gibberish to maintain placement of objects in the surrounding parts of the document or a message or graphic is substituted indicating decryption failed. In addition, when a section is not decrypted, an alternative method of displaying that section is to show a box for entering a decryption key and a button to press to activate the decryption process.
In a second approach, the target areas are detected from the host document and stored as an appendage (extended attribute) to the host document. This could be accomplished in the same manner that OS/2, DOS, and Windows systems do via formatted extended attribute file extensions. It could also be accomplished by wrapping the extracted encrypted area in GML-like tags, such as XML wrappers, which indicate to the word processor that the attachments require decryption to be viewable. In this case, the host document would contain placeholders where the extracted encrypted area was removed. In turn, the encrypted areas stored externally would contain (GML or XML, etc.) escape sequences or tags that indicate to the word processor where the extracted areas reside within the host document. Both of the methods described above and other possible embodiments require that the encryption methodology used be identified such that the word processor can determine that is necessary to first encrypt and then to later decrypt the targeted areas. Both of the methods described above and other possible embodiments require that the encryption methodology used be identified such that the word processor can determine that is necessary to first encrypt and then to later decrypt the targeted areas.
A third approach could be an alternative version of the second approach. In this approach, the target areas are extracted from the host document and stored as an appendage (extended attribute) to the host document as with the second method. The document would also contain placeholders to indicate where the extracted area was removed from the document. In turn, the extracted areas stored externally would contain escape sequences or tags that indicate to the word processor where the extracted areas reside within the host document. The appendage would be protected and could only be accessed by demonstrating proper authorization. An authorization process could be used to supply a proper password.
This methodology of the present invention could be extended for transmission purposes as well. For example, rather than encrypting an entire document (via HTTPS, for example) during transmission, the transmission function could be enhanced to transmit the body of the host document (or file) and then search for an extended attribute (appendage) entity which indicated that encryption is required. If such an appendage were located, it would be encrypted for transmission. At the receiving end of the transmission, the process would detect any appendage to the message. The encrypted sections in the appendage would then be decrypted as soon as the reader provides the proper key or keys. This process can be accomplished completely transparent to both the sender and the recipient.
The present invention uses encryption techniques to conceal selective portions of a document. These encryption schemes transform data into a format that is readable when decrypted using predetermined decryption keys. User authentication and Data Encryption schemes provide the ability to authenticate, encrypt and decrypt certain information. This present invention can implement a public key/private key encryption scheme to protect data as it is displayed or as it traverses across public networks.
Symmetric, or private key, encryption (also known as conventional encryption) is based on a secret key that is shared by both communicating parties. The sending party uses the secret key as part of the mathematical operation to encrypt (or encipher) plaintext to ciphertext. The receiving party uses the same secret key to decrypt (or decipher) the ciphertext to plaintext. Examples of symmetric encryption schemes are the RSA RC4 algorithm (which provides the basis for Microsoft Point-to-Point Encryption (MPPE), Data Encryption Standard (DES), the International Data Encryption Algorithm (IDEA), and the Skipjack encryption technology proposed by the United States government (and implemented in the Clipper chip).
Asymmetric or public key encryption uses two different keys for each user: one key is a private key known only to the user to which the key pair belongs; the other is a corresponding public key, which is accessible to anyone. The encryption algorithm mathematically relates the private and public keys. One key is used for encryption and the other for decryption, depending on the nature of the communication service being implemented. In addition, public key encryption technologies allow digital signatures to be placed on messages. A digital signature uses the sender's private key to encrypt some portion of the message. When the message is received, the receiver uses the sender's public key to decipher the digital signature as a way to verify the sender's identity and the integrity of the message.
With symmetric encryption, both the sender and receiver have a shared secret key. The distribution of the secret key must occur (with adequate protection) prior to any encrypted communication. However, with asymmetric encryption, the sender uses the recipient's public key to encrypt or digitally sign messages, while the receiver uses their key to decipher these messages. The public key can be freely distributed to anyone who needs to encrypt messages to the owner of the public key or to verify digitally signed messages by the private key that corresponds to the public key. The owner of the key pair only needs to carefully protect the private key.
To secure the integrity of the public key, the public key is published with a certificate. A certificate (or public key certificate) is a data structure that is digitally signed by a certificate authority (CA). The CA is an authority that users of the certificate can trust. The certificate contains a series of values, such as the certificate name and usage, information identifying the owner of the public key, the public key itself, an expiration date, and the name of the certificate authority. The CA uses its private key to sign the certificate. If the receiver knows the public key of the certificate authority, the receiver can verify that the certificate is indeed from the trusted CA, and therefore contains reliable information and a valid public key. Certificates can be distributed electronically (via Web access or e-mail), on smart cards, or in an LDAP database. Public key certificates provide a convenient, reliable method for verifying the identity of a sender. IPSec can optionally use this method for end-to-end authentication.
A public and private key pair is a unique association of key values wherein one key can encrypt information and the other can decrypt. For example, the public key can encrypt data and only the corresponding private key can decrypt the data. Public and private keys are used for signing and sending encrypted messages. A public key is typically made available to users on a global computer network (the Internet) within a certificate stored in a publicly accessible Lightweight Directory Application Protocol (LDAP) directory. The associated private key is kept in confidence by the entity, such as the person or cooperation that owns the key pair.
With reference now to
After receiving the encryption key, during this encryption process, step 22, the highlighted portion of the document would be encrypted using the encryption routines available for that word processor. Following the encryption process, in step 23, the document is displayed containing encrypted portions. In an alternative approach, the encrypted section may not be shown as gibberish to the author but rather optionally modified in some other way to indicate that the section is encrypted. For example the encrypted section might have fine diagonal red lines drawn under the text. Also, when a reader decrypts a section, it might not turn into simple black on white text, but again may be displayed in a unique manner to show that it was a section that was encrypted and warn the reader that this section should be treated carefully. A situation where this precaution may be needed is when someone is hovering over the reader's shoulder trying to also read the screen.
When there is an attempt to access an encrypted portion of the document, step 45 detects the attempt to access that encrypted portion. In step 46, there is a determination of whether the user attempting the access has proper authority to view that portion of the document. In this determination, the requestor must provide the correct key to initiate a decryption of the encrypted contents that the requestor wants to access. If the requestor has the correct key, the decryption of the encrypted contents occurs. If the decryption process is successful, the method moves to step 47, which displays the contents of the encrypted portion as part of the document. If in step 46, there is a determination that the user attempting the access does not have authority to view the document, the method moves to step 48 where the access attempt is rejected and only the unencrypted portions of the document are displayed to the requester.
As described in
As previously mentioned, the documents with encrypted contents may be transmitted across computing networks such as the one illustrated in
Still referring to
Gateway server 74 is preferably an individual computer or Intelligent Work Station (IWS), which serves to link Local Area Network (LAN) 63 to Local Area Network (LAN) 62. As discussed above with respect to Local Area Network (LAN) 62 and Local Area Network (LAN) 62, a plurality of data processing procedures or documents may be stored within storage device 70 and controlled by mainframe computer 68, as Resource Manager or Library Service for the data processing procedures and documents thus stored. Of course, those skilled in the art will appreciate that mainframe computer 68 may be located a great geographical distance from Local Area Network (LAN) 62 and similarly Local Area Network (LAN) 62 may be located a substantial distance from Local Area Network (LAN) 65. That is, Local Area Network (LAN) 65 may be located in California while Local Area Network (LAN) 62 may be located within Texas and mainframe computer 68 may be located in New York.
When there is an attempt to access an encrypted portion of the document, step 91 detects a request to access the encrypted portion. In step 92, there is a determination of whether the requestor has proper authority to view the document. As in the method of
As the document is displayed, as any encrypted section is encountered, the displaying software would try to decrypt the encrypted section with each of the previously entered encryption keys until one successfully decrypts the section. If none of them succeeds in decrypting the section, the user would be prompted to add yet another decryption key to his list (that would presumably work for this section.) The way the system could tell whether a decryption was successful or not would be to include a known string to every section to be encrypted. Then, on decryption, if the added string does not turn into the known string, then the decryption would be considered a failure, which would then cause the system to try a different key from the list entered by the user. The encryption keys should be of sufficient length and methods used for encryption be sufficiently strong to avoid any possibility of using these multiply encrypted copies to discover the encoded text or any of the keys by an outside party. Also, if one party knows the text because he has one of the keys, the techniques should not make it possible to permit that user to discover any of the other keys. One way to help prevent this is to have a different random string appended to each text copy before it is encrypted. This random string is discarded after decryption.
Furthermore, if a section of the document is supposed to be decryptable with more than one key, then multiple copies of that section would be included in the document file, each copy encrypted with a different key. There would of course be some tag information that indicated that the particular section is duplicated and encrypted with different keys. This would be used to have some parts of the document encrypted for department A viewing, for example, and other non-disjoint parts for viewing by department B.
It is important to note that while the present invention has been described in the context of a fully functioning data processing system, those skilled in the art will appreciate that the processes of the present invention are capable of being distributed in the form of instructions in a computer readable medium and a variety of other forms, regardless of the particular type of medium used to carry out the distribution. Examples of computer readable media include media such as EPROM, ROM, tape, paper, floppy disc, hard disk drive, RAM, and CD-ROMs and transmission-type of media, such as digital and analog communications links.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5157763 *||Jul 30, 1991||Oct 20, 1992||International Business Machines Corporation||Visually assisted method for transfer of data within an application or from a source application to a receiving application|
|US5212784 *||Oct 22, 1990||May 18, 1993||Delphi Data, A Division Of Sparks Industries, Inc.||Automated concurrent data backup system|
|US5267313 *||Jul 20, 1992||Nov 30, 1993||Laurel Intelligent Systems, Co., Ltd.||File security system|
|US5673316||Mar 29, 1996||Sep 30, 1997||International Business Machines Corporation||Creation and distribution of cryptographic envelope|
|US6339825||Jul 18, 2001||Jan 15, 2002||Authentica, Inc.||Method of encrypting information for remote access while maintaining access control|
|US6345256||Dec 1, 1998||Feb 5, 2002||International Business Machines Corporation||Automated method and apparatus to package digital content for electronic distribution using the identity of the source content|
|US6449721||Nov 1, 2001||Sep 10, 2002||Authentica Security Technologies, Inc.||Method of encrypting information for remote access while maintaining access control|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7523309||Jun 27, 2008||Apr 21, 2009||International Business Machines Corporation||Method of restricting access to emails by requiring multiple levels of user authentication|
|US7703036||Sep 30, 2004||Apr 20, 2010||Microsoft Corporation||User interface for displaying selectable software functionality controls that are relevant to a selected object|
|US7707255||May 19, 2004||Apr 27, 2010||Microsoft Corporation||Automatic grouping of electronic mail|
|US7716593||May 21, 2004||May 11, 2010||Microsoft Corporation||Conversation grouping of electronic mail records|
|US7739259||May 9, 2006||Jun 15, 2010||Microsoft Corporation||Integrated search and find user interface|
|US7747966||Sep 30, 2004||Jun 29, 2010||Microsoft Corporation||User interface for providing task management and calendar information|
|US7870386||Apr 29, 2004||Jan 11, 2011||International Business Machines Corporation||Method for permanent decryption of selected sections of an encrypted document|
|US7886290||Jun 16, 2005||Feb 8, 2011||Microsoft Corporation||Cross version and cross product user interface|
|US7895531||Jun 13, 2005||Feb 22, 2011||Microsoft Corporation||Floating command object|
|US7917771||Jun 9, 2008||Mar 29, 2011||International Business Machines Corporation||Method for selective encryption within documents|
|US8117542||Sep 30, 2004||Feb 14, 2012||Microsoft Corporation||User interface for displaying selectable software functionality controls that are contextually relevant to a selected object|
|US8150930||Apr 5, 2010||Apr 3, 2012||Microsoft Corporation||Automatic grouping of electronic mail|
|US8201103||Jun 29, 2007||Jun 12, 2012||Microsoft Corporation||Accessing an out-space user interface for a document editor program|
|US8239882||Aug 30, 2005||Aug 7, 2012||Microsoft Corporation||Markup based extensibility for user interfaces|
|US8255828||Sep 30, 2004||Aug 28, 2012||Microsoft Corporation||Command user interface for displaying selectable software functionality controls|
|US8302014||Jun 11, 2010||Oct 30, 2012||Microsoft Corporation||Merging modifications to user interface components while preserving user customizations|
|US8332350||Mar 29, 2010||Dec 11, 2012||Titus Inc.||Method and system for automated security access policy for a document management system|
|US8359659 *||Jun 24, 2005||Jan 22, 2013||Creative Technology Ltd||Method and apparatus for protecting private information on a user apparatus|
|US8364980||Jan 13, 2012||Jan 29, 2013||International Business Machines Corporation||System for selective encryption within documents|
|US8402096||Jun 24, 2008||Mar 19, 2013||Microsoft Corporation||Automatic conversation techniques|
|US8407805||Mar 2, 2010||Mar 26, 2013||Titus Inc.||Method and system for classifying and redacting segments of electronic documents|
|US8484578||Jun 27, 2008||Jul 9, 2013||Microsoft Corporation||Communication between a document editor in-space user interface and a document editor out-space user interface|
|US8543606||Dec 10, 2012||Sep 24, 2013||Titus Inc.||Method and system for automated security access policy for a document management system|
|US8549621 *||Dec 21, 2010||Oct 1, 2013||Canon Kabushiki Kaisha||Client apparatus and a method therefor|
|US8605090||Jun 1, 2006||Dec 10, 2013||Microsoft Corporation||Modifying and formatting a chart using pictorially provided chart elements|
|US8627222||May 9, 2006||Jan 7, 2014||Microsoft Corporation||Expanded search and find user interface|
|US8638333||Oct 6, 2009||Jan 28, 2014||Microsoft Corporation||Modifying and formatting a chart using pictorially provided chart elements|
|US8683223||Nov 15, 2012||Mar 25, 2014||International Business Machines Corporation||Selective encryption within documents|
|US8762880||Jun 27, 2008||Jun 24, 2014||Microsoft Corporation||Exposing non-authoring features through document status information in an out-space user interface|
|US8799353||Mar 30, 2009||Aug 5, 2014||Josef Larsson||Scope-based extensibility for control surfaces|
|US8799808||May 21, 2004||Aug 5, 2014||Microsoft Corporation||Adaptive multi-line view user interface|
|US8832445 *||Feb 25, 2005||Sep 9, 2014||Blackberry Limited||System and method for handling secure messages|
|US8839139||May 11, 2010||Sep 16, 2014||Microsoft Corporation||User interface for providing task management and calendar information|
|US8869299||Apr 6, 2010||Oct 21, 2014||Titus Inc.||Method and system for generating trusted security labels for electronic documents|
|US8887301||Mar 21, 2013||Nov 11, 2014||Titus Inc.||Method and system for classifying and redacting segments of electronic documents|
|US8904185 *||Nov 10, 2004||Dec 2, 2014||International Business Machines Corporation||Presence sensing information security|
|US9015621||Feb 17, 2009||Apr 21, 2015||Microsoft Technology Licensing, Llc||Command user interface for displaying multiple sections of software functionality controls|
|US9015624||Feb 15, 2011||Apr 21, 2015||Microsoft Corporation||Floating command object|
|US9046983||May 12, 2009||Jun 2, 2015||Microsoft Technology Licensing, Llc||Hierarchically-organized control galleries|
|US9059838 *||Mar 30, 2007||Jun 16, 2015||Verizon Patent And Licensing Inc.||Encryption algorithm with randomized buffer|
|US9098473||May 4, 2012||Aug 4, 2015||Microsoft Technology Licensing, Llc||Accessing an out-space user interface for a document editor program|
|US9098837||Feb 9, 2008||Aug 4, 2015||Microsoft Technology Licensing, Llc||Side-by-side shared calendars|
|US20040268270 *||Jun 26, 2003||Dec 30, 2004||Microsoft Corporation||Side-by-side shared calendars|
|US20050004989 *||May 19, 2004||Jan 6, 2005||Microsoft Corporation||Automatic grouping of electronic mail|
|US20050004990 *||May 21, 2004||Jan 6, 2005||Microsoft Corporation||Conversation grouping of electronic mail records|
|US20050246526 *||Apr 29, 2004||Nov 3, 2005||International Business Machines Corporation||Method for permanent decryption of selected sections of an encrypted document|
|US20050246540 *||Feb 25, 2005||Nov 3, 2005||Brown Michael S||System and method for handling secure messages|
|US20060036946 *||Jun 13, 2005||Feb 16, 2006||Microsoft Corporation||Floating command object|
|US20060069604 *||Sep 30, 2004||Mar 30, 2006||Microsoft Corporation||User interface for providing task management and calendar information|
|US20060101275 *||Nov 10, 2004||May 11, 2006||International Business Machines Corporation||Presence sensing information security|
|US20060294377 *||Jun 23, 2006||Dec 28, 2006||Hitrust.Com Incorporated||Method for encrypting/decrypting e-mail, and storage medium and module|
|US20060294599 *||Jun 24, 2005||Dec 28, 2006||Creative Technology Ltd.||Method and apparatus for protecting private information on a user apparatus|
|US20090100267 *||Sep 4, 2008||Apr 16, 2009||Brown Daniel R||Signatures with confidential message recovery|
|US20100008509 *||Feb 10, 2009||Jan 14, 2010||Kabushiki Kaisha Toshiba||Communication apparatus, key server, and management server|
|US20110162065 *||Jun 30, 2011||Canon Kabushiki Kaisha||Client apparatus and a method therefor|
|US20110182419 *||Mar 30, 2007||Jul 28, 2011||Verizon Data Services Inc.||Encryption algorithm with randomized buffer|
|U.S. Classification||713/151, 713/168, 713/154, 713/152|
|International Classification||G06F1/24, H04L9/00|
|Cooperative Classification||H04L2209/60, H04L9/00, G06F21/62|
|Oct 23, 2003||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FORLENZA, RANDOLPH MICHAEL;BERSTIS, VIKTORS;REEL/FRAME:014639/0074;SIGNING DATES FROM 20031017 TO 20031021
|Jul 15, 2011||FPAY||Fee payment|
Year of fee payment: 4
|Jun 30, 2015||FPAY||Fee payment|
Year of fee payment: 8