Tag data structure for maintaining relational data over captured objects

Information

  • Patent Grant
  • 7899828
  • Patent Number
    7,899,828
  • Date Filed
    Tuesday, March 30, 2004
    20 years ago
  • Date Issued
    Tuesday, March 1, 2011
    13 years ago
Abstract
Objects captured over a network by a capture system can be indexed to provide enhanced search and content analysis capabilities. In one embodiment the objects can be indexed using a data structure having a source address field to indicate an origination address of the object, a destination address field to indicate a destination address of the object, a source port field to indicate an origination port of the object, a destination port field to indicate a destination port of the object, a content field to indicate a content type from a plurality of content types identifying a type of content contained in the object, and a time field to indicate when the object was captured. The data structure may also store a cryptographic signature of the object to ensure the object is not altered after capture.
Description
FIELD OF THE INVENTION

The present invention relates to computer networks, and in particular, to capturing and indexing objects in a computer network.


BACKGROUND

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. Modem 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. However, once an intruder has gained access to sensitive content, there 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. What is needed is a comprehensive system to capture, store, and analyse all data communicated using the enterprises network.


SUMMARY OF THE INVENTION

Content leaving a local network can be captured. Objects captured over a network by a capture system can be indexed to provide enhanced search and content analysis capabilities. In one embodiment the objects can be indexed using a data structure having a source address field to indicate an origination address of the object, a destination address field to indicate a destination address of the object, a source port field to indicate an origination port of the object, a destination port field to indicate a destination port of the object, a content field to indicate a content type from a plurality of content types identifying a type of content contained in the object, and a time field to indicate when the object was captured. The data structure may also store a cryptographic signature of the object to ensure the object is not altered after capture.





BRIEF DESCRIPTION OF THE DRAWINGS

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:



FIG. 1 is a block diagram illustrating a computer network connected to the Internet;



FIG. 2 is a block diagram illustrating one configuration of a capture system according to one embodiment of the present invention;



FIG. 3 is a block diagram illustrating the capture system according to one embodiment of the present invention;



FIG. 4 is a block diagram illustrating an object assembly module according to one embodiment of the present invention;



FIG. 5 is a block diagram illustrating an object store module according to one embodiment of the present invention;



FIG. 6 is a block diagram illustrating an example hardware architecture for a capture system according to one embodiment of the present invention; and



FIG. 7 is a flow diagram illustrating object verification according to one embodiment of the present invention.





DETAILED DESCRIPTION

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.


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.


As indicated above, one embodiment of the present invention is instantiated in computer software, that is, computer readable instructions, which, when executed by one or more computer processors/systems, instruct the processors/systems to perform the designated actions. Such computer software may be resident in one or more computer readable media, such as hard drives, CD-ROMs, DVD-ROMs, read-only memory, read-write memory and so on. Such software may be distributed on one or more of these media, or may be made available for download across one or more computer networks (e.g., the Internet). Regardless of the format, the computer programming, rendering and processing techniques discussed herein are simply examples of the types of programming, rendering and processing techniques that may be used to implement aspects of the present invention. These examples should in no way limit the present invention, which is best understood with reference to the claims that follow this description.


Networks



FIG. 1 illustrates a simple prior art configuration of a local area network (LAN) 10 connected to the Internet 12. Connected to the LAN 102 are various components, such as servers 14, clients 16, and switch 18. There are numerous other known networking components and computing devices that can be connected to the LAN 10. The LAN 10 can be implemented using various wireline or wireless technologies, such as Ethernet and 802.11b. The LAN 10 may be much more complex than the simplified diagram in FIG. 1, and may be connected to other LANs as well.


In FIG. 1, the LAN 10 is connected to the Internet 12 via a router 20. This router 20 can be used to implement a firewall, which are widely used to give users of the LAN 10 secure access to the Internet 12 as well as to separate a company's public Web server (can be one of the servers 14) from its internal network, i.e., LAN 10. In one embodiment, any data leaving the LAN 10 towards the Internet 12 must pass through the router 12. However, there the router 20 merely forwards packets to the Internet 12. The router 20 cannot capture, analyse, and searchably store the content contained in the forwarded packets.


One embodiment of the present invention is now illustrated with reference to FIG. 2. FIG. 2 shows the same simplified configuration of connecting the LAN 10 to the Internet 12 via the router 20. However, in FIG. 2, the router 20 is also connected to a capture system 22. In one embodiment, the router 12 splits the outgoing data stream, and forwards one copy to the Internet 12 and the other copy to the capture system 22.


