US 8,601,034 B2Grant
System and method for real time data awareness
Issue Date:2013-12-03
•23 Claims
•7 Drawing Sheets
Abstract
A system includes a sensor and a processor. The sensor is configured to passively read data in packets as the packets are in motion on a network. The processor is cooperatively operable with the sensor The processor is configured to receive the read data from the sensor; and originate real-time map profiles of files and file data, both from the read data from the sensor, as the passively read packets are in motion on the network.
Metadata
Assignee
- Sourcefire, Inc.
Inventor
- Martin Frederick Roesch
Application Information
Application Number:US 13/046,127
Filing Date:2011-03-11
Priority Date:2011-03-11
Art Unit:2162
Classifications
IPC:
G06F15/173G06F17/30
Patent Drawings (7 sheets)
Description
Technical Field
[0001] The technical field relates in general to communication network security, and more specifically to passively determining attributes of data (such as location of data) in a network, from packets in motion on the network.
Background
[0002] A “data leak prevention” (DLP) system is a technology designed to keep a company's data in that company's network, or at least so the company can manage it and influence its motion on the company's network. A DLP assumes that it knows where the data is which it is monitoring. Classic examples of problems the DLP is trying to solve are people e-mailing to places where they shouldn't or with attachments that they shouldn't, people trying to e-mail out the company's source code, people trying to download the company's credit card database, and the like.
[0003] Initially DLP was positioned as something designed to stop malicious users from exfiltrating data out of the network. In practice, it turned into something to keep people from doing stupid things with data. It turned into a stupidity prevention system. Basically, a DLP was good for things like preventing fat-fingering auto-complete e-mail addresses, for example, when the company's provisional quarterly numbers are accidentally sent to the Washington Post instead of the company's accountant.
Summary
[0004] Accordingly, one or more embodiments of the present invention provide methods, systems, and/or computer readable memory mediums, in which a sensor is configured to passively read data in packets as the packets are in motion on a network; and a processor is cooperatively operable with the sensor, and configured to receive the read data from the sensor; and originate real-time map profiles of files and file data, both from the read data from the sensor, as the passively read packets are in motion on the network.
[0005] In an embodiment, the processor can be configured to perform correlation and inference from the read data read by the sensor.
[0006] In another embodiment, the processor can be configured to catalog attributes of the files and the file data, all from the read data in the packets in motion on the network.
[0007] In still another embodiment, the attributes which are cataloged include: file name, file size, time stamp, file hash, block hashes, server ID that contained the file, host ID which contains the file, user ID who sent it, user ID who is receiving it, place file is transferred to, content of the file, where the file data is, who has access to the file data or the file, what device has the file data on it, how the file was transferred, how the file was transformed.
[0008] In another embodiment, the content of the file which is cataloged comprises: keywords, hashes, and file content changes.
[0009] In yet another embodiment, the content of the file can be determined by analyzing the file and the file data as it is flowing by for keywords or hashes in the files in the data.
[0010] In a further embodiment, the processor can be configured to create a user access map associating user identity with the files, file hashes, and databases the user has actually touched.
[0011] In another embodiment, wherein the sensor can be configured to embed a honeytoken into voids inside the file contained in the passively read packets when the file has a file format predetermined to have dead data that can be overwritten, and to use the honeytoken to aid tracking of the file's movement around and outside the network.
[0012] In a still further embodiment, the honeytoken that is embedded in the file can be one of a main hash of the entire file, and a block hash of an individual block within the file. In still another embodiment, a honeytoken of both kinds (main hash of the entire file, and block hash of individual block within the file) can be provided and embedded in the file.
[0013] In another embodiment, the processor further examines the read data from the sensor for the files and the file data, when the read data is, for example, one or more of a conversation between users, a page being downloaded, an e-mail attachment, a file download, a file repository access, and a file transfer via the network. Optionally, the processor skips examining the read data from the sensor for the files and file data when the read data is not one of the foregoing.
[0014] In still another embodiment, the file repository access can be a download, an ftp transfer, a file share access, or an NFS access. Optionally, the file repository access can be extensions and variations of the foregoing.
[0015] A further embodiment provides that the processor is further configured to extract metadata from the read data in the passively read packets to generate passively discovered metadata, as the packets are in motion on the network, the read data including: the main hash of the entire file, the block hash of individual blocks within the file, the directory listing of files with file names, dates, time stamps, size, and file owners; the hash being a cryptographic hash unique to the file; store the passively discovered metadata, attributes of the files, and the file data, in a relational database; and store the passively discovered metadata in a data map of passively discovered metadata.
[0016] Another embodiment provides that the relational database is based around the file itself and indicates where the file has been transferred and who transferred it.
[0017] A still further embodiment provides that the relational database can be implemented as a postprocessor to the sensor.
[0018] In still another embodiment, the processor is further configured to infer a user role from who is using the file and the file data and how the user is transferring or accessing the file and the file data; and detect when the user is performing an inappropriate usage from the inferred user role and the read data from the sensor.
[0019] In another embodiment, the processor is further configured to report on how a content of the file has changed, the changes including location reflected in the file data, ownership reflected in the file data, changes in the file data itself, and changes in the file itself.
[0020] Yet another embodiment provides a method for any or all of the foregoing, and/or a combination of the foregoing.
[0021] A still further embodiment provides a computer-readable storage medium comprising computer-executable instructions for performing any or all of the foregoing, and/or a combination of the foregoing.
[0022] In a still further embodiment, there is a system, a method, and/or a computer readable medium that provides for (A) a sensor and (B) a processor.
[0023] (A) The sensor is configured to:
-
- [0024] (1) passively read data in packets as the packets are in motion on a network;
- [0025] (2) embed a honeytoken into voids inside files contained in the passively read packets when the file has a file format predetermined to have dead data that can be overwritten, and to use the honeytoken to aid tracking of the file's movement around and outside the network, the honeytoken can be a main hash of the entire file and/or a block hash of one or more individual blocks within the file.
[0026] (B) The processor is configured to:
-
- [0027] (1) receive the read data from the sensor;
- [0028] (2) identify files and file data in the data read in the passively read packets as the passively read packets are in motion on the network, the files and the file data including conversations between users, pages being downloaded, e-mail attachments, file downloads, file repository accesses (e.g., downloads, ftp, file share, NFS), and file transfers via the network;
- [0029] (3) generate real-time map profiles of the files, systems, users and the file data observed as the files and file data in the data read in the passively read packets;
- [0030] (4) catalog attributes of the files and the file data, including direct file data information (e.g., file name, file size, time stamp, file hash, block hashes, server ID that contained the file; host ID which contains the file, user ID who sent it, user ID who is receiving it, place file is transferred to, content of the file (e.g., keywords or hashes, file content changes), where the data is, who has access to the data or file, what device has data on it, how the file was transferred, how the file was transformed (e.g., encrypted)), all observed from the data in the packets in motion on the network;
- [0031] (i) the content of the file being determined by analyzing the data as it is flowing by for key words or hashes;
- [0032] (5) extract metadata from the data in the passively read packets to generate passively discovered metadata, as the packets are in motion on the network, including: the main hash of the entire file, the block hash of individual blocks within the file (e.g., paragraph hash of WORD files, data block hash of ACROBAT or OFFICE files), the directory listing of files with file names, dates, time stamps, size, and file owners; the hash being a cryptographic hash unique to the file; and store the metadata and direct information in a relational database;
- [0033] (6) create, from the observed files and the file data, a user access map associating user identity with files, file hashes, and databases the user has actually touched;
- [0034] (7) infer, from the observed files and the file data, a user role from who is using the data and how they are transferring or accessing it, and detecting when a user is performing an inappropriate usage from the inferred user role and the data read in the packet as it is in motion on the network; and/or
- [0035] (8) report, from the observed files and the file data, on how a content of the file has changed, the changes including location of data, ownership of data, changes in the data itself.
[0036] (C) The relational database that stores the passively discovered metadata is based around the file itself and thereby indicates an observation from passively read packets as to where the file has been transferred and who transferred it, the relational database being implemented as a postprocessor to the sensor.
[0037] Further, the purpose of the foregoing abstract is to enable the U.S. Patent and Trademark Office and the public generally, and especially the scientists, engineers and practitioners in the art who are not familiar with patent or legal terms or phraseology, to determine quickly from a cursory inspection the nature and essence of the technical disclosure of the application. The abstract is neither intended to define the invention of the application, which is measured by the claims, nor is it intended to be limiting as to the scope of the invention in any way.
Brief Description of the Drawings
[0038] The accompanying figures, where like reference numerals refer to identical or functionally similar elements and which together with the detailed description below are incorporated in and form part of the specification, serve to further illustrate various exemplary embodiments and to explain various principles and advantages in accordance with the present invention.
[0039] FIG. 1 is a diagram illustrating a simplified and representative environment associated with real time data awareness;
[0040] FIG. 2 is a block diagram illustrating a system used for real time data awareness;
[0041] FIG. 3 is a sequence diagram illustrating some examples of real time data awareness processing;
[0042] FIG. 4 is a continuation of the sequence diagram of FIG. 3 ;
[0043] FIG. 5 is a diagram illustrating layers used for packet processing;
[0044] FIG. 6 is a block diagram illustrating portions of an exemplary computer system;
[0045] FIG. 7 is a flow chart illustrating a process for real time data awareness; and
[0046] FIG. 8 is a diagram illustrating a prior art data leak prevention system.
Detailed Description
[0047] In overview, the present disclosure concerns security of communication networks, often referred to as packet switching networks, which support communication between a source and a destination. Packets on such communication networks may carry information which reveals data (for example, files) stored on the network. More particularly, various inventive concepts and principles are embodied in systems, devices, and methods therein for analyzing packets on a communication network to passively determine attributes of data (such as location) in the computer network, so as to provide real time data awareness.
[0048] The instant disclosure is provided to further explain in an enabling fashion the best modes of performing one or more embodiments of the present invention. The disclosure is further offered to enhance an understanding and appreciation for the inventive principles and advantages thereof, rather than to limit in any manner the invention. The invention is defined solely by the appended claims including any amendments made during the pendency of this application and all equivalents of those claims as issued.
[0049] Relational terms such as first and second, and the like, if any, are used herein solely to distinguish one from another entity, item, or action without necessarily requiring or implying any actual such relationship or order between such entities, items or actions. Some embodiments may include a plurality of processes or steps, which can be performed in any order, unless expressly and necessarily limited to a particular order; i.e., processes or steps that are not so limited may be performed in any order.
[0050] Much of the inventive functionality and many of the inventive principles when implemented, are best supported with or in software or integrated circuits (ICs), such as a digital signal processor and software therefore, and/or application specific ICs. It is expected that one of ordinary skill, notwithstanding possibly significant effort and many design choices motivated by, for example, available time, current technology, and economic considerations, when guided by the concepts and principles disclosed herein will be readily capable of generating such software instructions or ICs with minimal experimentation. Therefore, in the interest of brevity and minimization of any risk of obscuring the principles and concepts according to the present invention, further discussion of such software and ICs, if any, will be limited to the essentials with respect to the principles and concepts used by the exemplary embodiments.
[0051] Real time data awareness (RDA) came from looking at data leak prevention (DLP) systems and finding them wanting. Most DLP systems expect the company to know where all of the company's data is. Most security technology expects the user to know what the network looks like, what devices are plugged in, and how they are configured.
[0052] Conventional DLP technology expects the company to know where all of its data is. We can show that people have no idea where their data is. The data is not in static locations on the network—it is usually in motion. For example, the data might be on the laptop that walks out the door every day. The way data is typically shared between co-workers is not through a file server, but rather through e-mail; occasionally a file share is used to share data. In practice, a data transfer is not typically done via a file server.
[0053] It was realized that, if a system had a way to passively analyze the network traffic and look at the data in motion on the network, the system could start cataloging the attributes of the data as it revealed itself without having to previously know anything about the data.
[0054] Verizon's “Data Breach Investigations Report” is an excellent source of empirical data about computer incidents which were handled for customers: how they hacked in, what tools they used, how hard it was, what they got out, and how they were detected. Eighty percent of the time, people do not know what is being hacked: the systems involved, the users and what they have access to, or the data which is hacked. The data problem is the biggest problem of them all. People have no idea where their data is on the network or devices.
[0055] In a conventional DLP, the user tells it where the data is, and the DLP does a “registry” process where it hashes the documents where it has been told to build up a map of the data which it knows about. Then it watches for that known data to go past the devices which are sniffing. The foundational assumption for a DLP is that a user has identified where the data is, so that the DLP can crawl the data. In a conventional DLP, represented by FIG. 8 , a DLP 811 is told where the data is. In this example, the DLP is told that the data is on a file server 801. The DLP 811 crawls the file server 801 to do data registration, e.g., by inserting file hashes into files on the file server 801. Then, the DLP can monitor and observe, for example, for hashes in e-mails. The DLP will solve the problem of securing data only so long as somebody keeps telling the DLP where the data is, so that the DLP is aware of the data before it is observed in a packet. If a user has not identified a location with data, the DLP will be unaware of that data moving around.
[0056] These and other problems in network data security can be addressed by various embodiments of real time data awareness discussed herein.
[0057] Further in accordance with exemplary embodiments, real time data awareness can passively analyze network traffic and look for data. In contrast to a conventional DLP, the RDA system or method assumes that the user may have no idea where the data is, and the data will reveal itself as it moves without the system being aware of the data in advance of the data being in motion.
[0058] Such a system or method can observe conversations between users, pages being downloaded, e-mail attachments, downloads, and the like; and can associate attributes with the data such as file name, file size, who sent it, who is receiving it (provided from a login, source/destination IP address, actual user (as disclosed in Ser. No. 12/149,196, “Real Time User Awareness for a Computer Network”, hereby expressly incorporated by reference) or similar), content of the file (by analyzing the data stream as it is flowing by for key words or hashes and looking for snippets of files showing up in other files), even reporting on how a file's content changes. Such a system or method can see all of these things by analyzing network traffic when it is in motion, on the wire, as the data reveals itself without being actively assessed before being in motion.
[0059] The approach can include analyzing the network environment, building a catalog of where the company's data is and who has access to it, and/or looking for change in real time. Changes can include, for example, location of data, ownership of data, and changes in data itself Once the system has the information provided by RDA (discussed herein), it can build a data leak prevention system because it has an idea of where the data actually is.
[0060] The catalogued data can include a user access map, which associates user identity with data (files and databases) that they have actually touched.
[0061] This information can be gathered from user actions such as e-mail, database access, file repository accesses (ftp, file share, NFS and the like), file transfers via the web, etc. Various embodiments propose one or more of the following:
-
- [0062] a catalog of where my data is (what devices have data on them that I am interested in)
- [0063] to know the metadata (data about the data)
- [0064] to know who has had access to the files
- [0065] to know who is moving the files
- [0066] to be able to extract metadata
- [0067] to identify changes to a file, e.g., essentially hashing the file to generate a cryptographic hash which is unique to that file, and then one can look for the hash for that file in other places.
[0068] In one analogy, DLP is like active sonar where pings are sent out; in contrast, this system is like passive sonar in which the targets in the environment tell the system about themselves by the noise they make. Conventional systems in this area are all like active sonar, sending out pings. They do not work very well.
[0069] In another analogy, consider that an astronomer's job is almost entirely passive—the astronomer waits to make observations, and gradually builds up a picture of the universe based on data which is merely observed. The astronomer then infers things about the remote entities based on the data.
[0070] As with the above analogies, the present system can wait for the direct action of a remote, possibly unknown entity in the network to reveal itself at the detector (e.g., sensor), and from the passively revealed information the system can generate and build up a picture about what was revealed. Then the system can start inferring things about the files based on the data, e.g., file server, directories thereon, files in the directory, percent of files which are archived because nobody touches them anymore, the active data set of the enterprise.
[0071] Moreover, in IPV6, active scanning (as with conventional DLP systems) will not work as a practical matter. The smallest network in IPV6 will have a 32 bit address space. It can take days to scan a 32 bit address space because it is so massive. In IPV6, the address space is several billion times larger than IPV4. There is a fundamental issue throughout networking of figuring out what the system has and how it is configured. Typically before IPV6, figuring out what the system has and how it is configured is done by people specifying how things are set up, or by scanning, or by observing passively. Basically, after IPV6 is common, there is no practical way to scan the entire system. After IPV6 is common, it is not unreasonable for each individual in a company to have about 24 million IP addresses. 2128 addresses is a staggeringly large number.
[0072] The passive approach detailed herein came about from the realization that focuses on real-time response and capabilities. One thing that active methods do not provide is real time response—the ability for a system to see what is going on right now in order to change itself.
[0073] The idea herein is to passively analyze the network traffic and use the passively revealed information to generate an initial profile and keep it current by observing what actually happens. Passive monitors such as protocol analyzers, sniffers, etc. do not take the next step of generating profiles. This system can generate real-time profiles of systems, users, and data.
[0074] The data being monitored includes the files themselves, or database transactions. Consider, for example, that a user has an SMTP session to transfer a file, which results (as is well understood) in packets containing the SMTP command protocol, the e-mail itself, and the file attachment. The system is interested in the file attachment: (A) it was transferred, (B) the file contents, (C) who sent it and to whom it was sent.
[0075] As another example, consider a user attaching to a file server, which generates a directory listing. The system can catalog the directory listing of files which exist on the file server.
[0076] In comparison to an intrusion detection/prevention system (IDS/IPS), the IDS/IPS has no clue about files but can see protocols, ports, and clients. The IDS/IPS is primarily interested in the configuration of devices on the network, from which can be inferred vulnerabilities of the devices. In comparison to SNORT™ packet sniffing software, SNORT™ is purely an in-line device that looks at traffic and looks for attacks.
[0077] A difference over the conventional DLP is that the system described herein is figuring out where the data is, as the data reveals itself when in motion. The system observes the traffic as it is in motion on the network, instead of trying to go out and find it actively.
[0078] Referring now to FIG. 1 , a diagram illustrating a simplified and representative environment associated with real time data awareness will be discussed and described. FIG. 1 illustrates a file server 101 storing a file 105 therein, and having a directory 103 listing the file 105 and many other files thereon, in accordance with known methods. Also illustrated is a user system 109, a sensor 111, a web server 113, a mail server 115, a network A 107, a network B 117, and a recipient in China 119. The sensor is deployed in conventional fashion to monitor packets which are in motion on the network, such as between the file server 101 and the user system 109, web server 113, and mail server 115.
[0079] Packets are sent between source and destination, for example, when the file 105 is retrieved by the user system 109 which results in packets being sent between the file server 101 and the user system 109. As another example, packets may be sent between source and destination, e.g., the user system 109, the network A 107, the web server 113, the mail server 115, and network B 117. The sensor 111 is disposed in accordance with known techniques so as to observe packets in motion between source and destination. In this illustration, the sensor 111 is disposed between the file server 101 and the user system 109. The sensor 111 is representative of sensors which can be disposed between the user system 109 and the web server 113, the user system 109 and the mail server 115, between the mail server 115 and the network B 117, and/or between the user system 109 and the network A 107.
[0080] In the illustration, the user system 109 initiates transmissions and requests to the file server 101, the network A 107, the web server 113, the mail server 115, and the network B 117. The packets which are transmitted can be monitored in accordance with well known techniques by a network appliance such as with the sensor 111. Alternatively, the sensor 111 can be provided in-line, or can be incorporated into one or more of the file server 101, the user system 109, the web server 113, or the mail server 115.
[0081] Monitoring data in the packets to see a file is quite different from monitoring for an intrusion using an IDS/IPS. There are two big problems addressed by RDA that an IDS/IPS does not have: (1) RDA typically goes deeper into the traffic streams in order to get the information. In contrast, most of the data in the packets that an IDS/IPS operates on is within the first couple hundred bytes of the application layer. (2) RDA can go through the application layer portion of the packet to get to the actual file itself. Hence, RDA can be a more intensive process. RDA may know more protocols (e.g., file transfer protocols) explicitly and be able to follow them all the way down through the layers in the packet, and then reconstitute the data which could be in any number of formats, e.g.: MIME (multipurpose internet Mail extensions)-encoded, zipped, and/or encrypted. The file data might be in different places in the packets for different protocols. For example, the file data is generally at the lowest level of the protocol, but in an e-mail it is usually MIME-encoded as part of the body of the e-mail. The system might need to know that there is a MIME attachment, base 64 encoded, which must be unwound in to a zip file, which must then unzip, hash, etc. And then, the system can start doing the file analysis.
[0082] Actually being able to, on the fly, identify the contents of the file as it is in motion on the network, and then catalog it, as further discussed herein, is very new. Before this, the bytes were captured and then later attempted to be unwound.
[0083] Referring now to FIG. 2 , a block diagram illustrating a system used for real time data awareness will be discussed and described. FIG. 2 illustrates a packet 201, a source 211, a destination 209, a sensor 203, a processor 205, and a database 207. The packet 201 is transmitted from the source 211 to the destination 209. The packet 201 is representative of numerous packets which can be transmitted between source 211 and destination 209, as will be well understood in the art. The designation “end points” (plural) or “end point” (singular) is used herein specifically to indicate generically the source and/or destination identified in the packet header.
[0084] In order to perform RDA, the sensor 203 may know about a lot of protocols. Advantageously, a correlation backend, such as the illustrated processor 205 and database 207 can be provided. For example, one or more sensors (represented by sensor 203) can talk to a single processor 205, and the single processor 205 can do correlations and make decisions about what to do and inform the rest of the system.
[0085] In order to get to the data, a deep packet inspection can be performed to unpack the packets, and then figure out the file format itself so as to be able to work with the file.
[0086] A supporting database 207, such as a relational database, can be provided. The metadata which is collected can be stored into the database 207 which supports the system.
[0087] In an embodiment, the supporting database 207 can be based around the file itself, where it has been transferred, and who has transferred it being used as keys or indexes. The information stored in the database 207 can include, for example:
-
- [0088] File name, time stamp, size, file hash, subhash. (information about the file itself read directly from the packet traffic)
- [0089] Server ID that contained the file (IP address), host ID (which contains the file), user ID, places file transferred to (information about the packet containing the file, read directly from the packet traffic)
- [0090] Files themselves, the places the files have been, the people that had the files, the processes used to transfer/transform (e.g., encrypt) the file (information inferred about the file)
[0091] Inferred information can include, for example, the user role, inferred from types of data the user transfers/accesses.
[0092] Inferred information can be based on transformations the user performs on the file—should the file be encrypted before transferred? The system can infer malicious behavior from, e.g., an activity that fakes out a DLP such as breaking a single file into smaller pieces.
[0093] As illustrated, the sensor 203 can be on the front end of a back-end which comprises a processor 205 containing a correlation and inference engine, and the database 207. The sensor 203 can spool the packets onto a disk to avoid real-time analysis, if desired.
[0094] Building and managing the maps of the files is difficult. A real-time map of a large network is difficult to manage. Most of the data can be kept in memory of the processor 205, in order to be timely.
[0095] Referring now to FIG. 3 and FIG. 4 , a sequence diagram illustrating some examples of real time data awareness processing will be discussed and described. FIG. 4 is a continuation of FIG. 3 . The sequence diagrams of FIG. 3 and FIG. 4 could be envisioned for use of the example system illustrated in FIG. 1 .
[0096] The following are a few representative example scenarios of data in motion. In the illustration, scenario 1 encompasses stages 1, 1.5, 2 and 2.5; scenario 2 encompasses stages 4, 4.5, 4.6, and 4.7; scenario 3 encompasses stages 6 and 6.5; scenario 4 encompasses stages 8 and 8.5; and scenario 5 encompasses stages 9, 9.5 and 9.6. FIG. 3 and FIG. 4 are simplified, and represent other combinations and sequences of the scenarios as will be appreciated by one of skill in the art.
[0097] Scenario 1
[0098] At stage 1, a logged-in user attaches to a file server 303. The attachment to the file server is performed in accordance with known techniques which include sending a series of packets (summarized by the illustrated arrow, which shows end points) to and from the user system 311 and the file server 303. A sensor 309 passively receives packets transmitted on the network, according to known techniques. The sensor can be located between the end points. From the data in the packets which effectuate the attaching to the file server, at stage 1.5, a sensor 309 sees that there is a file server on this IP address.
[0099] At stage 2, the user system 311 and the file server 303 exchange packets, according to conventional techniques, so that the user system 311 gets a directory listing of what is on a file server 303. Meanwhile, at stage 2.5 the sensor 309 receives the directory listing that lists files with directory listing information. Conventional directory listing information can include names, dates, time stamps (for creation, access and/or modification), file sizes, and perhaps file ownership and/or other information. The directory listing information gives the sensor 309 a picture of the file server 303, specifically, some of the files and structure of files which are on the file server 303.
[0100] The sensor 309 (or its backend processor, as further described herein) can originate a map profile of the files and file data listed in the directory listing, merely by passively observing the packet. It is not necessary for the system to have prior information about the files on the file server 303. It is expected that the directory listing is not a complete list of files on the file server 303. Subsequent directory listings from the file server 303 received by the user system 311 can be used to expand the map profile to include additional files in the subsequent directory listings. The term “originate” is used herein to indicate that the sensor 309 (or its backend) is not previously aware of the existence of the file; hence, an entry indicating the file (or the file's data) does not exist in the sensor 309 (or its backend) and is not provided to the sensor 309 (or its backend) except as passively observed from the packet.
[0101] Scenario 2
[0102] At stage 4, the user drags and drops a file onto the desktop of the user system 311. This generates a file transfer from the file server 303 to the user system 311. The packets which request the file transfer and which actually send the copy of the file can be conventionally known.
[0103] Meanwhile, at stage 4.5, the sensor sees the file name and metadata in the packets which request the file transfer and which actually send the copy of the file from the file server 303 to the user system 311. The packets are passively received by the sensor, as they are transmitted from the file server 303 to the user system 311, or vice versa. The sensor 309 (or its backend, as further described herein) can originate a map profile of the file being transferred, merely by passively observing the packet. It is not necessary for the system to have prior information about the file on the file server 303. If the file is already included in a map profile, then the metadata and information newly detected about the file can be added to the map profile.
[0104] Optionally, at stage 4.6, the sensor 309 (or its backend) can create a file hash (as discussed further herein) from the copy of the file in the packets which were passively received. As the file is transferred, the sensor 309 can hash to provide the total file hash and a paragraph hash inserted into the file, and stored for later reference by the sensor 309.
[0105] At stage 4.7, the sensor 309 (or its backend) can associate the file with the user. The user identity of the user on the user system 311 can be identified, for example, via a log-in identity (if known) and/or IP address, as further discussed herein. The sensor 309 can store an indication in the map profile that the file is associated with the user, and/or can store a user access map associating the user identity with the file and/or the file hash and/or the paragraph hash, and further indicating that the user identity actually touched the file (for example, the user received a copy of the file). Therefore the system has a picture of this individual file.
[0106] Now the sensor 309 can start monitoring the passively received packets for the file in motion. For example, the sensor 309 (or its backend) can perform keyword search, and/or search for honey tokens, and the like.
[0107] Scenario 3
[0108] At stage 6, the user on the user system 311 wants to get a file (which is stored on the user system 311) out to a lot of people. The user system 311 has an IM client; the user drops the file into the IM client and sends it to a friend in Russia (on Network A 301).
[0109] Meanwhile, at stage 6.5, the sensor 309 sees the file in the IM packets which actually send the copy of the file from the file server 303 over the network A 301. The packets are passively received by the sensor, as they transition from the user system 311 to the network A 301, or vice versa. The sensor sees the file transfer, recognizes the hashes (if included in the file) and knows the file, recognizes the user, and identifies who the user sends the file to. The sensor notes the file name, the destination and the destination user name, and the user identification which transferred the file. However, it is not necessary for the system to have prior information about the files on the user system 311. The sensor 309 (or its backend, as further described herein) can originate a map profile of the files and file data included in the IM message, merely by passively observing the packets, even for files which the sensor 309 was not aware of before observing the files in the packets. If the sensor already includes this file and metadata in a map profile, the sensor can expand the profile to include information that the file was transferred by an IM client as well as where the file was transferred.
[0110] Scenario 4
[0111] In Scenario 4, the user wants to e-mail the file to another friend in China. At stage 8, the user drops the file from the user system 311 (as illustrated), or from the file server 303 (not illustrated) onto an e-mail server 305 and the e-mail server 305 will pump it out to the other friend as an e-mail.
[0112] At stage 8.5, the sensor sees the file e-mailed to China, and catalogs: who the file is sent to (destination user ID from e-mail), that the file is sent to China (based on destination country code), sent by whom (e.g., source user ID from e-mail), and the method of transfer (by e-mail).
[0113] The packets are passively received by the sensor 309, as they transition from the user system 311 to the mail server 305. The sensor sees the e-mail with the attached file, recognizes the hashes (if included in the file) and knows the file, recognizes the user, and identifies who the user sends the file to. The sensor notes the file name, the destination and the destination user name, and the user identification which transferred the file. If the sensor 309 does not have prior information about the file, however, the sensor 309 (or its backend, as further described herein) can originate a map profile of the files and file data included in the e-mail, merely by passively observing the packets with the e-mail. If the sensor already includes this file and metadata in a map profile, the sensor can expand the profile to include information that the file was transferred to the mail server 305 as well as where the file was transferred.
[0114] Scenario 5
[0115] In this scenario, the user wants to make file available to lots of friends. At stage 9, the user puts the file on a web server 307 (his personal web page) within the network to which the sensor 309 is attached.
[0116] At stage 9.5, the sensor 309 sees the file transfer, recognizes the hashes and knows the file, and recognizes that the user is sending a copy of the file to the web server 307.
[0117] At stage 9.6, as people come in, sensor can see the file going out from the web server 307. The sensor probably does not know the user ID which is retrieving the file since the file is retrieved from outside the network.
[0118] The packets are passively received by the sensor, as they are transmitted to or from the web server 307. The sensor notes the file name and the user identification which transferred the file to the web server 307. The sensor 309 sees the file transfer from the user system 311 to the web server 307, or from the web server 307 to network B 313, recognizes the hashes (if included in the file) and knows the file, and recognizes the user. It is not necessary for the system to have prior information about the files on the user system 311 or the web server 307. The sensor 309 (or its backend, as further described herein) can originate a map profile of the files and file data transferred to or from the web server 307, merely by passively observing the packets, even for files which the sensor 309 was not aware of before observing the files in the packets. If the sensor already includes this file and metadata in a map profile, the sensor can expand the profile to include information indicating how the file was transferred.
[0119] The above scenarios illustrate that the system can generate a catalog of the file structure and the file itself, where it has moved around the network, etc. All of this information has been collected.
[0120] Now, consider the following example applications of the information which was collected.
[0121] (1) The system can evaluate the ability of the user to have access to the information. Is the file in the wrong directory? For example, is a payroll information file and/or stock ownership file in the wrong directory?
[0122] (2) The system can evaluate who it is being sent to, and appropriateness of channel user is using: Is it an appropriate channel for this data to be distributed over? Is IM appropriate for potentially sensitive information? Is the receiving user appropriate (e.g., inside the network or outside the network)?
[0123] (3) The e-mail server: should the user be e-mailing this file? Is the person in a country (top level domain, e.g., .cn) that is black-listed?
[0124] (4) The web server: should data in this file be put on the web server?
[0125] There can be a data management back end associated with this kind of collection and inference. The combination of the sensor and data management backend can monitor and correlate (and if in-line can block). For example, the system can have a list of events and the hashes for the file, can notice the file in motion from this device, and can track how the file is being fanned out. From this and other data which is collected, the system can start inferring that something is happening.
[0126] Consider another example: Marty creates a file on his desktop and e-mails it to Doug. The system can track that Marty sent the file to Doug, and track who Doug then sends the file to.
[0127] The system is creating something new: profiles about the data itself, as well as the data map for the network, and how the data is being used. Over time, as traffic moves, the map/topology of the network gets better.
[0128] Referring now to FIG. 5 , a diagram illustrating layers used for packet processing will be discussed and described. FIG. 5 is included to summarize layers that are referenced by one or more embodiments in discussing packet processing. The packet processing layers are well understood in the art. The layers include the application layer 507, the transport layer 505, the IP layer 503, and the data link layer 501. Additional layers can be provided and/or merged together by end points, according to known techniques. The packet is formatted to reflect the layers, as is well known. Hence, when the packet is received and passively observed, a deep inspection can be performed based on the packet format and how the endpoints are expected to have formatted the packet. Deep inspection will not be further discussed, but rather, it is assumed that a deep inspection will be provided which can appropriately find a file, file contents, file header, file information (e.g., directory listing), file name, and the like contained in a packet, whether such data is incorporated into a header portion, message body, or data contents of one or more packets.
[0129] Referring now to FIG. 6 , a block diagram illustrating portions of an exemplary computer system will be discussed and described. The computer system 601, sometimes referred to herein as a “system,” may include one or more controllers 605, which can receive signals from a sensor 611 which senses communications from a network 609 in accordance with known techniques, where the communications are being sent to a target (not illustrated). The sensor 611 is representative of one or more sensors which can be deployed in accordance with known techniques. The controller 605 can include a processor 607, a memory 613, an optional display 651, and/or an optional user input device such as a keyboard 653. Additional remote or local storage can include map profiles of files and file data 655 and a catalog of files, file data and file attributes 657. An optional relational database post-processor 659 can be included to assist access to the storage 655, 657.
[0130] The processor 607 may comprise one or more microprocessors and/or one or more digital signal processors. The memory 613 may be coupled to the processor 607 and may comprise a read-only memory (ROM), a random-access memory (RAM), a programmable ROM (PROM), and/or an electrically erasable read-only memory (EEPROM). The memory 613 may include multiple memory locations for storing, among other things, an operating system, data and variables 615 for programs executed by the processor 607; computer programs for causing the processor to operate in connection with various functions such as to receive 617 passively read data from the sensor, originate 619 real-time map profiles of files and file data, perform 621 correlation and inference from the passively read data, catalog 623 attributes of files and file data from passively read data, create 625 a user access map of files, etc. the user was observed as actually touching, causing 627 the sensor to write honey tokens and/or hashes into files in passively read packets, analyze 629 file and file data as it is flowing by for keywords and/or hashes in the files, extract 631 metadata from the data in the passively read packets in motion on the network, infer 633 a user role from the user of the file and the file data, and how the file and file data is transferred/accessed by the user, and detect when there is inappropriate usage, and report 635 how the file content was observed to change; a user access map 637; an inferred user roles database 639; and a database 641 for other information used by the processor 607. The computer programs may be stored, for example, in ROM or PROM and may direct the processor 607 in controlling the operation of the computer system 601. Much of the interconnection and relationship between the overall memory 613, the processor 607, the sensor 611, the network 609 the display 651, the keyboard 653, and remote/local databases 655, 657 is technology known to one of the skill in the art and will not be discussed herein.
[0131] The processor 607 may be programmed to receive 617 passively read data from the sensor 611. In the illustrated example, packets are detected by the sensor 611 connected to the computer system 601 and information in the detected packets are supplied to the computer system 601 in accordance with known techniques. Various techniques can be used to passively read data at the sensor while the data is in motion on the network, for example, packet sniffing. Various known sensor devices can be programmed or otherwise configured to operate as the sniffer 611 discussed herein. The sensor 611 can be electrically or wirelessly connected to the processor 607 so as to be in communication therewith, in accordance with conventional techniques. The sensor 611 and processor 607 which are connected together can mutually communicate with each other, or the sensor 611 can be programmed in transmit only mode to the processor 607.
[0132] The processor 607 can be programmed to originate real-time map profiles of files and file data from the data passively read by the sensor 611, as the passively read packets are in motion on the network. A map profile about the files is intended to provide a topographical map of where the files are located. A map profile can include, for example, directory listings of files and file data, locations where files originated from and were transferred to, meta data about the files (e.g., file type, creation date, modified date, created by, owned by, etc.), an indication of the user(s) associated with the file, an indication that the file was transferred or accessed, how it was transferred/accessed, and by/to whom it was transferred/accessed, and possible other information about the file. Because the map profiles are originated at the processor from passively read data in motion on the network, the map profiles can be continually revised and refined as new information is observed from passively read packets in motion on the network. For example, as new files are discovered from passively read packets, they can be added to the real-time map.
[0133] The processor 607 may be programmed to perform 621 correlation and inference from the passively read data which was received from the sensor 611. The following are examples of information which can be correlated from the passively read data: file information stored in the catalog of files, a list of events can be constructed for the file to indicate how the file is transferred and/or accessed, a list of users of the file, a list of source(s) of the file and destination(s) of the file, a list of hashes for the file (block hash and/or file hash), a list of honeytokens for the file. The following can be inferred from the passively read data: the places the files are permitted to be can be inferred because they are related to places the files have been, the users that are permitted to access the files can be inferred from the roles of people that had the files, the processes properly used to transfer/transform (e.g., encrypt) the file can be inferred from past processes used to transfer/transform the file, the user role can be inferred from types of data the user transfers/accesses. For example, if the file was previously encrypted and/or sent as a single file, the inference is that it should be encrypted before being transferred, and that the file should not be broken into small blocks before being transferred. The system can infer malicious behavior from, e.g., an activity that fakes out a DLP such as breaking a single file into smaller pieces.
[0134] The processor 607 may be programmed to catalog 623 attributes of files and file data from passively read data, which is read by the sensor 611 from packets as they are in motion on the network 609. Attributes of the files can be collected from, e.g., file headers in the passively read data, file directories in the passively read data, database file formats in the passively read data, hosts (as the source of the file) listed in the packet headers, hosts (as the destination of the file) listed in the packet headers, and the like. File data can be collected when it appears in the packets as they are in motion on the network 609. The term “file data” is used herein to indicate data that is inside the file itself, in comparison to a file header.
[0135] The processor 607 may be programmed to create 625 a user access map of files, associating the user identifier with files, file hashes and/or databases which the user was observed (from the passively read packets) as actually touching. The user access map 637 can correlate information about the user identifier and the files, file hashes and/or databases which the user sent or received. The user identifier can be unique to the individual user and can correlate a single user with one or more handles, i.e., unique mail addresses or contact numbers, which he or she uses. Available techniques can be used to determine and generate a user identifier.
[0136] The processor 607 may be programmed to analyze 629 file and file data as it is flowing by for keywords and/or hashes in the files. Changes to a file can be identified in the following way, for example: decompose the file format and then hash on blocks of the file. For example, hash each paragraph in a WORD file, and then look for those paragraph hashes to occur in other files, and look for changes in that file (based on same file name having some different paragraph hashes). Also, there can be a main file hash (“main file hash” being defined as a hash in which the entire file is hashed) and a block hash (“block hash” being defined as a hash in which a paragraph or data block of the file is hashed). Hashing is known technology. A block hash is useful for determining which block changes, or identifying a block that came from somewhere else.
[0137] How static the hashes are is dependent on the file type, e.g., ACROBAT files will tend to be relatively static, WORD documents are edited and tend to change. Note, because the sensor 511 can operate in-line, it can influence the content of files. Also, the voids inside of the files (i.e., stretches of garbage data), can be written as a file traverses the device with a tracker—the file can be modified as it goes by. This is different than what has been done before with tagging because it is done in real time, e.g., this is a WORD document, let's put in a tag and see where the tag goes. One of the in-line sensors 611, e.g., for RDA technology, can be used to do this. As data comes in to the IPS or IDS, the hash can be inserted. The term used in security industry is embedding a “honeytoken”. The system can embed the honeytoken in the file and look for the honey token in places where it is not supposed to be.
[0138] Hence, the processor 607 may be programmed to cause 627 the sensor to write honey tokens and/or hashes into files in passively read packets. Certain formats are known to have dead data that can be overwritten: Microsoft WORD documents, .pdf documents, Microsoft OFFICE documents. The files that are picked to be tagged can have one of these formats which is predetermined to have dead data that can be overwritten. The sensor can be instructed by the processor 607 to embed a honeytoken into the voids inside files contained in the passively read packets as they are in motion on the network. The honeytoken can then be observed by one or more sensors 611 so the honeytoken can be used to aid tracking of the file's movement around and outside the network.
[0139] The processor 607 may be programmed to extract 631 metadata from the data in the passively read packets in motion on the network. The metadata can include, for example, one or more of the following: a main hash of the entire file, a block hash of individual blocks within the file (e.g., paragraph hash of WORD files, data block hash of ACROBAT or OFFICE files), a directory listing of files with file names, dates, time stamps, size, and file owners. The metadata can be stored, for example by the relational database post processor 659, in a relational database.
[0140] The processor 607 may be programmed to infer 633 a user role from the user of the file and the file data, and how the file and file data is transferred/accessed by the user, and detect when there is inappropriate usage by the user from the inferred user role and the read data from the sensor. The inferred user roles can be stored in the inferred user roles database 639.
[0141] The system can start inferring roles from who is using the data and how they are using it. Consider, for example, that Marty interacts with the main version of the control server, the mail server, and two other servers around the enterprise. The system can note when Marty is interacting with data he has never interacted with before. Or, a particular user's job is XYZ and he should access one type of data, but he is accessing other types of data. The system can infer roles by who is accessing the data, and can infer when a user exceeds permissions. E.g., the legal team should interact with legal type of data, but one person in the legal team is interacting with payroll-type data.
[0142] The processor 607 may be programmed to report 635 that the file content was observed to change and/or how the file content was observed to change. The changes which were observed can include, for example, location of the file (source and/or destination), ownership of the file, the file data about the file itself, and/or the file itself. The change can be noted by comparing the file data and file attributes from current passively read data as current information, and comparing the current information about the file with previously observed information about the file, such as can be stored in the map profiles 655 of files and file data and/or catalog 657 of files, file data, and file attributes. The changes can be used to alert, notify, report, and/or the like, or can be used as an event which can trigger a policy rule for the file.
[0143] The processor 607 may include store for the user access map 637 and/or the inferred user roles database 639 (each discussed further herein). As an alternative to the illustrated storage in memory 613, one or both the user access map 637 and the inferred user roles database 639 can be stored in an accessible storage (not illustrated) and/or a local or remote database, and/or can be stored in a distributed manner on plural local/remote computer accessible storage media.
[0144] It should be understood that various logical groupings of functions are described herein. Different realizations may omit one or more of these logical groupings. Likewise, in various realizations, functions may be grouped differently, combined, or augmented. Furthermore, functions including those identified as optional can be omitted from various realizations. Similarly, the present description may describe or suggest a database or collection of data and information. One or more embodiments can provide that the database or collection of data and information can be distributed, combined, or augmented, or provided locally (as illustrated) and/or remotely (not illustrated).
[0145] Referring now to FIG. 7 , a flow chart illustrating a process for real time data awareness will be discussed and described. These procedure for real time data awareness 701 can advantageously be implemented on, for example, a processor of a controller and the procedure for sense data 721 can advantageously be implemented on, for example, a processor of a sensor, both described in connection with FIG. 6 or other apparatuses appropriately arranged. The procedures for real time data awareness 701 and for sense data 721 can be run simultaneously in parallel, so that data can be passively read in real time continuously while packets are in motion, whilst the passively read data is handled.
[0146] The sense data procedure 721 can be implemented on a sensor, or similar network appliance, and is described herein first. The sense data procedure 721 can include a loop that will passively read 723 the data, and send 725 the data which was read. More particularly, the procedure 721 can passively read 723 the data in packets as they are in motion on the network between a source and a destination of the packets. Techniques are known for passively reading data in packets as they are in motion on the network. Then, the procedure 721 can send 725 the data which was passively read for further post-sensor analysis. Any of several conventional techniques can be used for sending data to a post-sensor processor.
[0147] The real time data awareness procedure 701 can include looping to receive 703 passively read data from a sensor, checking 703 whether the passively read data includes files and/or file data, and if so, handling the files and/or file data 707, 709, 711, 713. The real time data awareness procedure 701 can continuously loop so as to continuously be ready to receive and handle files and/or file data from a sensor.
[0148] The real time data awareness procedure can include receiving 703 passively read data, for example, from one or more sensors. The data received from the sensor can be in a format which is predetermined by the sensor, comprising data detected from the packets and/or a summary of data from the packets.
[0149] The real time data awareness procedure can include checking 703 whether the passively read data includes files and/or file data. For example, the procedure 701 can check for one or more of the following types of file transfer methods:
-
- [0150] conversations between users such as e-mail, instant message, SMTP (simple mail transfer protocol), LAN messenger, and variations and evolutions thereof, when a file is embedded in or attached to the conversation
- [0151] pages being downloaded, when the page includes a file
- [0152] e-mail attachments
- [0153] file downloads
- [0154] file repository accesses
- [0155] file transfers such as ftp (file transfer protocol), NFS (network file system), tftp (trivial file transfer protocool), http (hypertext transfer protocol), Bittorrent, Kermit, and other file transfer protocols, variants thereof, and evolutions thereof.
[0156] The location and format of the file can differ depending on the type of file transfer method. Accordingly, the determination of whether the passively read data includes files and/or file data can be sensitive to the type of file transfer methods, so as to identify the file depending on the type of file transfer method. For example, a file attached to an e-mail attachment is in a different location and format than a file being transferred via ftp or NFS. Each of these file transfer methods is well defined in respective industry standard or proprietary specifications.
[0157] When the passively read data includes files and/or file data, the real time data awareness procedure 701 can handle the files and/or file data, for example by originating 707 real time map profiles; performing 709 correlation and inference; cataloging 711 files/file attributes; and creating 713 a user map. Each of these is discussed further herein, to the extent that it has not been discussed in detail previously.
[0158] The real time data awareness procedure 701 can include originating 707 real time map profiles. The real time map profile can map locations of files, to provide a topography map of locations of files on the network. The real time map profile can be developed from information about the file or files, obtained from the passively read packets, such as file name, time stamp, file size, file hash, subhash, server ID that contained the file (IP address), host ID (which contains the file), user ID (indicating user that had the file), destination ID (the place to which the file was transferred), and file directories.
[0159] The real time data awareness procedure 701 can include performing 709 correlation and inference. Correlation and inference have been discussed in more detail above.
[0160] The real time data awareness procedure 701 can include cataloging 711 files/file attributes. Attributes which can be cataloged and associated with a particular file include direct file data information (e.g., file name, file size, time stamp, file hash, block hashes, server ID that contained the file; host ID which contains the file, user ID who sent it, user ID who is receiving it, place file is transferred to, content of the file (e.g., keywords or hashes, file content changes), where the data is, who has access to the data or file, what device has data on it, how the file was transferred, how the file was transformed (e.g., encrypted)), all of the direct file data information being observed from the data in the packets in motion on the network, obtained from the sensor.
[0161] The real time data awareness procedure 701 can include creating 713 a user access map associating user identity with the files, file hashes, and databases the user has actually touched by transferring or receiving. This has been discussed in more detail above.
[0162] Moreover, embodiments can include a computer system configured with the foregoing tangible computer-readable medium and/or method(s); and/or a communication network comprising at least one computer system configured with the foregoing computer-readable medium and/or method(s).
[0163] It should be noted that the communication networks of interest include those that transmit information in packets in accordance with packet processing protocols, for example, by packet switching networks that transmit data, where the packet(s) are generated by a source, the packets are transmitted, and the packets are routed over network infrastructure devices, which are sent to a destination specified in the packet(s). Such networks include, by way of example, the Internet, intranets, local area networks (LAN), wireless LANs (WLAN), wide area networks (WAN), and others. Protocols supporting communication networks that utilize packets include one or more of various networking protocols having any link layers that support the TCP transport layer, or any application that rides over the transport layer, for example, IPV4 or IPV6, and other wireless application protocols or wireline application protocols and/or other protocol structures, and variants and evolutions thereof. Such networks can provide wireless communications capability and/or utilize wireline connections such as cable and/or a connector, or similar.
[0164] The designation “file” is defined herein as a block of arbitrary information, or resource for storing information, which is readable by a computer program and stored in non-transitory electronic memory; a file remains available for programs to use after the current program has finished. Typically, a file has a file name and a path which uniquely locates the file within its storage. Plural files are typically organized within a file directory. The format of a file can be further pre-defined by a file system such as UNIX or WINDOWS or other file systems to include a file header, file data (which is the content of the file), meta data, and/or attributes. The “attributes” of a file can specify operations that can be performed on the file (for example, read, write, hidden, archive, and the like) and/or file name, file size, time stamp, and the like. The designation “file data” is defined herein to mean the content of the file (distinct from the file header, file meta data, and file attributes).
[0165] Furthermore, the designation “intrusion detection/prevention system” (and IDS/IPS) is used herein to denote a device or software that passively or actively analyzes network traffic for intrusion. Examples of such devices or software are sometimes referred to as “intrusion detection system” (IDS), “intrusion prevention system” (IPS), “network intrusion detection system” (NIDS), “network intrusion protection system” (NIPS″), and the like, and variants or evolutions thereof. An intrusion detection/prevention system may be host-based, or may monitor traffic to a target system using, for example, sensors, anywhere between the target system and the intruder, typically after a final router or firewall.
[0166] The designation “in motion on a network” or “in motion on the network” is defined herein to refer to a packet, data in a packet, or a file in a packet that has been transmitted from the source host of the packet and but is observed, read or monitored before that packet has been received at the destination host of the packet.
[0167] The designation “packet” is defined herein as a unit of data formatted in accordance with a packet processing protocol such as IPV4 or IPV6, carried by a packet switching network and includes a header and data, and is sometimes referred to as an IP packet or a datagram.
[0168] A “passively read” packet is defined herein as a packet which was not elicited or initiated by the processor on which the packet is read. To “passively read” data or a packet is defined herein as to receive a packet which was not elicited or initiated by a prior transmission from the processor on which the packet is read.
[0169] The term “real-time” or “real time” is defined herein to mean that the analyzed (input) and/or generated (output) data (whether they are grouped together in large segments or processed individually) can be processed (or generated) continuously in the time it takes to input and/or output the same set of data independent of the processing delay.
[0170] The designation “sensor” is defined herein expressly to indicate a device including a processor whose primary functions are to detect and reports network traffic on the network to which it is attached and to detect malicious activity on the network, typically by examining the header and data portions of packets to look for patterns and behavior that suggest malicious activity, are sometimes referred to as a security appliance or sensor appliance, and can be standalone or incorporate one or more of: a firewall, an anti-virus scanning device, a content filtering device, an intrusion detection appliance, an intrusion prevention appliance, a penetration testing appliance, a vulnerability assessment appliance, and the like. The sensor can operate inline (installed as an appliance within the network, so that traffic flows through it); as a tap (network traffic between the clients and servers is copied by the tap to the sensor which is essentially invisible to the other network entities); or in a span (traffic is spanned off either the server side or the client side of a router or switch, copying both the incoming and outgoing traffic from any of the ports). The sensor can collect information on the packets which it sees, and can be configured to transmit the collected packet information for individual packets, summaries of packets, reports, and/or as detected events. Examples of such sensors include a Sourcefire™ sensor, a McAfee™ sensor, and the like.
[0171] This disclosure is intended to explain how to fashion and use various embodiments in accordance with the invention rather than to limit the true, intended, and fair scope and spirit thereof. The invention is defined solely by the appended claims, as they may be amended during the pendency of this application for patent, and all equivalents thereof. The foregoing description is not intended to be exhaustive or to limit the invention to the precise form disclosed. Modifications or variations are possible in light of the above teachings. The embodiment(s) was chosen and described to provide the best illustration of the principles of the invention and its practical application, and to enable one of ordinary skill in the art to utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated. All such modifications and variations are within the scope of the invention as determined by the appended claims, as may be amended during the pendency of this application for patent, and all equivalents thereof, when interpreted in accordance with the breadth to which they are fairly, legally, and equitably entitled.
Claims
What is claimed is:
1. A system, comprising:
a sensor configured to:
passively read data in packets as the packets are in motion on a network;
a processor, being a hardware processor, cooperatively operable with the sensor, and configured to:
receive the read data from the sensor;
originate real-time map profiles of files and file data, both from the read data from the sensor, as the passively read packets are in motion on the network,
wherein the map profile is a topographical map of locations of the files on the network,
wherein the map profile further designates hosts which contain the files, destinations to where the files were transferred, and file directories of the files on the hosts and destinations;
extract metadata from the read data in the passively read packets to generate passively discovered metadata, as the packets are in motion on the network, the read data including: the main hash of the entire file, the block hash of individual blocks within the file, the directory listing of files with file names, dates, time stamps, size, and file owners; the hash being a cryptographic hash unique to the file;
store the passively discovered metadata, attributes of the files, and the file data, in a relational database; and
store the passively discovered metadata in a data map of passively discovered metadata.
2. The system of claim 1, wherein the processor is further configured to:
perform correlation and inference from the read data read by the sensor.
3. The system of claim 1, wherein the processor is further configured to:
catalog attributes of the files and the file data, all from the read data in the packets in motion on the network.
4. The system of claim 1, wherein the processor is further configured to:
create a user access map associating user identity with the files, file hashes, and databases the user has actually touched.
5. The system of claim 1, wherein the sensor is further configured to embed a honeytoken into voids inside the file contained in the passively read packets when the file has a file format predetermined to have dead data that can be overwritten, and to use the honeytoken to aid tracking of the file's movement around and outside the network.
6. The system of claim 1, wherein the processor further examines the read data from the sensor for the files and the file data, when the read data is a conversation between users, a page being downloaded, an e-mail attachment, a file download, a file repository access, and a file transfer via the network.
7. The system of claim 1, wherein the relational database is based around the file itself and indicates where the file has been transferred and who transferred it.
8. The system of claim 1, the relational database being implemented as a postprocessor to the sensor.
9. The system of claim 1, wherein the processor is further configured to:
infer a user role from who is using the file and the file data and how the user is transferring or accessing the file and the file data; and
detect when the user is performing an inappropriate usage from the inferred user role and the read data from the sensor.
10. The system of claim 1, wherein the processor is further configured to:
report on how a content of the file has changed, the changes including location reflected in the file data, ownership reflected in the file data, changes in the file data itself, and changes in the file itself.
11. The system of claim 3, wherein the attributes which are cataloged include: file name, file size, time stamp, file hash, block hashes, server ID that contained the file, host ID which contains the file, user ID who sent it, user ID who is receiving it, place file is transferred to, content of the file, where the file data is, who has access to the file data or the file, what device has the file data on it, how the file was transferred, how the file was transformed.
12. The system of claim 11, wherein the content of the file which is cataloged comprises: keywords, hashes, and file content changes.
13. The system of claim 11, the content of the file being determined by analyzing the file and the file data as it is flowing by for keywords or hashes in the files in the data.
14. The system of claim 5, wherein the honeytoken that is embedded in the file is one of a main hash of the entire file, and a block hash of an individual block within the file.
15. The system of claim 6, the file repository access being a download, an ftp transfer, a file share access, or an NFS access.
16. A method, comprising:
in a sensor, passively reading data in packets as the packets are in motion on a network;
in a processor, being a hardware processor, receiving the read data from the sensor;
originating real-time map profiles of files and file data from the read data, both from the sensor, as the passively read packets are in motion on the network,
wherein the map profile is a topographical map of locations of the files on the network,
wherein the map profile further designates hosts which contain the files, destinations to where the files were transferred, and file directories of the files on the hosts and destinations;
extracting metadata from the read data in the passively read packets to generate passively discovered metadata, as the packets are in motion on the network, the read data including: the main hash of the entire file, the block hash of individual blocks within the file, the directory listing of files with file names, dates, time stamps, size, and file owners; the hash being a cryptographic hash unique to the file;
storing the passively discovered metadata, attributes of the files, and the file data, in a relational database; and
storing the passively discovered metadata in a data map of passively discovered metadata.
17. The method of claim 16, further comprising:
performing correlation and inference from the data retrieved by the sensor.
18. The method of claim 16, further comprising:
cataloging attributes of the files and the file data, all from the read data in the packets in motion on the network.
19. The method of claim 16, further comprising:
creating a user access map associating user identity with the files, file hashes, and databases the user has actually touched.
20. A non-transitory computer-readable storage medium comprising computer-executable instructions for performing the steps of:
passively reading, from a sensor, data in packets as the packets are in motion on a network;
receiving, in a processor, the read data from the sensor;
originating real-time map profiles of files and file data, both from the read data from the sensor, as the passively read packets are in motion on the network,
wherein the map profile is a topographical map of locations of the files on the network,
wherein the map profile further designates hosts which contain the files, destinations to where the files were transferred, and file directories of the files on the hosts and destinations;
extracting metadata from the read data in the passively read packets to generate passively discovered metadata, as the packets are in motion on the network, the read data including: the main hash of the entire file, the block hash of individual blocks within the file, the directory listing of files with file names, dates, time stamps, size, and file owners; the hash being a cryptographic hash unique to the file;
storing the passively discovered metadata, attributes of the files, and the file data, in a relational database; and
storing the passively discovered metadata in a data map of passively discovered metadata.
21. The non-transitory computer-readable storage medium of claim 20, further comprising:
performing correlation and inference from the read data read by the sensor.
22. The non-transitory computer-readable storage medium of claim 20, further comprising:
cataloging attributes of the files and the file data, all from the read data in the packets in motion on the network.
23. The non-transitory computer-readable storage medium of claim 20, further comprising:
creating a user access map associating user identity with the files, file hashes, and databases the user has actually touched.
Patent Citations (240)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4550436(A) | 1985-10-01 | Freeman | Applicant |
| US4570157(A) | 1986-02-01 | Kodaira | Applicant |
| US4857912(A) | 1989-08-01 | Everett et al. | Applicant |
| US4912748(A) | 1990-03-01 | Horii et al. | Applicant |
| US4985863(A) | 1991-01-01 | Fujisawa et al. | Applicant |
| US5193192(A) | 1993-03-01 | Seberger | Applicant |
| US5222081(A) | 1993-06-01 | Lewis et al. | Applicant |
| US5404488(A) | 1995-04-01 | Kerrigan et al. | Applicant |
| US5430842(A) | 1995-07-01 | Thompson et al. | Applicant |
| US5459841(A) | 1995-10-01 | Flora-Holmquist et al. | Applicant |
| US5495409(A) | 1996-02-01 | Kanno | Applicant |
| US5497463(A) | 1996-03-01 | Stein et al. | Applicant |
| US5604910(A) | 1997-02-01 | Kojima et al. | Applicant |
| US5646997(A) | 1997-07-01 | Barton | Examiner |
| US5666293(A) | 1997-09-01 | Metz et al. | Applicant |
| US5796942(A) | 1998-08-01 | Esbensen | Applicant |
| US5870554(A) | 1999-02-01 | Grossman et al. | Applicant |
| US5881269(A) | 1999-03-01 | Dobbelstein | Applicant |
| US5901307(A) | 1999-05-01 | Potter et al. | Applicant |
| US5917821(A) | 1999-06-01 | Gobuyan et al. | Applicant |
| US5919257(A) | 1999-07-01 | Trostle | Applicant |
| US5963942(A) | 1999-10-01 | Igata | Applicant |
| US5987473(A) | 1999-11-01 | Jorgensen | Applicant |
| US5995963(A) | 1999-11-01 | Nanba et al. | Applicant |
| US5999937(A) | 1999-12-01 | Ellard | Applicant |
| US6002427(A) | 1999-12-01 | Kipust | Applicant |
| US6141686(A) | 2000-10-01 | Jackowski et al. | Applicant |
| US6199181(B1) | 2001-03-01 | Rechef et al. | Applicant |
| US6219786(B1) | 2001-04-01 | Cunningham et al. | Applicant |
| US6240452(B1) | 2001-05-01 | Welch et al. | Examiner |
| US6259805(B1) | 2001-07-01 | Freedman et al. | Applicant |
| US6321338(B1) | 2001-11-01 | Porras et al. | Applicant |
| US6324656(B1) | 2001-11-01 | Gleichauf et al. | Applicant |
| US6334121(B1) | 2001-12-01 | Primeaux et al. | Applicant |
| US6343362(B1) | 2002-01-01 | Ptacek et al. | Applicant |
| US6393474(B1) | 2002-05-01 | Eichert et al. | Applicant |
| US6415321(B1) | 2002-07-01 | Gleichauf et al. | Applicant |
| US6453354(B1) | 2002-09-01 | Jiang et al. | Applicant |
| US6477648(B1) | 2002-11-01 | Schell et al. | Applicant |
| US6487666(B1) | 2002-11-01 | Shanklin et al. | Applicant |
| US6499107(B1) | 2002-12-01 | Gleichauf et al. | Examiner |
| US6539381(B1) | 2003-03-01 | Prasad et al. | Applicant |
| US6546493(B1) | 2003-04-01 | Magdych et al. | Applicant |
| US6587876(B1) | 2003-07-01 | Mahon et al. | Applicant |
| US6590885(B1) | 2003-07-01 | Jorgensen | Applicant |
| US6678734(B1) | 2004-01-01 | Haatainen et al. | Applicant |
| US6678824(B1) | 2004-01-01 | Cannon et al. | Applicant |
| US6684332(B1) | 2004-01-01 | Douglas | Applicant |
| US6711127(B1) | 2004-03-01 | Gorman et al. | Applicant |
| US6754826(B1) | 2004-06-01 | Challenger et al. | Applicant |
| US6766320(B1) | 2004-07-01 | Wang et al. | Applicant |
| US6772196(B1) | 2004-08-01 | Kirsch et al. | Applicant |
| US6789202(B1) | 2004-09-01 | Ko et al. | Applicant |
| US6816973(B1) | 2004-11-01 | Gleichauf et al. | Applicant |
| US6851061(B1) | 2005-02-01 | Holland et al. | Applicant |
| US6957348(B1) | 2005-10-01 | Flowers et al. | Applicant |
| US6983323(B2) | 2006-01-01 | Cantrell et al. | Applicant |
| US6993706(B2) | 2006-01-01 | Cook | Applicant |
| US6999998(B2) | 2006-02-01 | Russell | Applicant |
| US7032114(B1) | 2006-04-01 | Moran | Applicant |
| US7047423(B1) | 2006-05-01 | Maloney et al. | Examiner |
| US7054930(B1) | 2006-05-01 | Cheriton | Applicant |
| US7058821(B1) | 2006-06-01 | Parekh et al. | Applicant |
| US7065657(B1) | 2006-06-01 | Moran | Applicant |
| US7073198(B1) | 2006-07-01 | Flowers et al. | Applicant |
| US7076803(B2) | 2006-07-01 | Bruton et al. | Applicant |
| US7096503(B1) | 2006-08-01 | Magdych et al. | Applicant |
| US7113789(B1) | 2006-09-01 | Boehmke | Applicant |
| US7120635(B2) | 2006-10-01 | Bhide et al. | Examiner |
| US7133916(B2) | 2006-11-01 | Schunemann | Applicant |
| US7134141(B2) | 2006-11-01 | Crosbie et al. | Applicant |
| US7152105(B2) | 2006-12-01 | McClure et al. | Applicant |
| US7174566(B2) | 2007-02-01 | Yadav | Applicant |
| US7181769(B1) | 2007-02-01 | Keanini et al. | Applicant |
| US7231665(B1) | 2007-06-01 | McArdle et al. | Applicant |
| US7243148(B2) | 2007-07-01 | Keir et al. | Applicant |
| US7257630(B2) | 2007-08-01 | Cole et al. | Applicant |
| US7305708(B2) | 2007-12-01 | Norton et al. | Applicant |
| US7310688(B1) | 2007-12-01 | Chin | Applicant |
| US7313695(B2) | 2007-12-01 | Norton et al. | Applicant |
| US7315801(B1) | 2008-01-01 | Dowd et al. | Applicant |
| US7317693(B1) | 2008-01-01 | Roesch et al. | Applicant |
| US7346922(B2) | 2008-03-01 | Miliefsky | Applicant |
| US7350077(B2) | 2008-03-01 | Meier et al. | Applicant |
| US7363656(B2) | 2008-04-01 | Weber et al. | Applicant |
| US7365872(B2) | 2008-04-01 | Lawrence et al. | Applicant |
| US7467202(B2) | 2008-12-01 | Savchuk | Applicant |
| US7467205(B1) | 2008-12-01 | Dempster et al. | Applicant |
| US7467410(B2) | 2008-12-01 | Graham et al. | Applicant |
| US7493388(B2) | 2009-02-01 | Wen et al. | Applicant |
| US7496662(B1) | 2009-02-01 | Roesch et al. | Applicant |
| US7496962(B2) | 2009-02-01 | Roelker et al. | Applicant |
| US7519954(B1) | 2009-04-01 | Beddoe et al. | Applicant |
| US7539681(B2) | 2009-05-01 | Norton et al. | Applicant |
| US7580370(B2) | 2009-08-01 | Boivie et al. | Applicant |
| US7594273(B2) | 2009-09-01 | Keanini et al. | Applicant |
| US7596807(B2) | 2009-09-01 | Ptacek et al. | Applicant |
| US7644275(B2) | 2010-01-01 | Mowers et al. | Applicant |
| US7664845(B2) | 2010-02-01 | Kurtz et al. | Applicant |
| US7673043(B2) | 2010-03-01 | Keir et al. | Applicant |
| US7680929(B1) | 2010-03-01 | Lyon | Applicant |
| US7701945(B2) | 2010-04-01 | Roesch et al. | Applicant |
| US7716742(B1) | 2010-05-01 | Roesch et al. | Applicant |
| US7730011(B1) | 2010-06-01 | Deninger et al. | Applicant |
| US7730175(B1) | 2010-06-01 | Roesch et al. | Applicant |
| US7733803(B2) | 2010-06-01 | Vogel, III et al. | Applicant |
| US7801980(B1) | 2010-09-01 | Roesch et al. | Applicant |
| US7805482(B2) | 2010-09-01 | Schiefer | Examiner |
| US7805762(B2) | 2010-09-01 | Rowland | Applicant |
| US7831522(B1) | 2010-11-01 | Satish et al. | Examiner |
| US7885190(B1) | 2011-02-01 | Roesch et al. | Applicant |
| US7949732(B1) | 2011-05-01 | Roesch et al. | Applicant |
| US8020211(B2) | 2011-09-01 | Keanini et al. | Applicant |
| US8041773(B2) | 2011-10-01 | Abu-Ghazaleh et al. | Applicant |
| US8150039(B2) | 2012-04-01 | de Cesare et al. | Applicant |
| US8272055(B2) | 2012-09-01 | Wease | Applicant |
| US8289882(B2) | 2012-10-01 | Vogel, III et al. | Applicant |
| US8433790(B2) | 2013-04-01 | Polley et al. | Applicant |
| US2001/0027485(A1) | 2001-10-01 | Ogishi et al. | Applicant |
| US2001/0034847(A1) | 2001-10-01 | Gaul, Jr. | Applicant |
| US2002/0035639(A1) | 2002-03-01 | Xu | Applicant |
| US2002/0066034(A1) | 2002-05-01 | Schlossberg | Applicant |
| US2002/0083344(A1) | 2002-06-01 | Vairavan | Applicant |
| US2002/0087716(A1) | 2002-07-01 | Mustafa | Applicant |
| US2002/0112185(A1) | 2002-08-01 | Hodges | Applicant |
| US2002/0123995(A1) | 2002-09-01 | Shibuya | Applicant |
| US2002/0143918(A1) | 2002-10-01 | Soles et al. | Applicant |
| US2002/0144142(A1) | 2002-10-01 | Shohat | Examiner |
| US2002/0165707(A1) | 2002-11-01 | Call | Applicant |
| US2002/0168082(A1) | 2002-11-01 | Razdan | Examiner |
| US2002/0178271(A1) | 2002-11-01 | Graham et al. | Examiner |
| US2003/0009699(A1) | 2003-01-01 | Gupta et al. | Applicant |
| US2003/0014662(A1) | 2003-01-01 | Gupta et al. | Applicant |
| US2003/0046388(A1) | 2003-03-01 | Milliken | Applicant |
| US2003/0065817(A1) | 2003-04-01 | Benchetrit et al. | Applicant |
| US2003/0083847(A1) | 2003-05-01 | Schertz et al. | Applicant |
| US2003/0093517(A1) | 2003-05-01 | Tarquini et al. | Applicant |
| US2003/0101353(A1) | 2003-05-01 | Tarquini et al. | Applicant |
| US2003/0126472(A1) | 2003-07-01 | Banzhof | Applicant |
| US2003/0140250(A1) | 2003-07-01 | Taninaka et al. | Applicant |
| US2003/0195874(A1) | 2003-10-01 | Akaboshi | Applicant |
| US2003/0212779(A1) | 2003-11-01 | Boyter et al. | Applicant |
| US2003/0212910(A1) | 2003-11-01 | Rowland et al. | Applicant |
| US2003/0217283(A1) | 2003-11-01 | Hrastar et al. | Applicant |
| US2003/0229726(A1) | 2003-12-01 | Daseke et al. | Applicant |
| US2004/0010684(A1) | 2004-01-01 | Douglas | Applicant |
| US2004/0015728(A1) | 2004-01-01 | Cole et al. | Applicant |
| US2004/0034773(A1) | 2004-02-01 | Balabine et al. | Applicant |
| US2004/0064726(A1) | 2004-04-01 | Girouard | Applicant |
| US2004/0073800(A1) | 2004-04-01 | Shah et al. | Applicant |
| US2004/0093408(A1) | 2004-05-01 | Hirani et al. | Applicant |
| US2004/0093582(A1) | 2004-05-01 | Segura | Applicant |
| US2004/0098618(A1) | 2004-05-01 | Kim et al. | Applicant |
| US2004/0117478(A1) | 2004-06-01 | Triulzi et al. | Examiner |
| US2004/0123153(A1) | 2004-06-01 | Wright et al. | Applicant |
| US2004/0172234(A1) | 2004-09-01 | Dapp et al. | Applicant |
| US2004/0179477(A1) | 2004-09-01 | Lincoln et al. | Applicant |
| US2004/0193943(A1) | 2004-09-01 | Angelino et al. | Applicant |
| US2004/0210756(A1) | 2004-10-01 | Mowers et al. | Applicant |
| US2004/0218532(A1) | 2004-11-01 | Khirman | Applicant |
| US2004/0221176(A1) | 2004-11-01 | Cole | Applicant |
| US2004/0250032(A1) | 2004-12-01 | Ji et al. | Applicant |
| US2004/0268358(A1) | 2004-12-01 | Darling et al. | Applicant |
| US2005/0005169(A1) | 2005-01-01 | Kelekar | Applicant |
| US2005/0015623(A1) | 2005-01-01 | Williams et al. | Applicant |
| US2005/0044422(A1) | 2005-02-01 | Cantrell et al. | Applicant |
| US2005/0055399(A1) | 2005-03-01 | Savchuk | Examiner |
| US2005/0076066(A1) | 2005-04-01 | Stakutis et al. | Applicant |
| US2005/0108393(A1) | 2005-05-01 | Banerjee et al. | Applicant |
| US2005/0108554(A1) | 2005-05-01 | Rubin et al. | Applicant |
| US2005/0108573(A1) | 2005-05-01 | Bennett et al. | Examiner |
| US2005/0113941(A1) | 2005-05-01 | Ii et al. | Applicant |
| US2005/0114700(A1) | 2005-05-01 | Barrie et al. | Applicant |
| US2005/0160095(A1) | 2005-07-01 | Dick et al. | Applicant |
| US2005/0172019(A1) | 2005-08-01 | Williamson et al. | Applicant |
| US2005/0188079(A1) | 2005-08-01 | Motsinger et al. | Applicant |
| US2005/0223014(A1) | 2005-10-01 | Sharma et al. | Applicant |
| US2005/0229255(A1) | 2005-10-01 | Gula et al. | Applicant |
| US2005/0240604(A1) | 2005-10-01 | Corl, Jr. et al. | Applicant |
| US2005/0251500(A1) | 2005-11-01 | Vahalia et al. | Applicant |
| US2005/0268331(A1) | 2005-12-01 | Le et al. | Applicant |
| US2005/0268332(A1) | 2005-12-01 | Le et al. | Applicant |
| US2005/0273673(A1) | 2005-12-01 | Gassoway | Applicant |
| US2005/0273857(A1) | 2005-12-01 | Freund | Applicant |
| US2006/0174337(A1) | 2006-08-01 | Bernoth | Applicant |
| US2006/0265748(A1) | 2006-11-01 | Potok | Applicant |
| US2006/0288053(A1) | 2006-12-01 | Holt et al. | Applicant |
| US2006/0294588(A1) | 2006-12-01 | Lahann et al. | Applicant |
| US2007/0027913(A1) | 2007-02-01 | Jensen et al. | Applicant |
| US2007/0058631(A1) | 2007-03-01 | Mortier et al. | Applicant |
| US2007/0143852(A1) | 2007-06-01 | Keanini et al. | Applicant |
| US2007/0162463(A1) | 2007-07-01 | Kester et al. | Applicant |
| US2007/0192286(A1) | 2007-08-01 | Norton et al. | Applicant |
| US2007/0192863(A1) | 2007-08-01 | Kapoor et al. | Applicant |
| US2007/0195797(A1) | 2007-08-01 | Patel et al. | Applicant |
| US2007/0271371(A1) | 2007-11-01 | Singh Ahuja | Applicant |
| US2007/0283007(A1) | 2007-12-01 | Keir et al. | Applicant |
| US2007/0283441(A1) | 2007-12-01 | Cole et al. | Applicant |
| US2007/0288579(A1) | 2007-12-01 | Schunemann | Applicant |
| US2008/0115213(A1) | 2008-05-01 | Bhatt et al. | Applicant |
| US2008/0127342(A1) | 2008-05-01 | Roesch et al. | Applicant |
| US2008/0133523(A1) | 2008-06-01 | Norton et al. | Applicant |
| US2008/0168561(A1) | 2008-07-01 | Durie et al. | Applicant |
| US2008/0196102(A1) | 2008-08-01 | Roesch | Applicant |
| US2008/0209518(A1) | 2008-08-01 | Sturges et al. | Applicant |
| US2008/0244741(A1) | 2008-10-01 | Gustafson et al. | Applicant |
| US2008/0263197(A1) | 2008-10-01 | Stephens | Applicant |
| US2008/0276319(A1) | 2008-11-01 | Rittermann | Applicant |
| US2008/0289040(A1) | 2008-11-01 | Ithal | Applicant |
| US2009/0019141(A1) | 2009-01-01 | Bush et al. | Applicant |
| US2009/0028147(A1) | 2009-01-01 | Russell | Applicant |
| US2009/0041020(A1) | 2009-02-01 | Gibbons et al. | Applicant |
| US2009/0055691(A1) | 2009-02-01 | Ouksel et al. | Applicant |
| US2009/0097662(A1) | 2009-04-01 | Olechowski et al. | Applicant |
| US2009/0164517(A1) | 2009-06-01 | Shields et al. | Applicant |
| US2009/0171981(A1) | 2009-07-01 | Shuster | Examiner |
| US2009/0182864(A1) | 2009-07-01 | Khan et al. | Applicant |
| US2009/0259748(A1) | 2009-10-01 | McClure et al. | Applicant |
| US2009/0262659(A1) | 2009-10-01 | Sturges et al. | Applicant |
| US2009/0271696(A1) | 2009-10-01 | Bailor et al. | Applicant |
| US2009/0282481(A1) | 2009-11-01 | Dow et al. | Applicant |
| US2009/0307776(A1) | 2009-12-01 | Curnyn | Applicant |
| US2009/0320138(A1) | 2009-12-01 | Keanini et al. | Applicant |
| US2010/0050260(A1) | 2010-02-01 | Nakakoji et al. | Applicant |
| US2010/0077483(A1) | 2010-03-01 | Stolfo et al. | Examiner |
| US2010/0088767(A1) | 2010-04-01 | Wease | Applicant |
| US2010/0161795(A1) | 2010-06-01 | Deridder et al. | Applicant |
| US2010/0205675(A1) | 2010-08-01 | Vogel, III et al. | Applicant |
| US2010/0257267(A1) | 2010-10-01 | Sohn et al. | Examiner |
| US2010/0268834(A1) | 2010-10-01 | Eidelman et al. | Examiner |
| US2011/0307600(A1) | 2011-12-01 | Polley et al. | Applicant |
| US2011/0314143(A1) | 2011-12-01 | Vogel, III et al. | Applicant |
| EP1548998(A1) | 2005-06-01 | Applicant | |
| EP2166725(A1) | 2010-03-01 | Applicant | |
| GB2432933(A) | 2007-06-01 | Applicant | |
| WO1/37511(A2) | 2001-05-01 | Applicant | |
| WO2004/100011(A1) | 2004-11-01 | Applicant | |
| WO2005/064884(A1) | 2005-07-01 | Applicant | |
| WO2006/025050(A2) | 2006-03-01 | Applicant | |
| WO2009/032925(A1) | 2009-03-01 | Applicant |
Non-Patent Literature (184)
- Final Office Action issued by the U.S. Patent Office on Dec. 9, 2011 in connection with related U.S. Appl. No. 12/688,400.Applicant
- Office Action issued by the U.S. Patent Office on Feb. 2, 2012 in connection with related U.S. Appl. No. 12/688,400.Applicant
- Office Action issued by the U.S. Patent Office on Feb. 15, 2012 in connection with related U.S. Appl. No. 12/820,227.Applicant
- Office Action issued by the U.S. Patent Office on Feb. 15, 2012 in connection with related U.S. Appl. No. 12/230,338.Applicant
- Office Action issued by the U.S. Patent Office on Mar. 5, 2012 in connection with related U.S. Appl. No. 12/968,682.Applicant
- U.S. Appl. No. 10/843,374, filed May 2004, Roesch et al., System and methods for determining characteristics of a network based on flow analysis.Applicant
- U.S. Appl. No. 12/813,859, filed Jun. 2010, Polley et al., System and method for assigning network blocks to sensors.Applicant
- U.S. Appl. No. 12/820,227, filed Jun. 2010, Vogel III et al., System and method for resolving operating system or service identity conflicts.Applicant
- U.S. Appl. No. 12/969,682, filed Dec. 2010, Roesch et al., Systems and methods for determining characteristics of a network and enforcing policy.Applicant
- U.S. Appl. No. 13/086,819, filed Apr. 2011, Olney et al., System and method for near-real time network attack detection, and system and method for unified detection via detection routing.Applicant
- Aho et al., “Efficient String Matching: An Aid to Bibliographic Search,” Communications from the ACM (Jun. 1975), vol. 18, No. 6, pp. 333-340.Applicant
- Tarjan, et al., “Storing a Sparse Table,” Communications of the ACM (Nov. 1979), vol. 2, No. 11, pp. 606-620.Applicant
- V. Jacobson, et al., Request for Comments: 1323, “TCP Extensions for High Performance,” May 1992 (35 pages).Applicant
- J. Howe, “An Environment for “Sniffing” DCE-RPC Traffic,” CITI Technical Report 93-4, Jun. 21, 1993, 12 pages total.Applicant
- T. Ptacek, et al., “Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection”, Jan. 1998, pp. 1-63.Applicant
- R. Gula, “Passive Vulnerability Detection. Techniques to passively find network security vulnerabilities,” Sep. 9, 1999 (5 pp.).Applicant
- N. Chase, “Active Server Pages 3.0 from Scratch” (Dec. 1999), Searching for products section, 13 pp.Applicant
- L. Spitzner, “Passive Fingerprinting,” FOCUS on Intrusion Detection: Passive Fingerprinting (May 3, 2000), pp. 1-4; obtained from: http://www.stillhq.com/pdfdb/000183/data.pdf.Applicant
- N. Brownlee, et al., “Methodology for Passive Analysis of a University Internet Link,” PAM2001 Passive and Active Measurement Workshop, Apr. 2001 (7 pp.).Applicant
- B. Krishnamurthy, “Web Protocols and Practice,” (May 1, 2001), pp. 518-520.Applicant
- G. Lyon, “Remote OS detection via TCP/IP Stack Fingerprinting”(Jun. 30, 2002), pp. 1-12, obtained from: http://web.archive.org/web20021017063625/www.insecure.org/nmap/nmap-fingerprinting-article.html.Applicant
- U. Shankar and V. Paxson, Active Mapping: Resisting NIDS Evasion Without Altering Traffic, Proc. IEEE Symposium on Security and Privacy. May 2003, pp. 1-18.Applicant
- D. Roelker, “HTTP IDS Evasions Revisited” (Aug. 1, 2003) [online] (retrieved on Nov. 9, 2006). Retrieved from the Internet <URL: http://docs.idsresearch.org/http—ids—evasions.pdf>.Applicant
- R.P. Lippmann et al., “Passive Operating System Identification from TCP/IP Packet Headers,” Proceedings Workshop on Data Mining for Computer Security (DMSEC), Nov. 2003 (10 pp.).Applicant
- Norton et al., “Multi-Patten Search Engine Aho-Corasick State Machine” (Mar. 17, 2004), Version 2.0, 36 pp.Applicant
- R. Hiyoshi, “Pràctical Guide to Intrusion Detection System: Snort & Tripwire,” Japan, Apr. 25, 2004, pp. 57-230 (concise English explanation of relevance attached).Applicant
- R. Deraison, et al., “Passive Vulnerability Scanning: Introduction to NeVO,” Tenable Network Security, May 30, 2004, pp. 1-13.Applicant
- Full Band and Matrix Algorithms (Jun. 9, 2004), http://web.archive.org/web20040109154658/http://www.netlib.org/utk/Isi/pcwLSI/text/node150.html.Applicant
- M. Norton, “Optimizing Pattern Matching for Intrusion Detection” (Jul. 4, 2004) [online] (retrieved on Nov. 9, 2006). Retrieved from the Internet <URL: http://docs.idsresearch.org/OptimizingPatternMatchingForIDS.pdf>.Applicant
- R. Deraison, et al., “Nessus Network Auditing,” Sungress Publishing, Jul. 20, 2004, pp. 1-13.Applicant
- Norton et al., “Sourcefire Optimizing Pattern Matching for Intrusion Detection” (Sep. 2004), 14 pp.Applicant
- J. Novak, “Target-Based Fragmentation Reassembly” (Apr. 2005), Revision 2.0, pp. 1-32.Applicant
- S.Siddharth, “Evading NIDS, revisited” (Dec. 12, 2005).Applicant
- “Snort™ Users Manual 2.6.0,” The Snort Project (May 23, 2006), pp. 1-126.Applicant
- “toupper()—convert lowercase character to uppercase,” http://www.mkssoftware.com, printed on Sep. 20, 2008 from http://web.archive.org, archive date Jun. 30, 2006, 2 pp.Applicant
- J. Novak et al., “Target-Based TCP Stream Reassembly” (Aug. 3, 2007), Revision 1.0, pp. 1-23, obtained from: http://www.snort/org/docs/stream5-modelAUg032007.pdf.Applicant
- “TaoSecurity—Dedicated to FreeBSD, network security monitoring, incident response, and network forensics,” (Oct. 1, 2007), obtained from: http://taosecurity.blogspot.com/2005/02/shmoocon-concludes-shmoocon-finished.html.Applicant
- D. Joseph, et al., “A Policy-aware Switching Layer for Data Centers,” SIGCOMM, Aug. 17-22, 2008, pp. 51-62.Applicant
- “Enhanced Operating System Identification with Nessus,” Tenable Network Security (2007), obtained from: http://blog.tenablesecurity.com/2009/02/enhanced—operat.html, posted by R. Gula on Feb. 16, 2009 (3 pp. total).Applicant
- Office Action issued by the U.S. Patent Office on Jul. 16, 2007 in connection with related U.S. Appl. No. 10/898,220.Applicant
- Office Action issued by the U.S. Patent Office on Sep. 6, 2007 in connection with related U.S. Appl. No. 10/843,374.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Sep. 6, 2007 in connection with related U.S. Appl. No. 10/843,376.Applicant
- Office Action issued by the U.S. Patent Office on Sep. 26, 2007 in connection with related U.S. Appl. No. 10/843,353.Applicant
- Office Action issued by the U.S. Patent Office on Oct. 4, 2007 in connection with related U.S. Appl. No. 10/951,796.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Oct. 5, 2007 in connection with related U.S. Appl. No. 10/793,887.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Oct. 9, 2007 in connection with PCT application No. PCT/US06/43800, which corresponds to U.S. Appl. No. 11/272,034.Applicant
- Office Action issued by the U.S. Patent Office on Nov. 21, 2007 in connection with related U.S. Appl. No. 10/843,398.Applicant
- European Search Report issued by the European Patent Office on Nov. 22, 2007 in connection with European patent application No. 07014575.0-1244, which corresponds to related U.S. Appl. No. 11/493,934.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Dec. 5, 2007 in connection with PCT application No. PCT/US05/25583, which corresponds to U.S. Appl. No. 10/951,796.Applicant
- European Search Report issued by the European Patent Office on Dec. 27, 2007 in connection with European patent application No. 07015003.2—2413, which corresponds to related U.S. Appl. No. 11/501,776.Applicant
- Office Action issued by the U.S. Patent Office on Jan. 10, 2008 in connection with related U.S. Appl. No. 10/843,373.Applicant
- Office Action issued by the U.S. Patent Office on Feb. 5, 2008 in connection with related U.S. Appl. No. 10/843,375.Applicant
- Office Action issued by the U.S. Patent Office on Feb. 21, 2008 in connection with related U.S. Appl. No. 11/272,033.Applicant
- Office Action issued by the U.S. Patent Office on Mar. 12, 2008 in connection with parent U.S. Appl. No. 10/843,459.Applicant
- Office Action issued by the U.S. Patent Office on Mar. 20, 2008 in connection with related U.S. Appl. No. 10/843,374.Applicant
- Final Office Action issued by the U.S. Patent Office on May 9, 2008 in connection with related U.S. Appl. No. 10/843,353.Applicant
- International Preliminary Report on Patentability mailed on May 22, 2008 in connection with PCT application No. PCT/US06/43800, which corresponds to U.S. Appl. No. 11/272,034.Applicant
- Final Office Action issued by the U.S. Patent Office on Jun. 4, 2008 in connection with related U.S. Appl. No. 10/843,398.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Jun. 19, 2008 in connection with PCT application No. PCT/US05/25584, which corresponds to U.S. Appl. No. 10/898,220.Applicant
- Final Office Action issued by the U.S. Patent Office on Jun. 26, 2008 in connection with related U.S. Appl. No. 10/898,220.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Jun. 30, 2008 in connection with PCT application No. PCT/US07/21351, which corresponds to U.S. Appl. No. 11/905,980.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Jul. 2, 2008 in connection with PCT application No. PCT/US08/02454, which corresponds to U.S. Appl. No. 11/711,876.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Jul. 7, 2008 in connection with PCT application No. PCT/US06/43820, which corresponds to U.S. Appl. No. 11/272,035.Applicant
- Office Action issued by the U.S. Patent Office on Jul. 11, 2008 in connection with related U.S. Appl. No. 11/272,034.Applicant
- Final Office Action issued by the U.S. Patent Office on Jul. 17, 2008 in connection with parent U.S. Appl. No. 10/843,459.Applicant
- Final Office Action issued by the U.S. Patent Office on Aug. 6, 2008 in connection with related U.S. Appl. No. 10/843,375.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Aug. 18, 2008 in connection with related U.S. Appl. No. 11/272,033.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Aug. 18, 2008 in connection with PCT application No. PCT/US08/05466, which corresponds to U.S. Appl. No. 12/149,196.Applicant
- Final Office Action issued by the U.S. Patent Office on Aug. 19, 2008 in connection with related U.S. Appl. No. 10/843,373.Applicant
- Final Office Action issued by the U.S. Patent Office on Aug. 20, 2008 in connection with related U.S. Appl. No. 10/843,353.Applicant
- Office Action issued by the U.S. Patent Office on Oct. 6, 2008 in connection with related U.S. Appl. No. 10/843,374.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Oct. 15, 2008 in connection with related U.S. Appl. No. 10/951,796.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Oct. 21, 2008 in connection with related U.S. Appl. No. 10/843,375.Applicant
- European Office Action issued by the European Patent Office on Nov. 28, 2008 in connection with European patent application No. 07 015 003.2-2413, which corresponds to related U.S. Appl. No. 11/501,776.Applicant
- Office Action issued by the U.S. Patent Office on Dec. 17, 2008 in connection with related U.S. Appl. No. 10/843,398.Applicant
- Office Action issued by the U.S. Patent Office on Dec. 23, 2008 in connection with related U.S. Appl. No. 11/272,034.Applicant
- Office Action issued by the U.S. Patent Office on Jan. 16, 2009 in connection with related U.S. Appl. No. 10/843,353.Applicant
- Office Action issued by the U.S. Patent Office on Jan. 21, 2009 in connection with related U.S. Appl. No. 11/493,934.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Jan. 21, 2009 in connection with related U.S. Appl. No. 10/898,220.Applicant
- Office Action issued by the U.S. Patent Office on Feb. 4, 2009 in connection with related U.S. Appl. No. 10/843,373.Applicant
- Office Action issued by the U.S. Patent Office on Feb. 9, 2009 in connection with parent U.S. Appl. No. 10/843,459.Applicant
- International Preliminary Report on Patentability and Written Opinion of the International Searching Authority mailed on Mar. 3, 2009 in connection with PCT application No. PCT/US05/025584, which corresponds to U.S. Appl. No. 10/898,220.Applicant
- International Preliminary Report on Patentability and Written Opinion of the International Searching Authority mailed on Mar. 17, 2009 in connection with corresponding PCT application No. PCT/US06/43820, which corresponds to related U.S. Appl. No. 11/272,035.Applicant
- International Preliminary Report on Patentability mailed on Apr. 7, 2009 in connection with PCT application No. PCT/US07/021351, which corresponds to U.S. Appl. No. 11/905,980.Applicant
- Office Action issued by the U.S. Patent Office on Apr. 28, 2009 in connection with related U.S. Appl. No. 11/501,776.Applicant
- Final Office Action issued by the U.S. Patent Office on May 13, 2009 in connection with related U.S. Appl. No. 10/843,374.Applicant
- Office Action issued by the U.S. Patent Office on May 14, 2009 in connection with related U.S. Appl. No. 11/272,034.Applicant
- International Search Report and Written Opinion of the International Searching Authority mailed on May 27, 2009 in connection with PCT application No. PCT/US09/02210, which corresponds to U.S. Appl. No. 12/230,338.Applicant
- Office Action issued by the U.S. Patent Office on Jun. 1, 2009 in connection with related U.S. Appl. No. 11/272,035.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Jun. 11, 2009 in connection with related U.S. Appl. No. 10/843,373.Applicant
- Office Action issued by the U.S. Patent Office on Jun. 23, 2009 in connection with related U.S. Appl. No. 11/785,609.Applicant
- Office Action issued by the U.S. Patent Office on Jul. 6, 2009 in connection with parent U.S. Appl. No. 10/843,459.Applicant
- Office Action issued by the U.S. Patent Office on Jul. 7, 2009 in connection with related U.S. Appl. No. 10/843,398.Applicant
- Office Action issued by the U.S. Patent Office on Jul. 28, 2009 in connection with related U.S. Appl. No. 10/843,353.Applicant
- Office Action issued by the U.S. Patent Office on Jul. 30, 2009 in connection with related U.S. Appl. No. 11/493,934.Applicant
- Office Action issued by the U.S. Patent Office on Aug. 20, 2009 in connection with related U.S. Appl. No. 10/843,374.Applicant
- International Preliminary Report on Patentability mailed on Sep. 11, 2009 in connection with PCT application No. PCT/US08/002454, which corresponds to U.S. Appl. No. 11/711,876.Applicant
- Advisory Action issued by the U.S. Patent Office on Sep. 29, 2009 in connection with parent U.S. Appl. No. 10/843,459.Applicant
- European Search Report issued by the European Patent Office on Oct. 12, 2009 in connection with European patent application No. 05773501.1-2201, which corresponds to related U.S. Appl. No. 10/898,220, U.S. Appl. No. 11/785,609 and U.S. Appl. No. 12/010,900.Applicant
- Final Office Action issued by the U.S. Patent Office on Oct. 29, 2009 in connection with related U.S. Appl. No. 11/501,776.Applicant
- International Preliminary Report on Patentability mailed on Nov. 12, 2009 in connection with PCT application No. PCT/US08/005466, which corresponds to U.S. Appl. No. 12/149,196.Applicant
- Advisory Action issued by the U.S. Patent Office on Dec. 2, 2009 in connection with related U.S. Appl. No. 10/843,398.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Dec. 8, 2009 in connection with related U.S. Appl. No. 11/501,776.Applicant
- Final Office Action issued by the U.S. Patent Office on Dec. 8, 2009 in connection with related U.S. Appl. No. 11/272/034.Applicant
- Final Office Action issued by the U.S. Patent Office on Dec. 9, 2009 in connection with related U.S. Appl. No. 11/272,035.Applicant
- Office Action issued by the U.S. Patent Office on Dec. 17, 2009 in connection with related U.S. Appl. No. 11/493,934.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Jan. 7, 2010 in connection with related U.S. Appl. No. 10/843,353.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Jan. 8, 2010 in connection with related U.S. Appl. No. 10/843,373.Applicant
- Office Action issued by the European Patent Office on Jan. 15, 2010 in connection with European patent application No. 05773501.1-2201, which corresponds to related U.S. Appl. No. 10/898,220, 11/785,609 and 12/010,900.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Feb. 5, 2010 in connection with related U.S. Appl. No. 11/272,034.Applicant
- Advisory Action issued by the U.S. Patent Office on Feb. 24, 2010 in connection with related U.S. Appl. No. 11/272,035.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Mar. 5, 2010 in connection with related U.S. Appl. No. 11/785,609.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Mar. 16, 2010 in connection with PCT application No. PCT/US09/59965, which corresponds to U.S. Appl. No. 12/575,612.Applicant
- Office Action issued by the U.S. Patent Office on Mar. 16, 2010 in connection with related U.S. Appl. No. 11/272,035.Applicant
- Final Office Action issued by the U.S. Patent Office on Mar. 17, 2010 in connection with related U.S. Appl. No. 10/843,374.Applicant
- Office Action issued by the U.S. Patent Office on Mar. 22, 2010 in connection with related U.S. Appl. No. 11/493,934.Applicant
- Office Action issued by the U.S. Patent Office on Apr. 7, 2010 in connection with related U.S. Appl. No. 11/711,876.Applicant
- Office Action issued by the U.S. Patent Office on Apr. 15, 2010 in connection with related U.S. Appl. No. 12/010,900.Applicant
- Office Action issued by the U.S. Patent Office on Apr. 21, 2010 in connection with parent U.S. Appl. No. 10/843,459.Applicant
- Notice of Allowance issued by the U.S. Patent Office on May 24, 2010 in connection with related U.S. Appl. No. 10/843,398.Applicant
- Advisory Action issued by the U.S. Patent Office on Aug. 3, 2010 in connection with related U.S. Appl. No. 10/843,374.Applicant
- Final Office Action issued by the U.S. Patent Office on Sep. 8, 2010 in connection with parent U.S. Appl. No. 10/843,459.Applicant
- Final Office Action issued by the U.S. Patent Office on Sep. 17, 2010 in connection with related U.S. Appl. No. 11/711,876.Applicant
- Office Action mailed Sep. 7, 2010 from the Japan Patent Office for Japanese patent application No. 2007-523639 in connection with related U.S. Appl. No. 10/951,796, now U.S. patent No. 7,496,962 (English translation enclosed).Applicant
- Final Office Action issued by the U.S. Patent Office on Sep. 30, 2010 in connection with related U.S. Appl. No. 11/493,934.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Oct. 5, 2010 in connection with related U.S. Appl. No. 10/843,374.Applicant
- International Preliminary Report on Patentability mailed on Oct. 19, 2010 in connection with PCT application No. PCT/US2009/02210, which corresponds to U.S. Appl. No. 12/230,338.Applicant
- Final Office Action issued by the U.S. Patent Office on Oct. 25, 2010 in connection with related U.S. Appl. No. 11/272,035.Applicant
- Final Office Action issued by the U.S. Patent Office on Nov. 4, 2010 in connection with related U.S. Appl. No. 10/843,459.Applicant
- Office Action issued by the U.S. Patent Office on Nov. 19, 2010 in connection with parent U.S. Appl. No. 10/843,459.Applicant
- Final Office Action issued by the U.S. Patent Office on Nov. 24, 2010 in connection with related U.S. Appl. No. 12/010,900.Applicant
- Office Action issued by the U.S. Patent Office on Dec. 22, 2010 in connection with related U.S. Appl. No. 11/905,908.Applicant
- “Snort™ Users Manual 2.2.0RC1,” The Snort Project, Jun. 28, 2004, Retrieved from the Internet: URL:http://cvs.snort.org/viewcvs.cgi/*checkout*/snort/doc/snort—manual.pdf?rev=1.25&content-type=applications/pdf [retrieved on Nov. 18, 2010] (XP002610157).Applicant
- V. Yegneswaran, et al., “Internet Sieve: An Architecture for Generating Resilient Signatures,” May 2004, Retrieved from the Internet: URL:http://www.cc.gatech.edu/˜giffin/papers/trl507/trl507.pdf [retrieved on Nov. 18, 2010] (XP002610154).Applicant
- D. Roekler, “HTTP IDS Evasions Revisited,” Jan. 8, 2003, Retrieved from the Internet: URL:http://docs.idsresearch.org/http—ids—evasions.pdf [Nov. 18, 2010] (XP002610155).Applicant
- M. Norton, et al., “The New Snort,” Computer Security Journal, CSI Security Institute, XIX, No. 3 (Jan. 1, 2003), pp. 37-47, ISSN: 0277-0865 (XP008039475).Applicant
- European Search Report issued by the European Patent Office on Dec. 6, 2010 in connection with European patent application No. 05773540.9-2413, which corresponds to related U.S. Patent No. 7,496,962.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Jan. 24, 2011 in connection with related U.S. Appl. No. 10/843,459.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Feb. 24, 2011 in connection with related U.S. Appl. No. 11/493,934.Applicant
- Press Release, “FaceTime Protects Enterprises from Information Leaks over Collaborative Suites like Microsoft OCS and IBM Sametime”, issued by FaceTime Communications, Belmont, California, Jul. 14, 2008, retrieved from www.facetime.com/pr/pr080714.aspx , Dec. 1, 2009.Applicant
- Office Action mailed Mar. 1, 2011 from the Japan Patent Office for Japanese patent application No. 2007-523640 in connection with related U.S. Appl. No. 10/898,220, now U.S. patent No. 7,539,681, U.S. Appl. No. 11/785,609, now U.S. patent No. 7,756,885, and U.S. Appl. No. 12/010,900 (English translation enclosed).Applicant
- Office Action issued by the U.S. Patent Office on Apr. 6, 2011 in connection with related U.S. Appl. No. 11/711,876.Applicant
- Office Action issued by the U.S. Patent Office on Apr. 13, 2011 in connection with related U.S. Appl. No. 12/230,338.Applicant
- Office Action issued by the U.S. Patent Office on May 12, 2011 in connection with related U.S. Appl. No. 12/149,196.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Apr. 6, 2011 in connection with related U.S. Appl. No. 12/010,900.Applicant
- PCT International Preliminary Report on Patentability mailed on Apr. 21, 2011 by the International Bureau of WIPO in connection with PCT patent application No. PCT/US2009/059965, which corresponds to U.S. Appl. No. 12/575,612.Applicant
- Office Action issued by the U.S. Patent Office on Mar. 19, 2012 in connection with related U.S. Appl. No. 12/813,859.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Apr. 25, 2012 in connection with corresponding PCT application No. PCT/US2012/021633.Applicant
- Final Office Action issued by the U.S. Patent Office on May 29, 2012 in connection with related U.S. Appl. No. 12/230,338.Applicant
- Notice of Allowance issued by the U.S. Patent Office on May 30, 2012 in connection with related U.S. Appl. No. 12/575,612.Applicant
- Final Office Action issued by the U.S. Patent Office on Jun. 5, 2012 in connection with related U.S. Appl. No. 12/813,859.Applicant
- Office Action issued by the U.S. Patent Office on May 31, 2011 in connection with related U.S. Appl. No. 12/688,400.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Jun. 22, 2011 in connection with related U.S. Appl. No. 11/272,035.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Jul. 22, 2011 in connection with related U.S. Appl. No. 11/711,876.Applicant
- Extended European Search Report issued by the European Patent Office on Jul. 19, 2011 in connection with European patent application No. 06837333.1-2413, which corresponds to related U.S. Patent No. 7,733,803.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Jul. 28, 2011 in connection with PCT application No. PCT/US2011/032489, which corresponds to U.S. Appl. No. 13/086,819.Applicant
- Matthew Olney et al.: “What would you do with a pointer and a size? A New Detection Framework”, Apr. 22, 2010 (Apr. 2, 2010), XP55002567, http://labs.snort.org/nrt/sfvrt-nrt.pdf (retrieved on Jul. 12, 2011) the whole document.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Jun. 25, 2012 in connection with related U.S. Appl. No. 12/688,400.Applicant
- International Search Report and Written Opinion of the International Searching Authority issued on Sep. 1, 2011 in connection with PCT application No. PCT/US2011/035874, which corresponds to U.S. Appl. No. 12/820,227.Applicant
- Francois Gagnon et al.: “A Hybrid Approach to Operating System Discovery using Answer Set Programming”, Integrated Network Management, 2007. IM'07, 10th IFIP/IEEE International Symposium On, IEEE, PI, May 1, 2007, pp. 391-400, XP031182713, ISBN: 978-1-4244-0798-9, p. 293, 394-397.Applicant
- Final Office Action issued by the U.S. Patent Office on Sep. 14, 2011 in connection with related U.S. Appl. No. 12/230,338.Applicant
- Office Action issued by the U.S. Patent Office on Oct. 21, 2011 in connection with related U.S. Appl. No. 12/969,682.Applicant
- Notice of Allowance issued by the Japanese Patent Office on Sep. 30, 2011 in connection with Japanese Patent Application No. 2007-523640, which corresponds to related U.S. Appl. No. 10/898,220, now U.S. Patent No. 7,539,681.Applicant
- Notice of Allowance issued the by U.S. Patent Office on Oct. 28, 2011 in connection with related U.S. Appl. No. 12/149,196.Applicant
- Advisory Action issued by the U.S. Patent Office on Nov. 28, 2011 in connection with related U.S. Appl. No. 12/230,338.Applicant
- Office Action issued by the U.S. Patent Office on Oct. 15, 2012 in connection with related U.S. Appl. No. 12/230,338.Applicant
- International Preliminary Report on Patentability mailed by the International Bureau of WIPO on Oct. 26, 2012, in connection with corresponding PCT application No. PCT/US2011/032489, which corresponds to related U.S. Appl. No. 13/086,819.Applicant
- Office Action issued by the U.S. Patent Office on Nov. 6, 2012 in connection with related U.S. Appl. No. 12/820,227.Applicant
- Li, Zhichun, et al. Netshield: Matching with a large vulnerability signature ruleset for high performance network defense. Technical Report NWU-EECS-08-07, Northwestern University, Aug. 2010.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Jan. 9, 2013 in connection with related U.S. Appl. No. 12/813,859.Applicant
- Office Action issued by the U.S. Patent Office on Jan. 10, 2013 in connection with related U.S. Appl. No. 12/969,682.Applicant
- U.S. Appl. No. 13/779,851, filed Feb. 28, 2013, Polley et al.Applicant
- International Preliminary Report on Patentability mailed by the International Bureau of WIPO on Jan. 10, 2013, in connection with corresponding PCT international application No. PCT/US2011/035874, which corresponds to related U.S. Appl. No. 12/820,227.Applicant
- Notice of Allowance issued by the U.S. Patent Office on Mar. 14, 2013 in connection with related U.S. Appl. No. 12/230,338.Applicant
- Auffret, Patrice. “SinFP, unification of active and passive operating system fingerprinting.” Journal in Computer Virology 6.3 (2010): 197-205.Applicant
- De Montigny-Leboef, Annie. “A multi-packet signature approach to passive operating system detection.” Defense Technical Information Center, 2005.Applicant
- Tu, William, et al. “Automated Service Discovery for Enterprise Network Management.” Mar. 8, 2009.Applicant
- Taleck, Greg. “Ambiguity Resolution via Passive OS Fingerprinting.” Recent Advances in Intrusion Detection. Springer-Verlag Berlin Heidelberg, 2003.Applicant
- Martin Roesch, “Snort-Lightweight Intrusion Detection for Networks”, Proceedings of LISA '99: 13th System Administration Conference, Nov. 12, 1999, pp. 229-238, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.6212.Applicant
- Office Action issued by the European Patent Office on Mar. 20, 2013 in connection with European Patent Application No. 05773501.1—1952 which corresponds to related U.S. Appl. No. 10/898,220 (now patent No. 7,539,631).Applicant
- Notice of Allowance issued by the Canadian Intellectual Property Office on Apr. 19, 2013 in connection with Canada Patent Application No. 2685292, which corresponds to related U.S. Appl. No. 12/820,227.Applicant
- Final Office Action issued by the U.S. Patent Office on Apr. 18, 2013 in connection with related U.S. Appl. No. 12/969,682.Applicant
- Office Action issued by the U.S. Patent Office on May 6, 2013 in connection with related U.S. Appl. No. 12/820,227.Applicant
- Office Action issued by the U.S. Patent Office on May 8, 2013 in connection with related U.S. Appl. No. 13/086,819.Applicant