US 9,923,925 B2Grant
Cyber security sharing and identification system
Issue Date:2018-03-20
•20 Claims
•15 Drawing Sheets
Abstract
Systems and techniques for sharing security data are described herein. Security rules and/or attack data may be automatically shared, investigated, enabled, and/or used by entities. A security rule may be enabled on different entities comprising different computing systems to combat similar security threats and/or attacks. Security rules and/or attack data may be modified to redact sensitive information and/or configured through access controls for sharing.
Metadata
Assignee
- Palantir Technologies Inc.
Inventors
- Jacob Albertson
- Melody Hildebrandt
- Harkirat Singh
- Shyam Sankar
- Rick Ducott
- Peter Maag
- Marissa Kimball
Application Information
Application Number:US 14/684,231
Filing Date:2015-04-10
Priority Date:2014-02-20
Art Unit:2433
Classifications
IPC:
H04L29/06
Patent Drawings (15 sheets)
Description
Incorporation by Reference to Any Priority Applications
[0001] Any and all applications for which a foreign or domestic priority claim is identified in the Application Data Sheet as filed with the present application are hereby incorporated by reference under 37 CFR 1.57.
[0002] This application is a continuation of U.S. patent application Ser. No. 14/280,490 filed May 16, 2014, which claims benefit of U.S. Provisional Application No. 61/942,480, which was filed Feb. 20, 2014. Each of these applications are hereby incorporated by reference herein in their entireties.
Cross-Reference to Related Applications
[0003] This application is related to but does not claim priority from U.S. patent application Ser. No. 13/968,265 entitled “Generating Data Clusters With Customizable Analysis Strategies” filed Aug. 15, 2013, and U.S. patent application Ser. No. 13/968,213 entitled “Prioritizing Data Clusters With Customizable Scoring Strategies” filed Aug. 15, 2013, which are hereby incorporated by reference in their entireties and collectively referred to herein as the “Cluster references.”
[0004] This application is related to but does not claim priority from U.S. Pat. No. 8,515,912 entitled “Sharing And Deconflicting Data Changes In A Multimaster Database System” filed Jul. 15, 2010, U.S. Pat. No. 8,527,461 entitled “Cross-ACL Multi-Master Replication” filed Nov. 27, 2012, U.S. patent application Ser. No. 13/076,804 entitled “Cross-Ontology Multi-Master Replication” filed Mar. 31, 2011, U.S. patent application Ser. No. 13/657,684 entitled “Sharing Information Between Nexuses That Use Different Classification Schemes For Information Access Control” filed Oct. 22, 2012, and U.S. patent application Ser. No. 13/922,437 entitled “System And Method For Incrementally Replicating Investigative Analysis Data” filed Jun. 20, 2013, which are hereby incorporated by reference in their entireties and collectively referred to herein as the “Sharing references.”
[0005] This application is related to but does not claim priority from U.S. Pat. No. 8,489,623 entitled “Creating Data In A Data Store Using A Dynamic Ontology” filed May 12, 2011, which is hereby incorporated by reference in its entirety and referred to herein as the “Ontology reference.”
Background
[0006] In the area of computer-based platforms, security data may be collected, analyzed, and used to protect computer networks from unwanted behavior.
Summary
[0007] The systems, methods, and devices described herein each have several aspects, no single one of which is solely responsible for its desirable attributes. Without limiting the scope of this disclosure, several non-limiting features will now be discussed briefly.
[0008] In some embodiments, a system for sharing security information comprises one or more computing devices programmed, via executable code instructions. When executed, the executable code instructions may cause the system to implement an attack data unit. The attack data unit may be configured to receive a plurality of security attack data from one or more entities. The security attack data may comprise information regarding one or more security attacks detected by respective entities. When further executed, the executable code instructions may cause the system to implement an attack data modification unit. The attack data modification unit may be configured to redact portions of the security attack data from various entities such that the redacted portions are not detectable in the security attack data. When further executed, the executable code instructions may cause the system to implement a distribution unit configured to share the security attack data with multiple entities.
[0009] In some embodiments, a non-transitory computer storage comprises instructions for causing one or more computing devices to share security information. When executed, the instructions may receive a plurality of security attack data from multiple entities. The security attack data may comprise information regarding one or more security attacks detected by respective entities. When further executed, the instructions may generate a ruleset based on the plurality of security attack data from multiple entities. The ruleset may be adapted to be executable by a plurality of the entities to recognize one or more security attacks. When further executed, the instructions may redact configurable portions of the security attack data from various entities such that the redacted portions are not detectable in the ruleset. When further executed, the instructions may transmit the ruleset, or a subset thereof, to one or more entities.
[0010] In some embodiments, a method for sharing security information comprises receiving a plurality of security attack data from multiple entities. The security attack data may comprise information regarding one or more security attacks detected by respective entities. The method may further comprise generating a ruleset based on the plurality of security attack information from multiple entities. The ruleset may be adapted to be executable by a plurality of the entities to recognize one or more security attacks. The method may further comprise redacting configurable portions of the security attack data from various entities such that the redacted portions are not detectable in the ruleset. The method may further comprise transmitting the ruleset to one or more entities.
[0011] In some embodiments, a system for sharing security information may share security attack data around specific security attacks and/or strategies for detecting security attacks.
Brief Description of the Drawings
[0012] Certain aspects of the disclosure will become more readily appreciated as those aspects become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings.
[0013] FIG. 1 is a block diagram illustrating an example security sharing system, according to some embodiments of the present disclosure.
[0014] FIG. 2 is a flowchart illustrating an example attack sharing process, according to some embodiments of the present disclosure.
[0015] FIG. 3 is a flowchart illustrating an example ruleset sharing process for a specific attack, according to some embodiments of the present disclosure.
[0016] FIG. 4 is a flowchart illustrating an example modification process for attack data and/or rulesets, according to some embodiments of the present disclosure.
[0017] FIG. 5 is a block diagram illustrating an example security sharing system sharing attack data, rulesets, and/or modified attack data, according to some embodiments of the present disclosure.
[0018] FIG. 6 is a flowchart illustrating an example ruleset sharing process for multiple attacks, according to some embodiments of the present disclosure.
[0019] FIG. 7 is a block diagram illustrating an example security sharing system sharing attack data, rulesets, and/or modified attack data from different entities, according to some embodiments of the present disclosure.
[0020] FIG. 8A illustrates an example security sharing table, according to some embodiments of the present disclosure.
[0021] FIG. 8B illustrates example attack data and/or modified attack data based on security attacks, according to some embodiments of the present disclosure.
[0022] FIG. 8C illustrates example attack data and/or rulesets based on multiple security attacks, according to some embodiments of the present disclosure.
[0023] FIG. 8D illustrates example rulesets in a format comprising code instructions, according to some embodiments of the present disclosure.
[0024] FIG. 9A illustrates an example user interface of the security sharing system, according to some embodiments of the present disclosure.
[0025] FIG. 9B illustrates an example user interface for viewing data objects within the security sharing system, according to some embodiments of the present disclosure.
[0026] FIG. 10 is a block diagram illustrating an example security sharing system with which various methods and systems discussed herein may be implemented.
Detailed Description
[0027] Security information may be shared with the goal of improving particular aspects of computer and/or cyber security. For example, in a computer-based context, security information and strategies may be orally shared among institutions and/or individuals at a cyber-security conference. The institutions and/or individuals may then implement detection and/or defensive strategies on their computing systems. In another example, in a software application-based context, antivirus software may detect malicious files and/or code through sharing of hash values of malicious files and/or code. Upon scanning a computing device, malicious files and/or code may be removed and/or quarantined.
[0028] In addition to sharing of security data orally and/or in an information entity to entity manner, disclosed herein are systems for sharing security information among multiple entities. Using the techniques and systems described herein, security threats may be addressed more preemptively and/or efficiently by utilizing more information and/or analysis from other entities. Those techniques and systems may comprise automatically and/or in an ad hoc manner sharing attack information and/or generic rules to combat security threats.
[0029] Sharing attack information may allow for distributive and/or efficient responses to security threats. Institutions, organizations, entities, and/or the government may share attack information automatically and/or in an ad hoc manner. The security sharing system may modify attack data to redact confidential and/or sensitive information for sharing with other entities.
[0030] Sharing of generic rules through the security sharing system may efficiently combat security threats. In some embodiments, a rule may be generated by human technicians and/or any participating entity and pushed to the security sharing system for use by other participating entities. In some embodiments, a rule may be generated by the security sharing system following an attack on any entity using the system. A rule may differ from a specific attack by comprising more abstract characteristics of an attack that may be used to proactively detect other attacks. The rules may be configured to be enabled and/or implemented on other entities and/or computing systems to defend against and/or combat security attacks using their own proprietary data.
[0031] System Overview
[0032] FIG. 1 illustrates a security sharing system, according to some embodiments of the present disclosure. In the example embodiment of FIG. 1 , the security sharing environment 190 comprises a network 120, a security sharing system 100, one or more security attacks 130 (including security attacks 130A, 130B, 130C, 130D, 130E, 130F, 130G, 130H, 130I in the example of FIG. 1 ), and one or more entities 110 (including entities 110A, 110B, and 110C in the example of FIG. 1 ). The network 120 may comprise, but is not limited to, one or more local area networks, wide area network, wireless local area network, wireless wide area network, the Internet, or any combination thereof. As shown by FIG. 1 , the security sharing system 100 may share security data with one or more entities 110.
[0033] In some embodiments, the security sharing environment 190 may not comprise a network. Some entities, such as, but not limited to, government entities, may not be connected to a network and/or may not want to share security information via a network. Thus, sharing of security information by the security sharing system may occur via physical transport, such as, but not limited to, Universal Serial Bus drives, external hard drives, and/or any other type of media storage.
[0034] The entities 110 may comprise one or more computing devices. For example, an entity 110 may be institution, such as, but not limited to, a bank, a financial institution, or the government, comprised of one or more computer servers. As illustrated by entity 110B, an entity may comprise one or more computing devices connected via a network 140A, such as a secure LAN. The entity 110B may communicate with a security sharing device 150A, which may reside outside the network 140A. The security sharing device 150A may then communicate with the security sharing system 100. The security sharing device 150 may comprise all of that institution's cyber data and/or analysis. As illustrated by entity 110C, the security sharing device 150B may reside within an entity's network 140B. The entity may be connected via the network 120.
[0035] There may be many different variations and/or types of a security attack 130. Several examples of security attacks are discussed herein, but these are not limiting in the types of other security attacks the security sharing system may be able to detect. For example, a security attack may comprise malicious code and/or software, such as, but not limited to, Trojans, viruses, worms, and/or bots. Security attacks and/or security patterns may evolve and/or change over time. Therefore, the security sharing system may be configured to handle different types of security attacks and/or the changes in security attacks over time.
[0036] For example, a Trojan installs and/or infects itself in the computer servers of an entity, such as, a banking institution. The Trojan originates from a computing device with a source identifier, such as, but not limited to, an Internet Protocol (“IP”) address. The Trojan then steals information and/or data from the entity, such as, but not limited to, credit card data, social security numbers, bank account numbers, personal data, names, phone numbers, addresses, and/or driver's license numbers. The Trojan sends the stolen information and/or data over the network 120 to one or more computing devices.
[0037] A security attack may comprise an attempt to make a computing device unavailable, such as, but not limited to, a denial of service (DOS) attack, or a distributed denial of service (DDOS) attack. For example, multiple computing devices saturate one or more computing devices of an entity with communication requests. In a DOS or DDOS attack, a goal of the multiple communication requests may be to make one or more computing devices unavailable to the network by overloading the computing devices with requests.
[0038] The security sharing system 100 may operate as a single instance, client server system, or as a distributed system. For example, there may be multiple instances of the security sharing system 100 running simultaneously that communicate through the network 120. In some embodiments, each security sharing system instance operates independently and/or autonomously. In some embodiments, there is a central server of the security sharing system 100 and individual clients of the security sharing system communicate with the central server via the network 120.
[0039] Example Attack Sharing Processes
[0040] FIG. 2 is a flowchart illustrating an attack sharing process, according to some embodiments of the present disclosure. The method of FIG. 2 may be performed by the security sharing system and/or one or more entities discussed about with reference to FIG. 1 . Depending on the embodiment, the method of FIG. 2 may include fewer or additional blocks and/or the blocks may be performed in order different than is illustrated.
[0041] Beginning in block 202, an attack is made on one of the computing devices of an entity 110. As noted above, various activities may be considered attacks on an entity 110. For example, a malicious application, such as a Trojan, may be installed on an entity's one or more internal computing devices. The malicious application may originate from an IP address.
[0042] At block 204, the security attack is identified and/or recorded as attack data. For example, the entity 110 may identify malicious software and/or communications from an external IP address, such as using antivirus or firewall software. The attack data may comprise information about the security attack, such as the IP address of the malicious application, an identifier for the malicious application, and/or the IP addresses of the internal computing devices that were attacked and/or infected. In some embodiments, the security attack may be identified automatically, such as by security and/or antivirus software, or the attack may be identified by a human operator, such as a system administrator or information technology technician. In some embodiments, attacks are initially detected by software and then a human technician confirms a software-detected attack before the attack data is shared, such as according to the process described below.
[0043] In some embodiments, identification of attacks occurs by the systems, methods, and/or techniques disclosed in the Cluster references. For example, related security attacks may be clustered as illustrated by U.S. patent application Ser. No. 13/968,265. A human technician may then view and analyze the cluster of related security attacks. Clusters of security attacks may also receive rankings and/or scorings as illustrated by U.S. patent application Ser. No. 13/968,213.
[0044] In some embodiments, attack data, rulesets, and/or other security information may be a data object according to the systems, methods, and/or techniques disclosed in the Ontology reference. For example, attack data, rulesets, and/or other security information may be included in data objects that are included in an ontology, which may be shared with other entities across the security sharing system and/or the data objects remain uniform across the entities they are shared with.
[0045] At block 205, the attack data may be optionally modified for sharing. For example, information regarding computing systems and/or employees of the entity 110 that was attacked may be removed from the attack data before it is shared with the security sharing system 100. The entity 110 may remove and/or modify data regarding the attack and/or the security sharing system 100 may remove and/or modify data regarding the attack once received from the entity 110 (e.g., as discussed below in block 206). In some embodiments, the attack data may be modified such that the network architecture and/or other proprietary information of the entity 110 is not indicated. For example, an entity 110 may want to share the attack data with others without exposing the particular network architecture and/or the specific computing devices that are part of the attack.
[0046] Next, at block 206 the attack data may be provided by the entity 110 to the security sharing system 100, such as via the network 120 of FIG. 1 . Depending on the embodiment, the attack data may be shared in various manners, such as via a shared network location that stores the data, a direct communication via an email or HTTP communication, or in any other manner. The attack data may be in various formats, such as a database format, files, XML, JSON, a file format that is proprietary to the security sharing system 100, or any other format, and maybe encrypted or have security of any available type.
[0047] In some embodiments, sharing of attack data at block 206 occurs by the systems, methods, and/or techniques disclosed in the Sharing references. For example, attack data may be shared and deconflicted through a replicated database system as illustrated by U.S. Pat. No. 8,515,912. Attack data may also be shared through a database system with multiple ontologies as illustrated by U.S. patent application Ser. No. 13/076,804. The sharing of attack data may also occur via incremental database replication as illustrated by U.S. patent application Ser. No. 13/922,437.
[0048] In some embodiments, the clusters generated by the systems, methods, and/or techniques disclosed in the Cluster references and/or other security information may be shared by the systems, methods, and/or techniques disclosed in the Sharing references, other mechanisms illustrated in this disclosure, and/or any other manner.
[0049] At block 208, the attack data that is received at the security sharing system 100 is wholly or partially shared with one or more entities 110. For example, if the attack data is received from entity 110A, the security sharing system 100 may share the attack data to entities 110B, 110C, and/or external systems, such as in accordance with sharing preferences of the entities.
[0050] At block 210, the attack data may be optionally used by the entities with which the attack data is shared. For example, the attack data may be proactively detect and hopefully prevent similar attacks.
[0051] There may be some variations of the optional use of the attack data at block 210. For example, an entity 110B, such as a financial institution, may implement security defenses, such as, antivirus software, to defend against the malicious application identified in the attack data. In another example, the entity 110B, may conduct a search for the malicious application throughout the entity's computing devices based on the received attack data. Thus, the attack data may be used to identify previous attacks (which may be ongoing) and initiate recovery actions (e.g., quarantining infected files, blocking IP addresses, deleting files, reinstalling drivers, etc.).
[0052] Rulesets
[0053] A ruleset may comprise code instructions and/or sets of data that enable a security system and/or entity to implement detection and/or defense strategies against security attacks. A ruleset differs from specific attack data (such as was discussed above with reference to FIG. 2 ) in that a ruleset may include more abstract characteristics of an attack that can be used to detect other attacks. For example, a ruleset may comprise code instructions and/or data representing a beaconing behavior based on a pattern of communication and/or call-back behavior by one or multiple entities from/to a common IP address (or group of IP addresses). In general, beaconing comprises communication from an entity's internal computing device to an external computer device that is believed to be malicious. Beaconing often occurs at regular intervals, such as every twenty-four hours. Thus, a beacon is traffic leaving the inside of a network at regular intervals. A beacon may be referred to as a phone home or heartbeat. Beacons can be used for malicious purposes, such as obtaining new orders from a command and control (C&C) server as well as to download updates or other tools (e.g., to malicious software installed on the entity's computing system). In some embodiments, beaconing may occur at irregular intervals, such as intervals that are determined based on a predetermined pattern algorithm, or at random intervals. Thus, a ruleset that identifies beaconing behavior does not necessarily indicate particular entities that have been attacked by the beaconing behavior, but may include characteristics of the beaconing behavior, such as may be reported by multiple entities, which can be used to detect similar attacks. For example, a beaconing ruleset may identify a group of IP addresses to which beacons are transmitted (e.g., from an attacked entity), a beaconing period (e.g. a fixed time period, a range of time periods, or algorithmic expression that defines a time period), and/or any other information that may be used by an entity to identify similar beaconing activities. Sharing of a beaconing ruleset, whether based on beaconing activities of a single entity or beaconing activities of multiple entities (e.g., as may be developed by the security sharing system 100 in response to receiving beaconing activity data from multiple entities), may enable early detection by the entity and/or the security sharing system of beaconing behavior.
[0054] A ruleset may be in various formats, such as source code and/or code instructions, a database format, files, XML, JSON, a file format that is proprietary to the security sharing system 100, or any other format, and may be encrypted or have security of any available type, and/or some combination thereof. In some embodiments, a ruleset may be enabled on different entities and/or computer systems without modification. For example, two different entities may use different proxy providers (e.g., computer servers that act as intermediaries for requests from clients seeking resources from other services). The ruleset may be sufficiently abstracted such that, with some configuration data and/or configuration of the entity's computing devices, the same ruleset checking for beaconing (or other) behavior may be run on different entities that have different proxy providers.
[0055] In some embodiments, rulesets and/or the output of rulesets may be clustered by the systems, methods, and/or techniques disclosed in the Cluster references. For example, related rulesets and/or the output of rulesets may be clustered as illustrated by U.S. patent application Ser. No. 13/968,265. A human technician may then view and analyze the cluster of related rulesets and/or output of the rulesets.
[0056] Example Ruleset Sharing
[0057] FIG. 3 is a flowchart illustrating a ruleset sharing process for a specific attack, according to some embodiments of the present disclosure. The method of FIG. 3 may be performed by the security sharing system and/or one or more entities discussed about with reference to FIG. 1 . Depending on the embodiment, the method of FIG. 3 may include fewer or additional blocks and/or the blocks may be performed in order different than is illustrated.
[0058] Beginning at block 302, a security attack is detected and a pattern associated with the security attack is identified. For example, the security attack may correspond to a beaconing attack that includes hundreds of beacons that have been identified by a particular entity to a group of related IP addresses. A detected pattern may indicate a regular time period, e.g., twenty-four hours, at which beacons repeatedly transmitted to the same IPs.
[0059] In some embodiments, there may be some variations of identification of the security attack and recognition of the pattern at block 302. As previously illustrated in FIG. 2 , identification of the attack at block 302 may be manual or automatic. Similarly, recognition of a pattern from the security attack at block 302 may be manual or automatic. For example, automatic pattern recognition by the security sharing system may occur from identifying beaconing at regular intervals and/or connections to the same external IP address. In some embodiments, humans may review the security attacks to recognize a pattern from them.
[0060] In some embodiments, similar to the identification of attacks, recognition of patterns occurs by the systems, methods, and/or techniques disclosed in the Cluster references.
[0061] At block 304, a ruleset may be generated from the recognized pattern. In some embodiments, generation of rulesets is automatic, manual, or some combination thereof.
[0062] At block 306, the ruleset may be optionally modified for sharing, such as in the manner discussed with reference to FIG. 4 , below.
[0063] At block 308, the security sharing system may share the ruleset with one or more other entities or external systems. The sharing of the ruleset with external systems at block 310 may be similar to the sharing of the attack data at block 208 of FIG. 2 .
[0064] At block 312, the ruleset may be optionally enabled by the external system and/or entity.
[0065] Modifying Attack Data and/or Rulesets
[0066] FIG. 4 is a flowchart illustrating a modification process for attack data and/or rulesets, according to some embodiments of the present disclosure. The method of FIG. 4 may be performed in whole, or in part, as part of block 205 of FIG. 2 and/or block 306 of FIG. 3 . Depending on the embodiment, the method of FIG. 4 may include fewer or additional blocks and/or the blocks may be performed in order that is different than illustrated.
[0067] At block 402, irrelevant and/or sensitive data may be redacted from attack data and/or rulesets. For example, attack data may initially comprise the source identifiers of internal computing devices of an entity, such as, but not limited to, the IP addresses of the computing devices. An entity may not want to share their internal IP addresses of their computing devices. Therefore, an entity may redact and/or remove data from the attack data such as the IP addresses of the entity's internal computing devices. Removal of entity specific information, such as internal IP addresses, from attack data, may abstract the attack data to increase usability by other entities. In some embodiments, redaction of attack data and/or rulesets is automatic, manual, or some combination thereof. For example, there may be a configurable list of IP addresses, which correspond to internal computing devices, to be removed from attack data and/or rulesets. Redaction may require approval by a human operator. In some embodiments, redaction of attack data and/or rulesets may be performed by a human operator.
[0068] At block 404, recipients may be specified for attack data and/or rulesets. For example, an entity may only want to send attack data to other entities it has close relationships with more entities in a particular vertical market or having other attributes. Therefore, the entity may specify one or more entities criteria for entities with which attack data and/or rulesets security sharing system. The sharing data may be provided in any available format, and may apply to sharing of attack data and/or ruleset data from the entity that provides the sharing data. In some embodiments, a human operator must approve and/or select the recipients of attack data and/or rulesets.
[0069] In some embodiments, access controls for replicating attack data and/or rulesets at block 404 occurs by the systems, methods, and/or techniques disclosed in the Sharing references. For example, asynchronous replication of attack data and/or rulesets occur via access control policies illustrated by U.S. Pat. No. 8,527,461. Replication of attack data and/or rulesets may occur where databases use different classification schemes for information access control as illustrated by U.S. patent application Ser. No. 13/657,684.
[0070] At block 406, attack data and/or rulesets may be made anonymous. For example, attack data and/or rulesets may comprise the source entity of the attack data and/or rulesets. Thus, an entity may specify whether the sharing attack data and/or rulesets should be anonymous. In some embodiments, there is a global setting and/or configuration for specifying anonymity. There may be a configurable setting enabling anonymity for some recipients but not others. In some embodiments, a human may approve or specify anonymity for each attack data item and/or ruleset that is shared.
[0071] At block 408, attack data and/or rulesets may be weighted differently such as based on the entity that provides the attack data or rule set (e.g., some entities may be more reliable providing attack data than others) or based on the type of attack identified in the attack data or rule set, and/or other factors. For example, if attack data indicates a high security risk associated with the attack, the security sharing system may assign a high weighting to the attack data. However, if the reported attack is less malicious and/or from an entity that commonly misreports attacks, a lower weighting may be assigned to the attack data, such that sharing of the attack data doesn't introduce false attack alerts in other entities. Thus, in some embodiments the security sharing system tracks the accuracy of reported attacks from respective entities and automatically applies weightings and/or prioritizations to future reports from those entities based on the determined accuracy.
[0072] The weightings may be assigned manually and/or automatically. For example, in some embodiments a human operator specifies whether attack data and/or rulesets are important. These weightings may change over time, as the attacks themselves evolve.
[0073] From the receiving perspective of attack data and/or rulesets, an entity may optionally weight attack data and/or rulesets from different entities. Thus, if an entity values attack data and/or rulesets from a different entity highly, the entity may set a high level of priority for anything received from that different entity.
[0074] Sharing Attack Data and/or Rulesets
[0075] FIG. 5 illustrates a security sharing system sharing attack data, rulesets, and/or modified attack data, or subsets thereof, according to some embodiments of the present disclosure. In accordance with some embodiments of the present disclosure, the security system 100 may comprise a rule unit 530, an attack modification unit 540, a ruleset data store 532, and/or attack data store 542.
[0076] As shown in the example of FIG. 5 , an entity 110A has been involved in three attack communications 130A, 130B, and 130C (each comprising one or more transmissions and/or receptions of data from the entity 110A). In this embodiment, the entity 110A, upon identifying the one or more communications as an attack (see, e.g., FIG. 2 ) may send attack data 500 to the security sharing system 100 through the network 120. In some embodiments, the security sharing system 100 automatically collects attack data from a security attack.
[0077] In this example, the security sharing system 100 generates a ruleset based on the attack data 500 corresponding to the multiple attack communications 130A, 130B, and 130C, such as by any one or more processes discussed with reference to FIG. 3 . For example, the multiple attacks 130A, 130B, and 130C illustrated in FIG. 5 may be associated with beaconing calls to an external computer device from the entity 110A. The attack ruleset 510 may be generated and/or output to other entities by the rule unit 530. The attack ruleset 510 may be stored in the attack data store 542. In the embodiment of FIG. 5 , the security sharing system 100 shares the attack ruleset 510 with another entity 110B through the network 120 and the modified attack data 520 with another entity 110C. The entities 110B and 110C may change, update, modify, etc. security measures based on the ruleset 510 or modified attack data 520, respectively.
[0078] In some embodiments, the security sharing system may be able to automatically generate rulesets based on one or more security attacks. Similar to automatic recognition of security attack patterns, a ruleset may be automatically generated from patterns of security attacks, e.g., beaconing and/or DOS attacks. Rulesets may be automatically output by the rule unit 530. For example, the rule unit 530 may take as input data regarding security attacks and automatically generate a ruleset from patterns recognized in the data.
[0079] In some embodiments, a human operator and/or a team of technicians may review the security attack patterns to generate a ruleset. The security sharing system may provide user interface tools to humans for analyzing security attacks and/or creating rulesets. For example, rulesets may be generated by a human operator of the user interface of the rule unit 530. A user interface of the rule unit 530 may comprise a document processing interface to generate a ruleset.
[0080] In some embodiments, a team of engineers and/or technicians may consume all of the security information and/or data from all of the entities of the security sharing system. The engineers and/or technicians may conceive and/or generate rulesets to share them with entities through the security sharing system.
[0081] In some embodiments, rulesets may be generated by entities and shared through the security sharing system. For example, the rule unit 530 may receive rulesets from entities for distribution to other entities through the security sharing system.
[0082] The shared attack data and/or ruleset may be modified by the entity 110A and/or the security sharing system 100, such as by any one or more processes discussed with reference to FIG. 4 . The attack modification unit 540 may modify the attack data 500 to output the modified attack data 520. The modified attack data 520 may be stored in the attack data store 542. Modification by the attack modification unit 540 and/or storage in the attack storage unit may achieve some of the goals and/or advantages illustrated in FIG. 4 .
[0083] Example Ruleset Generation from Multiple Attacks
[0084] FIG. 6 is a flowchart illustrating a ruleset sharing process for multiple attacks, according to some embodiments of the present disclosure. The method of FIG. 6 may be performed by the security sharing system and/or one or more entities discussed about with reference to FIG. 1 . Depending on the embodiment, the method of FIG. 6 may include fewer or additional blocks and/or the blocks may be performed in order different than is illustrated.
[0085] Beginning at block 602, attack data is received from separate entities. For example, the attack data from different entities (e.g., entities 130) may correspond to hundreds of DOS attacks that have been identified by different entities.
[0086] At block 604, a pattern is associated and/or recognized from the attack data from different entities. A recognized pattern may indicate a particular source of the attack, e.g., a DOS attack that originates from a particular IP address range, or domain.
[0087] At block 606, a ruleset may be generated from the recognized pattern. The ruleset may be optionally modified for sharing.
[0088] At block 608, the ruleset may be shared through the security sharing system. For example, the ruleset may be shared with one or more entities that shared attack data used in generation of the ruleset and/or other entities that did not provide attack data used in generation of the ruleset, such as in accordance with sharing rules (e.g., FIG. 8A ).
[0089] At block 610, the ruleset is shared through the security sharing system to external systems. The sharing of the ruleset with external systems at block 610 may be similar to the sharing of the attack data at block 208 of FIG. 2 .
[0090] At block 612, the ruleset may be optionally enabled by the external system and/or entity.
[0091] Sharing Attack Data and/or Rulesets from Different Entities
[0092] FIG. 7 is a block diagram illustrating a security sharing system sharing attack data, rulesets, and/or modified attack data that has been received from and/or determined based on information from different entities, according to some embodiments of the present disclosure. As shown in the example of FIG. 7 , the entity 110A has received three attack communications 130A, 130B, 130C and the entity 110B has received one attack communication 130D (although an attack, as used herein, may include one or any number of communications from and/or to an entity).
[0093] In this embodiment, the entity 110B, upon identifying the one or more communications as an attack (see, e.g., FIG. 2 ), may send attack data 702 to the security sharing system 100 through the network 120. Similar to entity 110B, entity 110A may send attack data 700, including information regarding attacks 130A, 130B, 130C, to the security sharing system 100. In this example, the security sharing system 100 generates a ruleset based on the attack data 700 from entity 110A and the attack data 702 from entity 110B. For example, the multiple attacks illustrated in FIG. 7 may be associated with DOS attacks from a set of computing devices associated with an IP address, a range of IP addresses, and/or a domain, for example.
[0094] Rule generation and/or sharing in FIG. 7 may be similar to FIG. 5 .
[0095] The security sharing system 100 may process the attack data from different entities to share attack rulesets, attack data, and/or modified attack data. In FIG. 7 , the security sharing system 100 shares modified attack data 720 with entity 110D, which may not have been attacked yet by the particular attack 130A-130D that were reported by entities 110A, 110B. For example, the modified attack data 720 may comprise the set of IP addresses where the DOS attacks originated from. The modified attack data 720 may differ from the attack data 700 by not having data regarding the internal computing devices that were targeted by the DOS attacks.
[0096] Sharing Tables
[0097] FIG. 8A illustrates an example security sharing table, according to some embodiments of the present disclosure. For example, the security sharing table may be one or more tables in a relational database of the security sharing system. In other examples, the security sharing table may be in various formats, such as a data object format, XML, JSON, a file format that is proprietary to the security sharing system, or any other format. The columns and/or fields shown in the table are illustrative. In some embodiments, there may be additional or less columns and/or fields. The security sharing table may be used to redact and/or modify any property of attack data, rulesets, and/or other security information of the security sharing system. The redaction and/or modification of any property may be possible because attack data, rulesets, and/or other security information may be in a data object format.
[0098] As shown in the example of FIG. 8A , the security sharing table may be used by the security sharing system (and/or by individual entities in some embodiments) to redact and/or modify attack data and/or rulesets. For example, there are four example entities shown. Attack data from a security attack may comprise the hostname and/or label for computing devices from an entity. Thus, the redact hostname column may be used to remove hostnames from attack data and/or rulesets. In the example, the hostnames “prod.example.net” and “application.example.net” will be removed from entity 1's attack data and/or rulesets. For entity 2, all of the hostnames ending in “corp” will be removed. As shown for entity 4, all hostnames may be removed from attack data and/or rulesets.
[0099] As shown in the example table of FIG. 8A , the four example entities have each provided different criteria for redacting or removing IP addresses from attack data and/or rulesets. According to these rules, the security sharing system may remove all internal IP addresses from attack data and/or rulesets from entity 4 and all internal IP addresses beginning with “192.168” from attack data and/or rulesets of entity 3.
[0100] The security sharing table may also be used to specify recipients for attack data and/or rulesets. For example, as shown in FIG. 8A , entity 1 has recipients: entity 2 and entity 3. Thus, the default recipients of entity 1 are entities 2 and 3 for sharing attack data and/or rulesets. As shown in the example table, entity 4 may share all of its attack data and/or rulesets with every entity in the security sharing system.
[0101] As shown in the example table of FIG. 8A , there may be a setting to make an entity anonymous while sharing attack data and/or rulesets. Entities 1 and 4 may share attack data and/or rulesets with other entities anonymously. For example, with the anonymous setting enabled, entity 1 can share attack data and/or rulesets with the security sharing system, which may then share that attack data, rulesets, and/or other ruleset generated based on the data received from entity 1, with other entities without identifying entity 1 as a source of the attack data.
[0102] Example Attack Data, Modified Attack Data, and/or Rulesets
[0103] As previously illustrated, attack data, modified attack data, and/or rulesets may be in various formats and/or combinations of formats and are not limited to the example formats shown in FIGS. 8B,8C, and 8D .
[0104] FIG. 8B illustrates example attack data and/or modified attack data based on security attacks, according to some embodiments of the present disclosure. For example, a security attack may be a DDOS attack with four originating IP addresses, shown in the <from_ip_addresses> element of the example attack data 802. The example attack data 802 also includes an attack identifier (in the <id> element), and identifies the type of attack (in the <type> element), internal IP addresses affected by the attack (in the <internal_ip_addresses> element) and entity providing the attack data (in the <entity> element>).
[0105] The security sharing system may modify the attack data 802, such as in the manner discussed with reference to FIG. 4 and/or FIG. 8A , to output modified attack data 804. As illustrated, modified attack data 804 may not contain the source entity of the attack data (e.g., the <entity> element is removed) and/or the internal IP addresses (e.g., the <internal_ip_addresses> element is removed) of the source entity, which may correspond to the preferences illustrated with reference to the sharing table of FIG. 8A . For example, the sharing table of FIG. 8A specified that entity 1 should remain anonymous and redact certain IP addresses. In another embodiment, entity 1 may include its identifier (e.g., include the <entity> element) and the security sharing system may anonymize the attack data by not indicating to other entities with which the attack data is shared that the attack data came from entity 1. In this way, data that is received by the security sharing system may still determine reliability of information based on source of information, even without sharing the exact identity of the source with other entities.
[0106] In another example, a security attack may be a previously illustrated Trojan attack with four originating IP addresses. Similar to the previous example, an entity may send attack data 806 to the security sharing system and/or the security sharing system may modify the attack data 806 to output modified attack data 808. Unlike modified attack data 804, which may be anonymous, modified attack data 808 may contain the source entity of the attack data, which may correspond to the preferences illustrated with reference to the sharing table of FIG. 8A . For example, the sharing table of FIG. 8A specified that entity 2 should not be anonymous. Similar to modified attack data 804, modified attack data 808 does not contain the internal IP addresses of entity 2, which may correspond to the preferences illustrated with reference to the sharing table of FIG. 8A .
[0107] FIG. 8C illustrates example attack data and rulesets based on multiple security attacks, according to some embodiments of the present disclosure. For example, attack data 810A, 810B, 810C correspond to three separate beaconing attacks against different entities may be received by the security sharing system. While in this example the attack data 810 are received from three separate entities (entity 1, entity 2, and entity 3), in other embodiments the attack data used to form a ruleset may all be received from the same entity.
[0108] The security system may generate ruleset 812 and ruleset 814, such as in the manner discussed with reference to FIG. 6 and/or FIG. 7 , based on the attack data 810. The security sharing system may interpret and/or redact the attack data, such as in accordance with redaction rules (e.g., FIG. 8A ). For example, each of the attack data 810 includes internal IP addresses (in the <internal_ip_addresses> element) and source entity data (in the <entity> element). However, the ruleset 812 may comprise more abstract characteristics of the attack data 810, such as the type of attack (in the <type> element) and/or the frequency of the attack for beaconing attacks (in the <frequency> element), while excluding specific attack characteristics such as internal IP addresses (e.g., the <internal_ip_addresses> element is removed) and source entity data (e.g., the <entity> element is removed). Another example of a ruleset is examining the method and/or behavior of attackers over time. For example, some hacking groups may only work during certain hours, thus may be more likely to attack during those time periods. These groups may mask the IPs they use, such that merely using the attack data may not be enough. A ruleset may allow entities to track malicious patterns even as the attack data itself changes. The ruleset 812 may also comprise actions to perform, such as, but not limited to, detecting attacks and/or alerting of suspicious behavior (in the <action> element). The security sharing system may interpret the attack data 810 to generate ruleset 814 to block malicious IP addresses. In the example, ruleset 814 comprises alerting and blocking actions (in the <action> element). Thus, an entity enabling ruleset 814 may automatically block malicious IP addresses (in the <block_ip_addresses> element). In some embodiments, attack data may be automatically interpreted to generate a ruleset to block a range of IP addresses.
[0109] FIG. 8D illustrates example rulesets 820 and 822 in a format comprising code instructions, according to some embodiments of the present disclosure. In some embodiments, rulesets may be complex enough such that their expression may be in a format comprising code instructions. The executable code instructions shown in FIG. 8D are illustrative pseudocode and, thus, may not correspond to any specific programming language or be executable in the format shown. Executable code that performs the functions outlined in rulesets 820 and 822 may be provided in any available programming language.
[0110] Example ruleset 820 comprises code configured to detect security attacks for globetrotter logins. In a globetrotter security attack, there may be Virtual Private Network (“VPN”) logins from locations that would be physically impossible for a single person to make. For example, logins by the same person from the United States and India within minutes and/or one hour of each other. Thus, the ruleset 820 includes code instructions that cause an entity's computing device and/or the security sharing system to find all VPN logins for a particular person. The VPN logins may then be sorted by time of login. The VPN logins may be iterated through by a for loop, which may first calculate the time since the previous login, the physical distance between locations of two previous logins, and the travel speed required for a person to complete both logins. If the speed is over a threshold then a cluster may be constructed, such as by using the IP addresses and or identity of the person as seeds (see the Cluster references), and an alert may be added to a queue. For example, if the speed threshold was set to a speed, such as, 2,000 miles per hour, then an alert would appear if there was a login between the United States and Japan within an hour of each other. Thus, the ruleset 820 may enable the detection of globetrotter security attacks.
[0111] Example ruleset 822 comprises code to detect security attacks for fake user-agent logins. In a fake user-agent security attack, malware may provide fake and/or made up user-agent logins and/or strings to gain access to an entity's network and/or resources. For example, the code instructions shown in 822 cause an entity's computing device and/or the security sharing system to receive a user-agent string for a login and find all of the user-agent strings on the network. If the user-agent string is not already on the network and/or is a new user-agent string, then a cluster may be constructed (see the Cluster references) and an alert may be added to a queue. Thus, the ruleset 822 may enable the detection of fake user-agent security attacks.
[0112] In some embodiments, rulesets may comprise various formats and/or combinations of formats. For example, a beaconing ruleset may comprise executable code instructions and/or XML documents. In the beaconing example, the executable code instructions may comprise programming logic to detect beaconing attacks. The XML documents may comprise parameters and/or configurations. In the beaconing example, the XML documents may comprise parameters for checking different beaconing frequencies, e.g., every hour and/or every twenty-four hours. Thus, both the code instructions and the parameterized format, such as, but not limited to, XML, may be shared through the security sharing system.
[0113] Example User Interface
[0114] FIGS. 9A and 9B illustrate example user interfaces of the security sharing system, according to some embodiments of the present disclosure. In some embodiments, the user interfaces described below may be displayed in any suitable computer system and/or application, for example, in a web browser window and/or a standalone software application, among others. Additionally, the functionality and/or user interfaces of the system as shown in FIGS. 9A and/or 9B may be implemented in one or more computer processors and/or computing devices, as is described with reference to FIG. 10 .
[0115] Referring to FIG. 9A , the example user interface 902 comprises security alerts 910, 920A, 920B, priority alert window 930, attacks window 940, and/or rulesets window 950.
[0116] In operation, a human operator may view security attack alerts through the user interface 902. For example, when an entity shares security attack data with the entity viewing the user interface 902, a security attack alert 910 may appear. The security attack alert 910 may display a risk/importance level, and/or “from” entity indicating the source of the security attack alert. The security attack alert 910 may also display details of the alert and/or a link to the details. For example, security attack alert details may comprise the IP address source of the attack, and/or the type of attack, e.g., beaconing, DOS attack, etc.
[0117] In the example of FIG. 9A , a human operator may also view ruleset alerts through the user interface. For example, when a ruleset is shared in the security sharing system, ruleset alerts, 920A and 920B may appear. Ruleset alerts 920A and 920B may be similar to security attack alert 910, but instead of security attack details, ruleset alerts 920A and 920B may display ruleset details. In the beaconing example, ruleset details may comprise an IP range to which beacons are sent and/or a frequency that a beacon is sent to an external computing device. The ruleset alerts windows 920 may have an “enable” button that activates the ruleset as previously described.
[0118] In some embodiments, the security attack alert 910 may have an “enable” button that activates the security attack alert similar to activating a ruleset. For example, enabling a security attack alert automatically sets alerts and/or detection of the malicious IP addresses specified in the security attack alert. The security sharing system may automatically generate a ruleset from the security attack alert when the security attack alert is enabled. In some embodiments, generation of the ruleset in response to activation of the security attack alert may occur without notification to the human operator. Thus, enabling a security attack alert may be a shortcut for generating a ruleset.
[0119] The priority alert window 930 may display entities that will receive a “high” and/or “important” priority level when those entities share attack data and/or rulesets with the particular entity viewing/operating the user interface 902. For example, in the priority alert window 930, entities 1, 5, and 10 are selected for priority alerts. In this example, the priority alert window 930 comprises an “edit” button to add and/or remove entities for priority alerts.
[0120] The attacks window 940 may display the security attacks that have been identified for the particular entity operating/viewing the user interface 902. For example, the attacks window 940 displays security attacks 1, 2, and 4. The attacks window 940 may be populated automatically by the security sharing system and/or by the entity. In the example attacks window 940, there is a “create” button, which may allow the human operator to add a security attack. The attacks window 940 may have a “share” button, which may allow the human operator to select one or more security attacks for sharing through the security sharing system, and may have options to share the security attack data, modified security attack data, and/or a ruleset regarding the security attack (possibly in connection with other security attacks). The attacks window 940 may also have an “edit” button, which may allow the human operator to edit and/or modify a security attack. For example, a security attack 1 may be a DDOS attack with two originating IP addresses for the attack, and security attack 1 may be edited to add and/or remove IP addresses. Alternatively, such updates may be performed automatically by the entity and/or the security sharing system based on predetermined rules for modifying attack data.
[0121] The rulesets window 950 may display the rulesets from an entity. The rulesets window 950 may be operated similar to the attacks window 940, except the rulesets window may be configured to display, create, and/or modify rulesets instead of security attacks. For example, ruleset 1 may be a beaconing ruleset with a frequency of twenty-four hours, and the example ruleset may be edited to a beaconing frequency of forty eight hours. Rulesets may be selected to display further information regarding the rulesets, such as the various rules of the ruleset, one or more entities having attack data on which the ruleset was based, other entities with which the ruleset has been shared (and/or is available for sharing), and/or entities that have actually implemented security measures in view of the ruleset, for example.
[0122] Referring to FIG. 9B , the example user interface 960 comprises a search box 964, an object display area 966, and/or a menu bar 962. A human operator by typing and/or entering data into the search box 964 may load, lookup, and/or retrieve one or more objects. The user interface 960 may display security attack data, rulesets, and/or other security information in clusters, which may correspond to the systems, methods, and/or techniques disclosed in the Ontology and/or Cluster references.
[0123] For example, by typing the name of a type of security attack, such as “beacon,” an attack data object 968 may be displayed in the object display area 966. The other objects 970 (including objects 970A, 970B, and/or 970C) may be displayed automatically and/or after user interaction by the human operator with the person object 410. The objects 970 may correspond to related security attacks, resources of the entity that have been attacked, and/or any other data object in the security sharing system. The one or more links 972 (including links 972A, 972B, and/or 972C) may display relationships between the attack data object 968 and related objects 970.
[0124] In addition to visually searching and/or showing data objects and/or relationships between data objects, the user interface 960 may allow various other manipulations. For example, data objects may be inspected (e.g., by viewing properties and/or associated data of the data objects), filtered (e.g., narrowing the universe of objects into sets and subsets by properties or relationships), and statistically aggregated (e.g., numerically summarized based on summarization criteria), among other operations and visualizations.
[0125] Implementation Mechanisms
[0126] The various computing device(s) discussed herein, such as the entities 110 and/or security sharing system 100, are generally controlled and coordinated by operating system software, such as, but not limited to, iOS, Android, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, Macintosh OS X, VxWorks, or other compatible operating systems. In other embodiments, the computing devices may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things. The security sharing system 100 may be hosted and/or executed on one or more computing devices with one or more hardware processors and with any of the previously mentioned operating system software.
[0127] FIG. 10 is a block diagram that illustrates example components of the security sharing system 100. While FIG. 10 refers to the security sharing system 100, any of the other computing devices discussed herein may have some or all of the same or similar components.
[0128] The security sharing 100 may execute software, e.g., standalone software applications, applications within browsers, network applications, etc., whether by the particular application, the operating system, or otherwise. Any of the systems discussed herein may be performed by the security sharing 100 and/or a similar computing system having some or all of the components discussed with reference to FIG. 10 .
[0129] The security sharing system 100 includes a bus 1002 or other communication mechanism for communicating information, and a hardware processor, or multiple processors, 1004 coupled with bus 1002 for processing information. Hardware processor(s) 1004 may be, for example, one or more general purpose microprocessors.
[0130] The security sharing system 100 also includes a main memory 1006, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 1002 for storing information and instructions to be executed by processor(s) 1004. Main memory 1006 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor(s) 1004. Such instructions, when stored in storage media accessible to processor(s) 1004, render the security sharing system 100 into a special-purpose machine that is customized to perform the operations specified in the instructions. Such instructions, as executed by hardware processors, may implement the methods and systems described herein for sharing security information.
[0131] The security sharing system 100 further includes a read only memory (ROM) 1008 or other static storage device coupled to bus 1002 for storing static information and instructions for processor(s) 1004. A storage device 1010, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 1002 for storing information and instructions. The rule unit 530, attack modification unit 540, ruleset data store 532 and/or attack data store 542 of FIG. 5 may be stored on the main memory 1006 and/or the storage device 1010.
[0132] In some embodiments, the ruleset data store 532 of FIG. 5 is a file system, relational database such as, but not limited to, MySql, Oracle, Sybase, or DB2, and/or a distributed in memory caching system such as, but not limited to, Memcache, Memcached, or Java Caching System. The attack data store 542 of FIG. 5 may be a similar file system, relational database and/or distributed in memory caching system as the ruleset data store 532.
[0133] The security sharing system 100 may be coupled via bus 1002 to a display 1012, such as a cathode ray tube (CRT) or LCD display or touch screen, for displaying information to a computer user. An input device 1014 is coupled to bus 1002 for communicating information and command selections to processor 504. One type of input device 1014 is a keyboard including alphanumeric and other keys. Another type of input device 1014 is a touch screen. Another type of user input device is cursor control 1016, such as a mouse, a trackball, a touch screen, or cursor direction keys for communicating direction information and command selections to processor 1004 and for controlling cursor movement on display 1012. This input device may have two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.
[0134] The security sharing system 100 may include a user interface unit to implement a GUI, for example, FIG. 9A and/or FIG. 9B , which may be stored in a mass storage device as executable software codes that are executed by the computing device(s). This and other units may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.
[0135] In general, the word “instructions,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software units, possibly having entry and exit points, written in a programming language, such as, but not limited to, Java, Lua, C, C++, or C#. A software unit may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, but not limited to, BASIC, Perl, or Python. It will be appreciated that software units may be callable from other units or from themselves, and/or may be invoked in response to detected events or interrupts. Software units configured for execution on computing devices by their hardware processor(s) may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and may be originally stored in a compressed or installable format that requires installation, decompression or decryption prior to execution). Such software code may be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. Generally, the instructions described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.
[0136] The security sharing system 100, or components of it, such as the rule unit 530 and/or the attack modification unit 540 of FIG. 5 , may be programmed, via executable code instructions, in a programming language.
[0137] The term “non-transitory media,” and similar terms, as used herein refers to any media that store data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media may comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 1010. Volatile media includes dynamic memory, such as main memory 1006. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, and networked versions of the same.
[0138] Non-transitory media is distinct from but may be used in conjunction with transmission media. Transmission media participates in transferring information between nontransitory media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 1002. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
[0139] Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor(s) 1004 for execution. For example, the instructions may initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer may load the instructions into its dynamic memory and send the instructions over a telephone or cable line using a modem. A modem local to the security sharing system 100 may receive the data on the telephone or cable line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 1002. Bus 1002 carries the data to main memory 1006, from which the processor(s) 1004 retrieves and executes the instructions. The instructions received by main memory 1006 may retrieve and execute the instructions. The instructions received by main memory 1006 may optionally be stored on storage device 1010 either before or after execution by processor(s) 1004.
[0140] The security sharing system 100 also includes a communication interface 1018 coupled to bus 1002. Communication interface 1018 provides a two-way data communication coupling to a network link 1020 that is connected to a local network 1022. For example, communication interface 1018 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 1018 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to be communicated with a WAN). Wireless links may also be implemented. In any such implementation, communication interface 1018 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
[0141] Network link 1020 typically provides data communication through one or more networks to other data devices. For example, network link 1020 may provide a connection through local network 1022 to a host computer 1024 or to data equipment operated by an Internet Service Provider (ISP) 1026. ISP 1026 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 1028. Local network 1022 and Internet 1028 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 1020 and through communication interface 1018, which carry the digital data to and from the security sharing system 100, are example forms of transmission media.
[0142] The security sharing system 100 can send messages and receive data, including program code, through the network(s), network link 1020 and communication interface 1018. In the Internet example, a server 1030 might transmit a requested code for an application program through Internet 1028, ISP 1026, local network 1022 and communication interface 1018.
[0143] The received code may be executed by processor(s) 1004 as it is received, and/or stored in storage device 1010, or other non-volatile storage for later execution.
[0144] Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code instructions executed by one or more computer systems or computer processors comprising computer hardware. The processes and algorithms may be implemented partially or wholly in application-specific circuitry.
[0145] The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and subcombinations are intended to fall within the scope of this disclosure. In addition, certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.
[0146] Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.
[0147] Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing units, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art.
[0148] It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure. The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated. The scope of the invention should therefore be construed in accordance with the appended claims and any equivalents thereof.
Claims
What is claimed is:
1. A system for sharing security information, the system comprising:
a plurality of entities, wherein each entity of the plurality of entities comprises a network of computing devices; and
one or more computing devices programmed, via executable code instructions, to:
share a first plurality of security attack data, the first plurality of security attack data comprising information regarding one or more first security attacks;
receive a ruleset from a first entity of the plurality of entities, the ruleset comprising instructions selectably applicable by an entity of the plurality of entities to detect one or more security attacks, wherein the ruleset is generated by the first entity, and wherein the ruleset is associated with the first plurality of security attack data; and
apply the ruleset at a second entity of the plurality of entities to identify malicious behavior of a potential or actual security attack, wherein applying the ruleset comprises:
identifying a plurality of network communications associated with a network of computing devices of the second entity, wherein the plurality of network communications are from the network of computing devices of the second entity to an external computing device;
identifying an elapsed time between at least two communications of the plurality of network communications; and
determining that the elapsed time is within a predetermined time interval, wherein said determination indicates beaconing behavior.
2. The system of claim 1, wherein the ruleset accesses one or more data objects associated with the second entity, the one or more data objects comprising the plurality of network communications.
3. The system of claim 1, wherein the one or more computing devices is further programmed, via executable code instructions, to:
provide an alert indicating the potential or actual security attack.
4. The system of claim 3, wherein the one or more computing devices is further programmed, via executable code instructions, to:
identify a computing device from the network of computing devices of the second entity, wherein the computing device is the source of at least one communication from the plurality of network communications;
identify potentially malicious code on the computing device, wherein the potentially malicious code sent the at least one communication; and
at least one of: removing or quarantining the potentially malicious code.
5. The system of claim 1, wherein application of the ruleset at the second entity further comprises identifying an external IP address associated with the potential or actual security attack.
6. The system of claim 5, wherein the one or more computing devices is further programmed, via executable code instructions, to:
block one or more communications from the external IP address to a computing device of the second entity.
7. The system of claim 1, wherein the one or more computing devices is further programmed, via executable code instructions, to:
access second security attack data associated with a second potential or actual security attack directed at the second entity;
access redaction rules of the second entity, wherein the redaction rules are associated with at least one of: internal IP addresses, hostnames, or other identifying information of a network of computing devices of the second entity;
generate modified security attack data from the second security attack data by removing any matching internal IP addresses, hostnames, or other identifying information as indicated by the redaction rules; and
share the modified security attack data with a third entity.
8. Non-transitory computer storage comprising instructions for causing one or more computing devices to perform operations comprising:
sharing a first plurality of security attack data, the first plurality of security attack data comprising information regarding one or more first security attacks;
receiving a ruleset from a first entity of a plurality of entities, the ruleset comprising instructions selectably applicable by an entity of the plurality of entities to detect one or more security attacks, wherein the ruleset is generated by the first entity, and wherein the ruleset is associated with the first plurality of security attack data, and wherein each entity of the plurality of entities comprises a network of computing devices; and
applying the ruleset at a second entity of the plurality of entities to identify malicious behavior of a potential or actual security attack, wherein applying the ruleset comprises:
identifying a plurality of network communications associated with a network of computing devices of the second entity, wherein the plurality of network communications are from the network of computing devices of the second entity to an external computing device;
identifying an elapsed time between at least two communications of the plurality of network communications; and
determining that the elapsed time is within a predetermined time interval, wherein said determination indicates beaconing behavior.
9. The non-transitory computer storage of claim 8, wherein the ruleset accesses one or more data objects associated with the second entity, the one or more data objects comprising the plurality of network communications.
10. The non-transitory computer storage of claim 8, wherein the operations further comprise:
providing an alert indicating the potential or actual security attack.
11. The non-transitory computer storage of claim 10, wherein the operations further comprise:
accessing second security attack data associated with a second potential or actual security attack directed at the second entity;
accessing redaction rules of the second entity, wherein the redaction rules are associated with at least one of: internal IP addresses, hostnames, or other identifying information of a network of computing devices of the second entity;
generating modified security attack data from the second security attack data by removing any matching internal IP addresses, hostnames, or other identifying information as indicated by the redaction rules; and
sharing the modified security attack data with a third entity.
12. The non-transitory computer storage of claim 8, wherein applying the ruleset at the second entity further comprises identifying an external IP address associated with the potential or actual security attack.
13. The non-transitory computer storage of claim 12, wherein the operations further comprise:
blocking one or more communications from the external IP address to a computing device of the second entity.
14. A computer implemented method comprising:
receiving a ruleset at a second entity of a plurality of entities, wherein the ruleset comprises instructions selectably applicable by an entity of the plurality of entities to detect one or more security attacks, wherein the ruleset was generated by a first entity of the plurality of entities, wherein the ruleset is associated with a first plurality of security attack data, and wherein each entity of the plurality of entities comprises a network of computing devices; and
applying the ruleset at the second entity to identify a potential or actual security attack at the second entity, wherein applying the ruleset comprises:
identifying a plurality of network communications associated with a network of computing devices of the second entity, wherein the plurality of network communications are from the network of computing devices of the second entity to an external computing device;
identifying an elapsed time between at least two communications of the plurality of network communications; and
determining that the elapsed time is within a predetermined time interval, wherein said determination indicates beaconing behavior.
15. The computer implemented method of claim 14, further comprising:
providing an alert indicating the potential or actual security attack.
16. The computer implemented method of claim 14, wherein applying the ruleset at the second entity further comprises identifying an external IP address associated with the potential or actual security attack.
17. The computer implemented method of claim 16, further comprising blocking one or more communications from the external IP address to a computing device of the second entity.
18. The computer implemented method of claim 16, wherein the external IP address is associated with the external computing device.
19. The computer implemented method of claim 18, further comprising:
identifying a computing device from the network of computing devices of the second entity, wherein the computing device is the source of at least one communication from the plurality of network communications;
identifying potentially malicious code on the computing device, wherein the potentially malicious code sent the at least one communication; and
at least one of: removing or quarantining the potentially malicious code.
20. The computer implemented method of claim 14, further comprising:
accessing second security attack data associated with a second potential or actual security attack directed at the second entity;
accessing redaction rules of the second entity, wherein the redaction rules are associated with at least one of: internal IP addresses, hostnames, or other identifying information of a network of computing devices of the second entity;
generating modified security attack data from the second security attack data by removing any matching internal IP addresses, hostnames, or other identifying information as indicated by the redaction rules; and
sharing the modified security attack data with a third entity.
Patent Citations (663)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5109399(A) | 1992-04-01 | Thompson | Applicant |
| US5329108(A) | 1994-07-01 | Lamoure | Applicant |
| US5548749(A) | 1996-08-01 | Kroenke et al. | Applicant |
| US5632009(A) | 1997-05-01 | Rao et al. | Applicant |
| US5670987(A) | 1997-09-01 | Doi et al. | Applicant |
| US5708828(A) | 1998-01-01 | Coleman | Applicant |
| US5765171(A) | 1998-06-01 | Gehani et al. | Applicant |
| US5781704(A) | 1998-07-01 | Rossmo | Applicant |
| US5845300(A) | 1998-12-01 | Comer | Applicant |
| US5870761(A) | 1999-02-01 | Demers et al. | Applicant |
| US6057757(A) | 2000-05-01 | Arrowsmith et al. | Applicant |
| US6091956(A) | 2000-07-01 | Hollenberg | Applicant |
| US6098078(A) | 2000-08-01 | Gehani et al. | Applicant |
| US6161098(A) | 2000-12-01 | Wallman | Applicant |
| US6190053(B1) | 2001-02-01 | Stahlecker et al. | Applicant |
| US6202085(B1) | 2001-03-01 | Benson et al. | Applicant |
| US6216140(B1) | 2001-04-01 | Kramer | Applicant |
| US6219053(B1) | 2001-04-01 | Tachibana et al. | Applicant |
| US6232971(B1) | 2001-05-01 | Haynes | Applicant |
| US6240414(B1) | 2001-05-01 | Beizer et al. | Applicant |
| US6247019(B1) | 2001-06-01 | Davies | Applicant |
| US6279018(B1) | 2001-08-01 | Kudrolli et al. | Applicant |
| US6289338(B1) | 2001-09-01 | Stoffel et al. | Applicant |
| US6317754(B1) | 2001-11-01 | Peng | Applicant |
| US6341310(B1) | 2002-01-01 | Leshem et al. | Applicant |
| US6369835(B1) | 2002-04-01 | Lin | Applicant |
| US6374252(B1) | 2002-04-01 | Althoff et al. | Applicant |
| US6456997(B1) | 2002-09-01 | Shukla | Applicant |
| US6463404(B1) | 2002-10-01 | Appleby | Applicant |
| US6505196(B2) | 2003-01-01 | Drucker et al. | Applicant |
| US6523019(B1) | 2003-02-01 | Borthwick | Applicant |
| US6523172(B1) | 2003-02-01 | Martinez-Guerra et al. | Applicant |
| US6539381(B1) | 2003-03-01 | Prasad et al. | Applicant |
| US6549944(B1) | 2003-04-01 | Weinberg et al. | Applicant |
| US6560620(B1) | 2003-05-01 | Ching | Applicant |
| US6567936(B1) | 2003-05-01 | Yang et al. | Applicant |
| US6581068(B1) | 2003-06-01 | Bensoussan et al. | Applicant |
| US6594672(B1) | 2003-07-01 | Lampson et al. | Applicant |
| US6631496(B1) | 2003-10-01 | Li et al. | Applicant |
| US6640231(B1) | 2003-10-01 | Andersen et al. | Applicant |
| US6642945(B1) | 2003-11-01 | Sharpe | Applicant |
| US6714936(B1) | 2004-03-01 | Nevin, III | Applicant |
| US6748481(B1) | 2004-06-01 | Parry et al. | Applicant |
| US6775675(B1) | 2004-08-01 | Nwabueze et al. | Applicant |
| US6807569(B1) | 2004-10-01 | Bhimani et al. | Applicant |
| US6816941(B1) | 2004-11-01 | Carlson et al. | Applicant |
| US6828920(B2) | 2004-12-01 | Owen et al. | Applicant |
| US6839745(B1) | 2005-01-01 | Dingari et al. | Applicant |
| US6877137(B1) | 2005-04-01 | Rivette et al. | Applicant |
| US6938034(B1) | 2005-08-01 | Kraft et al. | Applicant |
| US6976210(B1) | 2005-12-01 | Silva et al. | Applicant |
| US6980984(B1) | 2005-12-01 | Huffman et al. | Applicant |
| US6985950(B1) | 2006-01-01 | Hanson et al. | Applicant |
| US7027974(B1) | 2006-04-01 | Busch et al. | Applicant |
| US7036085(B2) | 2006-04-01 | Barros | Applicant |
| US7043702(B2) | 2006-05-01 | Chi et al. | Applicant |
| US7055110(B2) | 2006-05-01 | Kupka et al. | Applicant |
| US7072911(B1) | 2006-07-01 | Doman | Applicant |
| US7139800(B2) | 2006-11-01 | Bellotti et al. | Applicant |
| US7158878(B2) | 2007-01-01 | Rasmussen et al. | Applicant |
| US7162475(B2) | 2007-01-01 | Ackerman | Applicant |
| US7167877(B2) | 2007-01-01 | Balogh et al. | Applicant |
| US7168039(B2) | 2007-01-01 | Bertram | Applicant |
| US7171427(B2) | 2007-01-01 | Witkowski et al. | Applicant |
| US7237192(B1) | 2007-06-01 | Stephenson et al. | Applicant |
| US7240330(B2) | 2007-07-01 | Fairweather | Applicant |
| US7269786(B1) | 2007-09-01 | Malloy et al. | Applicant |
| US7278105(B1) | 2007-10-01 | Kitts | Applicant |
| US7290698(B2) | 2007-11-01 | Poslinski et al. | Applicant |
| US7333998(B2) | 2008-02-01 | Heckerman et al. | Applicant |
| US7370047(B2) | 2008-05-01 | Gorman | Applicant |
| US7373669(B2) | 2008-05-01 | Eisen | Applicant |
| US7379811(B2) | 2008-05-01 | Rasmussen et al. | Applicant |
| US7379903(B2) | 2008-05-01 | Caballero et al. | Applicant |
| US7418431(B1) | 2008-08-01 | Nies et al. | Applicant |
| US7426654(B2) | 2008-09-01 | Adams et al. | Applicant |
| US7437664(B2) | 2008-10-01 | Borson | Applicant |
| US7451397(B2) | 2008-11-01 | Weber et al. | Applicant |
| US7454466(B2) | 2008-11-01 | Bellotti et al. | Applicant |
| US7467375(B2) | 2008-12-01 | Tondreau et al. | Applicant |
| US7487139(B2) | 2009-02-01 | Fraleigh et al. | Applicant |
| US7502786(B2) | 2009-03-01 | Liu et al. | Applicant |
| US7525422(B2) | 2009-04-01 | Bishop et al. | Applicant |
| US7529727(B2) | 2009-05-01 | Arning et al. | Applicant |
| US7529734(B2) | 2009-05-01 | Dirisala | Applicant |
| US7533069(B2) | 2009-05-01 | Fairweather | Applicant |
| US7546245(B2) | 2009-06-01 | Surpin et al. | Applicant |
| US7558677(B2) | 2009-07-01 | Jones | Applicant |
| US7574409(B2) | 2009-08-01 | Patinkin | Applicant |
| US7574428(B2) | 2009-08-01 | Leiserowitz et al. | Applicant |
| US7579965(B2) | 2009-08-01 | Bucholz | Applicant |
| US7596285(B2) | 2009-09-01 | Brown et al. | Applicant |
| US7596608(B2) | 2009-09-01 | Alexander et al. | Applicant |
| US7614006(B2) | 2009-11-01 | Molander | Applicant |
| US7617232(B2) | 2009-11-01 | Gabbert et al. | Applicant |
| US7620628(B2) | 2009-11-01 | Kapur et al. | Applicant |
| US7627812(B2) | 2009-12-01 | Chamberlain et al. | Applicant |
| US7634717(B2) | 2009-12-01 | Chamberlain et al. | Applicant |
| US7640173(B2) | 2009-12-01 | Surpin et al. | Applicant |
| US7676788(B1) | 2010-03-01 | Ousterhout et al. | Applicant |
| US7685083(B2) | 2010-03-01 | Fairweather | Applicant |
| US7703021(B1) | 2010-04-01 | Flam | Applicant |
| US7712049(B2) | 2010-05-01 | Williams et al. | Applicant |
| US7716067(B2) | 2010-05-01 | Surpin et al. | Applicant |
| US7716077(B1) | 2010-05-01 | Mikurak | Applicant |
| US7725547(B2) | 2010-05-01 | Albertson et al. | Applicant |
| US7730396(B2) | 2010-06-01 | Chidlovskii et al. | Applicant |
| US7770100(B2) | 2010-08-01 | Chamberlain et al. | Applicant |
| US7783658(B1) | 2010-08-01 | Bayliss | Applicant |
| US7792664(B1) | 2010-09-01 | Crawford et al. | Applicant |
| US7805457(B1) | 2010-09-01 | Viola et al. | Applicant |
| US7809703(B2) | 2010-10-01 | Balabhadrapatruni et al. | Applicant |
| US7813937(B1) | 2010-10-01 | Pathria et al. | Applicant |
| US7814102(B2) | 2010-10-01 | Miller et al. | Applicant |
| US7818297(B2) | 2010-10-01 | Peleg et al. | Applicant |
| US7818658(B2) | 2010-10-01 | Chen | Applicant |
| US7827045(B2) | 2010-11-01 | Madill et al. | Applicant |
| US7877421(B2) | 2011-01-01 | Berger et al. | Applicant |
| US7894984(B2) | 2011-02-01 | Rasmussen et al. | Applicant |
| US7899611(B2) | 2011-03-01 | Downs et al. | Applicant |
| US7917376(B2) | 2011-03-01 | Bellin et al. | Applicant |
| US7920963(B2) | 2011-04-01 | Jouline et al. | Applicant |
| US7933862(B2) | 2011-04-01 | Chamberlain et al. | Applicant |
| US7962281(B2) | 2011-06-01 | Rasmussen et al. | Applicant |
| US7962495(B2) | 2011-06-01 | Jain et al. | Applicant |
| US7962848(B2) | 2011-06-01 | Bertram | Applicant |
| US7970240(B1) | 2011-06-01 | Chao et al. | Applicant |
| US7971150(B2) | 2011-06-01 | Raskutti et al. | Applicant |
| US8001465(B2) | 2011-08-01 | Kudrolli et al. | Applicant |
| US8001482(B2) | 2011-08-01 | Bhattiprolu et al. | Applicant |
| US8010545(B2) | 2011-08-01 | Stefik et al. | Applicant |
| US8010886(B2) | 2011-08-01 | Gusmorino et al. | Applicant |
| US8015151(B2) | 2011-09-01 | Lier et al. | Applicant |
| US8015487(B2) | 2011-09-01 | Roy et al. | Applicant |
| US8019709(B2) | 2011-09-01 | Norton et al. | Applicant |
| US8024778(B2) | 2011-09-01 | Cash et al. | Applicant |
| US8036632(B1) | 2011-10-01 | Cona et al. | Applicant |
| US8046362(B2) | 2011-10-01 | Bayliss | Applicant |
| US8082172(B2) | 2011-12-01 | Chao et al. | Applicant |
| US8103543(B1) | 2012-01-01 | Zwicky | Applicant |
| US8117022(B2) | 2012-02-01 | Linker | Applicant |
| US8132149(B2) | 2012-03-01 | Shenfield et al. | Applicant |
| US8134457(B2) | 2012-03-01 | Velipasalar et al. | Applicant |
| US8135679(B2) | 2012-03-01 | Bayliss | Applicant |
| US8135719(B2) | 2012-03-01 | Bayliss | Applicant |
| US8145703(B2) | 2012-03-01 | Frishert et al. | Applicant |
| US8196184(B2) | 2012-06-01 | Amirov et al. | Applicant |
| US8214232(B2) | 2012-07-01 | Tyler et al. | Applicant |
| US8214361(B1) | 2012-07-01 | Sandler et al. | Applicant |
| US8214764(B2) | 2012-07-01 | Gemmell et al. | Applicant |
| US8225201(B2) | 2012-07-01 | Michael | Applicant |
| US8229947(B2) | 2012-07-01 | Fujinaga | Applicant |
| US8230333(B2) | 2012-07-01 | Decherd et al. | Applicant |
| US8239668(B1) | 2012-08-01 | Chen et al. | Applicant |
| US8266168(B2) | 2012-09-01 | Bayliss | Applicant |
| US8271948(B2) | 2012-09-01 | Talozi et al. | Applicant |
| US8280880(B1) | 2012-10-01 | Aymeloglu et al. | Applicant |
| US8290942(B2) | 2012-10-01 | Jones et al. | Applicant |
| US8290990(B2) | 2012-10-01 | Drath et al. | Applicant |
| US8301464(B1) | 2012-10-01 | Cave et al. | Applicant |
| US8301904(B1) | 2012-10-01 | Gryaznov | Applicant |
| US8312367(B2) | 2012-11-01 | Foster | Applicant |
| US8312546(B2) | 2012-11-01 | Alme | Applicant |
| US8316060(B1) | 2012-11-01 | Snyder et al. | Applicant |
| US8321943(B1) | 2012-11-01 | Walters et al. | Applicant |
| US8347398(B1) | 2013-01-01 | Weber | Applicant |
| US8352881(B2) | 2013-01-01 | Champion et al. | Applicant |
| US8368695(B2) | 2013-02-01 | Howell et al. | Applicant |
| US8380659(B2) | 2013-02-01 | Zunger | Applicant |
| US8397171(B2) | 2013-03-01 | Klassen et al. | Applicant |
| US8411046(B2) | 2013-04-01 | Kruzeniski et al. | Applicant |
| US8412707(B1) | 2013-04-01 | Mianji | Applicant |
| US8442940(B1) | 2013-05-01 | Faletti et al. | Applicant |
| US8447674(B2) | 2013-05-01 | Choudhuri et al. | Applicant |
| US8447722(B1) | 2013-05-01 | Ahuja et al. | Applicant |
| US8452790(B1) | 2013-05-01 | Mianji | Applicant |
| US8463036(B1) | 2013-06-01 | Ramesh et al. | Applicant |
| US8484168(B2) | 2013-07-01 | Bayliss | Applicant |
| US8489331(B2) | 2013-07-01 | Kopf et al. | Applicant |
| US8489623(B2) | 2013-07-01 | Jain et al. | Applicant |
| US8489641(B1) | 2013-07-01 | Seefeld et al. | Applicant |
| US8495077(B2) | 2013-07-01 | Bayliss | Applicant |
| US8498969(B2) | 2013-07-01 | Bayliss | Applicant |
| US8498984(B1) | 2013-07-01 | Hwang et al. | Applicant |
| US8514082(B2) | 2013-08-01 | Cova et al. | Applicant |
| US8515207(B2) | 2013-08-01 | Chau | Applicant |
| US8515912(B2) | 2013-08-01 | Garrod et al. | Applicant |
| US8527461(B2) | 2013-09-01 | Ducott, III et al. | Applicant |
| US8554579(B2) | 2013-10-01 | Tribble et al. | Applicant |
| US8554653(B2) | 2013-10-01 | Falkenborg et al. | Applicant |
| US8554709(B2) | 2013-10-01 | Goodson et al. | Applicant |
| US8577911(B1) | 2013-11-01 | Stepinski et al. | Applicant |
| US8578500(B2) | 2013-11-01 | Long | Applicant |
| US8589273(B2) | 2013-11-01 | Creeden et al. | Applicant |
| US8600872(B1) | 2013-12-01 | Yan | Applicant |
| US8620641(B2) | 2013-12-01 | Farnsworth et al. | Applicant |
| US8639522(B2) | 2014-01-01 | Pathria et al. | Applicant |
| US8646080(B2) | 2014-02-01 | Williamson et al. | Applicant |
| US8676597(B2) | 2014-03-01 | Buehler et al. | Applicant |
| US8676857(B1) | 2014-03-01 | Adams et al. | Applicant |
| US8688749(B1) | 2014-04-01 | Ducott, III et al. | Applicant |
| US8689108(B1) | 2014-04-01 | Duffield et al. | Applicant |
| US8689182(B2) | 2014-04-01 | Leithead et al. | Applicant |
| US8707185(B2) | 2014-04-01 | Robinson et al. | Applicant |
| US8713467(B1) | 2014-04-01 | Goldenberg et al. | Applicant |
| US8726379(B1) | 2014-05-01 | Stiansen et al. | Applicant |
| US8739278(B2) | 2014-05-01 | Varghese | Applicant |
| US8742934(B1) | 2014-06-01 | Sarpy, Sr. et al. | Applicant |
| US8745516(B2) | 2014-06-01 | Mason et al. | Applicant |
| US8756224(B2) | 2014-06-01 | Dassa et al. | Applicant |
| US8781169(B2) | 2014-07-01 | Jackson et al. | Applicant |
| US8788405(B1) | 2014-07-01 | Sprague et al. | Applicant |
| US8788407(B1) | 2014-07-01 | Singh et al. | Applicant |
| US8799799(B1) | 2014-08-01 | Cervelli et al. | Applicant |
| US8799812(B2) | 2014-08-01 | Parker | Applicant |
| US8812960(B1) | 2014-08-01 | Sun et al. | Applicant |
| US8818892(B1) | 2014-08-01 | Sprague et al. | Applicant |
| US8830322(B2) | 2014-09-01 | Nerayoff et al. | Applicant |
| US8832594(B1) | 2014-09-01 | Thompson et al. | Applicant |
| US8832832(B1) | 2014-09-01 | Visbal et al. | Applicant |
| US8868486(B2) | 2014-10-01 | Tamayo | Applicant |
| US8917274(B2) | 2014-12-01 | Ma et al. | Applicant |
| US8924872(B1) | 2014-12-01 | Bogomolov et al. | Applicant |
| US8937619(B2) | 2015-01-01 | Sharma et al. | Applicant |
| US9009827(B1) | 2015-04-01 | Albertson et al. | Applicant |
| US9043894(B1) | 2015-05-01 | Dennison et al. | Applicant |
| US2001/0021936(A1) | 2001-09-01 | Bertram | Applicant |
| US2002/0033848(A1) | 2002-03-01 | Sciammarella et al. | Applicant |
| US2002/0065708(A1) | 2002-05-01 | Senay et al. | Applicant |
| US2002/0087328(A1) | 2002-07-01 | Denenberg et al. | Applicant |
| US2002/0091707(A1) | 2002-07-01 | Keller | Applicant |
| US2002/0095658(A1) | 2002-07-01 | Shulman | Applicant |
| US2002/0116120(A1) | 2002-08-01 | Ruiz et al. | Applicant |
| US2002/0130907(A1) | 2002-09-01 | Chi et al. | Applicant |
| US2002/0174201(A1) | 2002-11-01 | Ramer et al. | Applicant |
| US2002/0194119(A1) | 2002-12-01 | Wright et al. | Applicant |
| US2003/0028560(A1) | 2003-02-01 | Kudrolli et al. | Applicant |
| US2003/0039948(A1) | 2003-02-01 | Donahue | Applicant |
| US2003/0084017(A1) | 2003-05-01 | Ordille | Applicant |
| US2003/0088654(A1) | 2003-05-01 | Good et al. | Applicant |
| US2003/0097330(A1) | 2003-05-01 | Hillmer et al. | Applicant |
| US2003/0144868(A1) | 2003-07-01 | MacIntyre et al. | Applicant |
| US2003/0163352(A1) | 2003-08-01 | Surpin et al. | Applicant |
| US2003/0172053(A1) | 2003-09-01 | Fairweather | Applicant |
| US2003/0177112(A1) | 2003-09-01 | Gardner | Applicant |
| US2003/0182313(A1) | 2003-09-01 | Federwisch et al. | Applicant |
| US2003/0200217(A1) | 2003-10-01 | Ackerman | Applicant |
| US2003/0225755(A1) | 2003-12-01 | Iwayama et al. | Applicant |
| US2003/0229848(A1) | 2003-12-01 | Arend et al. | Applicant |
| US2004/0032432(A1) | 2004-02-01 | Baynger | Applicant |
| US2004/0064256(A1) | 2004-04-01 | Barinek et al. | Applicant |
| US2004/0083466(A1) | 2004-04-01 | Dapp et al. | Applicant |
| US2004/0085318(A1) | 2004-05-01 | Hassler et al. | Applicant |
| US2004/0095349(A1) | 2004-05-01 | Bito et al. | Applicant |
| US2004/0103124(A1) | 2004-05-01 | Kupkova | Applicant |
| US2004/0111390(A1) | 2004-06-01 | Saito et al. | Applicant |
| US2004/0111410(A1) | 2004-06-01 | Burgoon et al. | Applicant |
| US2004/0143602(A1) | 2004-07-01 | Ruiz et al. | Applicant |
| US2004/0153418(A1) | 2004-08-01 | Hanweck | Applicant |
| US2004/0181554(A1) | 2004-09-01 | Heckerman et al. | Applicant |
| US2004/0193600(A1) | 2004-09-01 | Kaasten et al. | Applicant |
| US2004/0205524(A1) | 2004-10-01 | Richter et al. | Applicant |
| US2004/0250124(A1) | 2004-12-01 | Chesla et al. | Applicant |
| US2004/0250576(A1) | 2004-12-01 | Flanders | Applicant |
| US2004/0260702(A1) | 2004-12-01 | Cragun et al. | Applicant |
| US2005/0027705(A1) | 2005-02-01 | Sadri et al. | Applicant |
| US2005/0028094(A1) | 2005-02-01 | Allyn | Applicant |
| US2005/0034107(A1) | 2005-02-01 | Kendall et al. | Applicant |
| US2005/0080769(A1) | 2005-04-01 | Gemmell | Applicant |
| US2005/0086207(A1) | 2005-04-01 | Heuer et al. | Applicant |
| US2005/0091420(A1) | 2005-04-01 | Snover et al. | Applicant |
| US2005/0108063(A1) | 2005-05-01 | Madill et al. | Applicant |
| US2005/0125715(A1) | 2005-06-01 | Di Franco et al. | Applicant |
| US2005/0162523(A1) | 2005-07-01 | Darrell et al. | Applicant |
| US2005/0180330(A1) | 2005-08-01 | Shapiro | Applicant |
| US2005/0182793(A1) | 2005-08-01 | Keenan et al. | Applicant |
| US2005/0183005(A1) | 2005-08-01 | Denoue et al. | Applicant |
| US2005/0193024(A1) | 2005-09-01 | Beyer et al. | Applicant |
| US2005/0222928(A1) | 2005-10-01 | Steier et al. | Applicant |
| US2005/0229256(A2) | 2005-10-01 | Banzhof | Applicant |
| US2005/0246327(A1) | 2005-11-01 | Yeung et al. | Applicant |
| US2005/0251786(A1) | 2005-11-01 | Citron et al. | Applicant |
| US2005/0262556(A1) | 2005-11-01 | Waisman et al. | Applicant |
| US2006/0026120(A1) | 2006-02-01 | Carolan et al. | Applicant |
| US2006/0026170(A1) | 2006-02-01 | Kreitler et al. | Applicant |
| US2006/0036568(A1) | 2006-02-01 | Moore et al. | Applicant |
| US2006/0045470(A1) | 2006-03-01 | Poslinski et al. | Applicant |
| US2006/0059139(A1) | 2006-03-01 | Robinson | Applicant |
| US2006/0069912(A1) | 2006-03-01 | Zheng et al. | Applicant |
| US2006/0074866(A1) | 2006-04-01 | Chamberlain et al. | Applicant |
| US2006/0074881(A1) | 2006-04-01 | Vembu et al. | Applicant |
| US2006/0080619(A1) | 2006-04-01 | Carlson et al. | Applicant |
| US2006/0106879(A1) | 2006-05-01 | Zondervan et al. | Applicant |
| US2006/0129746(A1) | 2006-06-01 | Porter | Applicant |
| US2006/0139375(A1) | 2006-06-01 | Rasmussen et al. | Applicant |
| US2006/0149596(A1) | 2006-07-01 | Surpin et al. | Applicant |
| US2006/0155945(A1) | 2006-07-01 | McGarvey | Applicant |
| US2006/0190497(A1) | 2006-08-01 | Inturi et al. | Applicant |
| US2006/0203337(A1) | 2006-09-01 | White | Applicant |
| US2006/0206866(A1) | 2006-09-01 | Eldrige et al. | Applicant |
| US2006/0218637(A1) | 2006-09-01 | Thomas et al. | Applicant |
| US2006/0224579(A1) | 2006-10-01 | Zheng | Applicant |
| US2006/0224629(A1) | 2006-10-01 | Alexander et al. | Applicant |
| US2006/0242040(A1) | 2006-10-01 | Rader | Applicant |
| US2006/0242630(A1) | 2006-10-01 | Koike et al. | Applicant |
| US2006/0265747(A1) | 2006-11-01 | Judge | Examiner |
| US2006/0271277(A1) | 2006-11-01 | Hu et al. | Applicant |
| US2006/0273893(A1) | 2006-12-01 | Warner | Applicant |
| US2006/0279630(A1) | 2006-12-01 | Aggarwal et al. | Applicant |
| US2007/0005707(A1) | 2007-01-01 | Teodosiu et al. | Applicant |
| US2007/0011150(A1) | 2007-01-01 | Frank | Applicant |
| US2007/0015506(A1) | 2007-01-01 | Hewett et al. | Applicant |
| US2007/0016363(A1) | 2007-01-01 | Huang et al. | Applicant |
| US2007/0026373(A1) | 2007-02-01 | Suriyanarayanan et al. | Applicant |
| US2007/0038962(A1) | 2007-02-01 | Fuchs et al. | Applicant |
| US2007/0057966(A1) | 2007-03-01 | Ohno et al. | Applicant |
| US2007/0074169(A1) | 2007-03-01 | Chess et al. | Applicant |
| US2007/0078832(A1) | 2007-04-01 | Ott et al. | Applicant |
| US2007/0078872(A1) | 2007-04-01 | Cohen | Applicant |
| US2007/0083541(A1) | 2007-04-01 | Fraleigh et al. | Applicant |
| US2007/0112714(A1) | 2007-05-01 | Fairweather | Applicant |
| US2007/0112887(A1) | 2007-05-01 | Liu et al. | Applicant |
| US2007/0168516(A1) | 2007-07-01 | Liu et al. | Applicant |
| US2007/0174760(A1) | 2007-07-01 | Chamberlain et al. | Applicant |
| US2007/0180075(A1) | 2007-08-01 | Chasman et al. | Applicant |
| US2007/0192143(A1) | 2007-08-01 | Krishnan et al. | Applicant |
| US2007/0192265(A1) | 2007-08-01 | Chopin et al. | Applicant |
| US2007/0208497(A1) | 2007-09-01 | Downs et al. | Applicant |
| US2007/0208498(A1) | 2007-09-01 | Barker et al. | Applicant |
| US2007/0208736(A1) | 2007-09-01 | Tanigawa et al. | Applicant |
| US2007/0220067(A1) | 2007-09-01 | Suriyanarayanan et al. | Applicant |
| US2007/0220328(A1) | 2007-09-01 | Liu et al. | Applicant |
| US2007/0233756(A1) | 2007-10-01 | D'Souza et al. | Applicant |
| US2007/0266336(A1) | 2007-11-01 | Nojima et al. | Applicant |
| US2007/0294200(A1) | 2007-12-01 | Au | Applicant |
| US2007/0294643(A1) | 2007-12-01 | Kyle | Applicant |
| US2007/0294766(A1) | 2007-12-01 | Mir et al. | Applicant |
| US2007/0299697(A1) | 2007-12-01 | Friedlander et al. | Applicant |
| US2007/0299887(A1) | 2007-12-01 | Novik et al. | Applicant |
| US2008/0027981(A1) | 2008-01-01 | Wahl | Applicant |
| US2008/0033753(A1) | 2008-02-01 | Canda et al. | Applicant |
| US2008/0040684(A1) | 2008-02-01 | Crump | Applicant |
| US2008/0051989(A1) | 2008-02-01 | Welsh | Applicant |
| US2008/0052142(A1) | 2008-02-01 | Bailey et al. | Applicant |
| US2008/0077597(A1) | 2008-03-01 | Butler | Applicant |
| US2008/0077642(A1) | 2008-03-01 | Carbone et al. | Applicant |
| US2008/0086718(A1) | 2008-04-01 | Bostick et al. | Applicant |
| US2008/0104019(A1) | 2008-05-01 | Nath | Applicant |
| US2008/0109762(A1) | 2008-05-01 | Hundal et al. | Applicant |
| US2008/0126951(A1) | 2008-05-01 | Sood et al. | Applicant |
| US2008/0133567(A1) | 2008-06-01 | Ames et al. | Applicant |
| US2008/0140387(A1) | 2008-06-01 | Linker | Applicant |
| US2008/0141117(A1) | 2008-06-01 | King et al. | Applicant |
| US2008/0148398(A1) | 2008-06-01 | Mezack et al. | Applicant |
| US2008/0162616(A1) | 2008-07-01 | Worley et al. | Applicant |
| US2008/0189240(A1) | 2008-08-01 | Mullins et al. | Applicant |
| US2008/0195417(A1) | 2008-08-01 | Surpin et al. | Applicant |
| US2008/0195608(A1) | 2008-08-01 | Clover | Applicant |
| US2008/0222295(A1) | 2008-09-01 | Robinson et al. | Applicant |
| US2008/0228467(A1) | 2008-09-01 | Womack et al. | Applicant |
| US2008/0229422(A1) | 2008-09-01 | Hudis et al. | Applicant |
| US2008/0235575(A1) | 2008-09-01 | Weiss | Applicant |
| US2008/0243951(A1) | 2008-10-01 | Webman et al. | Applicant |
| US2008/0255973(A1) | 2008-10-01 | El Wade et al. | Applicant |
| US2008/0263468(A1) | 2008-10-01 | Cappione et al. | Applicant |
| US2008/0267107(A1) | 2008-10-01 | Rosenberg | Applicant |
| US2008/0276167(A1) | 2008-11-01 | Michael | Applicant |
| US2008/0278311(A1) | 2008-11-01 | Grange et al. | Applicant |
| US2008/0281580(A1) | 2008-11-01 | Zabokritski | Applicant |
| US2008/0288306(A1) | 2008-11-01 | MacIntyre et al. | Applicant |
| US2008/0288425(A1) | 2008-11-01 | Posse et al. | Applicant |
| US2008/0301643(A1) | 2008-12-01 | Appleton et al. | Applicant |
| US2008/0320299(A1) | 2008-12-01 | Wobber et al. | Applicant |
| US2009/0002492(A1) | 2009-01-01 | Velipasalar et al. | Applicant |
| US2009/0018940(A1) | 2009-01-01 | Wang et al. | Applicant |
| US2009/0027418(A1) | 2009-01-01 | Maru et al. | Applicant |
| US2009/0030915(A1) | 2009-01-01 | Winter et al. | Applicant |
| US2009/0044279(A1) | 2009-02-01 | Crawford et al. | Applicant |
| US2009/0055251(A1) | 2009-02-01 | Shah et al. | Applicant |
| US2009/0076845(A1) | 2009-03-01 | Bellin et al. | Applicant |
| US2009/0082997(A1) | 2009-03-01 | Tokman et al. | Applicant |
| US2009/0083184(A1) | 2009-03-01 | Eisen | Applicant |
| US2009/0088964(A1) | 2009-04-01 | Schaaf et al. | Applicant |
| US2009/0100165(A1) | 2009-04-01 | Wesley et al. | Applicant |
| US2009/0103442(A1) | 2009-04-01 | Douville | Applicant |
| US2009/0119309(A1) | 2009-05-01 | Gibson et al. | Applicant |
| US2009/0125369(A1) | 2009-05-01 | Kloostra et al. | Applicant |
| US2009/0132921(A1) | 2009-05-01 | Hwangbo et al. | Applicant |
| US2009/0132953(A1) | 2009-05-01 | Reed et al. | Applicant |
| US2009/0144262(A1) | 2009-06-01 | White et al. | Applicant |
| US2009/0144274(A1) | 2009-06-01 | Fraleigh et al. | Applicant |
| US2009/0164934(A1) | 2009-06-01 | Bhattiprolu et al. | Applicant |
| US2009/0171939(A1) | 2009-07-01 | Athsani et al. | Applicant |
| US2009/0172511(A1) | 2009-07-01 | Decherd et al. | Applicant |
| US2009/0172821(A1) | 2009-07-01 | Daira et al. | Applicant |
| US2009/0179892(A1) | 2009-07-01 | Tsuda et al. | Applicant |
| US2009/0187546(A1) | 2009-07-01 | Whyte et al. | Applicant |
| US2009/0192957(A1) | 2009-07-01 | Subramanian et al. | Applicant |
| US2009/0199090(A1) | 2009-08-01 | Poston et al. | Applicant |
| US2009/0222400(A1) | 2009-09-01 | Kupershmidt et al. | Applicant |
| US2009/0222760(A1) | 2009-09-01 | Halverson et al. | Applicant |
| US2009/0228507(A1) | 2009-09-01 | Jain et al. | Applicant |
| US2009/0234720(A1) | 2009-09-01 | George et al. | Applicant |
| US2009/0248828(A1) | 2009-10-01 | Gould et al. | Applicant |
| US2009/0254970(A1) | 2009-10-01 | Agarwal et al. | Applicant |
| US2009/0271359(A1) | 2009-10-01 | Bayliss | Applicant |
| US2009/0281839(A1) | 2009-11-01 | Lynn et al. | Applicant |
| US2009/0287470(A1) | 2009-11-01 | Farnsworth et al. | Applicant |
| US2009/0292626(A1) | 2009-11-01 | Oxford | Applicant |
| US2009/0328222(A1) | 2009-12-01 | Helman et al. | Applicant |
| US2010/0011282(A1) | 2010-01-01 | Dollard et al. | Applicant |
| US2010/0042922(A1) | 2010-02-01 | Bradateanu et al. | Applicant |
| US2010/0057716(A1) | 2010-03-01 | Stefik et al. | Applicant |
| US2010/0070523(A1) | 2010-03-01 | Delgo et al. | Applicant |
| US2010/0070842(A1) | 2010-03-01 | Aymeloglu et al. | Applicant |
| US2010/0070897(A1) | 2010-03-01 | Aymeloglu et al. | Applicant |
| US2010/0077481(A1) | 2010-03-01 | Polyakov | Examiner |
| US2010/0077483(A1) | 2010-03-01 | Stolfo et al. | Applicant |
| US2010/0100963(A1) | 2010-04-01 | Mahaffey | Applicant |
| US2010/0114887(A1) | 2010-05-01 | Conway et al. | Applicant |
| US2010/0122152(A1) | 2010-05-01 | Chamberlain et al. | Applicant |
| US2010/0125546(A1) | 2010-05-01 | Barrett et al. | Applicant |
| US2010/0131457(A1) | 2010-05-01 | Heimendinger | Applicant |
| US2010/0145909(A1) | 2010-06-01 | Ngo | Applicant |
| US2010/0162176(A1) | 2010-06-01 | Dunton | Applicant |
| US2010/0169237(A1) | 2010-07-01 | Howard et al. | Applicant |
| US2010/0185691(A1) | 2010-07-01 | Irmak et al. | Applicant |
| US2010/0191563(A1) | 2010-07-01 | Schlaifer et al. | Applicant |
| US2010/0198684(A1) | 2010-08-01 | Eraker et al. | Applicant |
| US2010/0199225(A1) | 2010-08-01 | Coleman et al. | Applicant |
| US2010/0204983(A1) | 2010-08-01 | Chung et al. | Applicant |
| US2010/0235915(A1) | 2010-09-01 | Memon et al. | Applicant |
| US2010/0250412(A1) | 2010-09-01 | Wagner | Applicant |
| US2010/0262688(A1) | 2010-10-01 | Hussain et al. | Applicant |
| US2010/0280857(A1) | 2010-11-01 | Liu et al. | Applicant |
| US2010/0293174(A1) | 2010-11-01 | Bennett et al. | Applicant |
| US2010/0306029(A1) | 2010-12-01 | Jolley | Applicant |
| US2010/0306285(A1) | 2010-12-01 | Shah et al. | Applicant |
| US2010/0306713(A1) | 2010-12-01 | Geisner et al. | Applicant |
| US2010/0321399(A1) | 2010-12-01 | Ellren et al. | Applicant |
| US2010/0325526(A1) | 2010-12-01 | Ellis et al. | Applicant |
| US2010/0325581(A1) | 2010-12-01 | Finkelstein et al. | Applicant |
| US2010/0330801(A1) | 2010-12-01 | Rouh | Applicant |
| US2011/0010342(A1) | 2011-01-01 | Chen et al. | Applicant |
| US2011/0047159(A1) | 2011-02-01 | Baid et al. | Applicant |
| US2011/0060753(A1) | 2011-03-01 | Shaked et al. | Applicant |
| US2011/0061013(A1) | 2011-03-01 | Bilicki et al. | Applicant |
| US2011/0074811(A1) | 2011-03-01 | Hanson et al. | Applicant |
| US2011/0078173(A1) | 2011-03-01 | Seligmann et al. | Applicant |
| US2011/0087519(A1) | 2011-04-01 | Fordyce, III et al. | Applicant |
| US2011/0093327(A1) | 2011-04-01 | Fordyce, III et al. | Applicant |
| US2011/0117878(A1) | 2011-05-01 | Barash et al. | Applicant |
| US2011/0119100(A1) | 2011-05-01 | Ruhl et al. | Applicant |
| US2011/0137766(A1) | 2011-06-01 | Rasmussen et al. | Applicant |
| US2011/0153384(A1) | 2011-06-01 | Horne et al. | Applicant |
| US2011/0167105(A1) | 2011-07-01 | Ramakrishnan et al. | Applicant |
| US2011/0167493(A1) | 2011-07-01 | Song et al. | Applicant |
| US2011/0170799(A1) | 2011-07-01 | Carrino et al. | Applicant |
| US2011/0173032(A1) | 2011-07-01 | Payne et al. | Applicant |
| US2011/0173093(A1) | 2011-07-01 | Psota et al. | Applicant |
| US2011/0178842(A1) | 2011-07-01 | Rane et al. | Applicant |
| US2011/0208724(A1) | 2011-08-01 | Jones et al. | Applicant |
| US2011/0218934(A1) | 2011-09-01 | Elser | Applicant |
| US2011/0219450(A1) | 2011-09-01 | McDougal et al. | Applicant |
| US2011/0225198(A1) | 2011-09-01 | Edwards et al. | Applicant |
| US2011/0231223(A1) | 2011-09-01 | Winters | Applicant |
| US2011/0238510(A1) | 2011-09-01 | Rowen et al. | Applicant |
| US2011/0238553(A1) | 2011-09-01 | Raj et al. | Applicant |
| US2011/0238570(A1) | 2011-09-01 | Li et al. | Applicant |
| US2011/0246229(A1) | 2011-10-01 | Pacha | Applicant |
| US2011/0258216(A1) | 2011-10-01 | Supakkul et al. | Applicant |
| US2011/0291851(A1) | 2011-12-01 | Whisenant | Applicant |
| US2011/0307382(A1) | 2011-12-01 | Siegel et al. | Applicant |
| US2011/0310005(A1) | 2011-12-01 | Chen et al. | Applicant |
| US2012/0005159(A1) | 2012-01-01 | Wang et al. | Applicant |
| US2012/0016849(A1) | 2012-01-01 | Garrod et al. | Applicant |
| US2012/0019559(A1) | 2012-01-01 | Siler et al. | Applicant |
| US2012/0022945(A1) | 2012-01-01 | Falkenborg et al. | Applicant |
| US2012/0023075(A1) | 2012-01-01 | Pulfer et al. | Applicant |
| US2012/0036013(A1) | 2012-02-01 | Neuhaus et al. | Applicant |
| US2012/0036106(A1) | 2012-02-01 | Desai et al. | Applicant |
| US2012/0036434(A1) | 2012-02-01 | Oberstein | Applicant |
| US2012/0064921(A1) | 2012-03-01 | Hernoud et al. | Applicant |
| US2012/0066296(A1) | 2012-03-01 | Appleton et al. | Applicant |
| US2012/0079363(A1) | 2012-03-01 | Folting et al. | Applicant |
| US2012/0084135(A1) | 2012-04-01 | Nissan et al. | Applicant |
| US2012/0084866(A1) | 2012-04-01 | Stolfo | Examiner |
| US2012/0106801(A1) | 2012-05-01 | Jackson | Applicant |
| US2012/0110633(A1) | 2012-05-01 | An et al. | Applicant |
| US2012/0110674(A1) | 2012-05-01 | Belani et al. | Applicant |
| US2012/0117082(A1) | 2012-05-01 | Koperda et al. | Applicant |
| US2012/0131512(A1) | 2012-05-01 | Takeuchi et al. | Applicant |
| US2012/0144335(A1) | 2012-06-01 | Abeln et al. | Applicant |
| US2012/0150446(A1) | 2012-06-01 | Chang et al. | Applicant |
| US2012/0159307(A1) | 2012-06-01 | Chung et al. | Applicant |
| US2012/0159362(A1) | 2012-06-01 | Brown et al. | Applicant |
| US2012/0159399(A1) | 2012-06-01 | Bastide et al. | Applicant |
| US2012/0167164(A1) | 2012-06-01 | Burgess et al. | Applicant |
| US2012/0173985(A1) | 2012-07-01 | Peppel | Applicant |
| US2012/0191446(A1) | 2012-07-01 | Binsztok et al. | Applicant |
| US2012/0196557(A1) | 2012-08-01 | Reich et al. | Applicant |
| US2012/0196558(A1) | 2012-08-01 | Reich et al. | Applicant |
| US2012/0208636(A1) | 2012-08-01 | Feige | Applicant |
| US2012/0215898(A1) | 2012-08-01 | Shah et al. | Applicant |
| US2012/0221511(A1) | 2012-08-01 | Gibson et al. | Applicant |
| US2012/0221553(A1) | 2012-08-01 | Wittmer et al. | Applicant |
| US2012/0221580(A1) | 2012-08-01 | Barney | Applicant |
| US2012/0245976(A1) | 2012-09-01 | Kumar et al. | Applicant |
| US2012/0246148(A1) | 2012-09-01 | Dror | Applicant |
| US2012/0254129(A1) | 2012-10-01 | Wheeler et al. | Applicant |
| US2012/0266245(A1) | 2012-10-01 | McDougal et al. | Applicant |
| US2012/0290879(A1) | 2012-11-01 | Shibuya et al. | Applicant |
| US2012/0296907(A1) | 2012-11-01 | Long et al. | Applicant |
| US2012/0304150(A1) | 2012-11-01 | Leithead et al. | Applicant |
| US2012/0304244(A1) | 2012-11-01 | Xie et al. | Applicant |
| US2012/0310831(A1) | 2012-12-01 | Harris et al. | Applicant |
| US2012/0310838(A1) | 2012-12-01 | Harris et al. | Applicant |
| US2012/0311684(A1) | 2012-12-01 | Paulsen et al. | Applicant |
| US2012/0323829(A1) | 2012-12-01 | Stokes et al. | Applicant |
| US2012/0323888(A1) | 2012-12-01 | Osann, Jr. | Applicant |
| US2012/0330801(A1) | 2012-12-01 | McDougal et al. | Applicant |
| US2012/0330973(A1) | 2012-12-01 | Ghuneim et al. | Applicant |
| US2013/0006426(A1) | 2013-01-01 | Healey et al. | Applicant |
| US2013/0006655(A1) | 2013-01-01 | Van Arkel et al. | Applicant |
| US2013/0006668(A1) | 2013-01-01 | Van Arkel et al. | Applicant |
| US2013/0006725(A1) | 2013-01-01 | Simanek et al. | Applicant |
| US2013/0013612(A1) | 2013-01-01 | Fittges et al. | Applicant |
| US2013/0018796(A1) | 2013-01-01 | Kolhatkar et al. | Applicant |
| US2013/0019306(A1) | 2013-01-01 | Lagar-Cavilla | Examiner |
| US2013/0024307(A1) | 2013-01-01 | Fuerstenberg et al. | Applicant |
| US2013/0024339(A1) | 2013-01-01 | Choudhuri et al. | Applicant |
| US2013/0046842(A1) | 2013-02-01 | Muntz et al. | Applicant |
| US2013/0060786(A1) | 2013-03-01 | Serrano et al. | Applicant |
| US2013/0061169(A1) | 2013-03-01 | Pearcy et al. | Applicant |
| US2013/0067017(A1) | 2013-03-01 | Carriere et al. | Applicant |
| US2013/0073377(A1) | 2013-03-01 | Heath | Applicant |
| US2013/0078943(A1) | 2013-03-01 | Biage et al. | Applicant |
| US2013/0091084(A1) | 2013-04-01 | Lee | Applicant |
| US2013/0097482(A1) | 2013-04-01 | Marantz et al. | Applicant |
| US2013/0101159(A1) | 2013-04-01 | Chao et al. | Applicant |
| US2013/0111320(A1) | 2013-05-01 | Campbell et al. | Applicant |
| US2013/0117651(A1) | 2013-05-01 | Waldman et al. | Applicant |
| US2013/0124193(A1) | 2013-05-01 | Holmberg | Applicant |
| US2013/0139268(A1) | 2013-05-01 | An et al. | Applicant |
| US2013/0150004(A1) | 2013-06-01 | Rosen | Applicant |
| US2013/0151388(A1) | 2013-06-01 | Falkenborg et al. | Applicant |
| US2013/0157234(A1) | 2013-06-01 | Gulli et al. | Applicant |
| US2013/0160120(A1) | 2013-06-01 | Malaviya et al. | Applicant |
| US2013/0166550(A1) | 2013-06-01 | Buchmann et al. | Applicant |
| US2013/0173540(A1) | 2013-07-01 | Qian et al. | Applicant |
| US2013/0176321(A1) | 2013-07-01 | Mitchell et al. | Applicant |
| US2013/0179420(A1) | 2013-07-01 | Park et al. | Applicant |
| US2013/0191336(A1) | 2013-07-01 | Ducott et al. | Applicant |
| US2013/0191338(A1) | 2013-07-01 | Ducott, III et al. | Applicant |
| US2013/0211985(A1) | 2013-08-01 | Clark et al. | Applicant |
| US2013/0224696(A1) | 2013-08-01 | Wolfe et al. | Applicant |
| US2013/0232045(A1) | 2013-09-01 | Tai et al. | Applicant |
| US2013/0238616(A1) | 2013-09-01 | Rose et al. | Applicant |
| US2013/0246170(A1) | 2013-09-01 | Gross et al. | Applicant |
| US2013/0251233(A1) | 2013-09-01 | Yang et al. | Applicant |
| US2013/0262527(A1) | 2013-10-01 | Hunter et al. | Applicant |
| US2013/0263019(A1) | 2013-10-01 | Castellanos et al. | Applicant |
| US2013/0268520(A1) | 2013-10-01 | Fisher et al. | Applicant |
| US2013/0275446(A1) | 2013-10-01 | Jain et al. | Applicant |
| US2013/0276799(A1) | 2013-10-01 | Davidson | Applicant |
| US2013/0279757(A1) | 2013-10-01 | Kephart | Applicant |
| US2013/0282696(A1) | 2013-10-01 | John et al. | Applicant |
| US2013/0290011(A1) | 2013-10-01 | Lynn et al. | Applicant |
| US2013/0290825(A1) | 2013-10-01 | Arndt et al. | Applicant |
| US2013/0297619(A1) | 2013-11-01 | Chandrasekaran et al. | Applicant |
| US2013/0318594(A1) | 2013-11-01 | Hoy et al. | Applicant |
| US2013/0339218(A1) | 2013-12-01 | Subramanian et al. | Applicant |
| US2013/0346444(A1) | 2013-12-01 | Makkar et al. | Applicant |
| US2014/0006109(A1) | 2014-01-01 | Callioni et al. | Applicant |
| US2014/0019936(A1) | 2014-01-01 | Cohanoff | Applicant |
| US2014/0032506(A1) | 2014-01-01 | Hoey et al. | Applicant |
| US2014/0033010(A1) | 2014-01-01 | Richardt et al. | Applicant |
| US2014/0040182(A1) | 2014-02-01 | Gilder et al. | Applicant |
| US2014/0040371(A1) | 2014-02-01 | Gurevich et al. | Applicant |
| US2014/0040714(A1) | 2014-02-01 | Siegel et al. | Applicant |
| US2014/0047357(A1) | 2014-02-01 | Alfaro et al. | Applicant |
| US2014/0052466(A1) | 2014-02-01 | DeVille et al. | Applicant |
| US2014/0058754(A1) | 2014-02-01 | Wild | Applicant |
| US2014/0059038(A1) | 2014-02-01 | McPherson et al. | Applicant |
| US2014/0059683(A1) | 2014-02-01 | Ashley | Applicant |
| US2014/0068487(A1) | 2014-03-01 | Steiger et al. | Applicant |
| US2014/0081652(A1) | 2014-03-01 | Klindworth | Applicant |
| US2014/0095509(A1) | 2014-04-01 | Patton | Applicant |
| US2014/0108068(A1) | 2014-04-01 | Williams | Applicant |
| US2014/0108380(A1) | 2014-04-01 | Gotz et al. | Applicant |
| US2014/0108985(A1) | 2014-04-01 | Scott et al. | Applicant |
| US2014/0114972(A1) | 2014-04-01 | Ducott et al. | Applicant |
| US2014/0123279(A1) | 2014-05-01 | Bishop et al. | Applicant |
| US2014/0129518(A1) | 2014-05-01 | Ducott et al. | Applicant |
| US2014/0136237(A1) | 2014-05-01 | Anderson et al. | Applicant |
| US2014/0143009(A1) | 2014-05-01 | Brice et al. | Applicant |
| US2014/0149130(A1) | 2014-05-01 | Getchius | Applicant |
| US2014/0149272(A1) | 2014-05-01 | Hirani et al. | Applicant |
| US2014/0149436(A1) | 2014-05-01 | Bahrami et al. | Applicant |
| US2014/0156527(A1) | 2014-06-01 | Grigg et al. | Applicant |
| US2014/0157172(A1) | 2014-06-01 | Peery et al. | Applicant |
| US2014/0164502(A1) | 2014-06-01 | Khodorenko et al. | Applicant |
| US2014/0189536(A1) | 2014-07-01 | Lange et al. | Applicant |
| US2014/0195515(A1) | 2014-07-01 | Baker et al. | Applicant |
| US2014/0195887(A1) | 2014-07-01 | Ellis et al. | Applicant |
| US2014/0245210(A1) | 2014-08-01 | Battcher et al. | Applicant |
| US2014/0273910(A1) | 2014-09-01 | Ballantyne et al. | Applicant |
| US2014/0279824(A1) | 2014-09-01 | Tamayo | Applicant |
| US2014/0310282(A1) | 2014-10-01 | Sprague et al. | Applicant |
| US2014/0316911(A1) | 2014-10-01 | Gross | Applicant |
| US2014/0333651(A1) | 2014-11-01 | Cervelli et al. | Applicant |
| US2014/0337772(A1) | 2014-11-01 | Cervelli et al. | Applicant |
| US2014/0366132(A1) | 2014-12-01 | Stiansen et al. | Applicant |
| US2015/0046791(A1) | 2015-02-01 | Isaacson | Applicant |
| US2015/0046844(A1) | 2015-02-01 | Lee | Applicant |
| US2015/0046845(A1) | 2015-02-01 | Lee | Applicant |
| US2015/0046870(A1) | 2015-02-01 | Goldenberg | Applicant |
| US2015/0046876(A1) | 2015-02-01 | Goldenberg | Applicant |
| US2015/0074050(A1) | 2015-03-01 | Landau et al. | Applicant |
| US2015/0135329(A1) | 2015-05-01 | Aghasaryan et al. | Applicant |
| US2015/0186821(A1) | 2015-07-01 | Wang et al. | Applicant |
| US2015/0187036(A1) | 2015-07-01 | Wang et al. | Applicant |
| US2015/0213284(A1) | 2015-07-01 | Birkel et al. | Applicant |
| US2015/0230061(A1) | 2015-08-01 | Srivastava | Applicant |
| US2015/0235334(A1) | 2015-08-01 | Wang et al. | Applicant |
| US2015/0248489(A1) | 2015-09-01 | Solheim et al. | Applicant |
| US2015/0311991(A1) | 2015-10-01 | Iwai et al. | Applicant |
| US2015/0317285(A1) | 2015-11-01 | Duggal et al. | Applicant |
| US2015/0379341(A1) | 2015-12-01 | Agrawal et al. | Applicant |
| US2016/0065511(A1) | 2016-03-01 | Ganin et al. | Applicant |
| US2016/0112428(A1) | 2016-04-01 | Terleski et al. | Applicant |
| US2016/0119424(A1) | 2016-04-01 | Kane et al. | Applicant |
| CN101729531 | 2010-06-01 | Applicant | |
| CN103281301 | 2013-09-01 | Applicant | |
| DE102014103482 | 2014-09-01 | Applicant | |
| DE102014103476 | 2014-09-01 | Applicant | |
| EP816968 | 1996-01-01 | Applicant | |
| EP1191463 | 2002-03-01 | Applicant | |
| EP1672527 | 2006-06-01 | Applicant | |
| EP2551799 | 2013-01-01 | Applicant | |
| EP2778914 | 2014-09-01 | Applicant | |
| EP2778977 | 2014-09-01 | Applicant | |
| EP2778983 | 2014-09-01 | Applicant | |
| EP2779082 | 2014-09-01 | Applicant | |
| EP2835745 | 2015-02-01 | Applicant | |
| EP2835770 | 2015-02-01 | Applicant | |
| EP2911078 | 2015-08-01 | Applicant | |
| EP2911079 | 2015-08-01 | Applicant | |
| GB2366498 | 2002-03-01 | Applicant | |
| GB2514239 | 2014-11-01 | Applicant | |
| GB2516155 | 2015-01-01 | Applicant | |
| WO/09529 | 2000-02-01 | Applicant | |
| WO2005/104736 | 2005-11-01 | Applicant | |
| WO2008/011728 | 2008-01-01 | Applicant | |
| WO2008/064207 | 2008-05-01 | Applicant | |
| WO2008/113059 | 2008-09-01 | Applicant | |
| WO2009/061501 | 2009-05-01 | Applicant | |
| WO2010/000014 | 2010-01-01 | Applicant | |
| WO2010/030913 | 2010-03-01 | Applicant | |
| WO2011/071833 | 2011-06-01 | Applicant | |
| WO2011/161565 | 2011-12-01 | Applicant | |
| WO2012/009397 | 2012-01-01 | Applicant | |
| WO2013/126281 | 2013-08-01 | Applicant |
Non-Patent Literature (159)
- US 8,712,906, 04/2014, Sprague et al. (withdrawn)Applicant
- “A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30.Applicant
- “A Tour of Pinboard,” http://pinboard.in/tour as printed May 15, 2014 in 6 pages.Applicant
- Acklen, Laura, “Absolute Beginner's Guide to Microsoft Word 2003,” Dec. 24, 2003, pp. 15-18, 34-41, 308-316.Applicant
- Alfred, Rayner “Summarizing Relational Data Using Semi-Supervised Genetic Algorithm-Based Clustering Techniques”, Journal of Computer Science, 2010, vol. 6, No. 7, pp. 775-784.Applicant
- Ananiev et al., “The New Modality API,” http://web.archive.org/web/20061211011958/http://java.sun.com/developer/technicalArticles/J2SE/Desktop/javase6/modality/ Jan. 21, 2006, pp. 8.Applicant
- Anonymous, “BackTuIt—JD Edwards One World Version Control System,” printed Jul. 23, 2007 in 1 page.Applicant
- Baker et al., “The Development of a Common Enumeration of Vulnerabilities and Exposures,” Presented at the Second International Workshop on Recent Advances in Intrusion Detection, Sep. 7-9, 1999, pp. 35.Applicant
- Bluttman et al., “Excel Formulas and Functions for Dummies,” 2005, Wiley Publishing, Inc., pp. 280, 284-286.Applicant
- Bugzilla@Mozilla, “Bug 18726—[feature] Long-click means of invoking contextual menus not supported,” http://bugzilia.mozilia.org/show_bug.cgi?id=18726 printed Jun. 13, 2013 in 11 pages.Applicant
- Chen et al., “Bringing Order to the Web: Automatically Categorizing Search Results,” CHI 2000, Proceedings of the SIGCHI conference on Human Factors in Computing Systems, Apr. 1-6, 2000, The Hague, The Netherlands, pp. 145-152.Applicant
- Conner, Nancy, “Google Apps: The Missing Manual,” Sharing and Collaborating on Documents, May 1, 2008, pp. 93-97, 106-113 & 120-121.Applicant
- Crosby et al., “Efficient Data Structures for Tamper-Evident Logging,” Department of Computer Science, Rice University, 2009, pp. 17.Applicant
- Delicious, http://delicious.com/ as printed May 15, 2014 in 1 page.Applicant
- Dramowicz, Ela, “Retail Trade Area Analysis Using the Huff Model,” Directions Magazine http://www.directionsmag.com/articles/retail-trade-area-analysis-using-the-huff-model/123411, Jul. 2, 2005 in 10 pages.Applicant
- FireEye, http://www.fireeye.com/ Printed Jun. 30, 2014 in 2 pages.Applicant
- FireEye—Products and Solutions Overview, http://www.fireeye.com/products-and-solutions Printed Jun. 30, 2014 in 3 pages.Applicant
- Geiger, Jonathan G., “Data Quality Management, the Most Critical Initiative You Can Implement,” Data Warehousing, Management and Quality, Paper 098-29, SUGI 29, Intelligent Solutions, Inc., Bounder, CO, pp. 14, accessed Oct. 3, 2013.Applicant
- GIS-NET 3 Public—Department of Regional Planning. Planning & Zoning Information for Unincorporated LA County. Retrieved Oct. 2, 2013 from http://gis.planning.lacounty.gov/GIS-NET3_Public/Viewer.html.Applicant
- Goswami, Gautam, “Quite ‘Writely’ Said!” One Brick at a Time, Aug. 21, 2005, pp. 7.Applicant
- Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144.Applicant
- Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Elsevier Science, Sep. 2010, Ch. 4 & 10, pp. 53-67 & 143-164.Applicant
- Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context, Mar. 18, 2011, pp. 16.Applicant
- Holliday, JoAnne, “Replicated Database Recovery using Multicast Communication,” IEEE 2002, pp. 11.Applicant
- Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33.Applicant
- Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36.Applicant
- Kahan et al., “Annotea: An Open RDF Infrastructure for Shared WEB Annotations”, Computer Networks, 2002, vol. 39, pp. 589-608.Applicant
- Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf downloaded May 12, 2014 in 8 pages.Applicant
- Keylines.com, “KeyLines Datasheet,” Mar. 2014, http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf downloaded May 12, 2014 in 2 pages.Applicant
- Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf downloaded May 12, 2014 in 10 pages.Applicant
- Klemmer et al., “Where Do Web Sites Come From? Capturing and Interacting with Design History,” Association for Computing Machinery, CHI 2002, Apr. 20-25, 2002, Minneapolis, MN, pp. 8.Applicant
- Kokossi et al., “D7-Dynamic Ontology Management System (Design),” Information Societies Technology Programme, Jan. 10, 2002, pp. 1-27.Applicant
- Lamport, “Time, Clocks and the Ordering of Events in a Distributed System,” Communications of the ACM, Jul. 1978, vol. 21, No. 7, pp. 558-565.Applicant
- Lee et al., “A Data Mining and CIDF Based Approach for Detecting Novel and Distributed Intrusions,” Lecture Notes in Computer Science, vol. 1907 Nov. 11, 2000, pp. 49-65.Applicant
- Liu, Tianshun, “Combining GIS and the Huff Model to Analyze Suitable Locations for a New Asian Supermarket in the Minneapolis and St. Paul, Minnesota USA,” Papers in Resource Analysis, 2012, vol. 14, pp. 8.Applicant
- Loeliger, Jon, “Version Control with Git,” O'Reilly, May 2009, pp. 330.Applicant
- Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.Applicant
- Manske, “File Saving Dialogs,” http://www.mozilla.org/editor/ui_specs/FileSaveDialogs.html, Jan. 20, 1999, pp. 7.Applicant
- Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.bing.com.Applicant
- Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.google.com.Applicant
- Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.yahoo.com.Applicant
- Microsoft—Developer Network, “Getting Started with VBA in Word 2010,” Apr. 2010, http://msdn.microsoft.com/en-us/library/ff604039%28v=office.14%29.aspx as printed Apr. 4, 2014 in 17 pages.Applicant
- Microsoft Office—Visio, “About connecting shapes,” http://office.microsoft.com/en-us/visio-help/about-connecting-shapes-HP085050369.aspx printed Aug. 4, 2011 in 6 pages.Applicant
- Microsoft Office—Visio, “Add and glue connectors with the Connector tool,” http://office.microsoft.com/en-us/visio-help/add-and-glue-connectors-with-the-connector-tool-HA010048532.aspx?CTT=1 printed Aug. 4, 2011 in 1 page.Applicant
- Miklau et al., “Securing History: Privacy and Accountability in Database Systems,” 3 rd Biennial Conference on Innovative Data Systems Research (CIDR), Jan. 7-10, 2007, Asilomar, California, pp. 387-396.Applicant
- Morrison et al., “Converting Users to Testers: An Alternative Approach to Load Test Script Creation, Parameterization and Data Correlation,” CCSC: Southeastern Conference, JCSC 28, Dec. 2, 2012, pp. 188-196.Applicant
- Niepert et al., “A Dynamic Ontology for a Dynamic Reference Work”, Joint Conference on Digital Libraries, Jun. 17-22, 2007, Vancouver, British Columbia, Canada, pp. 1-10.Applicant
- Nivas, Tuli, “Test Harness and Script Design Principles for Automated Testing of non-GUI or Web Based Applications,” Performance Lab, Jun. 2011, pp. 30-37.Applicant
- Olanoff, Drew, “Deep Dive With the New Google Maps for Desktop With Google Earth Integration, It's More Than Just a Utility,” May 15, 2013, pp. 8, http://web.archive.org/web/20130515230641/http://techcrunch.com/2013/05/15/deep-dive-with-the-new-google-maps-for-desktop-with-google-earth-integration-its-more-than-just-a-utility/.Applicant
- Palantir, “Extracting and Transforming Data with Kite,” Palantir Technologies, Inc., Copyright 2010, pp. 38.Applicant
- Palantir, “Kite,” https://docs.palantir.com/gotham/3.11.1.0/adminreference/datasources.11 printed Aug. 30, 2013 in 2 pages.Applicant
- Palantir, “Kite Data—Integration Process Overview,” Palantir Technologies, Inc., Copyright 2010, pp. 48.Applicant
- Palantir, “Kite Operations,” Palantir Technologies, Inc., Copyright 2010, p. 1.Applicant
- Palantir, “The Repository Element,” https://docs.palantir.com/gotham/3.11.1.0/dataguide/kite_config_file.04 printed Aug. 30, 2013 in 2 pages.Applicant
- Palantir, “Write a Kite Configuration File in Eclipse,” Palantir Technologies, Inc., Copyright 2010, pp. 2.Applicant
- Palantir, https://docs.palantir.com/gotham/3.11.1.0/dataguide/baggage/KiteSchema.xsd printed Apr. 4, 2014 in 4 pages.Applicant
- Palermo, Christopher J., “Memorandum,” [Disclosure relating to U.S. Appl. No. 13/916,447, filed Jun. 12, 2013, and related applications], Jan. 31, 2014 in 3 pages.Applicant
- Palmas, et al., “An Edge-Bundling Layout for Interactive Parallel Coordinates,” Proceedings of the 2014 IEEE Pacific Visualization Symposium, Mar. 2014, pp. 57-64.Applicant
- Parker, Jr. et al., “Detection of Mutual Inconsistency in Distributed Systems,” IEEE Transactions in Software Engineering, May 1983, vol. SE-9, No. 3, pp. 241-247.Applicant
- Rouse, Margaret, “OLAP Cube,” http://searchdatamanagement.techtarget.com/definition/OLAP-cube, Apr. 28, 2012, pp. 16.Applicant
- Shah, Chintan, “Periodic Connections to Control Server Offer New Way to Detect Botnets,” Oct. 24, 2013 in 6 pages, http://www.blogs.mcafee.com/mcafee-labs/periodic-links-to-control-server-offer-new-way-to-detect-botnets.Applicant
- “The FASTA Program Package,” fasta-36.3.4, Mar. 25, 2011, pp. 29.Applicant
- VirusTotal—About, http://www.virustotal.com/en/about/ Printed Jun. 30, 2014 in 8 pages.Applicant
- Wiggerts, T.A., “Using Clustering Algorithms in Legacy Systems Remodularization,” Reverse Engineering, Proceedings of the Fourth Working Conference, Netherlands, Oct. 6-8, 1997, IEEE Computer Soc., pp. 33-43.Applicant
- Wollrath et al., “A Distributed Object Model for the Java System,” Conference on Object-Oriented Technologies and Systems, Jun. 17-21, 1996, pp. 219-231.Applicant
- Official Communication in Australian Application No. AU2007323689, dated Mar. 22, 2011.Applicant
- Official Communication in Canadian Patent Application No. 2,666,364, dated Oct. 3, 2013.Applicant
- International Search Report and Written Opinion in Application No. PCT/US07/085202, dated May 22, 2008.Applicant
- International Search Report and Written Opinion in Application No. PCT/US2009/056703, dated Mar. 15, 2010.Applicant
- International Search Report and Written Opinion in Application No. PCT/US2011/043794 dated Feb. 24, 2012.Applicant
- Official Communication in New Zealand Application No. 612705, dated Jul. 9, 2013.Applicant
- Official Communication in Australian Application No. 2012238282, dated Jan. 30, 2014.Applicant
- Official Communication in Australian Application No. 2012238282, dated Jun. 6, 2014.Applicant
- European Search Report in Application No. 13152370.6, dated Jun. 3, 2013.Applicant
- Official Communication in New Zealand Application No. 624212 dated May 5, 2014.Applicant
- Official Communication in New Zealand Application No. 622513 dated Apr. 3, 2014.Applicant
- Official Communication in European Application No. EP 14158861.6 dated Jun. 16, 2014.Applicant
- Official Communication in New Zealand Application No. 622517 dated Apr. 3, 2014.Applicant
- Official Communication in British Application No. GB1408025.3 dated Nov. 6, 2014.Applicant
- Official Communication in New Zealand Application No. 624557 dated May 14, 2014.Applicant
- Official Communication in New Zealand Application No. 628585 dated Aug. 26, 2014.Applicant
- Official Communication in British Application No. GB 1411984.6 dated Dec. 22, 2014.Applicant
- Official Communication in New Zealand Application No. 627061 dated Jul. 14, 2014.Applicant
- Official Communication in European Application No. 14180281.9 dated Jan. 26, 2015.Applicant
- Official Communication in New Zealand Application No. 628495 dated Aug. 19, 2014.Applicant
- Official Communication in New Zealand Application No. 628263 dated Aug. 12, 2014.Applicant
- Official Communication in New Zealand Application No. 628150 dated Aug. 15, 2014.Applicant
- Official Communication in New Zealand Application No. 628161 dated Aug. 25, 2014.Applicant
- Official Communication in European Application No. 14187996.5 dated Feb. 12, 2015.Applicant
- European Search Report in Application No. 14159535.5, dated May 22, 2014.Applicant
- Official Communication in Great Britain Application No. 1404457.2 dated Aug. 14, 2014.Applicant
- Official Communication in New Zealand Application No. 622181 dated Mar. 24, 2014.Applicant
- Official Communication in Great Britain Application No. 1413935.9 dated Jan. 27, 2015.Applicant
- Official Communication in New Zealand Application No. 627962 dated Aug. 5, 2014.Applicant
- Official Communication in New Zealand Application No. 622473 dated Mar. 27, 2014.Applicant
- Official Communication in New Zealand Application No. 622473 dated Jun. 19, 2014.Applicant
- Extended European Search Report for European Patent Application No. 14158977.0 dated Jun. 10, 2014.Applicant
- Official Communication in New Zealand Application No. 622389 dated Mar. 20, 2014.Applicant
- Official Communication in New Zealand Application No. 622404 dated Mar. 20, 2014.Applicant
- Official Communication in New Zealand Application No. 622484 dated Apr. 2, 2014.Applicant
- Official Communication in New Zealand Application No. 628840 dated Aug. 28, 2014.Applicant
- Official Communication in European Patent Application No. 14159464.8 dated Jul. 31, 2014.Applicant
- “A Word About Banks and the Laundering of Drug Money,” Aug. 18, 2012, http://www.golemxiv.co.uk/2012/08/a-word-about-banks-and-the-laundering-of-drug-money/.Applicant
- Definition “Identify”, downloaded Jan. 22, 2015, 1 page.Applicant
- Definition “Overlay”, downloaded Jan. 22, 2015, 1 page.Applicant
- Dell Latitude D600 2003, Dell Inc., http://www.dell.com/downloads/global/products/latit/en/spec_latit_d600_en.pdf.Applicant
- Dou et al., “Ontology Translaation on the Semantic Web 2005,” Springer-Verlag, Journal on Data Semantics II Lecture Notes in Computer Science, vol. 3350, pp. 35-37.Applicant
- Fidge, Colin J., “Timestamps in Message-Passing Systems,” K. Raymond (Ed.) Proc. of the 11th Australian Computer Science Conference (ACSC 1988), pp. 56-66.Applicant
- Mattern, F., “Virtual Time and Global States of Distributed Systems,” Cosnard, M., Proc. Workshop on Parallel and Distributed Algorithms, Chateau de Bonas, France:Elsevier, 1989, pp. 215-226.Applicant
- O'Sullivan, Bryan, “Making Sense of Revision Control Systems,” Communications of the ACM, Sep. 2009, vol. 52, No. 9, pp. 57-62.Applicant
- Owl Web Ontology Language Reference Feb. 4, W3C, http://www.w3.org/Tr/owl-ref/.Applicant
- “Potential Money Laundering Warning Signs,” snapshot taken 2003, https://web.archive.org/web/20030816090055/http:/finsolinc.com/ANTI-MONEY%20LAUNDERING%20TRAINING%20GUIDES.pdfApplicant
- Symantec Corporation, “E-Security Begins with Sound Security Policies,” Announcement Symantec, Jun. 14, 2001.Applicant
- Notice of Allowance for U.S. Appl. No. 13/657,684 dated Mar. 2, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/139,628 dated Jun. 24, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/139,640 dated Jun. 17, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/139,713 dated Jun. 12, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/264,445 dated May 14, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/286,485 dated Jul. 29, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/473,552 dated Jul. 24, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/473,860 dated Jan. 5, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/486,991 dated May 1, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/616,080 dated Apr. 2, 2015.Applicant
- Official Communication for European Patent Application No. 15155845.9 dated Oct. 6, 2015.Applicant
- Official Communication for European Patent Application No. 15156004.2 dated Aug. 24, 2015.Applicant
- Official Communication for Great Britain Patent Application No. 1404573.6 dated Sep. 10, 2014.Applicant
- Official Communication for U.S. Appl. No. 13/657,684 dated Aug. 28, 2014.Applicant
- Official Communication for U.S. Appl. No. 13/949,043 dated May 7, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/076,385 dated Jun. 2, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/076,385 dated Jan. 22, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/156,208 dated Aug. 11, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/156,208 dated Mar. 9, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/170,562 dated Jul. 17, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/170,562 dated Sep. 25, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/264,445 dated Apr. 17, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/278,963 dated Jan. 30, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/280,490 dated Jul. 24, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/286,485 dated Mar. 12, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/286,485 dated Apr. 30, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/289,596 dated Jul. 18, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/289,596 dated Jan. 26, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/289,596 dated Apr. 30, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/289,599 dated Jul. 22, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/289,599 dated May 29, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/334,232 dated Jul. 10, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/449,083 dated Mar. 12, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/449,083 dated Oct. 2, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/473,552 dated Feb. 24, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/486,991 dated Mar. 10, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/518,757 dated Dec. 1, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/518,757 dated Dec. 10, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/518,757 dated Sep. 19, 2016.Applicant
- Official Communication for U.S. Appl. No. 14/518,757 dated Apr. 2, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/518,757 dated Jul. 20, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/579,752 dated Aug. 19, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/579,752 dated May 26, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/639,606 dated May 18, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/639,606 dated Jul. 24, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/791,204 dated Sep. 28, 2017.Applicant