There are various other possible configurations. For example, the router 12 can also forward a copy of all incoming data to the capture system 22 as well. Furthermore, the capture system 22 can be configured sequentially in front of, or behind the router 20, however this makes the capture system 22 a critical component in connecting to the Internet 12. In systems where a router 12 is not used at all, the capture system can be interposed directly between the LAN 10 and the Internet 12. In one embodiment, the capture system 22 has a user interface accessible from a LAN-attached device, such as a client 16.


In one embodiment, the capture system 22 intercepts all data leaving the network. In other embodiments, the capture system can also intercept all data being communicated inside the network 10. In one embodiment, the capture system 22 reconstructs the documents leaving the network 10, and stores them in a searchable fashion. The capture system 22 can then be used to search and sort through all documents that have left the network 10. 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.


Capture System


One embodiment of the present invention is now described with reference to FIG. 3. FIG. 3 shows one embodiment of the capture system 22 in more detail. The capture system 22 is also sometimes referred to as a content analyzer, content or data analysis system, and other similar names. In one embodiment, the capture system 22 includes a network interface module 24 to receive the data from the network 10 or the router 20. In one embodiment, the network interface module 24 is implemented using one or more network interface cards (NIC), e.g., Ethernet cards. In one embodiment, the router 20 delivers all data leaving the network to the network interface module 24.


The captured raw data is then passed to a packet capture module 26. In one embodiment, the packet capture module 26 extracts data packets from the data stream received from the network interface module 24. In one embodiment, the packet capture module 26 reconstructs Ethernet packets from multiple sources to multiple destinations for the raw data stream.


In one embodiment, the packets are then provided the object assembly module 28. The object assembly module 28 reconstructs the objects being transmitted by the packets. For example, when a document is transmitted, e.g. as an email attachment, it is broken down into packets according to various data transfer protocols such as Transmission Control Protocol/Internet Protocol (TCP/IP) and Ethernet. The object assembly module 28 can reconstruct the document from the captured packets.


One embodiment of the object assembly module 28 is now described in more detail with reference to FIG. 4. When packets first enter the object assembly module, they are first provided to a reassembler 36. In one embodiment, the reassembler 36 groups—assembles—the packets into unique flows. For example, a flow can be defined as packets with identical Source IP and Destination IP addresses as well as identical TCP Source and Destination Ports. That is, the reassembler 36 can organize a packet stream by sender and recipient.


In one embodiment, the reassembler 36 begins a new flow upon the observation of a starting packet defined by the data transfer protocol. For a TCP/IP embodiment, the starting packet is generally referred to as the “SYN” packet. The flow can terminate upon observation of a finishing packet, e.g., a “Reset” or “FIN” packet in TCP/IP. If now finishing packet is observed by the reassembler 36 within some time constraint, it can terminate the flow via a timeout mechanism. In an embodiment using the TPC protocol, a TCP flow contains an ordered sequence of packets that can be assembled into a contiguous data stream by the ressembler 36. Thus, in one embodiment, a flow is an ordered data stream of a single communication between a source and a destination.


The flown assembled by the reassember 36 can then be provided to a protocol demultiplexer (demux) 38. In one embodiment, the protocol demux 38 sorts assembled flows using the TCP Ports. This can include 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—i.e., Web traffic—are typically associated with port 80, File Transfer Protocol (FTP) packets with port 20, Kerberos authentication packets with port 88, and so on. Thus in one embodiment, the protocol demux 38 separates all the different protocols in one flow.


In one embodiment, a protocol classifier 40 also sorts the flows in addition to the protocol demux 38. In one embodiment, the protocol classifier 40—operating either in parallel or in sequence with the protocol demux 38—applies signature filters to the flows to attempt to identify the protocol based solely on the transported data. Furthermore, the protocol demux 38 can make a classification decision based on port number which is subsequently overridden by protocol classifier 40. For example, if an individual or program attempted to masquerade an illicit communication (such as file sharing) using an apparently benign port such as port 80 (commonly used for HTTP Web browsing), the protocol classifier 40 would use protocol signatures, i.e., the characteristic data sequences of defined protocols, to verify the speculative classification performed by protocol demux 38.


