Sep 2026· Digital Threats: Research and Practice· 0 citations· 15 references
TL;DR
Frankenstein is presented, a simulation-based framework that synthesizes a memory dump from a time series of atomic, hypervisor-level ground-truth snapshots under a configurable traversal strategy and bandwidth model and proposes novel page-category priority orderings that cut semantic inconsistencies and Hamming distance respectively.
Abstract
Memory forensics relies on acquiring a faithful copy of RAM, yet software-based acquisition is inherently non-atomic: the operating system keeps modifying memory while pages are read, producing inconsistencies known as page smear. Prior work formalized quality criteria and measured such inconsistencies, but how the acquisition strategy, i.e., page order and transfer rate, affects image quality remains unexplored, and no public framework decouples strategy from the acquisition channel. We present Frankenstein, a simulation-based framework that synthesizes a memory dump from a time series of atomic, hypervisor-level ground-truth snapshots under a configurable traversal strategy and bandwidth model. We implement seven strategy–bandwidth combinations and evaluate them across three workloads via Hamming distance and semantic analysis. We find the acquisition strategy considerably affects quality, but, interestingly, no traversal minimizes byte-level distance and structural-semantic inconsistencies at the same time, since pages dominating byte-level change (user mappings, page cache) compete with pointer-rich kernel objects (slab, kernel pages) for the most timely acquisition. We therefore propose novel page-category priority orderings—a structural focus (slab and kernel pages first) and a volatile focus (user and page-cache pages first)—cutting semantic inconsistencies and Hamming distance respectively.
MixSan, a prototype built on RangeSanitizer (RSan), stores the same identity tag in pointer high bits through Intel Linear Address Masking (LAM) U57 and validates both the tag and the spatial bound with a unified 3-ALU-op check.
Xiao-Yun Lu, Qiang Wei, Yun-Feng Wang et al.· Applied Sciences· 0 citations
This work presents KVDiagnosis, a diagnostic dataset and benchmark with three contributions, a 25-method taxonomy that groups methods into five mechanism families and links them to eight verified implementations and their valid diagnostic measurements, and a common record format.
A novel framework that utilizes the Project Panama Vector API to perform predicate evaluation directly over bit-sliced, compressed data streams by transposing standard row-oriented data into parallel bit-planes to demonstrate a mechanism to evaluate complex filters using SIMD instructions without requiring prior decomp...
It is found that although the new protection measures aimed at stopping popular heap exploit techniques or restricting the exploit strategy space can effectively defend against the exploitation of most vulnerabilities, the attack strategies proposed by this work can still make these vulnerabilities exploitable again.
The results establish bounded feasibility and identify limitations that a deployment claim must not hide, as well as characterize cache-policy sensitivity, numerical comparison boundaries, and measurement limits.
This work presents Aray, a deterministic-first YARA interpreter and positive-fixture synthesizer, a deterministic-first YARA interpreter and positive-fixture synthesizer that validates generated fixtures against their source rules.
Emanuel C. A. Valente, Lourenço A. P. Júnior, L. Chahud et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.