JP4903386B2 - Searchable information content for pre-selected data - Google Patents

Description

  The present invention relates to the field of processing data, and in particular, the invention relates to detecting preselected (eg, proprietary) data in information content.

  Many organizations store large amounts of secure and confidential information in relational databases. This type of data is usually left to very thorough security measures, including physical protection, access control, peripheral security constraints, and possibly encryption. Because access to database data is essential for the work of many employees in a company to function, there is a great chance that this information could be stolen or distributed accidentally. Theft of information represents a significant business risk, both in terms of the value of intellectual property and in terms of legal reliability related to legal compliance.

Relational database systems Relational database systems are useful for a vast range of applications. The related structure presents the data in a manner that presents a natural and intuitive way to query the data and has the added benefit of hiding the details of the underlying disk storage system from the user. A typical application of a database system is to store and retrieve large amounts of small data that is naturally formatted into a table structure. The query types that most people are interested in are outlined below, but relational databases are very useful because they can be optimized using well-known index structures.

  Queries required for relational database systems use natural intuitive predicate logic called Structured Query Language (SQL) that allows users to simply request the table data they are looking for. Database tables are almost always equipped with indexes that make queries based on SQL more efficient. These indexes are stored in the memory using a data structure called a B-tree. The salient features of the B-tree that are most relevant to the current discussion are:

A B-tree is an abstract data structure based on a binary tree;
A B-tree must contain multiple copies to be indexed;
B-trees are most efficient using the example query outlined below.

There are many examples of inquiries
An exact match query of the form A = v, where:
A is a column or "attribute" of a given database table,
V is a specific attribute value,
For example, SELECT ^* FROM CUSTOMERS WHERE Income = 30,000
In the range query of the form v1 <A <v2, here;
A is a column or "attribute" of a given database table,
For example, SELECT ^* FROM CUSTOMERS WHERE 30 <Income <40
In the query for a prefix in the form of A MATCHESs ^*
"S" is a specific string value,
“S ^* ” is a regular expression,
For example, Last_Name MATCHES “Smith ^* ”

  There are many references on early work in the field of database systems. First, E.I. F. Coded “Relational Model of Data for Large Shared Data Bank” ACM Communications 13 (6), 377-387, 1970, original work on relational database.

  The second reference is one of the first published works on the “B-tree” data structure, the basic data structure that allows efficient querying of the type outlined above. . Rudolf Bayer and Edward M. McCreight's "Editing and Managing Large Ordered Indexes", 1970ACM SIGFIDET Workshop Record on Data Description and Access, November 16-16, 1970, University of Rice, Houston, Texas (2nd edition with appendix) ), Pages 107-141, ACM, 1970.

Information Retrieval System Information retrieval is a broad field that deals with the storage and retrieval of text data found in documents. These systems focus primarily on standard documents, not tabular data, and are different from those of database systems. An early example of this system was developed at Cornell University as part of the SMART system. Today, the best-known information retrieval applications are web-based search engines such as Google, Inktomi and AltaVista. A common way to use these systems is to find references to documents that are part of a larger digital document set. The user experience associated with these applications usually consists of a series of queries and results browsing. The results of the query are shown in order of relevance, and the user can refine the query after further browsing. For relational databases, these systems are exceptionally popular because of the ability of the underlying index to respond quickly to the types of queries that people find most useful.

  Most of these systems are based on an index derived from a so-called “term index” built from a collection of indexed documents. These term indexes include a data structure that lists, for each term, each location where that term occurs within each document. Such a data structure allows a quick search of all documents that contain a particular term. For user queries that query all documents that contain a collection of terms, the index is configured to represent a number of vectors in the higher order Euclidean space. The list of user query terms is then retranslated as a vector in this space. The query is performed by finding which vector in the document space is closest to the query vector. This last stage is called “cosine metric” with various optimizations for accuracy and speed.

  As mentioned earlier, typical user interaction with this type of system is an iterative cycle of querying, browsing, reviewing, and returning to the query. The result of a query is typically a large number of documents ranked in order of relevance, and the probability of error is very high. There are some standard examples of queries.

a) All documents that contain the terms “database” and “index” b) Boolean queries such as all documents that contain the term “database” or “index” but not “database”.

a) All documents linked with documents containing the term “dog” b) Most “popular” (ie linked) documents containing the term “dog” Link-based inquiry.

  One of the first important implementation projects of the information retrieval system is Cornell University's SMART system. This system includes many basic components of the information retrieval system still in use today: C.I. Buckley's “Execution of SMART Information Retrieval System” Technical Report TR85-686, Cornell University, 1985.

  The WAIS project was an early application of a massively parallel supercomputer made by Thinking Machine. This is one of the first information retrieval systems made available on the Internet. The first mention of this work is Brewster Kahle and Art Medlar's "Information System for Enterprise Users: Wide Area Information Server" Technical Report TMC-199, Sinking Machine, April 1991, version 3.19. is there.

Among the many current Internet search service vendors is Google. Google's true breakthrough in search accuracy is the ability to capture data from both the text and hyperlink structure of the indexed document. See “Structure of Web Search Engine for Large Hypertext” http://dbpubs.stanford.edu:8090/pub/1998-8 by Sergey Brin, Lawrage Page.

File shingling systems The growth of the Internet and affordable means of copying and distributing digital documents has raised research interest in technologies that help detect illegal or inappropriate copies of documents. The primary application for this task is to detect copyright law violations and to detect plagiarism. This problem is of considerable interest since it also relates to the detection and automatic deletion of promiscuous emails (advertisement emails sent without AKA requests). The technical term used to describe most of these techniques is that the adjacent sequence of document fragments is “single” reduced by a hash code and looked up in the same sequence as found in the document. It is a “file shingling” that is stored inside.

  File shingling provides a very quick way to look for similarities between two documents. To protect a particular document (eg, a text file), the document is singled by hashing the document sentence by sentence and storing these hashed sentences in a table for quick searching. To test and find out if a new document contains a copyrighted content fragment, the same hash function is applied to each fragment in the test message, and the fragment appears with copyrighted content. See if they appear in the same order as. The technique is quick because the time required to search for individual fragments is very short.

  Typical user interaction with the file shingling system is passive rather than active. File shingling systems are usually set up to automatically process documents and deliver query results to users asynchronously. In a typical file shingling application, a set of messages is used to prevent indiscriminate posting by creating an index of constrained content that an organization does not want to deliver to its own email system. In this scenario, “inquiry” is just an automatic email message processing and proper automatic routing.

  As for the document equivalence inquiry, in each test document t, all documents d in the collection of indexed documents having the same contents as t are identified. In the case of indiscriminate bulletin detection, set d may be all known positive indiscriminate bulletin messages and document t may be an incoming email message.

  Regarding the inquiry of cut and paste detection, in each test document t, all documents d in the collection of indexed documents in which some fragment of d occurs at t are located. If plagiarism is detected, set d may be all previously submitted essays for a particular class and document t may be a new document written by a student suspected of plagiarism.

The main published research projects in file shingling are called KOALA, COPS and SCAM. All of them use the basic file shingling variables described above with variables that optimize performance and accuracy. For information on KOALA, see N. See Heintze's “Measurable Document Advisory and Imprinting System” (Proceedings of the Second USENIX Workshop in Electronic Commerce, November 1996). http: // www-2. c. s. cmu. edu / afs / cs / user / nch / www / koala / main. html. For information on COPS, see S.C. Brin, J. et al. Davis and H.C. See “Copy Detection Mechanism for Digital Documents” by Garcia-Molina (ACM SIGMOD Annual Conference, May 1995). For information on SCAM, see N. Shivakumar and H.K. Garcia-Molina "SCAM: Copy Detection Mechanism for Digital Documents" (Proceedings of the Second International Conference in Digital Library Theory and Practice (DL'95), June 1995) http: // www-db . Stanford. edu / ~ shiva / SCAM / caminfo. html. N. Shivakumar and H.K. Garcia-Molina “Building a measurable and accurate copy detection mechanism” (Proceedings of the 1st ACM Conference on Digital Library (DL'95), March 1996) http: // www-db. Stanford. edu / pub / paper / performance. ps. Please refer to.