In one embodiment, the object assembly module 28 outputs each flow organized by protocol, which represent the underlying objects. Referring again to FIG. 3, these objects can then be handed over to the object classification module 30 (sometimes 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, protocols such as HTTP (Internet Web Surfing) may contain over 100 objects of any number of content types in a single flow. To deconstruct the flow, each object contained in the flow is individually extracted, and decoded, if necessary, by the object classification module 30.


The object classification module 30 uses the inherent properties and 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 document. The object classification module 30 can extract out each individual object and sort them out by such content types. Such classification renders the present invention immune from cases where a malicious user has altered a file extension or other property in an attempt to avoid detection of illicit activity.


In one embodiment, the object classification module 30 determines whether each object should be stored or discarded. In one embodiment, this determination is based on a various capture rules. For example, a capture rule can indicate that Web Traffic should be discarded. Another capture rule can indicate that all PowerPoint documents should be stored, except for ones originating from the CEO's IP address. Such capture rules can be implemented as regular expressions, or by other similar means.


In one embodiment, the capture rules are authored by users of the capture system 22. The capture system 22 is made accessible to any network-connected machine through the network interface module 24 and user interface 34. In one embodiment, the user interface 34 is a graphical user interface providing the user with friendly access to the various features of the capture system 22. For example, the user interface 34 can provide a capture rule authoring tool that allows users to write and implement any capture rule desired, which are then applied by the object classification module 30 when determining whether each object should be stored. The user interface 34 can also provide pre-configured capture rules that the user can select from along with an explanation of the operation of such standard included capture rules. In one embodiment, the default capture rule implemented by the object classification module 30 captures all objects leaving the network 10.


If the capture of an object is mandated by the capture rules, the object classification module 30 can also determine where in the object store module 32 the captured object should be stored. With reference to FIG. 5, in one embodiment, the objects are stored in a content store 44 memory block. Within the content store 44 are files 46 divided up by content type. Thus, for example, if the object classification module determines that an object is a Word document that should be stored, it can store it in the file 46 reserved for Word documents. In one embodiment, the object store module 32 is integrally included in the capture system 22. In other embodiments, the object store module can be external—entirely or in part—using, for example, some network storage technique such as network attached storage (NAS) and storage area network (SAN).


Tag Data Structure


In one embodiment, the content store is a canonical storage location, simply a place to deposit the captured objects. The indexing of the objects stored in the content store 44 is accomplished using a tag database 42. In one embodiment, the tag database 42 is a database data structure in which each record is a “tag” that indexes an object in the content store 44 and contains relevant information about the stored object.


An example of a tag record in the tag database 42 that indexes an object stored in the content store 44 is set forth in Table 1:










TABLE 1





Field Name
Definition







MAC Address
Ethernet controller MAC address unique to each



capture system


Source IP
Source Ethernet IP Address of object


Destination IP
Destination Ethernet IP Address of object


Source Port
Source TCP/IP Port number of object


Destination Port
Destination TCP/IP Port number of the object


Protocol
IP 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 (rule author)


Configuration
Capture rule directing the capture of object


Signature
Hash signature of object


Tag Signature
Hash signature of all preceding tag fields









There are various other possible tag fields, and some embodiments can omit numerous tag fields listed in Table 1. In other embodiments, the tag database 42 need not be implemented as a database, and a tag need not be a record. Any data structure capable of indexing an object by storing relational data over the object can be used as a tag data structure. Furthermore, the word “tag” is merely descriptive, other names such as “index” or “relational data store,” would be equally descriptive, as would any other designation performing similar functionality.


The mapping of tags to objects can, in one embodiment, 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 IP, Source Port, Destination Port, Instance and Timestamp. Many other such combinations including both shorter and longer names are possible. In another embodiment, the tag can contain a pointer to the storage location where the indexed object is stored.


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:










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









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 labelled 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); C++ Source, C Source, FORTRAN Source, Verilog Source (for source or 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); Binary Unknown, ASCII Unknown, and Unknown (as catchall categories).


The signature contained in the Signature and Tag Signature fields can be any digest or hash over the object, or some portion thereof. In one embodiment, a well known hash, such as MD5 or SHA1 can be used. In one embodiment, the signature is a digital cryptographic signature. In one embodiment, a digital cryptographic signature is a hash signature that is signed with the private key of the capture system 22. Only the capture system 22 knows its own private key, thus, the integrity of the stored object can be verified by comparing a hash of the stored object to the signature decrypted with the public key of the capture system 22, the private and public keys being a public key cryptosystem key pair. Thus, if a stored object is modified from when it was originally captured, the modification will cause the comparison to fail.


Similarly, the signature over the tag stored in the Tag Signature field can also be a digital cryptographic signature. In such an embodiment, the integrity of the tag can also be verified. In one embodiment, verification of the object using the signature, and the tag using the tag signature is performed whenever an object is presented, e.g., displayed to a user. In one embodiment, if the object or the tag is found to have been compromised, an alarm is generated to alert the user that the object displayed may not be identical to the object originally captured.


