Detecting malicious logins as graph anomalies
Brian A. Powell

TL;DR
This paper introduces a behavior-based, graph-anomaly detection method using historical login data and matrix factorization to identify malicious lateral movement in enterprise networks, outperforming signature-based systems.
Contribution
It presents a novel unsupervised approach combining login graph modeling and role-based anomaly detection to identify malicious logins with low false positives.
Findings
Successfully detects a broad range of lateral movement activities.
Achieves lower false positive rates than signature-based alert systems.
Effective on real enterprise login data and simulated adversarial scenarios.
Abstract
Authenticated lateral movement via compromised accounts is a common adversarial maneuver that is challenging to discover with signature- or rules-based intrusion detection systems. In this work a behavior-based approach to detecting malicious logins to novel systems indicative of lateral movement is presented, in which a user's historical login activity is used to build a model of putative "normal" behavior. This historical login activity is represented as a collection of daily login graphs, which encode authentications among accessed systems. Each system, or graph vertex, is described by a set of graph centrality measures that characterize it and the local topology of its login graph. The unsupervised technique of non-negative matrix factorization is then applied to this set of features to assign each vertex to a role that summarizes how the system participates in logins. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