Internet Content Filtration Systems Various commercial applications called content filtration systems implement protection measures. There are two main application types in this category: website constraint / monitoring software and email content control. In either case, the currently used main algorithm is pattern matching against a set of regular expressions that is performed on a set of text fragments that indicate misuse of data. For example, restricting all browsing with URLs containing the text fragment “XXX”. A typical example of an email content control category that includes the terms “ownership” and “secret”, but stops and blocks all emails that do not contain the terms “jokes” or “jokes”. It is to be.

E. F. Codd "Data Relational Model for Large Shared Data Bank" Rudolf Bayer and Edward M. “Creating and managing a large number of ordered indexes” by McCreight C. "Execution of SMART information retrieval system" by Buckley Brewster Kahlle and Art Medlar "Information System for Corporate Users: Wide Area Information Server" Sergey Brin, Lawrage Page, “Structure of Web Search Engine for Large Hypertext” N. "Measurable document advisory and imprint system" by Heintze S. Brin, J. et al. Davis and H.C. "Copy detection mechanism for digital documents" by Garcia-Molina N. Shivakumar and H.K. “SCAM: Copy Detection Mechanism for Digital Documents” by Garcia-Molina N. Shivakumar and H.K. "Building a measurable and accurate copy detection mechanism" by Garcia-Molina

  A method and apparatus for detecting preselected data stored in a personal computer device is described. In some embodiments, the method monitors a message electronically transmitted over the network for embedded preselected data, performs a content search on the message, and selects the preselected data. Detecting the presence of embedded preselected data using an abstract data structure derived from.

  The present invention may be better understood from the following detailed description of the various embodiments of the invention and the accompanying drawings, which are not intended to limit the invention to the specific embodiments, but are to be understood and understood. It is only for the purpose.

  Described herein are systems and methods for tracking and monitoring the use of sensitive information everywhere on a personal computer device. In some embodiments, this monitoring is performed by performing a content search of a data storage medium of a personal computer device such as a desktop computer or portable computer. In another embodiment, the monitoring is performed by performing a message content search when the message is transmitted and received at the personal computer device. In yet another embodiment, the monitoring performs a content search before, while and after the potentially sensitive information is used in any application running on the personal computing device. Implemented by: In some embodiments, the system described herein can detect this information in a secure and measurable manner that can handle large amounts of database data. Database data comprises any form of tabular data stored in various systems including, but not limited to, relational databases, spreadsheets, flat files, and the like.

  In the following description, numerous details are set forth in order to provide a thorough explanation of the present invention. However, it will be apparent to those skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring the present invention.

  Some portions of the detailed descriptions that follow are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. Here, and generally, the algorithm is considered to be a self-consistent sequence of steps that arrives at the desired result. This step is a step that requires physical manipulation of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transmitted, combined, compared, and manipulated. It has proven convenient at times, principally for reasons of common usage, to represent these signals as bits, numbers, elements, symbols, characters, terms, numbers, or the like.

  However, it should be borne in mind that all of these and similar terms are associated with appropriate physical quantities and are merely convenient labels applied to these quantities. Unless otherwise noted, as will be apparent from the following discussion, discussions that use terms such as “processing”, “operation”, “calculation”, “judgment” or “display” throughout Data represented in physical (electronic) quantities in system registers and memory, computer system memory or registers or other such information storage devices, or other equivalently represented as physical quantities in conversion or display devices It should be understood that it refers to the operation and processing of a computer system, or similar electronic computing device, that manipulates and converts to the same data.

  The invention further relates to an apparatus for performing the operations described herein. This device may be specially made for the required purpose, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such computer programs include, but are not limited to, any type of disk including floppy disks, optical disks, CD-ROMs and magnetic optical disks, read only memory (ROM), or random access memory (RAM). ), EPROM, EEPROM, magnetic or optical card, or any type of medium suitable for storing electronic instructions, each stored in a computer readable storage medium It is connected to.

  The algorithms and displays presented here are not inherently related to any particular computer or other device. Various general purpose systems may be used with the program according to the teachings herein, and it has also proven convenient to construct more specialized equipment to perform the necessary method steps. The required structure for a variety of these systems will appear from the description below. In addition, the present invention is not described with reference to any particular programming language. It should be understood that various programming languages can be used to implement the teachings of the invention described herein.

  A machine-readable medium includes any mechanism for storing or transmitting information in a form readable by a machine (eg, a computer). For example, a machine readable medium may include a read only memory (ROM), a random access memory (RAM), a magnetic disk storage medium, an optical storage medium, a flash memory device, or an electrical, optical, acoustic or other form of propagation Signals (eg, carrier wave, infrared signal, digital signal, etc.) are included.

Exemplary Embodiment Components In one embodiment, a system for performing the detection scheme described herein includes two main components: a policy management system (PMS) and a message monitoring system (MMS). It consists of A PMS is a data (eg, database data) contained in a message sent over a network or stored on a data storage medium of a personal computer device such as a portable computer, desktop computer, personal digital assistant, mobile phone, etc. Responsible for accepting user input that defines information protection policies for use and transmission. This data is therefore pre-selected. As used herein, the term “personal computer device data storage medium” refers to any storage that is in a personal computer device or that is accessible to a personal computer device that stores data for the personal computer device temporarily or permanently. Refers to the device.

  MMS performs the search of the contents of messages sent over the network, data processed by personal computer devices, or data stored in the data storage medium of personal computer devices, and the enforcement of policies for users by PMS. It is in charge. In some embodiments, both of these systems are coupled to a computer network that communicates with any standard protocol for information exchange.

  In this embodiment, in the course of normal operation, the user decides to enforce a given policy that restricts the use or transmission of database data by a person, and then the graphical user interface and one or more This policy is manually entered into the PMS using a user input device (eg, mouse, keyboard, etc.). The user interface receives input and is executed on a computer system or individual machine with a PMS. For example, one policy stops individuals in a given group at customer service from storing data files containing preselected data on removable media devices attached to personal computing devices. In some embodiments, the policy may include the desired protection characteristics (eg, limit only a subset of employees), the type of data that needs to be protected (eg, database data), and the database data that needs protection. Contains the network location (eg, database table name, server IP address, server or file name). Again, all this information is specified using a standard graphical user interface that prompts the user to enter specific information into the correct fields.

  At certain regular intervals, which can be adjusted by the user in some embodiments, but by default once every specified interval (eg, one day), the PMS will query the database and identify the database to be protected. A copy of the data is extracted, and an abstract data structure (hereinafter referred to as an “index”) described in detail below is derived from the data.

  The PMS then sends this index to the MMS along with the details of the policy to be enforced so that the MMS can begin enforcing that policy. The MMS receives the index from the PMS along with the policy details to be enforced. The MMS uses the index and policy information to enforce the user specified policy. In one embodiment, the MMS uses this index to search each output message (eg, email, webmail message, etc.) for data in the protected database, as discussed in detail below. In another embodiment, the MMS uses this index to relate to the data in the database to be protected and / or the contents of the personal computer device data storage media and / or the user and personal computer device as discussed in detail below. Explore the content of the dialogue between them.

  An overview of a typical workflow is shown in Figure 1, where the highest value information is identified, policies are created, monitored and enforced, and tied to business information subject to litigation. .

