Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sanaz Sheikhi

dblp:175/8252 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Digital forensics and information hiding · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding
data provenance
0.412020
Combating Dependence Explosion in Forensic Analysis Using Alternative Tag Propagation Semantics · SP 2020
Digital forensics and information hiding › attack investigation
dependency explosion
0.412020
Combating Dependence Explosion in Forensic Analysis Using Alternative Tag Propagation Semantics · SP 2020
Digital forensics and information hiding › digital forensics
forensic analysis
0.412020
Combating Dependence Explosion in Forensic Analysis Using Alternative Tag Propagation Semantics · SP 2020

Methods — techniques the papers use, named apart from their topics

tag decay · 0.4tag attenuation · 0.4
YearPublicationVenuePosition
2020 Combating Dependence Explosion in Forensic Analysis Using Alternative Tag Propagation Semantics
abstract
We are witnessing a rapid escalation in targeted cyber-attacks called Advanced and Persistent Threats (APTs). Carried out by skilled adversaries, these attacks take place over extended time periods, and remain undetected for months. A common approach for retracing the attacker's steps is to start with one or more suspicious events from system logs, and perform a dependence analysis to uncover the rest of attacker's actions. The accuracy of this analysis suffers from the dependence explosion problem, which causes a very large number of benign events to be flagged as part of the attack. In this paper, we propose two novel techniques, tag attenuation and tag decay, to mitigate dependence explosion. Our techniques take advantage of common behaviors of benign processes, while providing a conservative treatment of processes and data with suspicious provenance. Our system, called Morse, is able to construct a compact scenario graph that summarizes attacker activity by sifting through millions of system events in a matter of seconds. Our experimental evaluation, carried out using data from two government-agency sponsored red team exercises, demonstrates that our techniques are (a) effective in identifying stealthy attack campaigns, (b) reduce the false alarm rates by more than an order of magnitude, and (c) yield compact scenario graphs that capture the vast majority of the attack, while leaving out benign background activity.
Md Nahid Hossain, Sanaz Sheikhi, R. Sekar 0001
SP2
2018 Using a recurrent artificial neural network for dynamic self-adaptation of cluster-based web-server systems
Sanaz Sheikhi, Seyed Morteza Babamir
Appl. Intell.1
2016 A predictive framework for load balancing clustered web servers
Sanaz Sheikhi, Seyed Morteza Babamir
J. Supercomput.1