# US 2012/0255009 A1 · Method and apparatus for combating malicious code

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0255009 A1
- Document ID: US20120255009A1
- Status: Published application
- Kind: A1
- Application number: 13/490,998
- Filed: 2012-06-07
- Published: 2012-10-04
- Earliest claimed: 2004-09-17
- Assignees: SRI International
- Inventors: Phillip Porras; Linda Briesemeister
- Web page: https://patentgrep.com/patent/US20120255009A1

## CPC

- H04L 63/1441: {Countermeasures against malicious traffic (countermeasures against attacks on cryptographic mechanisms H04L9/002)}
- G06F 21/566: {Dynamic detection, i.e. detection performed at run-time, e.g. emulation, suspicious activities}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method and apparatus are provided for combating malicious code. In one embodiment, a method for combating malicious code in a network includes implementing a leap-ahead technique to defend against the malicious code reaching a full saturation potential in the network, by sending alert messages to a group of peers, and reselecting the membership of that group from time to time.

## Claims

### Claim 1

A method for combating self-propagating malicious code in a network, the method comprising:
detecting a suspected worm within the network;
sending an alert message regarding said worm to a group of one or more peers; and
reselecting a membership in said group at a later time period, such that one or more reselected peers in said group at said later time period is different from said one or more peers in said group,
wherein at least one of: said detecting, said sending, or said reselecting is performed using a processor.

### Claim 2 (depends on 1)

The method of claim 1, wherein said detecting further comprises:
detecting a resource limitation exceeded in said network.

### Claim 3 (depends on 2)

The method of claim 2, wherein said resource limitation includes a number of outbound connections made by a node in said network per unit of time.

### Claim 4 (depends on 2)

The method of claim 2, wherein said detecting further comprises:
receiving at least one alert message from at least one peer, wherein the at least one alert message contains information regarding the resource limitation that is exceeded.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
implementing a defensive action when a threshold amount of suspected malicious code activity is observed.

### Claim 6 (depends on 5)

The method of claim 5, wherein said defensive action is halted if said suspected malicious code activity is observed to fall below said threshold amount.

### Claim 7 (depends on 5)

The method of claim 5, wherein said threshold amount is adjustable.

### Claim 8 (depends on 5)

The method of claim 5, wherein said defensive action is an enablement of a filter to selectively block network traffic meeting defined characteristics.

### Claim 9 (depends on 8)

The method of claim 8, wherein said defined characteristics correspond to characteristics of packets dropped in accordance with said limiting.

### Claim 10 (depends on 9)

The method of claim 9, wherein said defined characteristics include at least one of: a port/protocol pair representing a dominant target port/protocol used by outbound packets during a time at which a violation of a resource usage threshold is detected, an average datagram size sent during said time at which said violation of said resource usage threshold is detected, or a standard deviation of datagrams sent during said time at which said violation of said resource usage threshold is detected.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
denying at least one incoming packet corresponding to said dominant target port/protocol.

### Claim 12 (depends on 5)

The method of claim 5, further comprising:
modifying an alert level counter after sending the alert message, and wherein said implementing a defensive action is performed at least partly based on a value of the alert level counter.

### Claim 13 (depends on 12)

The method of claim 12, wherein an amount by which the value of the alert level counter is modified depends at least partly on a severity of the suspected worm.

### Claim 14 (depends on 1)

The method of claim 1, further comprising:
receiving one or more alert messages from one or more peers in said network, said one or more alert messages indicating a detection of said suspected worm.

### Claim 15 (depends on 1)

The method of claim 1, wherein said reselecting comprises:
periodically re-computing said group.

### Claim 16 (depends on 1)

The method of claim 1, wherein said sending comprises:
determining whether to suppress or send the alert message depending on a value of a hold off counter; and
modifying the value of the hold off counter after sending the alert message, by an amount corresponding to a period of time during which additional alert messages are to be suppressed.

### Claim 17 (depends on 16)

The method of claim 16, wherein the amount by which the value of the hold off counter is modified is dependent on a severity of suspected malicious activity.

### Claim 18 (depends on 1)

The method of claim 1, wherein the group comprises a subset randomly selected from among a plurality of peers.

### Claim 19 (depends on 1)

The method of claim 1, wherein said reselecting is performed by a hierarchical coordinator function.

### Claim 20 (depends on 1)

The method of claim 1, wherein said reselecting is performed by said one or more peers.

### Claim 21

A computer readable storage device containing an executable program for self-propagating combating malicious code in a network, the method comprising:
detecting a suspected worm within the network;
sending an alert message regarding said worm to a group of one or more peers; and
reselecting a membership in said group at a later time period, such that one or more reselected peers in said group at said later time period is different from said one or more peers in said group.

### Claim 22

Apparatus for combating self-propagating malicious code in a network, the apparatus comprising:
a processor for detecting a suspected worm violation within the network; and
an output device for sending an alert message regarding said worm to a group of one or more peers; and
a hierarchical coordinator for reselecting a membership in said group at a later time period, such that one or more reselected peers in said group at said later time period is different from said one or more peers in said group.