Modes of Network-Based Operation In some embodiments, the message monitoring system is configured in one of two ways: “monitor mode” and “forced mode”. FIG. 2 shows two network configurations. In supervised mode, the MMS is located somewhere on the network where traffic and reports can be observed for policy violations, but is not configured to block when messages leave. This is illustrated in FIG. 2A where the PMS is accessing information. The PMS is connected to the Internet through switches, taps and firewalls. MMS uses taps to monitor network messages. In “forced mode”, the MMS can observe traffic and reports for violations, but can also block the message and change the path, changing the final destination of the message. This is illustrated in FIG. 2A where the PMS has access to information and is connected to the Internet through a switch and firewall. In this embodiment, the MMS uses a set of servers to monitor traffic and, if it determines that the message appears to contain preselected information, for example, redirects traffic to a specific server To do. MMS can use different servers for different layers of protocols.

  Message rerouting is not mandatory. Alternatively, the MMS can be configured to block and stop outgoing messages. One example of a “forced mode” policy is to send all messages that violate the policy to the manager of the person who violated the policy so that appropriate disciplinary action can be taken.

  In both modes of operation, many MMSs can be installed, each with its own copy of the index needed to detect the contents. This parallel processing mode helps with scale issues and the possible multiple points of defense for information exit.

  In both forms, the MMS actively analyzes messages that are transported using various application layer protocols (eg, SMTP, HTTP, FTP, AIM, ICQ, SOAP, etc.).

  In one embodiment, the two subsystems (PMS and MMS) run on one local area network (LAN). However, PMS and MMS can be integrated within the same physical or logical system. This integrated form is more suitable because it can control the cost of goods needed to create the system.

  In yet another alternative embodiment, the PMS and MMS are not necessarily on the same LAN. The PMS is on the same LAN as the database information, but the MMS is on a different LAN than the LAN where the PMS is. In this configuration, two different LANs are ultimately connected together by the Internet, but are separated by firewalls, routers and / or other network devices. This limits one company from violating the first company's database data policy (such as a law firm or a research agency) from another company that requires data from their database. This is a convenient configuration if you want to.

  FIG. 3 is a flow diagram of one implementation of a process for protecting data in a database. This process is performed by processing logic comprising hardware (circuitry, dedicated logic, etc.), software (such as running on a general purpose computer system or a dedicated machine), or a combination of both.

  As shown in FIG. 3, processing logic monitors messages for preselected data. (Processing block 301). Next, processing logic determines whether the message has preselected data (processing block 302). If not, processing moves to block 3011. If so, processing logic determines whether the personal send / receive message is approved to send / receive information in the message (processing block 303). If approved, the process ends and processing moves to processing block 301. If not approved, processing logic takes one or more actions such as intercepting the message, changing the path of the message, logging the message (processing block 304), and processing moves to processing block 301. .

Mode of Client-Based Operation The mode of client-based operation is directed to a monitoring operation taken by a user of a personal computing device to detect user operations including potential misuse of data. These user operations include, for example, saving or accessing restricted database data on any storage device of the computing system, using restricted database data within the application, and It includes the steps of printing restricted database data and using the restricted database data with any network communication protocol. In some embodiments, user activity monitoring may include content accessed or saved in a personal computer device's local storage system, or various application layer protocols (eg, SMTP, HTTP, FTP, AIM, ICQ, SOAP, etc.). This is done by analyzing and searching for any of the content that is transferred using. In another embodiment, the monitoring of user behavior is performed by capturing and interpreting data exchanged between the user and the personal computer device.

  FIG. 9 is a block diagram of one embodiment of a system for client-based protection of preselected sensitive data.

  As shown in FIG. 9, the server 902 communicates with a client computer (referred to as a client) 910 via a network 906. The network 906 may be a dedicated network (for example, a local area network (LAN)) or a public network (for example, a wide area network (WAN)). Client 910 is a computer belonging to different employees within an organization. Each client 910 is, for example, a desktop computer, a portable computer (eg, a laptop), or some other computer that operates with an intermittent network connection. A content monitoring system (also referred to herein as a message monitoring system or MMS) 912 resides on each client 912 and searches the content of this client's data storage medium for preselected sensitive data, and the user and client 912. I am in charge of capturing and interpreting the content exchanged between the two. Data storage media include, for example, main memory, static memory, mass storage memory (eg, hard disk), or some other storage device that temporarily or permanently stores files or other documents for a client computer. Yes. In some embodiments, the MMS 912 monitors specific data operations such as file reads, file writes, file updates, and removable media devices (eg, floppy drives, universal serial buses ( USB) devices, compact disc recordable (CDR) devices, etc.). The operation of MMS 912 facilitates preventing loss of sensitive data by removable and mobile devices. For example, the operation of the MMS 912 may allow a user to copy sensitive data stored on the client 910 to a floppy disk, move a file containing the sensitive data to a USB-based removable storage device, Prevents leakage of confidential data that occurs when confidential data is printed or emailed from a desktop computer and used in an unauthorized application.

  The server 902 is responsible for constructing the detection method described here in the organization. Server 902 includes PMS 904 and message collector 914. PMS 904 maintains a set of security policies that control the use of sensitive data. A set of safety policies identifies employees who must monitor their computer for potential misuse of sensitive data, specifies the sensitive data to perform the search, and defines the scope of the search (eg, Specific storage media, data operations, etc.). Based on this information, the PMS 904 instructs each MMS as to whether or not to search for the corresponding client 910, and sends an index used for the search. The index is derived from specific sensitive data preselected for one or more clients 912 based on a security policy. The message collector 914 is responsible for collecting messages received from the MMS 912 that notify the misuse of data by the user of the client 910.

  In some embodiments, each MMS 912 may stand alone when it cannot maintain network contact with the server 902 (eg, the laptop 910 is taken home on the weekend, moved to another network, or stolen). Can be operated with. For example, when the user disconnects the laptop 910 from the network 906, the MMS 912 running on the laptop 910 may periodically update the data storage medium of the laptop 910 while the user is working on the laptop at home. Perform a content search. Specifically, the MMS 912 searches the laptop 910's local file system, email message archive, and the like. Further, the MMS 912, when instructed by the PMS 902, performs certain data operations (eg, read file, write file, update file, read / write to removable media devices such as floppy disks). To monitor. In some embodiments, when MMS 912 detects pre-selected data on any data storage medium of client 910, MMS 912 creates a message that includes a notification of detection of the pre-selected data and sends the message to the transmission queue. To place. Later, when the connection to the network is reestablished, a message from the send queue is sent to the message collector 914. In some embodiments, the policy maintained by PMS 904 requires that MMS 912 prevent access to the preselected data when preselected data is detected.

  FIG. 10 is a flow diagram of one embodiment of a process for protection of preselected data based on a personal computer device. This process is performed by processing logic comprising hardware (circuitry, dedicated logic, etc.), software (such as running on a general purpose computer system or a dedicated machine), or a combination of both. Processing logic resides on a personal computer device such as client 910.

  As shown in FIG. 10, processing logic receives an instruction defining the scope of a content search performed on the personal computer device (processing block 1002). In some embodiments, the instructions specify the data storage medium that must be searched and the search period. In some embodiments, the instructions also specify the operation of data to be monitored for the presence of preselected sensitive data.

  Next, processing logic receives an abstract data structure or index derived from preselected sensitive data (processing block 1004). Several abstract data structure embodiments are discussed in more detail below.

  At processing block 1006, processing logic uses the abstract data structure to search the contents of the personal computer device data storage medium for preselected sensitive data. The scope of content search is defined by instructions received from the server. The search is performed on the content of the data storage medium of the data of the personal computer device and / or the content exchanged between the user and the personal computer device. In some embodiments, the content search is performed periodically at predetermined time intervals. Some embodiments of search techniques used in processing logic are discussed in further detail below. The term "personal computer device data storage medium" is accessible to personal computer devices including, for example, magnetic disks, volatile random access memory, removable media, tape backup systems, remote network addressable storage devices, etc. Refers to any form of data storage. In some embodiments, processing logic searches volatile storage to detect the use of preselected data by an application running on the personal computer device. If usage is detected, processing logic identifies the application that is using the preselected data.

  If the processing logic detects the presence of the preselected data (or a portion thereof) (processing box 1008), the processing logic indicates that the policy maintained by the PMS prevents access to the preselected data. It is determined whether or not a request is made (processing box 1009). In some embodiments, access to the detected data is blocked for applications attempting to access this data.

  If blocking is required, processing logic blocks access to the preselected data (processing block 1010), and further, the personal computer device makes network contact with the server or any other specified device. It is determined whether or not it can be maintained (processing box 1011). If this determination is positive, processing logic sends a message containing a notification of detection to the server (processing block 1012). The notification identifies the personal computer device and the detected data. In some embodiments, the notification identifies the application that was using the preselected data when running on the personal computer device.

  If there is no connection between the personal computing device and the server, processing logic places this message in the queue for transmission to the server when a connection to the network is re-established (processing block 1014).

  As discussed above, personal computer device based monitoring allows for the monitoring of content stored and processed on the personal computer device. Unlike existing desktop-based firewalls that perform filtering based on protocols, the content exploration described here is accessed by pre-selected database data or applications in the file system or memory bank. We are working on specific exploration issues related to tracking data within a process.

  With respect to access control techniques that prohibit unauthorized access by prompting the requester with credentials (eg, a password), the client-based protection of sensitive data described here is stored within the personal computer device. Content is monitored after this content has been downloaded or accessed through an access control system.

  Desktop-based encryption / decryption package systems generally rely on server-based mechanisms to encrypt data and rely on desktop-based mechanisms to decrypt and view the data. By restricting access to the decryption key, it works to prevent misuse of data. The client-based protection of sensitive data described here is left “exactly” outside the cryptography envelope and should therefore be used to protect data that is easily stolen by third parties. Can do.

  In contrast to the anti-virus solutions normally used to detect the presence of hostile code in attachments, the client-based protection of sensitive data described here is not the presence of hidden code. Dedicated to detecting the presence of pre-selected database data.

  A driver filter in the form of software written to drive hardware operations using a content filter that monitors all content sent to that personal computer device. Lacks the ability to perform searches on data storage media.