One embodiment of a process for using the cryptographic signatures is shown in flow chart form in FIG. 7. Blocks 702-714 describe object capture, while blocks 716-722 describe object presentation. First, in block 702, the object is captured by the capture system 22 described above. Then, in block 704, the digital cryptographic signature is generated, e.g., by hashing the object and signing the hash with the private key of the capture system 22. In block 706, all the information gathered by the object assembly module 28 and the object classification module 30 are used to populate the tag fields described above, such as “Source IP,” “Content,” “Size,” and the digital cryptographic signature is inserted into the appropriate “Signature” field.


In block 708, the cryptographic tag signature over the tag is generated using any known cryptographic method, such as the one used to generate the cryptographic signature over the object in block 704. The cryptographic tag signature is then inserted, in block 710, into the tag in the appropriate “Tag Signature” field. In block 712, the object is stored, e.g., in the content store 44, and in block 714, the tag indexing the object is stored, e.g., in the tag database 42.


The object and its corresponding tag maintaining the relational data over the object remain stored. Eventually, in block 716, a search—also sometimes referred to as a mine—is performed over one or more of the tag fields that results in a hit on the tag. For example, the tag indicates a particular source IP in the “Source IP” field that was indicated by the search. Next, in block 718, the tag is verified to ensure that it has not been modified since initial storage in block 714. This can be done by cryptographically verifying the tag signature generated in block 708. For example, the tag signature can be decrypted with the public key of the capture system 22 and compared to a new hash of the tag fields. Other verifications are possible depending on how the tag signature was generated.


In block 720, the object itself is verified by retrieving the object and cryptographically verifying the digital cryptographic signature stored in the “Signature” field. This can be done similarly to the verification of the tag signature in block 718. In both object and tag signature check out, that is, if neither the object nor the tag has been modified since original storage in blocks 712 and 714 respectively, then the object is presented, in bock 722, to the user. Presenting the object can include any method of delivery, including displaying the object to the user via the user interface 34. If either object or tag has been modified, that is, at least one of the signatures does not check out, the object can still be presented in block 722, but a warning or alert can also be appended to bring the modification to the users attention.


User Interface


Referring again to FIG. 3, in one embodiment, the objects and tags stored in the object store module 32 can be interactively queried by a user via the user interface 34. In one embodiment the user interface can interact with a web server (not shown) to provide the user with Web-based access to the capture system 22. The objects in the content store module 32 can thus be searched for specific textual or graphical content using exact matches, patterns, keywords, and various other advanced attributes.


For example, the user interface 34 can provide a query-authoring tool (not shown) to enable users to create complex searches of the object store module 32. These search queries can be provided to a data mining engine (not shown) that parses the queries, scans the tag database 42, and retrieves the found object from the content store 44. Then, these objects that matched the specific search criteria in the user-authored query can be counted and displayed to the user by the user interface 34.


Searches can also be scheduled to occur at specific times or at regular intervals, that is, the user interface 34 can provide access to a scheduler (not shown) that can periodically execute specific queries. Reports containing the results of these searches can be made available to the user at a later time, mailed to the administrator electronically, or used to generate an alarm in the form of an e-mail message, page, syslog or other notification format.


In several embodiments, the capture system 22 has been described above as a stand-alone device. However, the capture system of the present invention can be implemented on any appliance capable of capturing and analysing data from a network. For example, the capture system 22 described above could be implemented on one or more of the servers 14 or clients 16 shown in FIG. 1. The capture system 22 can interface with the network 10 in any number of ways, including wirelessly.


In one embodiment, the capture system 22 is an appliance constructed using commonly available computing equipment and storage systems capable of supporting the software requirements. In one embodiment, illustrated by FIG. 6, the hardware consists of a capture entity 46, a processing complex 48 made up of one or more processors, a memory complex 50 made up of one or more memory elements such as RAM and ROM, and storage complex 52, such as a set of one or more hard drives or other digital or analog storage means. In another embodiment, the storage complex 52 is external to the capture system 22, as explained above. In one embodiment, the memory complex stored software consisting of an operating system for the capture system device 22, a capture program, and classification program, a database, a filestore, an analysis engine and a graphical user interface.


