US 8,005,863 B2Grant
Query generation for a capture system
Issue Date:2011-08-23
•20 Claims
•22 Drawing Sheets
Abstract
A document accessible over a network can be registered. A registered document, and the content contained therein, is not transmitted undetected over and off of the network. In one embodiment, the invention includes a manager agent to maintain signatures of registered documents and a match agent to detect the unauthorized transmission of the content of registered documents.
Metadata
Assignee
- McAfee, Inc.
Inventors
- Erik de la Iglesia
- William Deninger
- Ratinder Paul Singh Ahuja
Application Information
Application Number:US 12/690,153
Filing Date:2010-01-20
Priority Date:2006-05-22
Art Unit:2155
Classifications
IPC:
G06F17/30
Patent Drawings (22 sheets)
Description
RELATED APPLICATION
[0001] This Application is a continuation (and claims the benefit of priority under 35 U.S.C. §120) of U.S. application Ser. No. 11/439,488, filed May 22, 2006, now U.S. Pat. No. 7,689,614 entitled “QUERY GENERATION FOR A CAPTURE SYSTEM,” Inventor(s) Erik de la Iglesia, et al. The disclosure of the prior application is considered part of (and is incorporated by reference in) the disclosure of this application.
FIELD OF THE INVENTION
[0002] The present invention relates to computer networks, and in particular, to registering documents in a computer network.
BACKGROUND
[0003] Computer networks and systems have become indispensable tools for modern business. Modern enterprises use such networks for communications and for storage. The information and data stored on the network of a business enterprise is often a highly valuable asset. Modern enterprises use numerous tools to keep outsiders, intruders, and unauthorized personnel from accessing valuable information stored on the network. These tools include firewalls, intrusion detection systems, and packet sniffer devices.
[0004] FIG. 1 illustrates a simple prior art configuration of a local area network (LAN) 100 connected to the Internet 102. Connected to the LAN 100 are various components, such as servers 104, clients 106, and switch 108. Numerous other networking components and computing devices are connectable to the LAN 100. The LAN 100 may be implemented using various wireline or wireless technologies, such as Ethernet and the 802.11 the IEEE family of wireless communication standards. LAN 100 could be connected to other LANs.
[0005] In this prior configuration, the LAN 100 is connected to the Internet 102 via a router 110. This router 110 may be used to implement a firewall. Firewalls are widely used to try to provide users of the LAN 100 with secure access to the Internet 102 as well as to provide separation of a public Web server (for example, one of the servers 104) from an internal network (for example, LAN 100). Data leaving the LAN 100 to the Internet 102 passes through the router 110. The router 110 simply forwards packets as is from the LAN 100 to the Internet 102.
[0006] However, once an intruder has gained access to sensitive content inside a LAN such as LAN 100, there presently is no network device that can prevent the electronic transmission of the content from the network to outside the network. Similarly, there is no network device that can analyse the data leaving the network to monitor for policy violations, and make it possible to track down information leeks.
[0007] Prior data storage techniques placed files/data in open locations of a disk. The location was not dependent on the time of the storage request. The location could be dependent on the relative importance (important files and/or files likely to be retrieved from the disk frequently are assigned to inner-areas of the disk) and/or what space is open. FIG. 2 illustrates an exemplary prior art disk storing three files (A, B, and C) with each file occupying three blocks of space. These files were stored in the order of A, then B, and finally C. Each of these files contains files A and B contain the same text (“example—1”) and file C contains text different than A and B (“example—2”). File A is stored in an inner-area. Files B and C are image files that are not used frequently. File C is stored in an intermediate location of the disk that was open. As illustrated, File B is stored in area farther out than A or B and is not stored in contiguous blocks. If these files were stored based on time, then A would be an innermost-area, followed by B, and then C.
[0008] When searching for a particular file or files that were stored in the prior art storage technique the entire disk and/or file system (such as a file allocation table or FAT) was searched to find the desired file or files. FIG. 3 illustrates an exemplary prior art search using lists. As shown, each block (or each line of the file system) is search serially until the desired information is located. When the information is found it is added to a list of positive matches.
[0009] If the search was to determine what files have the text “example—1” and “example—2” two different lists (list A and list B) would be created after each serial search is performed. After the two lists are created, the cross product (A×B) is performed and the results are evaluated. This means that the number of evaluations that have to be performed is the number of matches of in A multiplied by the number of matches in B. In other words, when looking for more than one piece of data, the search becomes an order n2 operation.
BRIEF DESCRIPTION OF THE DRAWINGS
[0010] The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings in which like reference numerals refer to similar elements and in which:
[0011] FIG. 1 is a block diagram illustrating a computer network connected to the Internet;
[0012] FIG. 2 is a block diagram illustrating one configuration of a capture system according to one embodiment of the present invention;
[0013] FIG. 3 is a block diagram illustrating the capture system according to one embodiment of the present invention;
[0014] FIG. 4 is a block diagram illustrating an object assembly module according to one embodiment of the present invention;
[0015] FIG. 5 is a block diagram illustrating an object store module according to one embodiment of the present invention;
[0016] FIG. 6 is a block diagram illustrating a document registration system according to one embodiment of the present invention;
[0017] FIG. 7 is a block diagram illustrating registration module according to one embodiment of the present invention; and
[0018] FIG. 8 illustrates an embodiment of the flow of the operation of a registration module;
[0019] FIG. 9 is a flow diagram illustrating an embodiment of a flow to generate signatures;
[0020] FIG. 10 is a flow diagram illustrating an embodiment of changing tokens into document signatures;
[0021] FIG. 11 illustrates an embodiment of a registration engine that generates signatures for documents;
[0022] FIG. 12 illustrates an exemplary embodiment of a system for the detection of registered content is performed on a distributed basis;
[0023] FIG. 13 shows an embodiment of a computing system (e.g., a computer);
[0024] FIG. 14 illustrates an exemplary flow of querying captured objects;
[0025] FIG. 15 illustrates an exemplary embodiment of a capture system for querying captured data;
[0026] FIGS. 16( a)-(c) illustrate an embodiment of an exemplary storage configuration for data received by a capture system;
[0027] FIG. 17 illustrates an embodiment of a method for performing a query in a capture system;
[0028] FIG. 18 illustrates pipeline staggering;
[0029] FIG. 19 illustrates the exemplary query being performed; and
[0030] FIG. 20 shows an embodiment of a computing system.
DETAILED DESCRIPTION
[0031] Although the present system will be discussed with reference to various illustrated examples, these examples should not be read to limit the broader spirit and scope of the present invention. Some portions of the detailed description that follows are presented in terms of algorithms and symbolic representations of operations on data within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the computer science arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared and otherwise manipulated.
[0032] It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers or the like. It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise, it will be appreciated that throughout the description of the present invention, use of terms such as “processing”, “computing”, “calculating”, “determining”, “displaying” or the like, refer to the action and processes of a Computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
Exemplary Networks
[0033] As described earlier, the router 110 of the prior art simply routes packets to and from a network and the Internet. While the router may log that a transaction has occurred (packets have been routed), it does not capture, analyze, or store the content contained in the packets.
[0034] FIG. 4 illustrates an embodiment of a system utilizing a capture device. In FIG. 4 , the router 410 is also connected to a capture system 400 in addition to the Internet 402 and LAN 412. Generally, the router 410 transmits the outgoing data stream to the Internet 402 and a copy of that stream to the capture system 400. The router 410 may also send incoming data to the capture system 400 and LAN 412.
[0035] However, other configurations are possible. For example, the capture system 400 may be configured sequentially in front of or behind the router 410. In systems where a router is not used, the capture system 400 is located between the LAN 412 and the Internet 402. In other words, if a router is not used the capture system 400 forwards packets to the Internet. In one embodiment, the capture system 400 has a user interface accessible from a LAN-attached device such as a client 406.
[0036] The capture system 400 intercepts data leaving a network such as LAN 412. In an embodiment, the capture system also intercepts data being communicated internal to a network such as LAN 412. The capture system 400 reconstructs the documents leaving the network 100 and stores them in a searchable fashion. The capture system 400 is then usable to search and sort through all documents that have left the network 100. There are many reasons such documents may be of interest, including network security reasons, intellectual property concerns, corporate governance regulations, and other corporate policy concerns. Exemplary documents include, but are not limited to, Microsoft Office documents, text files, images (such as JPEG, BMP, GM, etc.), Portable Document Format (PDF) files, archive files (such as GZIP, ZIP, TAR, JAR, WAR, RAR, etc.), email messages, email attachments, audio files, video files, source code files, executable files, etc.
Capture System
[0037] FIG. 5 shows an embodiment of a capture system in greater detail. A capture system (such as capture system 400 or 512) may also be referred to as a content analyzer, content or data analysis system, or other similar name. For simplicity, the capture system has been labeled as capture system 500. However, the discussion regarding capture system 500 is equally applicable to capture system 400. A network interface module 500 receives (captures) data from a network or router. Exemplary network interface modules 500 include network interface cards (NICs) (for example, Ethernet cards). More than one NIC may be present in the capture system 512.
[0038] Captured data is passed to a packet capture module 502 from the network interface module 500. The packet capture module 502 extracts packets from this data stream. Packet data is extracted from a packet by removing the headers and checksums from the packet. The packet capture module 502 may extract packets from multiple sources to multiple destinations for the data stream. One such case is asymmetric routing where packets from source A to destination B travel along one path but responses from destination B to source A travel along a different path. Each path may be a separate “source” for the packet capture module 502 to obtain packets.
[0039] An object assembly module 504 reconstructs the objects being transmitted from the packets extracted by the packet capture module 502. When a document is transmitted, such as in email attachment, it is broken down into packets according to various data transfer protocols such as Transmission Control Protocol/Internet Protocol (TCP/IP), UDP, HTTP, etc. The object assembly module 504 is able to reconstruct the original or reasonably equivalent document from the captured packets. For example, a PDF document would be broken down into packets before being transmitted from a network, these packets are reconfigurable to form the original (or reasonable equivalent) PDF. A complete data stream is obtained by reconstruction of multiple packets. The process by which a packet is created is beyond the scope of this application.
[0040] FIG. 6 illustrates an embodiment of an object assembly module. This object assembly module 606 includes a reassembler 600, protocol demultiplexer (demux) 602, and a protocol classifier 604. Packets entering the object assembly module 606 are provided to the reassembler 600. The reassembler 600 groups (assembles) the packets into at least one unique flow. An exemplary flow includes packets with identical source IP and destination IP addresses and/or identical TCP source and destination ports. In other words, the reassembler 600 organizes a packet stream by sender and recipient.
[0041] The reassembler 600 begins a new flow upon the observation of a starting packet. This starting packet is normally defined by the data transfer protocol being used. For TCP/IP, the starting packet is generally referred to as the “SYN” packet. The flow terminates upon observing a finishing packet (for example, a “Reset” or “FIN” packet in TCP/IP). If the finishing packet is observed by the reassembler 600 within a pre-determined time constraint, the flow terminates via a timeout mechanism. A TCP flow contains an ordered sequence of packets that may be assembled into a contiguous data stream by the reassemble 600. Thus, a flow is an ordered data stream of a single communication between a source and a destination.
[0042] The flow assembled by the reassembler 600 is provided to a protocol demultiplexer (demux) 602. In an embodiment, the protocol demux 602 sorts assembled flows using ports, such as TCP and/or UDP ports, by performing a speculative classification of the flow contents based on the association of well-known port numbers with specified protocols. For example, Web Hyper Text Transfer Protocol (HTTP) packets (such as, Web traffic packets) are typically associated with TCP port 80, File Transfer Protocol (FTP) packets with TCP port 20, Kerberos authentication packets with TCP port 88, etc. Thus, the protocol demux 402 separates the different protocols that exist in a flow.
[0043] A protocol classifier 604 may further sort the flows in addition to the sorting done by the protocol demux 602. The protocol classifier 604 (operating either in parallel or in sequence to the protocol demux 602) applies signature filters to a flow to attempt to identify the protocol based solely on the transported data. Furthermore, the protocol classifier 604 may override the classification assigned by the protocol demux 402. The protocol classifier 604 uses a protocol's signature(s) (such as, the characteristic data sequences of a defined protocol) to verify the speculative classification performed by the protocol demux 602. For example, if an individual or program attempted to masquerade an illicit communication (such as file sharing) using an apparently benign port (for example, TCP port 80), the protocol classifier 604 would use the HTTP protocol signature(s) to verify the speculative classification performed by protocol demux 602.
[0044] An object assembly module, such as object assembly modules 504 and 606 outputs each flow, organized by protocol, which represent the underlying objects being transmitted. These objects are passed to the object classification module 506 (also referred to as the “content classifier”) for classification based on content. A classified flow may still contain multiple content objects depending on the protocol used. For example, a single flow using HTTP may contain over 100 objects of any number of content types. To deconstruct the flow, each object contained in the flow is individually extracted and decoded, if necessary, by the object classification module 506.
[0045] The object classification module 506 uses the inherent properties and/or signatures of various documents to determine the content type of each object. For example, a Word document has a signature that is distinct from a PowerPoint document or an email. The object classification module 506 extracts each object and sorts them according to content type. This classification prevents the transfer of a document whose file extension or other property has been altered. For example, a Word document may have its extension changed from .doc to .dock but the properties and/or signatures of that Word document remain the same and detectable by the object classification module 506. In other words, the object classification module 506 does more than simple extension filtering.
[0046] The object classification module 506 may also determine whether each object should be stored or discarded. This determination is based on definable capture rules used by the object classification module 506. For example, a capture rule may indicate that all Web traffic is to be discarded. Another capture rule could indicate that all PowerPoint documents should be stored except for ones originating from the CEO's IP address. Such capture rules may be implemented as regular expressions or by other similar means.
[0047] The capture rules may be authored by users of a capture system. The capture system may also be made accessible to any network-connected machine through the network interface module 500 and/or user interface 510. In one embodiment, the user interface 510 is a graphical user interface providing the user with friendly access to the various features of the capture system 512. For example, the user interface 510 may provide a capture rule authoring tool that allows any capture rule desired to be written. These rules are then applied by the object classification module 506 when determining whether an object should be stored. The user interface 510 may also provide pre-configured capture rules that the user select's from along with an explanation of the operation of such standard included capture rules. Generally, by default, the capture rule(s) implemented by the object classification module 506 captures all objects leaving the network that the capture system is associated with.
[0048] If the capture of an object is mandated by one or more capture rules, the object classification module 506 may determine where in the object store module 508 the captured object should be stored. FIG. 7 illustrates an embodiment of an object store module. Within the content store 702 are files 704 grouped up by content type. Thus, for example, if an object classification module (such as object classification module 506) determines that an object is a Word document that should be stored, it can store it in the file 704 reserved for Word documents. The object store module 706 may be internal to a capture system or external (entirely or in part) using, for example, some network storage technique such as network attached storage (NAS), and storage area network (SAN), or other database.
[0049] In an embodiment, the content store 702 is a canonical storage location that is simply a place to deposit the captured objects. The indexing of the objects stored in the content store 702 is accomplished using a tag database 700. The tag database 700 is a database data structure in which each record is a “tag” that indexes an object in the content store 702 and contains relevant information (metadata) about the stored object. An example of a tag record in the tag database 700 that indexes an object stored in the content store 702 is set forth in Table 1:
[0050]
| TABLE 1 | |
|---|---|
| Field Name | Definition (Relevant Information) |
| MAC Address | NIC MAC address |
| Source IP | Source IP Address of object |
| Destination IP | Destination IP Address of object |
| Source Port | Source port number of object |
| Destination Port | Destination port number of the object |
| Protocol | Protocol that carried the object |
| Instance | Canonical count identifying object within a |
| protocol capable of carrying multiple data within a | |
| single TCP/IP connection | |
| Content | Content type of the object |
| Encoding | Encoding used by the protocol carrying object |
| Size | Size of object |
| Timestamp | Time that the object was captured |
| Owner | User requesting the capture of object (possibly |
| rule author) | |
| Configuration | Capture rule directing the capture of object |
| Signature | Hash signature of object |
| Tag Signature | Hash signature of all preceding tag fields |
[0051] There are various other possible tag fields and some tag fields listed in Table 1 may not be used. In an embodiment, the tag database 500 is not implemented as a database and another data structure is used.
[0052] The tag fields shown in Table 1 can be expressed more generally, to emphasize the underlying information indicated by the tag fields in various embodiments. Some of these possible generic tag fields are set forth in Table 2:
[0053]
| TABLE 2 | |
|---|---|
| Field Name | Definition |
| Device Identity | Identifier of capture device |
| Source Address | Origination Address of object |
| Destination Address | Destination Address of object |
| Source Port | Origination Port of object |
| Destination Port | Destination Port of the object |
| Protocol | Protocol that carried the object |
| Instance | Canonical count identifying object within a |
| protocol capable of carrying multiple data within a | |
| single connection | |
| Content | Content type of the object |
| Encoding | Encoding used by the protocol carrying object |
| Size | Size of object |
| Timestamp | Time that the object was captured |
| Owner | User requesting the capture of object (rule author) |
| Configuration | Capture rule directing the capture of object |
| Signature | Signature of object |
| Tag Signature | Signature of all preceding tag fields |
[0054] For many of the above tag fields in Tables 1 and 2, the definition adequately describes the relational data contained by each field. For the content field, the types of content that the object can be labeled as are numerous. Some example choices for content types (as determined, in one embodiment, by the object classification module 30) are JPEG, GIF, BMP, TIFF, PNG (for objects containing images in these various formats); Skintone (for objects containing images exposing human skin); PDF, MSWord, Excel, PowerPoint, MSOffice (for objects in these popular application formats); HTML, WebMail, SMTP, FTP (for objects captured in these transmission formats); Telnet, Rlogin, Chat (for communication conducted using these methods); GZIP, ZIP, TAR (for archives or collections of other objects); Basic_Source, C++_Source, C_Source, Java_Source, FORTRAN_Source, Verilog_Source, VHDL_Source, Assembly_Source, Pascal_Source, Cobol_Source, Ada_Source, Lisp_Source, Perl_Source, XQuery_Source, Hypertext Markup Language, Cascaded Style Sheets, JavaScript, DXF, Spice, Gerber, Mathematica, Matlab, AllegroPCB, ViewLogic, TangoPCAD, BSDL, C_Shell, K_Shell, Bash_Shell, Bourne_Shell, FTP, Telnet, MSExchange, POP3, RFC822, CVS, CMS, SQL, RTSP, MIME, PDF, PS (for source, markup, query, descriptive, and design code authored in these high-level programming languages); C Shell, K Shell, Bash Shell (for shell program scripts); Plaintext (for otherwise unclassified textual objects); Crypto (for objects that have been encrypted or that contain cryptographic elements); Englishtext, Frenchtext, Germantext, Spanishtext, Japanesetext, Chinesetext, Koreantext, Russiantext (any human language text); Binary Unknown, ASCII Unknown, and Unknown (as catchall categories).
[0055] The mapping of tags to objects may be obtained by using unique combinations of tag fields to construct an object's name. For example, one such possible combination is an ordered list of the source IP, destination EP, source port, destination port, instance and timestamp. Many other such combinations including both shorter and longer names are possible. A tag may contain a pointer to the storage location where the indexed object is stored.
[0056] The objects and tags stored in the object store module 508 may be interactively queried by a user via the user interface 510. In one embodiment, the user interface interacts with a web server (not shown) to provide the user with Web-based access to the capture system 312. The objects in the object store module 508 are searchable for specific textual or graphical content using exact matches, patterns, keywords, and/or various other attributes.
[0057] For example, the user interface 510 may provide a query-authoring tool (not shown) to enable users to create complex searches of the object store module 308. These search queries are provided to a data mining engine (not shown) that parses the queries the object store module. For example, tag database 700 may be scanned and the associated object retrieved from the content store 702. Objects that matched the specific search criteria in the user-authored query are counted and/or displayed to the user by the user interface 510.
[0058] Searches may be scheduled to occur at specific times or at regular intervals. The user interface 510 may provide access to a scheduler (not shown) that periodically executes specific queries. Reports containing the results of these searches are made available to the user at runtime or at a later time such as generating an alarm in the form of an e-mail message, page, system log, and/or other notification format.
[0059] Generally, a capture system has been described above as a stand-alone device. However, capture systems may be implemented on any appliance capable of capturing and analyzing data from a network. For example, the capture system 510 described above could be implemented on one or more of the servers or clients shown in FIG. 1 . Additionally, a capture system may interface with a network in any number of ways including wirelessly.
Document Registration
[0060] The capture system described above implements a document registration scheme. A user registers a document with a capture system, the system then alerts the user if all or part of the content in the registered document is attempting to, or leaving, the network. Thus, un-authorized documents of various formats (e.g., Microsoft Word, Excel, PowerPoint, source code of any kind, text are prevented) are prevented from leaving an enterprise. There are great benefits to any enterprise that keeps its intellectual property, and other critical, confidential, or otherwise private and proprietary content from being mishandled. Sensitive documents are typically registered with the capture system 200, although registration may be implemented using a separate device.
[0061] FIG. 8 illustrates an embodiment of a capture/registration system. The capture/registration system 800 has components which are used in a similar number similar or identical to the capture system 500 shown in FIG. 5 , including the network interface module 602, the object store module 806, user interface 812, and object capture modules 804 (the packet capture 502, object assembly 504, and object classification 506 modules of FIG. 5 ).
[0062] The capture/registration system 800 includes a registration module 810 interacting with a signature storage 808 (such as a database) to help facilitate a registration scheme. There are numerous ways to register documents. For example, a document may be electronically mailed (e-mailed), uploaded to the registration system 800 (for example through the network interface module 1002 or through removable media), the registration system 800 scanning a file server (registration server) for documents to be registered, etc. The registration process may be integrated with an enterprise's document management systems. Document registration may also be automated and transparent based on registration rules, such as “register all documents,” “register all documents by specific author or IP address,” etc.
[0063] After being received, classified, etc., a document to be registered is passed to the registration module 810. The registration module 810 calculates a signature or a set of signatures of the document. A signature associated with a document may be calculated in various ways. An exemplary signature consists of hashes over various portions of the document, such as selected or all pages, paragraphs, tables and sentences. Other possible signatures include, but are not limited to, hashes over embedded content, indices, headers, footers, formatting information, or font utilization. A signature may also include computations and meta-data other than hashes, such as word Relative Frequency Methods (RFM)—Statistical, Karp-Rabin Greedy-String-Tiling-Transposition, vector space models, diagrammatic structure analysis, etc.
[0064] The signature or set of signatures associated on a document is stored in the signature storage 808. The signature storage 808 may be implemented as a database or other appropriate data structure as described earlier. In an embodiment, the signature storage 808 is external to the capture system 800.
[0065] Registered documents are stored as objects in the object store module 806 according to the rules set for the system. In an embodiment, only documents are stored in the content store 806 of the object system network. These documents have no associated tag since many tag fields do not apply to registered documents.
[0066] As set forth above, the object capture modules 802 extract objects leaving the network and store various objects based on capture rules. In an embodiment, all extracted objects (whether subject to a capture rule or not) are also passed to the registration module for a determination whether each object is, or includes part of, a registered document.
[0067] The registration module 810 calculates the set of one or more signatures of an object received from the object capture modules 804 in the same manner as the calculation of the set of one or more signatures of a document received from the user interface 812 to be registered. This set of signatures is then compared against all signatures in the signature database 808. However, parts of the signature database may be excluded from a search to decrease the amount comparisons to be performed.
[0068] A possible unauthorized transmission is detectable if any one or more signatures in the set of signatures of an extracted object matches one or more signatures in the signature database 808 associated with a registered document. Detection tolerances are usually configurable. For example, the system may be configured so that at least two signatures must match before a document is deemed unauthorized. Additionally, special rules may be implemented that make a transmission authorized (for example, if the source address is authorized to transmit any documents off the network).
[0069] A query generator 614 may be used to search the object store module 806 for specific documents, emails, etc.
[0070] An embodiment of a registration module is illustrated in FIG. 9 . As discussed above, a user may select a document to be registered. The registration engine 902 generates signatures for the document and forwards the document to content storage and the generated signatures to the signature database 808. Generated signatures are associated with a document, for example, by including a pointer to the document or to some attribute to identify the document.
[0071] The registration engine calculates signatures for a captured object and forwards them to the search engine 910. The search engine 910 queries the signature database 808 to compare the signatures of a captured object to the document signatures stored in the signature database 808. Assuming for the purposes of illustration, that the captured object is a Word document that contains a pasted paragraph from registered PowerPoint document, at least one signature of registered PowerPoint signatures will match a signature of the captured Word document. This type of event is referred to as the detection of an unauthorized transfer, a registered content transfer, or other similarly descriptive term.
[0072] When a registered content transfer is detected, the transmission may be halted or allowed with or without warning to the sender. In the event of a detected registered content transfer, the search engine 910 may activate the notification module 912, which sends an alert to the registered document owner. The notification module 912 may send different alerts (including different user options) based on the user preference associated with the registration and the capabilities of the registration system.
[0073] An alert indicates that an attempt (successful or unsuccessful) to transfer a registered content off the network has been made. Additionally, an alert may provide information regarding the transfer, such as source IP, destination IP, any other information contained in the tag of the captured object, or some other derived information, such as the name of the person who transferred the document off the network. Alerts are provided to one or more users via e-mail, instant message (IM), page, etc. based on the registration parameters. For example, if the registration parameters dictate that an alert is only to be sent to the entity or user who requested registration of a document then no other entity or user will receive an alert.
[0074] If the delivery of a captured object is halted (the transfer is not completed), the user who registered the document may need to provide consent to allow the transfer to complete. Accordingly, an alert may contain some or all of the information described above and additionally contain a selection mechanism, such as one or two buttons—to allow the user to indicate whether the transfer of the captured object is eligible for completing. If the user elects to allow the transfer, (for example, because he is aware that someone is emailing a part of a registered document (such as a boss asking his secretary to send an email), the transfer is executed and the captured object is allowed to leave the network.
[0075] If the user disallows the transfer, the captured object is not allowed off of the network and delivery is permanently halted. Several halting techniques may be used such as having the registration system proxy the connection between the network and the outside, using a black hole technique (discarding the packets without notice if the transfer is disallowed), a poison technique (inserting additional packets onto the network to cause the sender's connection to fail), etc.
Attributes
[0076] When a search of object captured by a capture system is performed, it is desirable to make the search as fast as possible. A technique to speed up searches is to perform searches over the tag database instead of the content store, since the content store will generally be stored on disk and is therefore far more costly both in terms of time and processing power.
[0077] A query is generally in the form of a regular expression. A regular expression is a string that describes or matches a set of string according to certain syntax rules. There are various well-known syntax rules such as POSIX standard regular expressions and PERL scripting language regular expressions and are used by many text editors and utilities to search and manipulate bodies of text based on certain patterns and are well-known in the art. For example, according to one syntax (Unix), the regular expression 4\d{15} means the digit “4” followed by any fifteen digits in a row. This user query would return all objects containing that match this pattern.
[0078] Certain useful search categories are not well defined by a single regular expression. For example, a query of all emails containing a credit card number is hard to define with a single regular expression as various. Credit card companies use different numbering patterns and conventions. However, a card number for each company is representable by the regular expression and the generic concept of “credit card number” is representable by the union of all such regular expressions.
[0079] An attribute, represents a group of one or more regular expressions (or other such patterns). The term “attribute” is merely descriptive, and could just as easily be termed “category,” “regular expression list,” or any other descriptive term.
[0080] Attribute tagging is performed in the object classification 506 module described above. However, attribute tagging may be implemented in other parts of the capture system 512 or as a separate module.
[0081] An embodiment of the object classification module is illustrated in FIG. 10 . Objects arriving from the object assembly module 504 are forwarded to the content store 702 and are used to generate tags to be associated with the objects. The content classifier 1002 determines the content type of the object. The content type is then forwarded to the tag generator 1008 where it is inserted into the content field described above. Various other tasks, such as protocol and size determination, are represented by the other processing block 1006.
[0082] The attribute module 1004 generates an attribute index that is insertable into an index field of the tag by the tag generator 1008.
[0083] FIG. 11 illustrates an exemplary attribute index. A plurality of regular expressions (labeled RegEx 1100-1104) are, mapped to attributes using the attribute map 1106. For example, if regular expressions RegEx 1100-1102 can represent credit card patterns, then these regular expressions would map to a credit card number attribute. Regular expressions 1103 and 1104 may represent phone number patterns and would map to a phone number attribute. A mapping of a regular expression to an attribute is thus the reservation and usage of that attribute as implying a successful matching of the regular expression.
[0084] Attribute index 1106 is used to represent the attributes in a compact form. The attribute index 1108 may be implemented as a bit vector with a vector of bits having one bit position associated with each defined attribute. In one embodiment, the attribute index 1108 is 128 bits and 128 separate attributes are definable with this index and occur independently of one another.
[0085] The association of attributes to bit positions may be maintained in a table. For example, such a table may associate bit position A with the credit card number attribute and bit position B with the phone number attribute. Since, in this example, regular expressions 1100-1102 map to the credit card attribute, observing any one of the patterns defined by RegEx 1100-1102 causes an a captured object bit position A to be set to show the presence of a credit card number in the captured object.
[0086] Setting a bit position is done by changing a bit either from “0” to “1” or from “1” to “0” depending on which value is the default. In one embodiment, bit positions are initialized as “0” and are set to “1” to show the presence of an attribute. Similarly, since regular expressions 1103 and 1104 map to the phone number attribute, observing any one of the patterns defined by RegEx 1103 or 1104 causes bit position B to be set to show the presence of a phone number in the captured object.
[0087] An embodiment of the attribute module is illustrated in FIG. 12 . The input of the attribute module 1004, as set forth above, is an object captured by the object capture and assembly modules. The object may be a word document, email, spreadsheet, or some other document that includes text or other characters that represent a pattern expressed as a regular expression.
[0088] The text content contained in the object may be extracted to simplify the attribute tagging processing. The text content of objects includes only textual characters without formatting or application context. The object or text extracted from an object is provided to parser 1200. The parser 1200 parses the object to identify which regular expressions appear in the object.
[0089] The parser 1200 accesses a regular expression table 1202 that lists all the regular expressions of interest. The parser 1200 then determines which of the regular expressions appear in the object or the text extracted from the object.
[0090] The regular expression table 1202 also associates each regular expression contained therein with an attribute. In this manner, the regular expression table 1202 can function as the regular expression to attribute map 1106 of FIG. 11 . For example, the regular expression table 1202 as shown in FIG. 12 maps regular expression A to attribute X; regular expressions B and C to attribute Y; and regular expressions D, E, and F to attribute Z.
[0091] Since the regular expression table 1202 contain the regular expressions and their attribute mapping, the parser 1200, by parsing the regular expressions over the object determines which attributes are present in an object. In one embodiment, the parsing is done faster by parsing only the regular expressions related to attributes that have not yet been found in the object. For example, if the parser finds a hit from regular expression D in the object, then attribute Z is found in the object. This makes parsing using regular expressions E and F unnecessary, since attribute Z is already hit.
[0092] The parser 1200 outputs a list of attributes found in an object. As explained above, an attribute is a category of patterns such as credit card number, phone numbers, email addresses, bank routing numbers, social security numbers, confidentiality markers, web sites, the names of executive officers of a company, medical conditions or diagnoses, confidential project names or numerical strings indicating salary or compensation information.
[0093] Attributes found in the object are provided to an index generator 1204. The index generator 1204 generates the attribute index 1108 described with reference to FIG. 11 . The index generator 1204 accesses an attribute table 1206 which contains a mapping of attributes to bit positions of the attribute index 1108. For example, in FIG. 12 , attribute X is mapped to bit position 1, attribute Y is mapped to bit position 2, and attribute Z is mapped to bit position 3.
[0094] If an object contained regular expression A, D, and F, then the parser 1200 would first note that attribute X has been hit. When recognizing regular expression D, the parser 1200 would note that attribute Z has been hit. Since these are the only attributes in this abbreviated example, the parser 1200 would provide attributes X and Z to the index generator 1204. According to the attribute table 1206, the index generator would set bit positions 1 and 3 of an attribute index 1108. Thus, for this simplified example, the attribute index 1108 would be “101” first bit positions 1 through 3.
[0095] The generation of an attribute index 1108 and the use of the specific mapping tables shown in FIG. 12 is just one example of an attribute module 1004 performing attribute tagging. In another embodiment, each possible attribute has a separate field in the tag associated with the object indicating whether the attribute is present in the object. Thus, an attribute index may be thought of as a summary of a plurality of attribute fields. Alternatively, each bit position of the attribute index may be thought of as a separate field. Various other implementations and visualizations are also possible.
[0096] An embodiment of a method for attribute tagging is described by FIG. 13 . In block 1302, an object is captured. In block 1304, the textual content is extracted from the object. In block 1306, a determination is made as to whether a regular expression appears in the extracted text.
[0097] If the regular expression under consideration does not appear in the text, then, processing continues again at block 1306 using the next regular expression on the regular expression list. If, however, the regular expression under consideration does appear in the text, then, in block 1308 the attribute associated with the regular expression is tagged. This may be done by setting a field or position in an index in a tag of metadata associated with the object.
[0098] In block 1310, all other regular expressions associated with the observed attribute are removed from future consideration with respect to the object. In block 1312, a determination is made as to whether attribute tagging has completed with respect to the object. If no regular expressions remain to be compared with the extracted text, then the attribute tagging is complete and processing terminates. Otherwise, processing continues at block 1306 with the next regular expression on the list evaluated.
[0099] FIG. 14 illustrates an exemplary flow of querying captured objects. In block 1402, a query is issued. The query may be received by a capture device via a user interface. The process described with reference to FIG. 13 may be implemented entirely within the user interface, within some query module of the user interface, or a separate query module.
[0100] The query—in addition to other limitations, such as content type, size, time range, and so on—may contain one or more attributes the query is looking for. For example, the query could be for all Microsoft Excel documents from last week containing credit card numbers (credit card numbers being an attribute).
[0101] The received query may only include one or more regular expressions, as shown in block 1404. In block 1406, the regular expression is matched to an attribute, if possible. For example, if the regular expression in the query is only satisfied if another regular expression associated with an attribute is satisfied, then, objects having this attribute tagged are more relevant for this query than objects in general. In particular, any object satisfying the regular expression would also satisfy the attribute. For example, a query for a specific credit card number or range will satisfy the credit card attribute.
[0102] Whether provided by the user, or identified based on the query, in block 1408, the appropriate attribute or attributes are used to eliminate objects from the query. In one embodiment, a search is done over the appropriate attribute field or index bit positions in the tags in the tag database. If the attributes being sought are not shown as present in an object, the object is eliminated from further consideration for this query.
[0103] In block 1410, the objects remaining after elimination at 1408 are retrieved from the medium they are stored on (such as a disk) into memory. They can now be presented to the user as query results, or object can be further eliminated by parsing the retrieved objects for the specific regular expression queried for, where no specific attribute was named. Alternatively, only a link to the objects remaining after elimination are retrieved.
[0104] In one embodiment, the attributes are completely user-configurable. A user interface provides an attribute editor that allows a user to define attributes by creating an attribute and associating a group of one or more regular expressions with the created attribute. The capture device may come pre-configured with a list of common or popular attributes that may be tailored specifically to the industry into which the capture device is sold.
[0105] In one embodiment, a capture device may create new attributes automatically. For example, a capture device may observe that a certain regular expression is being searched with some threshold frequency (generally set to be above normal). The capture device creates an attribute to be associated with this regular expression and begins tagging the newly defined attribute when capturing new objects. In another embodiment, a capture device may suggest that a new attribute be created when a regular expression is searched frequently. In yet another embodiment, a capture device may suggest that an attribute be deleted if infrequently used to make room for another more useful attribute.
Query Generation
[0106] Objects and/or their associated metadata should be searchable upon request. For example, emails, documents, images, etc. may be processed by a capture system and searched. FIG. 15 illustrates an exemplary embodiment of a capture system for querying captured data. The network interface module 500, packet capture module 502, object assembly module 504, object classification module 506, object store module 508, and user interface 510 have all been described before.
[0107] The capture system 1512 also includes a query generator module 1514. The query generator module 1514 changes a search string into a capture system 1512 usable form. A search string comes from the user interface 1510 or an outside source, such as another capture system or remote request. The user interface 1510 may be outside of the capture system 1512. The query generator module 1514 may also be used with a capture/registration system (such as the one illustrated in FIG. 8 ).
[0108] As described earlier, objects and tags are generally stored in the object store module 508 even though objects and/or tags may also be persisted to remote databases. These objects and tags are searchable for specific content using exact matches, patterns, keywords, and/or various other attributes generated by the query generator 1514. For example, the tag database 700 may be scanned and the associated object retrieved from the content store 702. Additionally, the query generator 1514 may also search “look-asides” such as dictionaries and compiled lists. Look-asides may be stored in volatile storage (such as RAM) and/or in non-volatile storage (such as a hard disk, flash device, etc.). In practical deployments, a volatile look-aside structure is often shadowed into a non-volatile storage for persistence over a power loss or other fault condition.
[0109] Searches may be conducted at specific times or be periodically scheduled. For example, in some business environments it may be beneficial to have an on-demand query about emails leaving the network from a key employee and have a weekly search and report.
[0110] The user interface 510 may provide access to a scheduler (not shown) that periodically executes specific queries. Reports containing the results of these searches are made available to the user at runtime or at a later time by generating an alarm in the form of an e-mail message, page, system log, and/or other notification format.
[0111] Capture (and capture/registration) systems receive, sort, and store many different types of data. In one embodiment, captured objects, their metadata, and/or look-aside information are stored based on the time received. Accordingly, captured objects, metadata, and/or look-aside information is already in an order. Because information is already sorted by time, a search of this information is an order n search which is an improvement over the prior art in which time is not a primary index. Storing captured objects by time may also be accomplished by partitioning into time divisions. Of course, more than one entry may be made per time division. Time divisions may be of any size. For example, the time division may be one hour, two hours, one day, etc.
[0112] FIGS. 16( a)-(c) illustrate an embodiment of an exemplary storage configuration for data received by a capture system. In this particular example, time divisions (TN) are used.
[0113] FIG. 16( a) illustrates the storage configuration prior to any events occurring. Metadata (tag) storage 1601 stores the metadata associated with a captured object. Exemplary metadata has been described previously. Metadata may be separated by categories. Metadata storage 1601 is divided into five categories: email, documents, protocols, images, and other/miscellaneous. However, any number of classifications may be used. A single transaction could fall into more than one classification. For example, an email with an attached word document falls into three categories: email, document, and protocol (the protocol is dependent upon the type of email service used such as SMTP, POP3 or IMAP). Typically, a disk (such as a hard drive) or several disks for redundancy and performance reasons, are used for metadata storage. Tag database 700 is an example of metadata storage.
[0114] Look-aside storage 1603 stores information/data known to a capture system from a source other than object capture. For example, look-aside storage 1603 may include such information as the name of the competitor to company A is company B, the names of people in a particular department or office, etc. Volatile storage (such as RAM) or non-volatile storage (such as a disk) may be used for look-aside storage 1603. If volatile storage is used, provisions should be made to backup this information in the look-aside storage 1603 into non-volatile storage in case of a failure (such as a power failure) that would cause the information in the volatile storage to be lost. If time divisions are used, time divisions of look-aside storage 1603 could have different values.
[0115] Object storage 1605 stores captured/reassembled objects. For example, object storage 1605 may store text documents, images, videos, etc. The content store 702 is an example of object storage.
[0116] FIG. 16( b) shows the occurrence of a single event during T1. An email with an attached document is sent to a competitor in the look-aside dictionary during this time division. This email is processed by the capture system and, accordingly, all three storages have an entry for that email. In the metadata data storage 1601, an entry for the email and an entry for the attached document are created. The look-aside storage 1603 has an entry noting that a particular competitor in the look-aside dictionary was sent the email. Finally, the email text and the attachment are saved in the object storage 1605.
[0117] FIG. 16( c) shows the occurrence of a two events during T3. The first event is uploading an image to a web page using the HTTP protocol. As a result, there are entries in the image and protocol (HTTP) categories of the metadata storage 1601 and in the object storage 1605 during T3. The second event of T3 is an email being received with no attachments. Accordingly, an entry exists in the email category of the metadata storage 1601 and the email text is stored in the object storage 1605.
[0118] FIG. 17 illustrates an embodiment of a method for performing a query in a capture system. At 1701, a query is received or generated. A received query normally comes into a capture system via a user interface. These queries are typically written in a form that is not standard to the capture system and must be further decomposed. An exemplary query is “Find a MS Office document over 50 KB in size with the keywords “Confidential” and “Project” in the document with a destination address of “Competitor1” or “Competitor2” that was sent between January 1 and January 3.”
[0119] This query is decomposed into search terms and types at 1703. For each of these search terms, a list of matches to stored data will be generated. For the above example query, the decomposition results in six lists that will be generated: 1) attachments by time, content-type, and size; 2) keyword “Confidential;” 3) keyword “Project;” 4) email by time, content-type, and size; 5) keyword “Competitor1;” and 6) keyword “Competitor2.” Of course, the exact decomposition may very. For example, keywords could be combined, etc. Search terms may also be tokenized depending upon where the search term is located. Tokens are used in the searching of the tag database as described earlier. The exact tokenization method (how strings of text are broken into individual tokens) is not important as long as that method is identical between the capture and searching portions of the device.
[0120] The appropriate location(s)/file(s) to search are determined at 1705. As described earlier, typical capture systems use different types of storage locations and types. The search terms decomposed at 1703 may relate to these storage locations and types (such as email or attachment) differently based on the context of the search query. For example, a search for a keyword may typically start with a search in a look-aside such as a dictionary. Since these searches (searches of look-asides) are generally fast, a quick determination of whether or not the capture system has ever searched for these keywords and if a corresponding entry in metadata would have been made. Whereas the appropriate search for attachments in general is the metadata storage or object storage. Typically, the metadata storage is searched prior to object storage because it would be faster.
[0121] The appropriate search location(s)/file(s) are searched at 1707. For example, a look-aside may be searched for a keyword and the metadata storage searched for an attachment over 50 KB in size. Some optimizations for searching may be utilized by a capture system. One optimization is to perform a “dirty search” such as only searching for a portion of a keyword. If the search has several requirements, and one fails, it may be beneficial to not have searched for the entire keyword. However, further refinements of the search may need to be performed at a later time (for example, if no other search requirements fail then the entire keyword will have to be searched for).
[0122] Another optimization is that if one term of an “OR” clause of a search has been found, then the other terms of the “OR” clause do not need to be searched for. For example, of the search is for “A or B” and “A” is found, then “B” does not need to be searched for because the clause has already been satisfied.
[0123] Another optimization is to first search the list of terms that could be in the metadata. If a particular value is not going to be in the metadata then the metadata should not be searched. In fact, if a value is not in the metadata the entire object storage may have to be searched for that value. This would be a relatively slower search. For example, a determination of whether or not a capture system was previously searching and creating metadata for the text “Butters” is generally faster than searching the metadata storage.
[0124] In an embodiment, searches are performed one time division at a time. For example, if the capture system has 24 time divisions (one division per hour of the day), each hour is searched individually. Search results from the same time division are more likely to be related than search results from different time divisions. For example, an email that meets the criteria of the exemplary search query is likely to be processed and have items (metadata and objects) stored in the same time division. Accordingly, search results from different time divisions are often not combinable. Searching by time division may result in a search time of faster than order n.
[0125] A list of matches for each search is generated at 1709. Lists of matches are subsets of what is stored in a particular storage location. For example, a list of matches from the metadata storage is those metadata that match the search criteria. If time divisions are used, then each list of matches is divided by time division.
[0126] The lists of matches for each search are intersected at 1711. Intersecting determines the result of the search. If time divisions are used, results from each list for a specific time division are intersected with results from the same time division.
[0127] Searching, matching, and intersecting may also be staggered so as to better utilize resources. For example, look-asides may be searched before metadata or object storage. If there is no match in a look-aside, it may not be useful to search the other databases as those searches would likely result in resource waste. Likewise, object storage may be searched prior to object storage.
[0128] This staggering may also apply to searching, matching, and intersecting by time division in a “pipeline” fashion. FIG. 18 illustrates pipeline staggering. At time T1 1801, a first time slot 1805 is searched. At time T2 1803, a second time slot 1807 may be searched while a list (or lists) of matches is being generated for the first time slot, etc. The two staggering optimizations may also be combined.
[0129] FIG. 19 illustrates the exemplary query being performed. This query may be made over a particular time division or over the entire time that the capture system was operating.
[0130] The query is broken into different keywords and search types at 1901. As shown, attachments and emails (by time, content, and size) and keywords will be searched for.
[0131] The appropriate storage locations have been determined at 1903. The metadata storage will be searched for attachments and emails, while the look-aside storage will be searched for keywords.
[0132] Lists have been generated based on a search of these locations at 1905. Lists A and D have been generated from the search of the metadata storage. Lists B, C, F, and G have been generated from searching the look-aside storage. As described above, the searching and generation of lists may be staggered. For example, the look-aside storage may be searched before searching the metadata storage. These searches and list generations may be performed by time division. The object storage may also have to be searched. For example, the object storage may have to be searched to retrieve an email to look for the destination address of “Competitor 1” or “Competitor 2.”
[0133] Lists are intersected at 1907. Lists B and C are interested with A; F and G are intersected with D; and the results of those two previous intersections are intersected to create the final search result. Again, the timing of these intersections may be staggered.
Closing Comments
[0134] An article of manufacture may be used to store program code. An article of manufacture that stores program code may be embodied as, but is not limited to, one or more memories (e.g., one or more flash memories, random access memories (static, dynamic or other)), optical disks, CD-ROMs, DVD ROMs, EPROMs, EEPROMs, magnetic or optical cards or other type of machine-readable media suitable for storing electronic instructions. Program code may also be downloaded from a remote computer (e.g., a server) to a requesting computer (e.g., a client) by way of data signals embodied in a propagation medium (e.g., via a communication link (e.g., a network connection)).
[0135] In one embodiment, a capture system is an appliance constructed using commonly available computing equipment and storage systems capable of supporting the software requirements.
[0136] FIG. 20 shows an embodiment of a computing system (e.g., a computer). The exemplary computing system of FIG. 20 includes: 1) one or more processors 2001; 2) a memory control hub (MCH) 2002; 3) a system memory 2003 (of which different types exist such as DDR RAM, EDO RAM, etc,); 4) a cache 2004; 5) an I/O control hub (ICH) 2005; 6) a graphics processor 2006; 7) a display/screen 2007 (of which different types exist such as Cathode Ray Tube (CRT), Thin Film Transistor (TFT), Liquid Crystal Display (LCD), Digital Light Processing (DLP), Organic LED (OLED), etc.; and 8) one or more I/O and storage devices 2008.
[0137] The one or more processors 2001 execute instructions in order to perform whatever software routines the computing system implements. The instructions frequently involve some sort of operation performed upon data. Both data and instructions are stored in system memory 2003 and cache 2004. Cache 2004 is typically designed to have shorter latency times than system memory 2003. For example, cache 1304 might be integrated onto the same silicon chip(s) as the processor(s) and/or constructed with faster SRAM cells whilst system memory 2003 might be constructed with slower DRAM cells. By tending to store more frequently used instructions and data in the cache 2004 as opposed to the system memory 2003, the overall performance efficiency of the computing system improves.
[0138] System memory 2003 is deliberately made available to other components within the computing system. For example, the data received from various interfaces to the computing system (e.g., keyboard and mouse, printer port, LAN port, modem port, etc.) or retrieved from an internal storage element of the computing system (e.g., hard disk drive) are often temporarily queued into system memory 2003 prior to their being operated upon by the one or more processor(s) 2001 in the implementation of a software program. Similarly, data that a software program determines should be sent from the computing system to an outside entity through one of the computing system interfaces, or stored into an internal storage element, is often temporarily queued in system memory 1303 prior to its being transmitted or stored.
[0139] The ICH 2005 is responsible for ensuring that such data is properly passed between the system memory 2003 and its appropriate corresponding computing system interface (and internal storage device if the computing system is so designed). The MCH 2002 is responsible for managing the various contending requests for system memory 2003 access amongst the processor(s) 2001, interfaces and internal storage elements that may proximately arise in time with respect to one another.
[0140] One or more I/O devices 2008 are also implemented in a typical computing system. I/O devices generally are responsible for transferring data to and/or from the computing system (e.g., a networking adapter); or, for large scale non-volatile storage within the computing system (e.g., hard disk drive). ICH 2005 has bi-directional point-to-point links between itself and the observed I/O devices 2008. A capture program, classification program, a database, a filestore, an analysis engine and/or a graphical user interface may be stored in a storage device or devices 2008 or in memory 2003.
[0141] In the foregoing specification, the invention has been described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
[0142] Thus, a capture system and a document/content registration system have been described. In the forgoing description, various specific values were given names, such as “objects,” and various specific modules, such as the “registration module” and “signature database” have been described. However, these names are merely to describe and illustrate various aspects of the present invention, and in no way limit the scope of the present invention. Furthermore, various modules, may be implemented as software or hardware modules, combined or without dividing their functionalities into modules at all. The present invention is not limited to any modular architecture either in software or in hardware, whether described above or not.
Claims
What is claimed is:
1. An apparatus, comprising:
a processor;
a memory; and
a query generator configured to issue a query for a selected object included in a plurality of objects that are stored, wherein the objects are identified within packets that are captured at a network interface configured to receive the packets, and wherein the objects are stored with one or more respective tags indicative of characteristics of the objects, and wherein the query includes one or more regular expressions and at least one of the regular expressions are matched to an attribute, and wherein a first object is stored with a first attribute such that identification of the first attribute is used to determine whether the first object is relevant to the query, and wherein the first attribute is a selected one of a group of attributes, the group consisting of:
a) a document type;
b) an Internet protocol (IP) address from which the packets were sent or to where the packets were delivered;
c) an application type that generated the packets;
d) a size of a document associated with the packets; and
e) a time range in which the document associated with the packets was sent or received.
2. The apparatus of claim 1, further comprising:
a packet capture module configured to capture the packets, wherein the packets are part of an e-mail or a document sought to be communicated over a network connection.
3. The apparatus of claim 1, wherein the first attribute is used to search a database to eliminate at least some of the objects from being part of a response to the query.
4. The apparatus of claim 3, wherein searching the database includes evaluating an attribute field or an index bit position in the database.
5. The apparatus of claim 1, wherein a response is provided for the query, the response including one or more electronic links to elements that include the selected object.
6. The apparatus of claim 1, wherein the query is provided as a scheduled query being executed periodically.
7. The apparatus of claim 1, wherein the objects that are stored are categorized based on time intervals in which the objects were captured or sent.
8. The apparatus of claim 1, further comprising:
a tag generator configured to insert an attribute index into an index field of a selected one of the tags.
9. The apparatus of claim 1, further comprising:
an object assembly module configured to reassemble a first object associated with a first captured packet.
10. The apparatus of claim 1, further comprising:
an object classification module configured to generate the tags for the objects.
11. The apparatus of claim 1, further comprising:
an object store module configured to store the objects and the tags together.
12. The apparatus of claim 11, wherein the object store module further comprises:
a tag database configured to store the tags generated for the objects; and
a content store configured to store reassembled objects.
13. The apparatus of claim 1, further comprising:
a user interface configured to interact with the query generator and offer a display for inputting the query.
14. The apparatus of claim 1, wherein the query generator is further configured to:
decompose the query into search terms;
determine locations to search for the search terms;
generate a list of matches for the locations searched; and
intersect the list of matches to determine a response for the query.
15. The apparatus of claim 1, wherein locations are searched for the selected object, the locations being part of a group of locations, the group consisting of:
a look-aside storage;
a metadata database; and
an object storage, wherein the look-aside storage, metadata storage, and object storage are presorted by time.
16. Logic encoded in one or more tangible media that includes code for execution and when executed by a processor operable to perform operations comprising:
processing a query for a selected object included in a plurality of objects that are stored, wherein the objects are identified within packets that are captured at a network interface configured to receive the packets, and wherein the objects are stored with one or more respective tags indicative of characteristics of the objects, wherein the query includes one or more regular expressions and at least one of the regular expressions are matched to an attribute, and wherein a first object is stored with a first attribute such that identification of the first attribute is used to determine whether the first object is relevant to the query, and wherein the first attribute is a selected one of a group of attributes, the group consisting of:
a) a document type;
b) an Internet protocol (IP) address from which the packets were sent or to where the packets were delivered;
c) an application type that generated the packets;
d) a size of a document associated with the packets; and
e) a time range in which the document associated with the packets was sent or received.
17. The logic of claim 16, wherein the first attribute is used to search a database to eliminate at least some of the objects from being part of a response to the query.
18. The logic of claim 16, wherein searching the database includes evaluating an attribute field or an index bit position in the database.
19. The logic of claim 16, wherein a response is provided for the query, the response including one or more electronic links to elements that include the selected object.
20. The logic of claim 16, wherein the objects that are stored are categorized based on time intervals in which the objects were captured or sent.
Patent Citations (233)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4286255(A) | 1981-08-01 | Siy | Applicant |
| US4710957(A) | 1987-12-01 | Bocci et al. | Applicant |
| US5249289(A) | 1993-09-01 | Thamm et al. | Applicant |
| US5465299(A) | 1995-11-01 | Matsumoto et al. | Applicant |
| US5479654(A) | 1995-12-01 | Squibb | Applicant |
| US5497489(A) | 1996-03-01 | Menne | Applicant |
| US5542090(A) | 1996-07-01 | Henderson et al. | Applicant |
| US5557747(A) | 1996-09-01 | Rogers et al. | Applicant |
| US5623652(A) | 1997-04-01 | Vora et al. | Applicant |
| US5768578(A) | 1998-06-01 | Kirk | Applicant |
| US5781629(A) | 1998-07-01 | Haber et al. | Applicant |
| US5794052(A) | 1998-08-01 | Harding | Applicant |
| US5813009(A) | 1998-09-01 | Johnson et al. | Applicant |
| US5943670(A) | 1999-08-01 | Prager | Applicant |
| US5995111(A) | 1999-11-01 | Morioka et al. | Applicant |
| US6026411(A) | 2000-02-01 | Delp | Applicant |
| US6078953(A) | 2000-06-01 | Vaid et al. | Applicant |
| US6094531(A) | 2000-07-01 | Allison et al. | Applicant |
| US6108697(A) | 2000-08-01 | Raymond et al. | Applicant |
| US6161102(A) | 2000-12-01 | Yanagilhara | Applicant |
| US6175867(B1) | 2001-01-01 | Taghadoss | Applicant |
| US6192472(B1) | 2001-02-01 | Garay et al. | Applicant |
| US6243091(B1) | 2001-06-01 | Berstis | Applicant |
| US6243720(B1) | 2001-06-01 | Munter et al. | Applicant |
| US6278992(B1) | 2001-08-01 | Curtis et al. | Applicant |
| US6292810(B1) | 2001-09-01 | Richards | Applicant |
| US6336186(B1) | 2002-01-01 | Dyksterhouse et al. | Applicant |
| US6356885(B2) | 2002-03-01 | Ross et al. | Applicant |
| US6389419(B1) | 2002-05-01 | Wong et al. | Applicant |
| US6408294(B1) | 2002-06-01 | Getchius et al. | Applicant |
| US6408301(B1) | 2002-06-01 | Patton et al. | Applicant |
| US6457017(B2) | 2002-09-01 | Watkins et al. | Applicant |
| US6493761(B1) | 2002-12-01 | Baker et al. | Applicant |
| US6499105(B1) | 2002-12-01 | Yoshiura et al. | Applicant |
| US6515681(B1) | 2003-02-01 | Knight | Applicant |
| US6516320(B1) | 2003-02-01 | Odom et al. | Applicant |
| US6523026(B1) | 2003-02-01 | Gillis | Applicant |
| US6539024(B1) | 2003-03-01 | Janoska et al. | Applicant |
| US6556964(B2) | 2003-04-01 | Haug et al. | Applicant |
| US6571275(B1) | 2003-05-01 | Dong et al. | Applicant |
| US6584458(B1) | 2003-06-01 | Millett et al. | Applicant |
| US6598033(B2) | 2003-07-01 | Ross et al. | Applicant |
| US6629097(B1) | 2003-09-01 | Keith | Applicant |
| US6662176(B2) | 2003-12-01 | Brunet et al. | Applicant |
| US6665662(B1) | 2003-12-01 | Kirkwood et al. | Applicant |
| US6675159(B1) | 2004-01-01 | Lin et al. | Applicant |
| US6691209(B1) | 2004-02-01 | O'Connell | Applicant |
| US6754647(B1) | 2004-06-01 | Tackett et al. | Applicant |
| US6757646(B2) | 2004-06-01 | Marchisio | Applicant |
| US6771595(B1) | 2004-08-01 | Gilbert et al. | Applicant |
| US6772214(B1) | 2004-08-01 | McClain et al. | Applicant |
| US6785815(B1) | 2004-08-01 | Serret-Avila et al. | Applicant |
| US6820082(B1) | 2004-11-01 | Cook et al. | Applicant |
| US6857011(B2) | 2005-02-01 | Reinke | Applicant |
| US6937257(B1) | 2005-08-01 | Dunlavey | Applicant |
| US6950864(B1) | 2005-09-01 | Tsuchiya | Applicant |
| US6978297(B1) | 2005-12-01 | Piersol | Applicant |
| US7020654(B1) | 2006-03-01 | Najmi | Applicant |
| US7020661(B1) | 2006-03-01 | Cruanes et al. | Applicant |
| US7062572(B1) | 2006-06-01 | Hampton | Applicant |
| US7072967(B1) | 2006-07-01 | Saulpaugh et al. | Applicant |
| US7082443(B1) | 2006-07-01 | Ashby | Applicant |
| US7093288(B1) | 2006-08-01 | Hydrie et al. | Applicant |
| US7130587(B2) | 2006-10-01 | Hikokubo et al. | Applicant |
| US7158983(B2) | 2007-01-01 | Willse et al. | Applicant |
| US7185073(B1) | 2007-02-01 | Gai et al. | Applicant |
| US7185192(B1) | 2007-02-01 | Kahn | Applicant |
| US7194483(B1) | 2007-03-01 | Mohan et al. | Applicant |
| US7219131(B2) | 2007-05-01 | Banister et al. | Applicant |
| US7219134(B2) | 2007-05-01 | Takeshima et al. | Applicant |
| US7243120(B2) | 2007-07-01 | Massey | Applicant |
| US7246236(B2) | 2007-07-01 | Stirbu | Applicant |
| US7254562(B2) | 2007-08-01 | Hsu et al. | Applicant |
| US7266845(B2) | 2007-09-01 | Hypponen | Applicant |
| US7277957(B2) | 2007-10-01 | Rowley et al. | Applicant |
| US7290048(B1) | 2007-10-01 | Barnett et al. | Applicant |
| US7293067(B1) | 2007-11-01 | Maki et al. | Applicant |
| US7293238(B1) | 2007-11-01 | Brook et al. | Applicant |
| US7296070(B2) | 2007-11-01 | Sweeney et al. | Applicant |
| US7296088(B1) | 2007-11-01 | Padmanabhan et al. | Applicant |
| US7299277(B1) | 2007-11-01 | Moran et al. | Applicant |
| US7373500(B2) | 2008-05-01 | Ramelson et al. | Applicant |
| US7424744(B1) | 2008-09-01 | Wu et al. | Applicant |
| US7426181(B1) | 2008-09-01 | Feroz et al. | Applicant |
| US7434058(B2) | 2008-10-01 | Ahuja et al. | Applicant |
| US7477780(B2) | 2009-01-01 | Boncyk et al. | Applicant |
| US7483916(B2) | 2009-01-01 | Lowe et al. | Applicant |
| US7493659(B1) | 2009-02-01 | Wu et al. | Applicant |
| US7505463(B2) | 2009-03-01 | Schuba et al. | Applicant |
| US7506055(B2) | 2009-03-01 | McClain et al. | Applicant |
| US7509677(B2) | 2009-03-01 | Saurabh et al. | Applicant |
| US7516492(B1) | 2009-04-01 | Nisbet et al. | Applicant |
| US7551629(B2) | 2009-06-01 | Chen et al. | Applicant |
| US7596571(B2) | 2009-09-01 | Sifry | Applicant |
| US7657104(B2) | 2010-02-01 | Deninger et al. | Applicant |
| US7664083(B1) | 2010-02-01 | Cermak et al. | Applicant |
| US7760730(B2) | 2010-07-01 | Goldschmidt et al. | Applicant |
| US7760769(B1) | 2010-07-01 | Lovett et al. | Applicant |
| US2001/0032310(A1) | 2001-10-01 | Corella | Applicant |
| US2001/0037324(A1) | 2001-11-01 | Agrawal et al. | Applicant |
| US2001/0046230(A1) | 2001-11-01 | Rojas | Applicant |
| US2002/0032677(A1) | 2002-03-01 | Morgenthaler et al. | Applicant |
| US2002/0052896(A1) | 2002-05-01 | Streit et al. | Applicant |
| US2002/0078355(A1) | 2002-06-01 | Samar | Applicant |
| US2002/0091579(A1) | 2002-07-01 | Yehia et al. | Applicant |
| US2002/0103876(A1) | 2002-08-01 | Chatani et al. | Applicant |
| US2002/0107843(A1) | 2002-08-01 | Biebesheimer et al. | Applicant |
| US2002/0116124(A1) | 2002-08-01 | Garin et al. | Applicant |
| US2002/0126673(A1) | 2002-09-01 | Dagli et al. | Applicant |
| US2002/0128903(A1) | 2002-09-01 | Kernahan | Applicant |
| US2002/0129140(A1) | 2002-09-01 | Peled et al. | Applicant |
| US2002/0159447(A1) | 2002-10-01 | Carey et al. | Applicant |
| US2003/0009718(A1) | 2003-01-01 | Wolfgang et al. | Applicant |
| US2003/0028493(A1) | 2003-02-01 | Tajima | Applicant |
| US2003/0028774(A1) | 2003-02-01 | Meka | Applicant |
| US2003/0046369(A1) | 2003-03-01 | Sim et al. | Applicant |
| US2003/0053420(A1) | 2003-03-01 | Duckett et al. | Applicant |
| US2003/0065571(A1) | 2003-04-01 | Dutta | Applicant |
| US2003/0084300(A1) | 2003-05-01 | Koike | Applicant |
| US2003/0084318(A1) | 2003-05-01 | Schertz | Applicant |
| US2003/0084326(A1) | 2003-05-01 | Tarquini | Applicant |
| US2003/0093678(A1) | 2003-05-01 | Bowe et al. | Applicant |
| US2003/0099243(A1) | 2003-05-01 | Oh et al. | Applicant |
| US2003/0105716(A1) | 2003-06-01 | Sutton et al. | Applicant |
| US2003/0105739(A1) | 2003-06-01 | Essafi et al. | Applicant |
| US2003/0131116(A1) | 2003-07-01 | Jain et al. | Applicant |
| US2003/0135612(A1) | 2003-07-01 | Huntington | Applicant |
| US2003/0185220(A1) | 2003-10-01 | Valenci | Applicant |
| US2003/0196081(A1) | 2003-10-01 | Savarda et al. | Applicant |
| US2003/0204741(A1) | 2003-10-01 | Schoen et al. | Applicant |
| US2003/0221101(A1) | 2003-11-01 | Micali | Applicant |
| US2003/0225796(A1) | 2003-12-01 | Matsubara | Applicant |
| US2003/0225841(A1) | 2003-12-01 | Song et al. | Applicant |
| US2003/0231632(A1) | 2003-12-01 | Haeberlen | Applicant |
| US2003/0233411(A1) | 2003-12-01 | Parry et al. | Examiner |
| US2004/0010484(A1) | 2004-01-01 | Foulger et al. | Applicant |
| US2004/0036716(A1) | 2004-02-01 | Jordahl | Applicant |
| US2004/0054779(A1) | 2004-03-01 | Takeshima et al. | Applicant |
| US2004/0059736(A1) | 2004-03-01 | Willse et al. | Applicant |
| US2004/0071164(A1) | 2004-04-01 | Baum | Applicant |
| US2004/0111678(A1) | 2004-06-01 | Hara | Applicant |
| US2004/0114518(A1) | 2004-06-01 | MacFaden et al. | Applicant |
| US2004/0117414(A1) | 2004-06-01 | Braun et al. | Applicant |
| US2004/0120325(A1) | 2004-06-01 | Ayres | Applicant |
| US2004/0122863(A1) | 2004-06-01 | Sidman | Applicant |
| US2004/0181513(A1) | 2004-09-01 | Henderson et al. | Applicant |
| US2004/0181690(A1) | 2004-09-01 | Rothermel et al. | Applicant |
| US2004/0194141(A1) | 2004-09-01 | Sanders | Applicant |
| US2004/0196970(A1) | 2004-10-01 | Cole | Applicant |
| US2004/0205457(A1) | 2004-10-01 | Bent et al. | Applicant |
| US2004/0220944(A1) | 2004-11-01 | Behrens et al. | Applicant |
| US2004/0230572(A1) | 2004-11-01 | Omoigui | Applicant |
| US2004/0267753(A1) | 2004-12-01 | Hoche | Applicant |
| US2005/0004911(A1) | 2005-01-01 | Goldberg et al. | Applicant |
| US2005/0021715(A1) | 2005-01-01 | Dugatkin et al. | Applicant |
| US2005/0021743(A1) | 2005-01-01 | Fleig et al. | Applicant |
| US2005/0022114(A1) | 2005-01-01 | Shanahan et al. | Applicant |
| US2005/0027881(A1) | 2005-02-01 | Figueira et al. | Applicant |
| US2005/0033747(A1) | 2005-02-01 | Wittkotter | Applicant |
| US2005/0033803(A1) | 2005-02-01 | Vleet et al. | Applicant |
| US2005/0038809(A1) | 2005-02-01 | Abajian et al. | Applicant |
| US2005/0050205(A1) | 2005-03-01 | Gordy et al. | Applicant |
| US2005/0055327(A1) | 2005-03-01 | Agrawal et al. | Applicant |
| US2005/0055399(A1) | 2005-03-01 | Savchuk | Applicant |
| US2005/0075103(A1) | 2005-04-01 | Hikokubo et al. | Applicant |
| US2005/0091443(A1) | 2005-04-01 | Hershkovich et al. | Applicant |
| US2005/0091532(A1) | 2005-04-01 | Moghe | Applicant |
| US2005/0097441(A1) | 2005-05-01 | Herbach et al. | Applicant |
| US2005/0108244(A1) | 2005-05-01 | Riise et al. | Applicant |
| US2005/0114452(A1) | 2005-05-01 | Prakash | Applicant |
| US2005/0120006(A1) | 2005-06-01 | Nye | Applicant |
| US2005/0127171(A1) | 2005-06-01 | Ahuja et al. | Applicant |
| US2005/0128242(A1) | 2005-06-01 | Suzuki | Applicant |
| US2005/0131876(A1) | 2005-06-01 | Ahuja et al. | Applicant |
| US2005/0132034(A1) | 2005-06-01 | de la Iglesia et al. | Applicant |
| US2005/0132046(A1) | 2005-06-01 | de la Iglesia et al. | Applicant |
| US2005/0132079(A1) | 2005-06-01 | de la Iglesia et al. | Applicant |
| US2005/0132197(A1) | 2005-06-01 | Medlar | Applicant |
| US2005/0132198(A1) | 2005-06-01 | Ahuja et al. | Applicant |
| US2005/0132297(A1) | 2005-06-01 | Milic-Frayling et al. | Applicant |
| US2005/0138242(A1) | 2005-06-01 | Pope et al. | Applicant |
| US2005/0138279(A1) | 2005-06-01 | Somasundaram | Applicant |
| US2005/0149494(A1) | 2005-07-01 | Lindh et al. | Applicant |
| US2005/0149504(A1) | 2005-07-01 | Ratnaparkhi | Applicant |
| US2005/0166066(A1) | 2005-07-01 | Ahuja et al. | Applicant |
| US2005/0177725(A1) | 2005-08-01 | Lowe et al. | Applicant |
| US2005/0180341(A1) | 2005-08-01 | Nelson et al. | Applicant |
| US2005/0203940(A1) | 2005-09-01 | Farrar et al. | Applicant |
| US2005/0204129(A1) | 2005-09-01 | Sudia et al. | Applicant |
| US2005/0228864(A1) | 2005-10-01 | Robertson | Applicant |
| US2005/0235153(A1) | 2005-10-01 | Ikeda | Applicant |
| US2005/0289181(A1) | 2005-12-01 | Deninger et al. | Applicant |
| US2006/0005247(A1) | 2006-01-01 | Zhang et al. | Applicant |
| US2006/0021045(A1) | 2006-01-01 | Cook | Applicant |
| US2006/0021050(A1) | 2006-01-01 | Cook et al. | Applicant |
| US2006/0037072(A1) | 2006-02-01 | Rao et al. | Applicant |
| US2006/0041560(A1) | 2006-02-01 | Forman et al. | Applicant |
| US2006/0041570(A1) | 2006-02-01 | Lowe et al. | Applicant |
| US2006/0041760(A1) | 2006-02-01 | Huang | Applicant |
| US2006/0047675(A1) | 2006-03-01 | Lowe et al. | Applicant |
| US2006/0083180(A1) | 2006-04-01 | Baba et al. | Applicant |
| US2006/0150249(A1) | 2006-07-01 | Gassen et al. | Applicant |
| US2006/0167896(A1) | 2006-07-01 | Kapur et al. | Applicant |
| US2006/0184532(A1) | 2006-08-01 | Hamada et al. | Applicant |
| US2006/0242126(A1) | 2006-10-01 | Fitzhugh | Applicant |
| US2006/0242313(A1) | 2006-10-01 | Le et al. | Applicant |
| US2006/0251109(A1) | 2006-11-01 | Muller et al. | Applicant |
| US2006/0272024(A1) | 2006-11-01 | Huang et al. | Applicant |
| US2006/0288216(A1) | 2006-12-01 | Buhler et al. | Applicant |
| US2007/0006293(A1) | 2007-01-01 | Balakrishnan et al. | Applicant |
| US2007/0036156(A1) | 2007-02-01 | Liu et al. | Applicant |
| US2007/0050334(A1) | 2007-03-01 | Deninger et al. | Applicant |
| US2007/0050381(A1) | 2007-03-01 | Hu et al. | Applicant |
| US2007/0050467(A1) | 2007-03-01 | Borrett et al. | Applicant |
| US2007/0081471(A1) | 2007-04-01 | Talley et al. | Applicant |
| US2007/0094394(A1) | 2007-04-01 | Singh et al. | Applicant |
| US2007/0110089(A1) | 2007-05-01 | Essafi et al. | Applicant |
| US2007/0136599(A1) | 2007-06-01 | Suga | Applicant |
| US2007/0162609(A1) | 2007-07-01 | Pope et al. | Applicant |
| US2007/0226504(A1) | 2007-09-01 | de la Iglesia et al. | Applicant |
| US2007/0226510(A1) | 2007-09-01 | de la Iglesia et al. | Applicant |
| US2007/0248029(A1) | 2007-10-01 | Merkey et al. | Applicant |
| US2007/0271254(A1) | 2007-11-01 | de la Iglesia et al. | Applicant |
| US2007/0271371(A1) | 2007-11-01 | Ahuja et al. | Applicant |
| US2007/0271372(A1) | 2007-11-01 | Deninger et al. | Applicant |
| US2007/0280123(A1) | 2007-12-01 | Atkins et al. | Applicant |
| US2008/0028467(A1) | 2008-01-01 | Kommareddy et al. | Applicant |
| US2008/0235163(A1) | 2008-09-01 | Balasubramanian et al. | Applicant |
| US2009/0232391(A1) | 2009-09-01 | Deninger et al. | Applicant |
| US2009/0300709(A1) | 2009-12-01 | Chen et al. | Applicant |
| US2010/0011410(A1) | 2010-01-01 | Liu | Applicant |
| US2010/0185622(A1) | 2010-07-01 | Deninger et al. | Applicant |
| US2010/0268959(A1) | 2010-10-01 | Lowe et al. | Applicant |
Non-Patent Literature (22)
- Chapter 1. Introduction, “Computer Program product for analyzing network traffic,” Ethereal. Computer program product for analyzing network traffic, pp. 17-26, http://web.archive.org/web/20030315045117/www.ethereal.com/distribution/docs/user-guide, printed Mar. 12, 2009.Applicant
- U.S. Appl. No. 12/190,536, filed Aug. 12, 2008, entitled “Configuration Management for a Capture/Registration System,” Inventor(s) Jitendra B. Gaitonde et al. (P032).Applicant
- U.S. Appl. No. 12/352,720, filed Jan. 13, 2009, entitled “System and Method for Concept Building,” Inventor(s) Ratinder Paul Singh Ahuja et al.Applicant
- U.S. Appl. No. 12/354,688, filed Jan. 15, 2009, entitled “System and Method for Intelligent Term Grouping,” Inventor(s) Ratinder Paul Ahuja et al.Applicant
- U.S. Appl. No. 12/358,399, filed Jan. 23, 2009, entitled “System and Method for Intelligent State Management,” Inventor(s) William Deninger et al.Applicant
- U.S. Appl. No. 12/410,875, filed Mar. 25, 2009, entitled “System and Method for Data Mining and Security Policy Management,” Inventor(s) Ratinder Paul Singh Ahuja et al.Applicant
- U.S. Appl. No. 12/410,905, filed Mar. 25, 2009, entitled “System and Method for Managing Data and Policies,” Inventor(s) Ratinder Paul Singh Ahuja et al.Applicant
- Preneel, Bart, “Cryptographic Hash Functions”, Proceedings of the 3rd Symposium on State and Progress of Research in Cryptography, 1993, pp. 161-171.Applicant
- U.S. Appl. No. 12/360,537, filed Jan. 27, 2009, entitled “Database for a Capture System,” Inventor(s) Rick Lowe et al.Applicant
- U.S. Appl. No. 11/254,436, filed Oct. 19, 2005, entitled “Attributes of Captured Objects in a Capture System,” Inventor(s) William Deninger et al.Applicant
- U.S. Appl. No. 11/900,964, filed Sep. 14, 2007, entitled “System and Method for Indexing a Capture System,” Inventor(s) Ashok Doddapaneni et al.Applicant
- Microsoft Outlook, Out look, copyright 1995-2000, 2 pages.Applicant
- U.S. Appl. No. 12/873,860, filed Sep. 1, 2010, entitled “A System and Method for Word Indexing in a Capture System and Querying Thereof,” Inventor(s) William Deninger, et al.Applicant
- U.S. Appl. No. 12/873,061, filed Aug. 31, 2010, entitled “Document Registration,” Inventor(s) Ratinder Paul Singh Ahuja, et al.Applicant
- U.S. Appl. No. 12/939,340, filed Nov. 3, 2010, entitled “System and Method for Protecting Specified Data Combinations,” Inventor(s) Ratinder Paul Singh Ahuja, et al.Applicant
- Han, OLAP Mining: An Integration of OLAP with Data Mining, 1997, pp. 1-18.Applicant
- Niemi, Constructing OLAP Cubes Based on Queries, 2001, pp. 1-7.Applicant
- Schultz, Data Mining for Detection of New Malicious Executables, 2001, pp. 1-13.Applicant
- U.S. Appl. No. 12/967,013, filed Dec. 13, 2010, entitled “Tag Data Structure for Maintaining Relational Data Over Captured Objects,” Inventor(s) Erik de la Iglesia, et al.Applicant
- U.S. Appl. No. 13/024,923, filed Feb. 10, 2011, entitled “High Speed Packet Capture,” Inventor(s) Weimin Liu, et al.Applicant
- U.S. Appl. No. 13/047,068, filed Mar. 14, 2011, entitled “Cryptographic Policy Enforcement,” Inventor(s) Ratinder Paul Singh Ahuja, et al.Applicant
- U.S. Appl. No. 13/049,533, filed Mar. 16, 2011, entitled “File System for a Capture System,” Inventor(s) Rick Lowe, et al.Applicant