Safety requirements for one or more system embodiments Since this detection system embodiment is used to enforce an information safety policy, the safety characteristics of this system are the best. In some embodiments, the primary purpose of the system is to enforce safety policies involving database data. This suggests that the way the system handles database data is very secure. In the process of protecting database data, if the system opens a new way to steal database data, the ultimate goal is overturned.

  In some embodiments, MMS is deployed in a manner that monitors and / or blocks a large number of messages flowing through the network. This means installing MMS at various points of the network where traffic is concentrated (eg, routers, mail systems, firewalls, desktop computers, email archive systems, etc.). This means that MMS is installed either behind or before one of these concentration points on the network. Such an arrangement of the system allows the system to view messages exceptionally and increases the utility of the organization using the system. Unfortunately, this arrangement allows MMS to breach a security perimeter surrounding the network using unauthorized network access by third parties and steal data contained within the network. Base attacks (commonly referred to as “hacking”) are also very susceptible. Such an arrangement makes the MMS susceptible to “hacking” attacks by the same employees that the MMS is monitoring.

  In another embodiment, the MMS is deployed locally on a personal computer device, using a local storage medium, using classified data by an application running on the personal computer device, and network communication to the device Is responsible for the execution of monitoring. Such a system arrangement allows the system to exceptionally browse information used and accessed by a person operating a computer device, increasing the utility of the organization using the system. However, this arrangement makes the MMS susceptible to “hacking” attacks by the same employees that the MMS is monitoring.

  Concerns about PMS confidentiality are also high in that the software directly queries the source to create an index for use by MMS.

  Thus, in some embodiments the placement of MMS on the network, or in other embodiments the placement of MMS on a personal computer device exposes the MMS to attack. In some embodiments, these attacks come from inside the local area network (LAN) or from outside the LAN through WAN and / or Internet links maintained by the organization. In another embodiment, the attack may come from a user of a personal computer device. A particular confidentiality concern here is that MMS contains valuable database data from the relational database it is trying to protect. The concern is that hackers or users of personal computer devices try to steal data from MMS rather than from a more thoroughly guarded computer where the relational database is actually running.

  A second and related security concern for applications arises when MMS is deployed on a different LAN than the LAN on which PMS is deployed. As mentioned earlier, this is an important configuration that helps enforce security policies across two organizations that share database data. Information stored in the MMS is again exposed to information security threats.

  Various embodiments deal directly with these security threats. One aspect of the breakthrough of these embodiments described herein is that the PMS / MMS pair exchanges an index that does not contain a copy of the data it is trying to protect. As stated above, the PMS sends an abstract data structure derived from the data in the database to the MMS so that the MMS can enforce policies. One possible way to achieve this protection is simply to copy the database to the MMS, or (also from a security standpoint) to ensure that the content is not in conflict with the policy. It is to be able to inquire directly. The problem with this method is that it introduces considerable security vulnerabilities that were not previously available. In this dangerous way, recovery is more difficult than illness.

  In some embodiments, the PMS creates an index from a database that does not contain a copy of the data in the database or contains only an encrypted or hashed copy of the data in the database. Such an index is created using a tuple storage mechanism that provides a data structure for storing a number of tuples related to database data fragments. Examples of tuple storage mechanisms include hash tables, vectors, arrays, trees, lists or relational database management system tables. In the process described below, the data stored in the index only holds the position of the element in the database relative to other elements. For example, in the case of a hash table, the index stores the hash code of the fragment together with its row number, column number, and column type for each fragment of data in the database (data fragment in the database cell).

  Other embodiments of this same solution use an index that contains fragments of protected intellectual property to reduce the value of the solution by exposing that information to security threats. In some embodiments, the techniques specifically described herein can represent any representation of the data itself so that if a hacker enters a host running MMS, the data subject to theft is illogical. Is not remembered.

  Functionality can be enhanced by implementing alternative embodiments described in the process described below. In this alternative embodiment, only a small copy of frequently used strings and numbers from the database representing the majority of the data in the system is stored in the index, with information about the relative position of the data in the database table. Stored directly with the rest. This is done by storing a copy of these generic strings themselves instead of hash codes. In this alternative method, the system stores (in terms of these general terms) the row number, column number, and database data type, but instead of storing the hash code, it stores the string itself. In the remaining cells of the less common database, only the row number, column number, and database data type are stored, specifically without storing copies of these strings. This method is the fact that the statistical distribution of string and numeric data in the database is often skewed so that the most common terms account for a very large percentage of the total amount of data stored Is used. Since a few common terms occupy the majority of queries, storing these common terms in separate indexes makes index queries efficient, and these queries can be found in literature (for example, hash tables). Lookup, bitmap, etc.) can be run using standard and quick techniques. This is not a security vulnerability because the few terms that account for the disproportionate share of the amount of data in the database are the least valuable data. Although the terms “John” and “Smith” are very common in databases containing names, theft of these terms is relatively low value. In this embodiment, the system carefully avoids storing a copy of higher value, uncommon term data (eg, credit card number, SSN, uncommon name, etc.). In this embodiment, as in the previous embodiment, the system avoids storing any copy of sensitive information by storing only hash codes and tuples of information related to the placement of cells in the database. To do.