Thus, a capture system and content analyser have been described. In the forgoing description, various specific values were given names, such as “packets,” and various specific modules, such as the “object assembly module” and “object store module” 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, such as the object store module 32 and the object classification module 30 in FIG. 3, can be implemented as software or hardware modules, 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
  • 1. A computer readable medium having stored thereon data representing instructions that, when executed by a processor, cause the processor to perform operations comprising: generating a tag describing an object of a communication captured during transmission of the communication from an origination address to a destination address, extracted from the communication, and stored in a memory block, wherein the tag includes, a source address field to indicate an origination address of the object,a destination address field to indicate a destination address of the object,a source port field to indicate an origination port of the object,a destination port field to indicate a destination port of the object,a content field to indicate a content type from a plurality of content types identifying a type of content contained in the object, anda time field to indicate when the object was captured; andstoring the tag in a database, wherein the tag indexes the object in the memory block, the tag being stored to allow subsequent searching for the object based on one or more of the fields, wherein the fields are obtained from the communication, and wherein the object is part of a document captured based on a capture rule that defines which objects are to be captured, wherein the capture rule is part of a default rule set for a capture system configured to monitor network traffic, and wherein a determination is made based on the capture rule to discard or to store the document, and wherein the capture rule identifies a first internet protocol (IP) address from which the document was sent and a second IP address associated with an intended destination of the document.
  • 2. The computer readable medium of claim 1, wherein the plurality of content types comprises JPEG, GIF, BMP, TIFF, PNG, Skintone, PDF, MSWord, Excel, PowerPoint, MSOffice, HTML, WebMail, SMTP, Telnet, Rlogin, FTP, Chat, GZIP, ZIP, TAR, C++Source, C Source, FORTRAN Source, Verilog Source, C Shell, K Shell, Bash Shell, Plaintext, Crypto, LIF, Binary Unknown, ASCII Unknown, and Unknown.
  • 3. The computer readable medium of claim 1, further comprising generating a device identity field to indicate a device that captured the object.
  • 4. The computer readable medium of claim 1, further comprising generating a protocol field to indicate the protocol that carried the object.
  • 5. The computer readable medium of claim 1, further comprising an instance field to indicate a number of the object in a connection.
  • 6. The computer readable medium of claim 1, further comprising generating an encoding field to indicate a how the object was encoded.
  • 7. The computer readable medium of claim 1, further comprising generating a size field to indicate the size of the object.
  • 8. The computer readable medium of claim 1, further comprising generating an owner field to indicate an entity that requested capture of the object.
  • 9. The computer readable medium of claim 1, further comprising generating a capture rule field to indicate a rule that triggered capture of the object.
  • 10. The computer readable medium of claim 1, further comprising generating a signature field to store a signature of the object.
  • 11. The computer readable medium of claim 10, wherein the signature comprises a digital cryptographic signature.
  • 12. The computer readable medium of claim 1, further comprising generating a tag signature field to store a signature of the data structure.
  • 13. The computer readable medium of claim 12, wherein the tag signature comprises a digital cryptographic signature.
  • 14. A computer readable medium having stored thereon data representing instructions that, when executed by a processor, cause the processor to perform operations comprising: storing data associated with an object of a communication captured during transmission of the communication from an origination address to a destination address, extracted from the communication, and stored in a memory block by a capture system to create a tag that indexes the object in the memory block, the data comprising: an Ethernet controller MAC address of the capture system that captured the object;a source Ethernet IP address of the object;a destination Ethernet IP address of the object;a source TCP/IP port number of the object;a destination TCP/IP port number of the object.an IP protocol that carried the object when captured by the capture system;a canonical count of a number of the object within a TCP/IP connection;a content type of the object;an encoding that was used on the object;a size of the object;a timestamp indicating when the capture system captured the object;a user who requested capture of the object;a capture rule that directed capture of the object;a hash signature of the object; anda hash signature of the tag, the tag being stored to allow subsequent searching for the object based on one or more of the fields, wherein the IP addresses are obtained from the communication, and wherein the object is part of a document captured based on a capture rule that defines which objects are to be captured, wherein the capture rule is part of a default rule set for the capture system configured to monitor network traffic, and wherein a determination is made based on the capture rule to discard or to store the document, and wherein the capture rule identifies a first internet protocol (IP) address from which the document was sent and a second IP address associated with an intended destination of the document.
  • 15. The computer readable medium of claim 14, wherein the hash signature of the object comprises a digital cryptographic signature of the object.
  • 16. The computer readable medium of claim 15, wherein the hash signature of the tag comprises a digital cryptographic signature of the tag.
  • 17. The computer readable medium of claim 14, wherein the content type of the object is one of JPEG, GIF, BMP, TIFF, PNG, Skintone, PDF, MSWord, Excel, PowerPoint, MSOffice, HTML, WebMail, SMTP, Telnet, Rlogin, FTP, Chat, GZIP, ZIP, TAR, C++Source, C Source, FORTRAN Source, Verilog Source, C Shell, K Shell, Bash Shell, Plaintext, Crypto, LIF, Binary Unknown, ASCII Unknown, and Unknown.
  • 18. A method to index a captured object, comprising: generating for storage of objects of a communication captured during transmission of the communication from an origination address to a destination address, extracted from the communication, and stored in a memory block: a source address field to indicate an origination address of the object;a destination address field to indicate a destination address of the object;a source port field to indicate an origination port of the object;a destination port field to indicate a destination port of the object;a content field to indicate a content type from a plurality of content types identifying a type of content contained in the object; anda time field to indicate when the object was captured; andstoring data in the fields to create a tag, the tag indexing the objects in the memory block, the tag being stored to allow subsequent searching for the objects based on one or more of the fields, wherein the fields are obtained from the communication, and wherein the object is part of a document captured based on a capture rule that defines which objects are to be captured, wherein the capture rule is part of a default rule set for a capture system configured to monitor network traffic, and wherein a determination is made based on the capture rule to discard or to store the document, and wherein the capture rule identifies a first internet protocol (IP) address from which the document was sent and a second IP address associated with an intended destination of the document.
  • 19. A method to index a captured object, comprising: storing data associated with an object of a communication captured during transmission of the communication from an origination address to a destination address, extracted from the communication, and stored in a memory block by a capture system to create a tag indexing the object in the memory block, the data comprising: an Ethernet controller MAC address of the capture system that captured the object;a source Ethernet IP address of the object;a destination Ethernet IP address of the object;a source TCP/IP port number of the object;a destination TCP/IP port number of the object;an IP protocol that carried the object when captured by the capture system;a canonical count of a number of the object within a TCP/IP connection;a content type of the object;an encoding that was used on the object;a size of the object;a timestamp indicating when the capture system captured the object;a user who requested capture of the object;a capture rule that directed capture of the object;a hash signature of the object; anda hash signature of the tag, the tag being stored to allow subsequent searching for the object based on one or more of the fields, wherein the IP addresses are obtained from the communication, and wherein the object is part of a document captured based on a capture rule that defines which objects are to be captured, wherein the capture rule is part of a default rule set for the capture system configured to monitor network traffic, and wherein a determination is made based on the capture rule to discard or to store the document, and wherein the capture rule identifies a first internet protocol (IP) address from which the document was sent and a second IP address associated with an intended destination of the document.
