Evidence map›Paper›PMID 40738933›Full record

ArticleScientific reports2025

A data-driven approach to prioritize MITRE ATT&CK techniques for active directory adversary emulation.

Alshaimaa Abo-Alian, Mahmoud Youssef, Nagwa L Badr

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Review
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Alshaimaa Abo-AlianFaculty of Computer and Information Sciences, Ain Shams University, Cairo, Egypt.
Mahmoud YoussefFaculty of Computer and Information Sciences, Ain Shams University, Cairo, Egypt. mahmoud_youssef@cis.asu.edu.eg.
Nagwa L BadrFaculty of Computer and Information Sciences, Ain Shams University, Cairo, Egypt.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Advanced Persistent Threats (APTs) continue to evolve, employing sophisticated and evasive techniques that pose significant challenges to modern defense mechanisms, particularly in Active Directory (AD) environments. Adversary emulation serves as a proactive security strategy, enabling organizations to replicate real-world adversary behaviors to assess and enhance detection, response, and mitigation capabilities. However, existing frameworks often lack a structured approach to prioritizing techniques based on impact, feasibility, and security control gaps, leading to suboptimal resource allocation. This study proposes a Multi-Criteria Decision-Making (MCDM) approach that integrates Operational Threat Intelligence (OTI) and structured datasets from MITRE ATT&CK to systematically prioritize adversary techniques. The methodology evaluates techniques across three key dimensions: Active Directory Impact, Threat Score, and Security Control Gap, employing entropy-based weighting to ensure an objective and data-driven prioritization process. To validate the proposed framework, a real-world case study based on the APT3 threat group is presented, demonstrating the applicability and effectiveness of the prioritization strategy in aligning adversary emulation with real-world attack scenarios. By focusing on high-impact and difficult-to-detect techniques, this framework enhances the effectiveness of adversary emulation and strengthens security postures in AD environments.

Indexed as

Active directory securityAdversary emulationMITRE ATT&CKMulti-Criteria Decision-Making (MCDM)Technique prioritizationThreat intelligence

Identifiers

PMID40738933
PMCPMC12311202

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.