Preselected Data Detection In one embodiment, the process of detecting preselected data includes two main operations or stages: indexing and searching. In the indexing phase, the system builds an index from preselected data. The preselected data may be any data as long as the relationship can be configured in a table format. That is, preselected data can be stored in a table format (eg, data in a relational database, data in an Excel spreadsheet, etc.) or stored in a table format, but not in a table format. (For example, data stored as a comma separated value in a flat file or password database, relational data in an object-oriented database, etc.).

  FIG. 4 is a flow diagram of one embodiment of a process for indexing preselected data. This process is performed by processing logic with hardware (circuitry, dedicated logic, etc.), software (such as running on a general purpose computer system or a dedicated machine), or a combination thereof.

  As shown in FIG. 4, processing logic begins with determining whether pre-selected data is stored in a standard table format (processing box 402). If not, processing logic converts the preselected data to a standard table format (processing block 404). Each cell in the resulting table stores a pre-selected fragment of data. In some embodiments, each data fragment is a token. A token may be a single word or a cluster of words (eg, a quoted word). For example, the word “this” represents a token stored in a database cell, but the phrase “this token” represents an independent token when stored in a database cell as a single string. To express.

  Next, processing logic creates a tuple storage structure derived from preselected data (processing block 406). Tuple storage structures provide a mechanism for storing a number of tuples associated with preselected fragments of data. Examples of tuple storage structures include hash tables, vectors, arrays, trees or lists. Each type of tuple storage structure relates to a method for searching a set of tuples for any given content fragment (the set of tuples is empty if there is no match in the tuple storage structure). It is attached.

  Further, processing logic stores information regarding the location of each data fragment in the database of corresponding tuples (processing block 408). In some embodiments, the information regarding the location of the data fragment includes the number of the row storing the data fragment in the database. In another embodiment, this information also includes the number of the column storing the data fragment in the database, and optionally the data type of the column.

  Thereafter, processing logic sorts the tuples into a predetermined order (eg, ascending lexicographic order) (processing block 410).

  Thus, the resulting abstract data structure (ie, index) only contains information about the relative position of the data record within a large overall context, and contains no fragments of the preselected data itself. .

  In some embodiments, the contents of the index are handled cryptographically (eg, with a hash function or with a cryptographic function with a cryptographic key) to further protect the index from theft.

  The “search” phase of the preselected data detection process will be discussed in more detail. FIG. 5 is a flow diagram of one embodiment of a process for searching information content for preselected data. This process is performed by processing logic comprising hardware (circuitry, dedicated logic, etc.), software (such as running on a general purpose computer system or a dedicated machine), or a combination of both.

  As shown in FIG. 5, processing logic begins with receiving information content (processing block 502). Information content can be sent over the network using a file (eg, an archived email message stored on a computer hard drive) or a block of data sent over the network (any type of network protocol) Email message).

  Next, processing logic detects a sequence of content fragments in the information content that may contain a portion of the preselected data (processing block 504). As previously mentioned, the preselected data is proprietary database data that needs to be protected or some other kind of data that has a unique table structure. That is, pre-selected data may be stored in a tabular format (eg, data in a relational database, data in an Excel spreadsheet, etc.) and not stored in tabular format, but in tabular format. It may have a relationship that can be stored (for example, data stored as a comma-separated value in a flat file or password database, relational data in an object-oriented database, etc.).

  In some embodiments, the sequence of detected content fragments is a set of adjacent tokens in the information content. Each token corresponds to a word or phrase. The sequence of detected content fragments is part of the received information content or the entire information content.

  In some embodiments, when the processing logic determines that the sequence of content fragments is similar to the column formatted data, the sequence of content fragments may include a portion of the preselected data. Judge that there is. This determination involves analyzing the received information content to identify separation lines (e.g., indicated by tags <cr> or <cr> <1f>), and these separation lines optionally with the same number of tokens. This is done by finding out that it contains a similar token data format.

  In another embodiment, processing logic analyzes the entire information content and, when searching for blocks of adjacent tokens for preselected data, the sequence of content fragments includes a portion of the preselected data. It is determined that there is a possibility that In some embodiments, adjacent blocks of tokens have a user-specified width of each block and a user-specified location of each block in the information content (e.g., the user selects two adjacent blocks, Defined based on user-specified parameters such as requiring separation with a certain number of tokens).

  In yet another embodiment, the processing logic may find that the sequence of content fragments includes a portion of the preselected data in finding a pre-defined format representation in the information content. Judge that there is. Such expressions include, for example, account numbers, social security numbers, credit card numbers, telephone numbers, postal codes, email addresses, financial values or text formats that indicate numbers (eg, “$” sign with numbers), etc. It is. Once this representation is found, processing logic determines that the area of text around this representation may contain some of the preselected data. The size of this area is determined by the number of predetermined tokens on each side of the found expression.

  In yet another embodiment, processing logic may allow certain characteristics associated with the received information content to include pre-selected data in the information content based on a history of previous violations. When it is determined that the content fragment is present, it is determined that the sequence of content fragments includes a portion of the preselected data. These characteristics include, for example, the destination of the information content (eg, recipient of the electronic message), the origin of the information content, the time of transmission associated with the information content, the size of transmission associated with the information content, File types (for example, multipurpose Internet mail extension (MIME) type files) and the like. In one embodiment, the history of previous violations identifies characteristics of the information content from which the preselected data was detected each time the preselected data was detected, and these characteristics are stored in the database of previous violations. Retained by recording in. Thereafter, processing logic identifies the characteristics of the new information content when determining whether the sequence of content fragments in the new information content includes a portion of the preselected data, and for these characteristics Search the database for previous violations. If a match is found, processing logic determines whether a previous violation associated with the match characteristic indicates the possibility that preselected data is included in the new information content. This indication may be based on the number of previous violations associated with the match characteristic or the frequency of previous violations associated with the match characteristic. For example, this indication may be based on the total number of violations committed by a particular sender or may be based on the frequency of those violations over a given period.

  Thereafter, in detecting a sequence of content fragments that may contain a portion of the preselected data, processing logic determines that any subset of these content fragments is a subset of the preselected data. (Processing block 506). This determination is made using an index that defines the table structure of preselected data (referred to herein as an abstract data structure).

  FIG. 6 is a flow diagram of one embodiment of a process for finding matches for a subset of content fragments in an abstract data structure derived from preselected data. This process is performed by processing logic with hardware (circuitry, dedicated logic, etc.), software (such as running on a general purpose computer system or a dedicated machine), or a combination thereof.

As shown in FIG. 6, processing logic begins with parsing the sequence of content fragments identified in process block 504 of FIG. 5 with content fragments (eg, tokens). Processing logic then searches the abstract data structure for a set of matching tuples for each content fragment (processing block 602). For example, the word “Smith” included in the information content may occur multiple times in the pre-selected data reflected in the abstract data structure. Specifically, each of these occurrences has a corresponding tuple in the abstract data structure. Processing logic searches a set of tuples corresponding to the occurrence of the word “Smith” in the preselected data during the search. Each tuple stores information regarding the location of this data fragment in a database or table storing preselected data. In some embodiments, the location information includes the row number of the cell storing the data fragment. In another embodiment, the location information also includes the column number of this cell and optionally the data type of that column.

  Next, processing logic combines the set of matching tuples found in all content fragments (processing block 604), and then classifies the combined set of matching tuples into group L by row number (processing block). 606). As a result, each group L (referred to herein as an accumulator) includes a set of matching tuples that all have the same column number, ie, the set of matching tuples for each group L all come from the same row in the database. Corresponds to pre-selected fragments of data that appear to be.

  Further, processing logic sorts group L by the number of matching tuple sets contained in each group (processing block 608), and in one embodiment has a set of tuples with a distinct number of columns. A group is selected (processing block 610). Thereafter, processing logic determines whether the selected group has a sufficiently large set of matching tuples (processing block 612). For example, if the number of sets of matching tuples in a group is greater than “3”, the information content is likely to contain data from four or more columns of the same row in the database.

  A representative embodiment of the search process is described. 7A-7C are flow diagrams of an alternative embodiment of a process for searching for incoming messages using a pre-selected data hash table index. This process is performed by processing logic with hardware (circuitry, dedicated logic, etc.), software (such as running on a general purpose computer system or a dedicated machine), or a combination thereof.

  As shown in FIG. 7A, processing logic begins with parsing the incoming message (processing block 702). Next, processing logic determines whether the analyzed portion of the incoming message contains column formatted data (processing block 704). In some embodiments, lexical analysis is used to analyze incoming messages (eg, by finding the tags <cr> or <cr> <1f> used to separate lines). Identify the partial lines and detect that the number of tokens found in adjacent lines is the same in number and type. In some embodiments, processing logic stores the type of each token along with the total number of tokens.

  If the determination made at process box 704 is no, the process moves to process block 702. Otherwise, processing moves to processing block 706 where processing logic sets i equal to the first line that resembles column formatted data.

  Next, processing logic applies a hash function H (k) to each token in line i (processing block 708) and finds a set of tuples at H (k) in the hash table for each token in line i. , Add the tuple to list L, and reclassify list L into a set of accumulators where each accumulator tuple has the same row value (processing block 712). Further, processing logic sorts the list L by the length of each Ai (processing block 714) and checks for the appearance of a unique column in the sorted list L (processing block 716). At processing block 710, optional pre-processing logic is performed to filter the tokens before insertion into the list L so that only tuples with a type that matches the lexical type of the original token k are added to L. . In some embodiments, the step of confirming the appearance of a unique column is omitted for speed or simplicity reasons. In yet another embodiment, a tuple is simply a “single set” that includes only row numbers (ie, neither column numbers nor type indicators).

  Thereafter, if the incoming message contains more lines similar to the column formatted data (processing box 718), processing logic sets i to the next line similar to the column formatted data. Step by step (processing block 722) and processing moves to processing block 706. Otherwise, processing logic reports a line of text with Ai that exceeds a predetermined size and has a unique column number (processing block 720).

  As shown in FIG. 7B, processing logic receives “width” (W) and “jump” (J) parameters specified by the user (processing block 732) and analyzes the incoming message (processing block 734). ) Start with stage. Parameter W specifies the number of adjacent tokens in each block of adjacent tokens that will be searched during a single iteration, and parameter J specifies the number of tokens required between two adjacent blocks To do.

