IP Library Granted Patent US 11,310,249
Granted Patent B2
US 11,310,249 · App. 16/365,268 · Granted Apr 19, 2022

Systems, methods, and media for defending computing systems from attack

Inventors: Yuan Jochen Kang (New York, NY); Salvatore Stolfo (New York, NY)
Assignee: The Trustees of Columbia University in the City of New York
H04L63/1425G06F7/582G06F9/542G06F21/54G06F21/602H04L63/1416
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,310,249
App. No.
16/365,268
Granted
Apr 19, 2022
Kind
B2
Abstract

Mechanisms for defending a computing system from attack are presented. The mechanisms include: maintaining a round counter that tracks a round number for a local host; determining a location in a graph for each of a plurality of hosts including the local host; determining monitor hosts of the plurality of hosts that are monitoring the local host; determining monitoree hosts of the plurality of hosts that are being monitored by the local host; sending a message to each of the monitor hosts identifying a value of the round counter; forwarding a first set of heartbeat messages from previous monitoree hosts to the monitor hosts; attempting to receive messages from the monitoree hosts; determining whether any messages were not received from the monitoree hosts; and in response to determining that one or more messages were not received from the monitoree hosts, generating an alert.

Claims (44)

1. A system for defending a computing system from attack, comprising:

a memory; and

a hardware processor coupled to the memory and configured to execute a local host that is configured to:

maintain a round counter that tracks a round number;

determine a location in a graph for each of a plurality of hosts including the local host, wherein the location in the graph for each of a plurality of hosts is determined using a pseudo-random function based on a shared key, the round counter, and an identifier for each of the plurality of hosts;

determine monitor hosts of the plurality of hosts that are monitoring the local host;

determine monitoree hosts of the plurality of hosts that are being monitored by the local host;

send a message to each of the monitor hosts identifying a value of the round counter;

forward a first set of heartbeat messages from previous monitoree hosts to the monitor hosts;

attempt to receive messages from the monitoree hosts;

determine whether any messages were not received from the monitoree hosts; and

in response to determining that one or more messages were not received from the monitoree hosts, generate an alert.

2. The system of claim 1 , wherein the directed graph is a DeBruijn graph.

3. The system of claim 1 , wherein the message sent to each of the monitor hosts identifying a value of the round counter is signed.

4. The system of claim 1 , wherein the hardware processor is configured to generate an alert in response to determining whether any received messages are invalid.

5. The system of claim 1 , wherein the hardware processor is configured to determine whether any heartbeat messages were received early.

6. A method for defending a computing system from attack, comprising:

maintaining a round counter that tracks a round number for a local host using a hardware processor;

determining a location in a graph for each of a plurality of hosts including the local host using the hardware processor, wherein the location in the graph for each of a plurality of hosts is determined using a pseudo-random function based on a shared key, the round counter, and an identifier for each of the plurality of hosts;

determining monitor hosts of the plurality of hosts that are monitoring the local host using the hardware processor;

determining monitoree hosts of the plurality of hosts that are being monitored by the local host using the hardware processor;

sending a message to each of the monitor hosts identifying a value of the round counter using the hardware processor;

forwarding a first set of heartbeat messages from previous monitoree hosts to the monitor hosts using the hardware processor;

attempting to receive messages from the monitoree hosts using the hardware processor;

determining whether any messages were not received from the monitoree hosts using the hardware processor; and

in response to determining that one or more messages were not received from the monitoree hosts, generating an alert using the hardware processor.

7. The method of claim 6 , wherein the directed graph is a DeBruijn graph.

8. The method of claim 6 , wherein the message sent to each of the monitor hosts identifying a value of the round counter is signed.

9. The method of claim 6 , further comprising generating an alert in response to determining whether any received messages are invalid.

10. The method of claim 6 , further comprising determining whether any heartbeat messages were received early.

11. A non-transitory computer-readable medium containing computer-executable instructions that, when executed by a processor, cause the processor to perform a method for defending a computing system from attack, the method comprising:

maintaining a round counter that tracks a round number for a local host;

determining a location in a graph for each of a plurality of hosts including the local host, wherein the location in the graph for each of a plurality of hosts is determined using a pseudo-random function based on a shared key, the round counter, and an identifier for each of the plurality of hosts;

determining monitor hosts of the plurality of hosts that are monitoring the local host;

determining monitoree hosts of the plurality of hosts that are being monitored by the local host;

sending a message to each of the monitor hosts identifying a value of the round counter;

forwarding a first set of heartbeat messages from previous monitoree hosts to the monitor hosts;

attempting to receive messages from the monitoree hosts;

determining whether any messages were not received from the monitoree hosts; and

in response to determining that one or more messages were not received from the monitoree hosts, generating an alert.

12. The non-transitory computer-readable medium of claim 11 , wherein the directed graph is a DeBruijn graph.

13. The non-transitory computer-readable medium of claim 11 , wherein the message sent to each of the monitor hosts identifying a value of the round counter is signed.

14. The non-transitory computer-readable medium of claim 11 , wherein the method further comprises generating an alert in response to determining whether any received messages are invalid.

15. The non-transitory computer-readable medium of claim 11 , wherein the method further comprises determining whether any heartbeat messages were received early.

Assignments (2)
GOVERNMENT INTEREST AGREEMENT Recorded Nov 26, 2025
From: COLUMBIA UNIV OF NEW YORK MORNINGSIDE
To: THE GOVERNMENT OF THE UNITED STATES OF AMERICA AS REPRESENTED BY THE SECRETARY OF THE NAVY
Reel/Frame 073715/0595 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 10, 2019
From: KANG, YUAN JOCHEN; STOLFO, SALVATORE
To: THE TRUSTEES OF COLUMBIA UNIVERSITY IN THE CITY OF NEW YORK
Reel/Frame 050682/0199 →
Continuity (2)
Provisional Application 62648290 · Mar 26, 2018
Related Publication 20190297104A1 · Sep 26, 2019