|Publication number||US7512985 B1|
|Application number||US 12/112,069|
|Publication date||Mar 31, 2009|
|Filing date||Apr 30, 2008|
|Priority date||Apr 30, 2008|
|Publication number||112069, 12112069, US 7512985 B1, US 7512985B1, US-B1-7512985, US7512985 B1, US7512985B1|
|Inventors||Genady Grabarnik, Jonathan Lenchner, Laura Z. Luan, Larisa Shwartz|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (3), Non-Patent Citations (1), Referenced by (12), Classifications (16), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
IBM® is a registered trademark of International Business Machines Corporation, Armonk, N.Y., U.S.A. Other names used herein may be registered trademarks, trademarks or product names of International Business Machines Corporation or other companies.
1. Field of the Invention
This invention relates to information security, and particularly to a system, method, and computer program product for implementing search- and retrieval-compatible data obfuscation.
2. Description of Background
Obfuscation is a widely used method for making extraction of information more difficult. In one application, obfuscation is used to make it difficult to reverse engineer programs (see, e.g., Sunil Gupta, “Code Obfuscation—Part 2: Obfuscating Data Structures,” http://palisade.plynt.com/issues/2005Sep/code-obfuscation-continued/). In another application, obfuscation is used to mask data to make it less recognizable (see, e.g., “The Data Masker: Data Obfuscation Made Simple,” http://www.datamasker.com/dm_sitemap.htm).
Obfuscation is also widely used in security and privacy where data obfuscation addresses this dilemma by extending several existing technologies and defining obfuscation properties that quantify the technologies' usefulness and privacy preservation (see, e.g., David Bakken, Rupa Parameswaren, Douglas Blough, Andy Franz and Ty Plamer, “Data Obfuscation: Anonymity and Desensitization of Usable Data Sets” http://doi.ieeecomputersociety.org/10.1109/MSP.2004.97; and R. Agrawal and S. Ramakrishnan, “Privacy-Preserving Data Mining,” Proc. ACM SIGMOD Conf. on Management of Data, ACM Press, 2000, pp. 439-450).
Obfuscation is also used to hide actual IP addresses from being recognized by malice web sites and not allowing the sites to collect personal data from the PC every time it is visited by a user (see, e.g., NetConceal—software to hide your ip address: http://www.netconceal.com/).
One way to access documents/information in an electronic format is to create an index of some sort (e.g., using keywords or topics, etc.) and then providing a search capability, incorporating the index, in such a way that a desired document or portion thereof may be located quickly. This is described in U.S. Pat. No. 6,654,754 (issued November 2003), entitled “System and method of dynamically generating an electronic document based upon data analysis.”
Existing methods of obfuscation (see, e.g., U.S. Pat. No. 6,981,217 (issued December 2005), entitled “System and method of obfuscating data”) are incompatible with regular indexing, such as the indexing methods described in U.S. Pat. No. 6,654,754, and create significant difficulty for locating information in the obfuscated documents.
What is needed, therefore, is a way to obfuscate information or documents that enables the creation of indices, as well as a way to obfuscate not only content, but also metadata and the structure and relationships between artifacts.
The shortcomings of the prior art are overcome and additional advantages are provided through the provision of a system for implementing search- and retrieval-compatible data obfuscation includes an annotator that annotates data, metadata, and relationships thereof that are privacy sensitive according to privacy levels. The system also includes an indexing server that indexes the annotated data according to policies that specify rules for controlling access to the annotated data based upon the annotated privacy levels and user profiles. The system also includes an obfuscation server for defining the user profiles, which specifies data entitlement and access rights for the users. In response to receiving a search request from a user, the obfuscation server forwards the search terms in the request, along with a privacy level determined from a corresponding user profile and the policies, to a search engine that searches indices of a database having the privacy level in the request, and returning to the user only the data, metadata, and relationships which match the search term and privacy level.
Method and computer program products corresponding to the above-summarized methods are also described and claimed herein.
Additional features and advantages are realized through the techniques of the present invention. Other embodiments and aspects of the invention are described in detail herein and are considered a part of the claimed invention. For a better understanding of the invention with advantages and features, refer to the description and to the drawings.
As a result of the summarized invention, technically we have achieved a solution which provides privacy protection and authorized data access to the documented details and structural artifacts of a service engagement involving customers and one or more service providers, each of whom have different access levels and privacy requirements. Documents/records are annotated, either automatically (for example, using rule-based expressions) or manually, and then a semantic search is employed to identify and determine the sections/fractions of the data content that are privacy sensitive and require access authorization. Once the sections/document fractions are identified and marked with appropriate markers of privacy levels, a set of policies along with user profiles are used to automatically determine the obfuscation schemes applicable to each marked section/fraction of the data content. The obfuscation schemes are applied to various aspects of the data including search indexing data, metadata, and the retrieved marked original data for rendering to end users.
The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:
The detailed description explains the preferred embodiments of the invention, together with advantages and features, by way of example with reference to the drawings.
In an exemplary embodiment, a system, method, and computer program product for implementing search- and retrieval-compatible data obfuscation are provided. The data obfuscation provides privacy protection and authorized data access to the documented details and structural artifacts of a service engagement involving customers and one or more service providers, each of whom has different access levels and privacy requirements. The data obfuscation processes solve this problem by obfuscating sensitive sections/fractions of the data content during indexing, search, and rendering to be compliant with application specific privacy policies and user profiles. The data obfuscation addresses the problem existing particularly in service management solutions where multi-party consumers and suppliers access and analyze common data sources for service quality and contract execution management.
Turning now to the drawings in greater detail, it will be seen that in
The system of
The system also includes a database 106, which stores annotated documents, records, and metadata. The database 106 may be federated, containing multiple database instances.
The system further includes an indexing server 110, which recognizes the annotation markers in the documents/records/metadata stored in database 106 and produces indexing data accordingly in various privacy levels. The base level indexing data are produced from the data without any markers and hence have the least privacy protection.
Also included in the system of
In addition, an obfuscation server 104 is provided in
A search engine 112 is provided for producing relevant document/record/metadata links for given search terms and the privacy level.
Turning now to
The process begins at step 200 whereby the obfuscation server 104 receives a request at step 202. The obfuscation server 104 assigns a privacy level to the request according to policies 124 and the profile 122 of the user who initiated the request at step 204. At step 206, it is determined whether the request is for a search or a document retrieval.
If the request is for a search, the process proceeds to step 208 whereby the obfuscation server 104 forwards the search term(s) (in the request), along with the privacy level assigned to the search engine 112. The search engine 112, in turn, searches the indices (e.g., one or both of indices 126/128) based upon the privacy level at step 210. At step 212, the search response is returned to the requester by the search engine 112. The content of the response varies according to the privacy level assigned. Example obfuscation schemes and scenarios illustrating this concept are provided further herein.
If, however, the request is for retrieval of a document, i.e., a piece of data, metadata, or relationship data at step 206, the process proceeds to step 216, whereby the obfuscation server 104 retrieves the requested data/document from the database 106. The obfuscation server 104 selects the obfuscation scheme according to the policy 124 and the assigned privacy level at step 218. In step 220, the obfuscation server 104 applies the selected scheme to the annotated data in the retrieved document according to the privacy level and returns the obfuscated data (e.g., document, record, metadata, etc.) to the requester at step 222. The process ends at step 214. The data obfuscation may employ various techniques such as simple black-out, simple substitution cipher, or anonymity/pseudonymity
A linear obfuscation scheme is demonstrated below for the scenario of searching/viewing problem tickets.
Substitute the marked data of level>n with blanks or a randomized string for a user of privacy level=n.
Annotator marking rules (examples):
User Profiles (examples):
Policies to assign user privacy levels (examples):
If role=subcontractor, then level=1,
If role=customer, level=2,
If role=administrator, then level=3
The base indices 126 for search are produced and stored in index database 114. The base indices 126 are those produced from the data (indexed from database 106) with no markers (i.e., marker level=0). Additional indices 128 for level=n, n>1 are generated from the data (indexed from database 106) with marker level=n.
A search request from a user (e.g., via client application 102) with a role of “subcontractor” is assigned “level=1” by obfuscation server 104 using the user profile 122 and the policy 124. The search request and the assigned privacy level are forwarded to search engine 112 which searches the relevant records among the base indices 126 and the additional indices 128 of level=l. If the search term is a person's name or a non-800 phone number, for instance, the search engine 112 will not return any results for the names and the phone numbers are not included in the indices to which the request is entitled.
If a search request is from a user with the “customer” role, it is assigned a privacy level=2 and, therefore, entitled to the additional indices of levels 1 and 2 (e.g., indices 128). The search engine 112 will return results if any matches are found in these indices.
In the case of a retrieval request, if from a user with the “subcontractor” role, it will be assigned with privacy level=1. The obfuscation server 104 will obfuscate the marked record from the database 106 where the markers are level>1 and return to the user the obfuscated record with the personal names, phone numbers, and IP address eradicated.
If a retrieval request is from a user of “customer” role, the returned obfuscated record will have only IP addresses eradicated.
The capabilities of the present invention can be implemented in software, firmware, hardware or some combination thereof.
As one example, one or more aspects of the present invention can be included in an article of manufacture (e.g., one or more computer program products) having, for instance, computer usable media. The media has embodied therein, for instance, computer readable program code means for providing and facilitating the capabilities of the present invention. The article of manufacture can be included as a part of a computer system or sold separately.
Additionally, at least one program storage device readable by a machine, tangibly embodying at least one program of instructions executable by the machine to perform the capabilities of the present invention can be provided.
The flow diagrams depicted herein are just examples. There may be many variations to these diagrams or the steps (or operations) described therein without departing from the spirit of the invention. For instance, the steps may be performed in a differing order, or steps may be added, deleted or modified. All of these variations are considered a part of the claimed invention.
While the preferred embodiment to the invention has been described, it will be understood that those skilled in the art, both now and in the future, may make various improvements and enhancements which fall within the scope of the claims which follow. These claims should be construed to maintain the proper protection for the invention first described.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US6654754||Dec 8, 1999||Nov 25, 2003||Inceptor, Inc.||System and method of dynamically generating an electronic document based upon data analysis|
|US20030115481 *||Dec 18, 2001||Jun 19, 2003||Baird Roger T.||Controlling the distribution of information|
|US20080118150 *||Nov 22, 2006||May 22, 2008||Sreeram Viswanath Balakrishnan||Data obfuscation of text data using entity detection and replacement|
|1||Bharat Bhargava, et al., Private and Trusted Collaborations, Department of Computer Sciences and Center for Education and Research in Information Assurance and Security (CERIAS) Purdue University, 6 pages.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8179556 *||Mar 26, 2007||May 15, 2012||Xerox Corporation||Masking of text in document reproduction|
|US8355923 *||Oct 21, 2011||Jan 15, 2013||Gervais Thomas J||Systems and methods for de-identification of personal data|
|US8615735||May 3, 2011||Dec 24, 2013||Apple Inc.||System and method for blurring instructions and data via binary obfuscation|
|US8677149 *||Dec 12, 2011||Mar 18, 2014||C3S Pte. Ltd.||Method and system for protecting intellectual property in software|
|US9143513 *||Dec 9, 2010||Sep 22, 2015||Oberthur Technologies||Portable electronic device and associated method for making information available|
|US20080239365 *||Mar 26, 2007||Oct 2, 2008||Xerox Corporation||Masking of text in document reproduction|
|US20110150222 *||Jun 23, 2011||Oberthur Technologies||Portable electronic device and associated method for making information available|
|US20120041791 *||Oct 21, 2011||Feb 16, 2012||Gervais Thomas J||Systems and methods for de-identification of personal data|
|US20120151600 *||Jun 14, 2012||Ta Chun Yun||Method and system for protecting intellectual property in software|
|US20130198857 *||Jan 25, 2013||Aug 1, 2013||International Business Machines Corporation||Processing of restricted access data|
|US20150019334 *||Jul 9, 2013||Jan 15, 2015||Infolinks, Inc.||Systems and methods for providing targeted messaging when targeting terms are unavailable|
|CN101576920B||Jun 19, 2009||Nov 28, 2012||用友软件股份有限公司||Search engine system|
|U.S. Classification||726/26, 715/230, 707/999.009, 707/999.01|
|International Classification||H04L9/32, H04N7/16, H04L9/00, G06K9/00, H04K1/00, G06F17/30, H03M1/68, G06F7/04|
|Cooperative Classification||Y10S707/99939, G06F21/6263|
|European Classification||G06F21/62B5B, H04L9/06|
|Apr 30, 2008||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GRABARNIK, GENADY;LENCHNER, JONATHAN;LUAN, LAURA Z.;AND OTHERS;REEL/FRAME:020877/0488;SIGNING DATES FROM 20080331 TO 20080401
|Nov 12, 2012||REMI||Maintenance fee reminder mailed|
|Jan 28, 2013||SULP||Surcharge for late payment|
|Jan 28, 2013||FPAY||Fee payment|
Year of fee payment: 4