Next, processing logic sets the value of the position variable (S _t ) to zero (processing block 736) and collects the tokens of W adjacent messages that begin with S _t , thereby searching the block (“text block” ) Is defined (processing block 738).

  Further, processing logic applies a hash function H (k) to each token in the text block (processing block 740) and finds a set of tuples at H (k) in the hash table for each token in the text block. Add a tuple with the same type as the corresponding token in the text block to processing list 742 (processing block 742), reclassify the processing list L into a set of accumulators (processing block 744) The list L is sorted (processing block 746) and the occurrence of a unique column in the sorted list L is checked (processing block 748).

Thereafter, processing logic, escalating S _t only J number of tokens (processing block 750), the position S _t is still determined whether the message (processing box 752). If the determination is positive, processing moves to processing block 738. Otherwise, processing logic reports a text block with Ai that exceeds a predetermined size and has a unique column number (processing block 758).

  As shown in FIG. 7C, processing logic begins with parsing the incoming message (processing block 764) and looking for the first representation with the user specified format (processing block 766). Such a representation is, for example, an account number, social security number, credit card number, financial value or text format indicating a numerical value (eg, a “$” sign with a number). If no match expression is found, processing moves to processing block 764. If found, processing moves to processing block 768 where processing logic defines the block to search (“text block”) by collecting W adjacent tokens before and after the match expression. For example, the text block includes 10 tokens immediately before the matching expression, the matching expression itself, and 10 tokens immediately after the matching expression.

  Further, processing logic applies a hash function H (k) to each token in the text block (processing block 770) and finds a set of tuples at H (k) in the hash table for each token in the text block. Add a tuple with the same type as the corresponding token in the text block to processing list 772 (processing block 772), reclassify the processing list L into a set of accumulators (processing block 774) The list L is sorted (processing block 776) and the occurrence of a unique column in the sorted list L is confirmed (processing block 778).

  Thereafter, processing logic determines whether the message has more representations of the format specified by the user (processing box 780). If the determination is positive, processing moves to processing block 768. Otherwise, processing logic reports a text block with Ai that exceeds a predetermined size and has a unique column number (processing block 782).

Typical Applications In one embodiment, the PMS is placed on a company network so that it can communicate securely with an organization database (where records that need to be protected reside) during normal operation. It is assumed that In the course of normal operation, it is further assumed that the MMS is arranged to monitor and / or block email communications with all outside the organization.

  In this example, assume that an organization wants to protect a database table called “customer record” that contains four columns: 1) name, 2) last name, 3) credit card number, and 4) balance. An employee of this organization will use a user interface application provided by the PMS to specify that the customer record table needs protection against email theft. The PMS then indexes the records in the customer record table, which consists of a hash table derived from the string values of the cells in the database. In other words, the number in the hash table is examined using the number in the cell. The hash table itself includes a record of each row number, column number, and data type of the cell itself. In the case of collisions often found in hash tables, the “collision list” keeps a number of such records regarding row numbers, column numbers and types. Once all the cells in the database table have been hashed into such a structure, an index is created and ready for transmission to the MMS. Note that the index does not include a record of the database data itself. This is an important safety constraint that this system meets.

  After the MMS receives the index, it parses the message and recreates the in-memory hash table in the same manner as it was created by the PMS.

When MMS picks up an external email message and parses it, it uses this index in the manner described below, and any of these emails contains data from the database. Detect whether or not. This is done by parsing individual lines of text from the email message. This includes decoding the surrounding file type and converting everything into raw text (eg stripping all formatting information from a Microsoft word file and leaving only the text itself). ing. This series of lines of text is analyzed in the individual words by looking for the separation mark, such as a punctuation of "space" sign or other forms. These words are text tokens. The system looks up the index by applying a hash function to each token for each line of text tokens. The result of this operation is a hash table collision list for each token on the line. As explained above, each collision list is itself a set of data elements that store possible row numbers, column numbers, and type triplets. If you know that all triplets unions have been taken from all collision lists, and you know that a set of triplets have the same row number but different column numbers, you are likely to The line contains records from the database. As used herein, the term “tuple” is not limited to the specific case of row number, column number, and type triplet, and refers to a data structure that does not include all three parameters. For example, in one embodiment, a tuple includes a row number, but does not include a column number and database data type.