PRIORITY AND RELATED APPLICATIONS

This patent application is related to, incorporates by reference, and claims the priority benefit of U.S. Provisional Application 60/528,680, entitled “TAG DATA STRUCTURE FOR MAINTAINING RELATIONAL DATA OVER CAPTURED APPLICATION DATA”, filed Dec. 10, 2003, and of U.S. Provisional Application 60/528,644, entitled “VERIFYING CAPTURED OBJECTS BEFORE PRESENTATION”, filed Dec. 10, 2003.

US Referenced Citations (197)
Number Name Date Kind
4286255 Siy Aug 1981 A
4710957 Bocci et al. Dec 1987 A
5249289 Thamm et al. Sep 1993 A
5465299 Matsumoto et al. Nov 1995 A
5479654 Squibb Dec 1995 A
5497489 Menne Mar 1996 A
5557747 Rogers et al. Sep 1996 A
5623652 Vora et al. Apr 1997 A
5768578 Kirk Jun 1998 A
5781629 Haber et al. Jul 1998 A
5794052 Harding Aug 1998 A
5813009 Johnson et al. Sep 1998 A
5943670 Prager Aug 1999 A
5995111 Morioka et al. Nov 1999 A
6026411 Delp Feb 2000 A
6078953 Vaid et al. Jun 2000 A
6094531 Allison et al. Jul 2000 A
6108697 Raymond et al. Aug 2000 A
6161102 Yanagihara et al. Dec 2000 A
6175867 Taghadoss Jan 2001 B1
6192472 Garay et al. Feb 2001 B1
6243091 Berstis Jun 2001 B1
6243720 Munter et al. Jun 2001 B1
6278992 Curtis et al. Aug 2001 B1
6292810 Richards Sep 2001 B1
6356885 Ross et al. Mar 2002 B2
6389419 Wong et al. May 2002 B1
6408294 Getchius et al. Jun 2002 B1
6408301 Patton et al. Jun 2002 B1
6457017 Watkins et al. Sep 2002 B2
6493761 Baker et al. Dec 2002 B1
6499105 Yoshiura et al. Dec 2002 B1
6515681 Knight Feb 2003 B1
6516320 Odom et al. Feb 2003 B1
6523026 Gillis Feb 2003 B1
6539024 Janoska et al. Mar 2003 B1
6571275 Dong et al. May 2003 B1
6598033 Ross et al. Jul 2003 B2
6662176 Brunet et al. Dec 2003 B2
6691209 O'Connell Feb 2004 B1
6771595 Gilbert et al. Aug 2004 B1
6772214 McClain et al. Aug 2004 B1
6785815 Serret-Avila et al. Aug 2004 B1
6820082 Cook et al. Nov 2004 B1
6857011 Reinke Feb 2005 B2
6937257 Dunlavey Aug 2005 B1
6950864 Tsuchiya Sep 2005 B1
6978297 Piersol Dec 2005 B1
7020654 Najmi Mar 2006 B1
7020661 Cruanes et al. Mar 2006 B1
7062572 Hampton Jun 2006 B1
7072967 Saulpaugh et al. Jul 2006 B1
7082443 Ashby Jul 2006 B1
7093288 Hydrie et al. Aug 2006 B1
7130587 Hikokubo et al. Oct 2006 B2
7158983 Willse et al. Jan 2007 B2
7185073 Gai et al. Feb 2007 B1
7185192 Kahn Feb 2007 B1
7219131 Banister et al. May 2007 B2
7219134 Takeshima et al. May 2007 B2
7243120 Massey Jul 2007 B2
7246236 Stirbu Jul 2007 B2
7254562 Hsu et al. Aug 2007 B2
7266845 Hypponen Sep 2007 B2
7277957 Rowley et al. Oct 2007 B2
7290048 Barnett et al. Oct 2007 B1
7296070 Sweeney et al. Nov 2007 B2
7296088 Padmanabhan et al. Nov 2007 B1
7299277 Moran et al. Nov 2007 B1
7373500 Ramelson et al. May 2008 B2
7424744 Wu et al. Sep 2008 B1
7426181 Feroz et al. Sep 2008 B1
7434058 Ahuja et al. Oct 2008 B2
7477780 Boncyk et al. Jan 2009 B2
7483916 Lowe et al. Jan 2009 B2
7493659 Wu et al. Feb 2009 B1
7506055 McClain et al. Mar 2009 B2
7509677 Saurabh et al. Mar 2009 B2
7516492 Nisbet et al. Apr 2009 B1
7551629 Chen et al. Jun 2009 B2
7596571 Sifry Sep 2009 B2
7664083 Cermak et al. Feb 2010 B1
20010037324 Agrawal et al. Nov 2001 A1
20020032677 Morgenthaler et al. Mar 2002 A1
20020052896 Streit et al. May 2002 A1
20020078355 Samar Jun 2002 A1
20020091579 Yehia et al. Jul 2002 A1
20020103876 Chatani et al. Aug 2002 A1
20020107843 Biebesheimer et al. Aug 2002 A1
20020116124 Garin et al. Aug 2002 A1
20020126673 Dagli et al. Sep 2002 A1
20020129140 Peled et al. Sep 2002 A1
20020159447 Carey et al. Oct 2002 A1
20030009718 Wolfgang et al. Jan 2003 A1
20030028493 Tajima Feb 2003 A1
20030028774 Meka Feb 2003 A1
20030046369 Sim et al. Mar 2003 A1
20030053420 Duckett et al. Mar 2003 A1
20030065571 Dutta Apr 2003 A1
20030084300 Koike May 2003 A1
20030084318 Schertz May 2003 A1
20030084326 Tarquini May 2003 A1
20030093678 Bowe et al. May 2003 A1
20030099243 Oh et al. May 2003 A1
20030105739 Essafi et al. Jun 2003 A1
20030131116 Jain et al. Jul 2003 A1
20030135612 Huntington Jul 2003 A1
20030185220 Valenci Oct 2003 A1
20030196081 Savarda et al. Oct 2003 A1
20030204741 Schoen et al. Oct 2003 A1
20030221101 Micali Nov 2003 A1
20030225796 Matsubara Dec 2003 A1
20030225841 Song et al. Dec 2003 A1
20030231632 Haeberlen Dec 2003 A1
20040059736 Willse et al. Mar 2004 A1
20040071164 Baum Apr 2004 A1
20040111678 Hara Jun 2004 A1
20040114518 MacFaden et al. Jun 2004 A1
20040117414 Braun et al. Jun 2004 A1
20040120325 Ayres Jun 2004 A1
20040122863 Sidman Jun 2004 A1
20040181513 Henderson et al. Sep 2004 A1
20040181690 Rothermel et al. Sep 2004 A1
20040194141 Sanders Sep 2004 A1
20040196970 Cole Oct 2004 A1
20040230572 Omoigui Nov 2004 A1
20040267753 Hoche Dec 2004 A1
20050004911 Goldberg et al. Jan 2005 A1
20050021715 Dugatkin et al. Jan 2005 A1
20050021743 Fleig et al. Jan 2005 A1
20050022114 Shanahan et al. Jan 2005 A1
20050027881 Figueira et al. Feb 2005 A1
20050033747 Wittkotter Feb 2005 A1
20050033803 Vleet et al. Feb 2005 A1
20050038809 Abajian et al. Feb 2005 A1
20050050205 Gordy et al. Mar 2005 A1
20050055327 Agrawal et al. Mar 2005 A1
20050055399 Savchuk Mar 2005 A1
20050091443 Hershkovich et al. Apr 2005 A1
20050091532 Moghe Apr 2005 A1
20050097441 Herbach et al. May 2005 A1
20050108244 Riise et al. May 2005 A1
20050114452 Prakash May 2005 A1
20050120006 Nye Jun 2005 A1
20050127171 Ahuja et al. Jun 2005 A1
20050128242 Suzuki Jun 2005 A1
20050131876 Ahuja et al. Jun 2005 A1
20050132034 de la Iglesia et al. Jun 2005 A1
20050132046 de la Iglesia et al. Jun 2005 A1
20050132197 Medlar Jun 2005 A1
20050132198 Ahuja et al. Jun 2005 A1
20050132297 Milic-Frayling et al. Jun 2005 A1
20050138242 Pope et al. Jun 2005 A1
20050138279 Somasundaram Jun 2005 A1
20050149504 Ratnaparkhi Jul 2005 A1
20050166066 Ahuja et al. Jul 2005 A1
20050177725 Lowe et al. Aug 2005 A1
20050180341 Nelson et al. Aug 2005 A1
20050203940 Farrar et al. Sep 2005 A1
20050204129 Sudia et al. Sep 2005 A1
20050228864 Robertson Oct 2005 A1
20050235153 Ikeda Oct 2005 A1
20050289181 Deninger et al. Dec 2005 A1
20060005247 Zhang et al. Jan 2006 A1
20060021045 Cook Jan 2006 A1
20060021050 Cook et al. Jan 2006 A1
20060037072 Rao et al. Feb 2006 A1
20060041560 Forman et al. Feb 2006 A1
20060041570 Lowe et al. Feb 2006 A1
20060041760 Huang Feb 2006 A1
20060047675 Lowe et al. Mar 2006 A1
20060083180 Baba et al. Apr 2006 A1
20060150249 Gassen et al. Jul 2006 A1
20060167896 Kapur et al. Jul 2006 A1
20060184532 Hamada et al. Aug 2006 A1
20060242126 Fitzhugh Oct 2006 A1
20060242313 Le et al. Oct 2006 A1
20060251109 Muller et al. Nov 2006 A1
20060272024 Huang et al. Nov 2006 A1
20060288216 Buhler et al. Dec 2006 A1
20070006293 Balakrishnan et al. Jan 2007 A1
20070036156 Liu et al. Feb 2007 A1
20070050334 Deninger et al. Mar 2007 A1
20070050381 Hu et al. Mar 2007 A1
20070094394 Singh et al. Apr 2007 A1
20070110089 Essafi et al. May 2007 A1
20070116366 Deninger et al. May 2007 A1
20070136599 Suga Jun 2007 A1
20070162609 Pope et al. Jul 2007 A1
20070226504 de la Iglesia et al. Sep 2007 A1
20070226510 de la Iglesia et al. Sep 2007 A1
20070248029 Merkey et al. Oct 2007 A1
20070271254 de la Iglesia et al. Nov 2007 A1
20070271371 Ahuja et al. Nov 2007 A1
20070271372 Deninger et al. Nov 2007 A1
20070280123 Atkins et al. Dec 2007 A1
20080028467 Kommareddy et al. Jan 2008 A1
Related Publications (1)
Number Date Country
20050132079 A1 Jun 2005 US
Provisional Applications (2)
Number Date Country
60528680 Dec 2003 US
60528644 Dec 2003 US