Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Michael Spertus is active.

Publication


Featured researches published by Michael Spertus.


annual computer security applications conference | 2017

Smoke Detector: Cross-Product Intrusion Detection With Weak Indicators

Kevin Alejandro Roundy; Acar Tamersoy; Michael Spertus; Michael Hart; Daniel Kats; Matteo Dell'Amico; Robert Scott

The central task of a Security Incident and Event Manager (SIEM) or Managed Security Service Provider (MSSP) is to detect security incidents on the basis of tens of thousands of event types coming from many kinds of security products. We present Smoke Detector, which processes trillions of security events with the Random Walk with Restart (RWR) algorithm, inferring high order relationships between known security incidents and imperfect secondary security events (smoke) to find undiscovered security incidents (fire). By finding previously undetected incidents, Smoke Detectors RWR algorithm is able to increase the MSSPs critical incident count by 19% with a 1.3% FP rate. Perhaps equally importantly, our approach offers significant benefits beyond increased incident detection: (1) It provides a robust approach for leveraging Big Data sensor nets to increase adversarial resistance of protected networks; (2) Our event-scoring techniques enable efficient discovery of primary indicators of compromise; (3) Our confidence scores provide intuition and tuning capabilities for Smoke Detectors discovered security incidents, aiding incident display and response.


international symposium on algorithms and computation | 2009

A Simple, Fast, and Compact Static Dictionary

Scott Schneider; Michael Spertus

We present a new static dictionary that is very fast and compact, while also extremely easy to implement. A combination of properties make this algorithm very attractive for applications requiring large static dictionaries: 1 High performance, with membership queries taking O(1)-time with a near-optimal constant. 1 Continued high performance in external memory, with queries requiring only 1-2 disk seeks. If the dictionary has n items in


Archive | 2006

Efficient backups using dynamically shared storage pools in peer-to-peer networks

Michael Spertus; Slava Kritov; Darrell Kienzle; Hans F. van Rietschote; Anthony T. Orling; William E. Sobel

\left\{ 0, ..., m\!-\!1 \right\}


Archive | 2006

Adaptive instrumentation through dynamic recompilation

Michael Spertus

and d is the number of bytes retrieved from disk on each read, then the average number of seeks is


Archive | 2005

Interactive debugging system with debug data base system

Michael Spertus; Charles Fiterman; Gustavo Rodriguez Rivera

\min\left(1.63, 1 + O\left( \frac{\sqrt{n} \log m}{d} \right)\right)


Archive | 2009

Malware detection using a white list

Michael Spertus

. 1 Efficient use of space, storing n items from a universe of size m in


Archive | 2006

Redundancy management service for peer-to-peer networks

Michael Spertus; Slava Kritov

n \log m - \frac{1}{2} n \log n + O\left(n + \log \log m\right)


Archive | 2001

Conservative garbage collectors that can be used with general memory allocators

Gustavo Rodriguez-Rivera; Michael Spertus; Charles Fiterman

bits. We prove this space bound with a novel application of the Kolmogorov-Smirnov distribution. 1 Simplicity, with a 20-line pseudo-code construction algorithm and 4-line query algorithm.


Archive | 2007

Web site hygiene-based computer security

Carey Nachenberg; Michael Spertus


Archive | 2006

File-system-independent malicious content detection

Sanjay Ramchandra Kale; Kuldeep Sureshrao Nagarkar; Abhay Harishchandra Marode; Michael Spertus

Collaboration


Dive into the Michael Spertus's collaboration.

Researchain Logo
Decentralizing Knowledge