Comparison with the prior art The database query mechanism is significantly different from the teachings described here. One difference is that the B-tree actually contains fragments of database tables that the B-tree indexes. In the above method, a copy of database data is not stored inside the index. This is important because, as mentioned above, MMS must have a copy of the index to protect data from leakage, but at the same time it is best deployed to locations in the network that are exposed to significant threats. . It is an important requirement to keep the index used by the MMS free from any component of the data in the database.

  Another difference between the standard database query mechanism and the invention outlined here relates to the type of query required. The standard set of queries used for relational databases is based on predicate logic using connectives such as AND or OR. This basic system usually does not work well for detecting database data that is cut and pasted into email and webmail messages. Database data that is cut and pasted into an email message is usually from a report, and each line often contains data that is foreign and not found inside the database table. One example is, for example, an email message that contains accounting information for a group of consumers. Such messages include, for example, a large amount of records from the core database that need protection, such as name, surname, social security number, but also information that is not in the core database table. A typical example is information “linked” from other databases. Another example is a simple line format token that separates the fields of data in the database. Because of the possibility of this extra data seen on each of these lines, standard predicate logic conjunctions such as AND and OR applied to each token on the outgoing message line (OR (If) produces excessive hits or (if AND) produces zero hits. In the description here, the system can detect the presence of n or more tokens, all from the same row of the database table, even though n is significantly less than the total number of tokens in the line. This is another important difference between the present invention and the above prior art regarding databases and document query mechanisms.

  There are several significant differences between the above techniques and information retrieval techniques. First, the indexes of these systems contain the same terms (in the term index) that are stored in the protected database. Again, the system deploys this index to a network location where it can be threatened by hackers, which is an obvious drawback. Second, these query systems perform Boolean queries using forms of predicate logic such as AND and OR. As mentioned earlier, this method is clearly disadvantageous for detecting database records that may be “concatenated” with foreign data from other tables.

  The file shingling technique is similar to the technique described here, but is substantially different. In file shingling, the main subject of interest is text data (prose, software, summary, etc.). The techniques described here focus on protecting database data. One difference is that database data from a given database table appears in a row or column order that is arbitrarily reordered in the test message. These permutations are usually the simple result of a query mechanism applied to extract database data. A database query is a block of database data that appears in any column order and any row order. For this reason, applying the basic technique of file shingling to database data does not work. File shingling assumes that the same linear sequence follows between the protected document and the test document.

  There are many important differences between Internet content filtering systems and the teachings described herein. As mentioned earlier, Internet content filtering systems are based on keyword searches. The state-of-the-art techniques described above build abstract data structures from the database that we want to protect. This abstract data structure does not contain the fragment of text that is to be protected. The keyword filtering system must contain several representations of the text you are searching for in order to perform queries on that text. A second important difference is that these Internet content filtering systems do not intend to protect database data. Using regular expression matching to detect violations of the organization's confidentiality policy on database data makes the detection method very inaccurate. These systems are primarily used to stop employees from misusing the Internet when it is related to pornographic or abusive content and language. Such a system, when applied to the protection of database data, uses regular expressions to align with database records. This also transmits database data fragments to computers on the network where the danger of safety is greatest.

Exemplary Computer System FIG. 8 is a block diagram of an exemplary computer system that performs one or more of the operations described herein. As shown in FIG. 8, the computer system 800 includes a typical client 850 or server 800 computer system. Computer system 800 includes a communication mechanism or bus 811 for communicating information, and a processor 812 coupled to bus 811 for processing information. The processor 812 includes, but is not limited to, a microprocessor such as Pentium ^™ , PowerPC ^™ , Alpha ^™, and the like.

  System 800 includes random access memory (RAM) or other dynamic storage device 804 (referred to as main memory) coupled to bus 811 for storing information and instructions executed by processor 812. In addition. Main memory 804 is also used to store temporary variables or intermediate information while processor 812 is executing instructions.

  Computer system 800 includes a read only memory (ROM) and / or other static storage device 806 coupled to bus 811 for storing static information and instructions for processor 812, such as a magnetic disk or optical disk. A data storage device 807 and its corresponding disk drive are further provided. Data storage device 807 is coupled to bus 811 for storing information and instructions.

  The computer system 800 is further coupled to a display device 821 such as a cathode ray tube (CRT) or liquid crystal display (LCD) that is coupled to the bus 811 for displaying information to a computer user. An alphanumeric input device 822 containing alphanumeric characters and other keys is also coupled to bus 811 for communicating information and command selections to processor 812. Additional user input devices communicate instruction information and command selections to the processor 812, mouse, trackball, trackpad, stylus or cursor direction keys coupled to the bus 811 to control cursor movement on the display. The cursor control 823 is as follows.

  Another device coupled to the bus 811 is a hard copy device 824 used to print instructions, data or other information on media such as paper, film or similar type media. In addition, audio recording and playback devices, such as speakers and / or microphones, are optionally coupled to the bus 811 for providing an acoustic interface with the computer system 800. In addition, a device connected to the bus 811 includes a wired / wireless communication device 825 for communicating with a telephone or a portable device.

  Note that any or all of the components of system 800 and associated hardware can be used in the present invention. However, other configurations of the computer system may include part or the front of the apparatus.

  After reading the foregoing description, many changes and modifications relating to the present invention will no doubt become apparent to those skilled in the art, but the specific details shown and described for clarity. The embodiments do not limit the present invention. Accordingly, references to details of various embodiments are not intended to limit the scope of the claims, which enumerate only the features that are considered essential to the invention.

1 illustrates one embodiment of a workflow. A typical mode of operation is shown. A typical mode of operation is shown. FIG. 3 is a flow diagram of one embodiment of a process for protecting data in a database. FIG. 3 is a flow diagram of one embodiment of a process for indexing data in a database. FIG. 4 is a flow diagram of one embodiment of a process for searching information content of preselected data. FIG. 3 is a flow diagram of one embodiment of a process for finding a match for a subset of content fragments in an abstract data structure derived from preselected data. FIG. 6 is a flow diagram of an alternative embodiment of a process for searching for incoming messages using a pre-selected data hash table index. FIG. 6 is a flow diagram of an alternative embodiment of a process for searching for incoming messages using a pre-selected data hash table index. FIG. 6 is a flow diagram of an alternative embodiment of a process for searching for incoming messages using a pre-selected data hash table index. FIG. 2 is a block diagram of a representative computer system that performs one or more operations described herein. 1 is a block diagram of one embodiment of a system for client-based protection of preselected sensitive data. FIG. FIG. 5 is a flow diagram of one embodiment of a process for protecting preselected sensitive data on a client basis.

Claims (39)

A message monitoring system monitoring a plurality of messages electronically transmitted to reach individual destinations over a network for preselected data;
Performing a content search of the plurality of messages by the message monitoring system to determine whether one or more of the retrieved messages includes at least a portion of the preselected data; And performing a content search of a message containing a plurality of content fragments,
Exploring an abstract data structure to identify an entry in the abstract data structure that includes a pre-created hash or cipher of the preselected data corresponding to a hash or cipher of the content fragment The abstract data structure is an index of the preselected data having a table structure, and the abstract data structure entry includes a pre-created hash of the contents of a cell in the table structure or Identifying the text and the row number of the cell, wherein the abstract data structure does not represent the contents of a cell in the table structure of the preselected data;
Determining a group of content fragments, each group associated with a hash or cipher corresponding to a pre-created hash or cipher of entries in the abstract data structure having the same line number Determining the content fragment to contain;
Determining if any group satisfies at least one condition, determining that the message includes at least a portion of the preselected data;
In response to the message monitoring system determining that the message on which the content search has been performed includes at least a portion of the pre-selected data, the message is prevented from reaching the individual destination. A method comprising: The abstract data structure does not include a copy of the preselected data;
The method of claim 1, wherein the at least one condition is a quantity threshold that is satisfied if any group includes a quantity of content fragments that reach or exceed the quantity threshold.   The method of claim 1, wherein each entry in the abstract data structure further comprises a column number of a cell in the table structure and a column type of a cell in the table structure.   The method of claim 1, further comprising creating the abstract data structure based on the preselected data extracted from a database prior to performing the content search. the method of. Each entry in the abstract data structure further includes a cell column number, the condition is a quantity threshold for a content fragment, and performing the content search of the message further comprises:
Parsing individual lines of text in the message and parsing the message with content fragments that are words or phrases;
Applying a hash function to at least a portion of the content fragment to create a hash of the content fragment;
Creating a hash table collision list for each content fragment, wherein the hash table collision list is a list of matches between pre-created hashes for entries in the abstract data structure and content fragment hashes Creating each of the groups having a content fragment associated with a hash table collision list identifying entries in the abstract data structure having the same row number;
If any group includes at least a content fragment quantity threshold associated with a hash table collision list identifying entries in the abstract data structure having different column numbers, the message is preselected 2. The method of claim 1, comprising determining to include at least a portion of the data. The step of performing a content search of the message further includes:
Before searching the abstract data structure, each line of text in the message is parsed, the message is parsed with content fragments that are words or phrases, and the preselected in the message. Detecting a sequence of content fragments that may contain a portion of the data,
Applying a hash function or encryption function to at least a portion of the content fragments in the sequence to create a hash or ciphertext of the content fragments;
An entry in the abstract data structure that searches the abstract data structure and includes a pre-created hash or cipher of the preselected data corresponding to a hash or cipher of content fragments in the sequence The method of claim 1 including the step of: Detecting the sequence of content fragments that may contain a portion of the preselected data;
Searching the body of the message for an expression having the predetermined format using a search rule defining a predetermined format, wherein the expression having the predetermined format includes an account number, a social security number, a credit card Searching for a number, telephone number, postal code, email address, cash amount or driver's license number;
Determining that an area surrounding the representation may include a portion of the preselected data, wherein the region surrounding the representation is adjacent to the front and back of the representation And determining the amount of data fragments to be included. Means for monitoring a plurality of electronically transmitted messages to reach individual destinations on the network for embedded preselected data;
Means for performing a content search of the plurality of messages and determining whether one or more of the retrieved plurality of messages includes at least a portion of the preselected data; The stage of performing a content search for messages containing fragments is:
Exploring an abstract data structure to identify an entry in the abstract data structure that includes a pre-created hash or cipher of the preselected data corresponding to a hash or cipher of the content fragment The abstract data structure is an index of the preselected data having a table structure, and the entry in the abstract data structure is a pre-created hash of the contents of a cell in the table structure Identifying the abstract data structure that does not represent the contents of a cell in the table structure of the preselected data, comprising:
Determining a group of content fragments, each group associated with a hash or cipher that matches a pre-created hash or cipher of an entry in the abstract data structure having the same line number Determining the content fragment to contain;
Determining means if any group satisfies at least one condition, determining that the message includes at least a portion of the preselected data;
Means for preventing the message from reaching the individual destination in response to determining that the message on which the content search has been performed includes at least a portion of the preselected data. A device characterized by comprising. When executed on a processor, the processor
Monitoring a plurality of electronically transmitted messages to reach individual destinations on the network for preselected data;
Performing a content search of the plurality of messages to determine whether one or more of the retrieved plurality of messages includes at least a portion of the preselected data, the plurality of contents The stage of performing a content search for messages containing fragments is:
Exploring an abstract data structure to identify an entry in the abstract data structure that includes a pre-created hash or cipher of the preselected data corresponding to a hash or cipher of the content fragment The abstract data structure is an index of the preselected data having a table structure, and the abstract data structure entry includes a pre-created hash of the contents of a cell in the table structure or Identifying the text and the row number of the cell, wherein the abstract data structure does not represent the contents of a cell in the table structure of the preselected data;
Determining a group of content fragments, each group associated with a hash or cipher that matches a pre-created hash or cipher of an entry in the abstract data structure having the same line number Determining the content fragment to contain;
Determining if any group satisfies at least one condition, determining that the message includes at least a portion of the preselected data;
In response to determining that a message for which a content search has been performed includes at least a portion of the preselected data, preventing the message from reaching the individual destination;
Computer-readable storage medium storing instructions for executing a method comprising. An abstract data structure derived from data elements of preselected sensitive data having a table structure, wherein the abstract data structure is an index of the preselected data having a table structure and the abstract The entry in the static data structure includes a pre-created hash or secret of the contents of the cells in the table structure and the row number of the cells, and the contents of the cells in the table structure of the preselected sensitive data A personal computer device receives an abstract data structure that does not contain from a server;
A plurality of personal computer devices for indicia indicating that at least some of the preselected sensitive data stored in the server is included in the contents of a plurality of data storage media of the personal computer device; Searching the contents of the data storage medium, wherein the searching step comprises:
The abstract data structure was searched and pre-created for the pre-selected data that is a content fragment of content from a storage medium that matches a hash or cipher of the content fragment containing a word or phrase Identifying an entry in an abstract data structure containing a hash or secret;
Determining a group of content fragments, each group associated with a hash or cipher that matches a pre-generated hash or cipher of entries having the same line number in the abstract data structure A step of determining including determining a content fragment that is included, and
A plurality of data stores in the personal computer device to detect that a portion of the preselected sensitive data stored in the server is stored in the personal computer device by a user of the personal computer device Detecting in at least one content of the medium at least a portion of the preselected sensitive data based on the group meeting at least one condition;
Sending a notification from the personal computer device to the server regarding the detection of a portion of the preselected sensitive data.   11. The method of claim 10, further comprising preventing access to the detected data if at least a portion of the preselected sensitive data is detected.   The method of claim 10, wherein the content is searched periodically.   The method of claim 10, wherein the content is searched when the personal computer device is disconnected from the network. Sending the notification comprises:
Creating a message that includes a notification of detection of the preselected sensitive data upon detecting the preselected sensitive data;
Placing the message in a send queue;
14. The method of claim 13, comprising transmitting the message to the system after the personal computer device is reconnected to the system.   11. The method of claim 10, further comprising receiving instructions from the server that define a search range for the personal computer device.   Exploring the contents of a plurality of data storage media of the personal computing device includes monitoring one or more specific data operations for the presence of at least a portion of the preselected sensitive data. The method according to claim 10, characterized in that:   At least one of the one or more specific data operations is file read, file write, file update, read from removable media device, write to removable media device, and on the personal computer device 17. The method of claim 16, wherein the method is selected from the group consisting of: access to data stored in any of the plurality of data storage media by a program running on the computer.   The method of claim 10, wherein the preselected sensitive data is maintained by an organization in at least one of a spreadsheet, a flat file, and a database. Each of the abstract data structure entries further includes a column number of the cell and optionally a column type, and the searching step further comprises:
Analyzing the content of the storage medium with the content fragment;
Applying a hash function to at least a portion of the content fragment to create a hash of the content fragment;
Creating a hash table collision list for each of the content fragments, wherein the hash table collision list is a match between a pre-created hash for the entry in the abstract data structure and a hash of the content fragment. And each group includes creating a hash table collision list having content fragments associated with a hash table collision list that identifies entries in the abstract data structure having the same row number. The method according to claim 18.   The method of claim 10, wherein the plurality of data storage media are selected from the group consisting of main memory, static memory, and mass storage memory. Searching the contents of the plurality of data storage media comprises:
Searching the contents of each volatile storage device in the plurality of data storage media;
11. The method of claim 10, comprising searching the contents of each permanent storage device in the plurality of data storage media.   The method of claim 21, further comprising detecting use of the preselected data by an application running on the personal computing device. Identifying the application using the preselected data;
The method of claim 21, further comprising reporting the identified application. Means for a personal computing device to receive from a server an abstract data structure derived from data elements of preselected sensitive data having a table structure, wherein the abstract data structure has the table structure The abstract data structure entry includes a pre-created hash or ciphertext of the contents of the cells in the table structure and the row number of the cell, the abstract data structure being Means for receiving the preselected sensitive data not including the contents of the cells in the table structure;
A plurality of personal computer devices for indicia indicating that at least some of the preselected sensitive data stored in the server is included in the contents of a plurality of data storage media of the personal computer device; Means for searching the contents of the data storage medium, wherein the searching means comprises:
The abstract data structure was searched and pre-created for the pre-selected data that is a content fragment of content from a storage medium that matches a hash or cipher of the content fragment containing a word or phrase Identifying an entry in an abstract data structure containing a hash or secret;
Determining a group of content fragments, each group associated with a hash or cipher that matches a pre-generated hash or cipher of entries having the same line number in the abstract data structure A means for determining comprising determining a content fragment that is included, and
A plurality of data stores in the personal computer device to detect that a portion of the preselected sensitive data stored in the server is stored in the personal computer device by a user of the personal computer device Means for detecting at least a portion of the pre-selected sensitive data based on the group satisfying at least one condition in at least one content of the medium;
Means for sending a notification from the personal computer device to the server regarding detection of a portion of the preselected sensitive data;
A device characterized by comprising:   The apparatus of claim 24, wherein the content is searched periodically.   25. The device of claim 24, wherein the content is searched when the personal computer device is disconnected from the network. The means for sending the notification is:
Means for creating a message including a notification of detection of the preselected sensitive data upon detecting the preselected sensitive data;
Means for placing the message in a transmission queue;
25. The apparatus of claim 24, further comprising: means for transmitting the message to the system after the personal computer device is reconnected to the system.   25. The apparatus of claim 24, further comprising means for receiving instructions from the server that define a search range for the personal computer device.   The means for searching the contents of a plurality of data storage media of the personal computer device is for monitoring one or more specific data operations for the presence of at least a portion of the preselected sensitive data. 25. The apparatus of claim 24, comprising:   At least one of the one or more specific data operations is file read, file write, file update, read from removable media device, write to removable media device, and on the personal computer device 30. The apparatus of claim 29, wherein the apparatus is selected from the group consisting of: access to data stored in any of the plurality of data storage media by a program running on the computer.   25. The apparatus of claim 24, wherein the plurality of data storage media are selected from the group consisting of main memory, static memory, and mass storage memory. The means for searching the contents of the plurality of data storage media includes:
Means for searching the contents of each volatile storage device in the plurality of data storage media;
25. The apparatus of claim 24, comprising: means for searching the contents of each permanent storage device in the plurality of data storage media.   The apparatus of claim 32, further comprising means for detecting use of the preselected data by an application running on the personal computing device. Means for identifying the application using the preselected data;
The apparatus of claim 32, further comprising means for reporting the identified application. When executed on a processor, the processor
Receiving an abstract data structure derived from data elements of pre-selected sensitive data having a table structure from a server, wherein the abstract data structure has the table structure The abstract data structure entry includes a pre-created hash or ciphertext of the contents of the cells in the table structure and the row number of the cell, the abstract data structure being Receiving the pre-selected sensitive data not including the contents of the cells in the table structure;
A plurality of personal computer devices for indicia indicating that at least some of the preselected sensitive data stored in the server is included in the contents of a plurality of data storage media of the personal computer device; Searching for the content of the data storage medium by the personal computer device, wherein the searching step comprises:
The abstract data structure was searched and pre-created for the pre-selected data that is a content fragment of content from a storage medium that matches a hash or cipher of the content fragment containing a word or phrase Identifying an entry in an abstract data structure containing a hash or secret;
Determining a group of content fragments, each group associated with a hash or cipher that matches a pre-generated hash or cipher of entries having the same line number in the abstract data structure A step of determining including determining a content fragment that is included, and
A plurality of data stores in the personal computer device to detect that a portion of the preselected sensitive data stored in the server is stored in the personal computer device by a user of the personal computer device Detecting, by the personal computer device, at least a portion of the preselected sensitive data based on the group satisfying at least one condition in at least one content of the medium;
Sending a notification from the personal computing device to the server regarding detection of a portion of the preselected sensitive data;
A computer-readable storage medium storing instructions for performing a method comprising:   The method of claim 1, wherein the at least one condition is a quantity threshold that is satisfied if any group includes a quantity of content fragments that reach or exceed the quantity threshold. 10. The computer readable storage medium of claim 9, wherein the at least one condition is a quantity threshold that is satisfied if any group contains a quantity of content fragments that reach or exceed the quantity threshold. .   The method of claim 10, wherein the at least one condition is a quantity threshold that is satisfied if any group includes a quantity of content fragments that reach or exceed the quantity threshold.   25. The apparatus of claim 24, wherein the at least one condition is a quantity threshold that is satisfied when any group includes a quantity of content fragments that reach or exceed the quantity threshold.

Images