RowHammer Vulnerability Counter (RVC): Redefining RowHammer Detection with Victim-Centric Tracking

• URL: http://arxiv.org/abs/2604.24287v1
• Date: Mon, 27 Apr 2026 10:21:51 GMT
• Title: RowHammer Vulnerability Counter (RVC): Redefining RowHammer Detection with Victim-Centric Tracking
• Abstract summary: The Rowhammer vulnerability poses an increasing challenge with newer generations of DRAM and aggressive technology scaling.<n>Existing mitigation techniques, such as Graphene, Twice, and Hydra, primarily rely on tracking activation counts for each row.<n>We propose a novel framework called Rowhammer Vulnerability Count (RVC), which shifts the focus from activation count tracking to evaluating a row's actual vulnerability to bit flips selectively.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Rowhammer vulnerability poses an increasing challenge with newer generations of DRAM and aggressive technology scaling. Existing mitigation techniques, such as Graphene, Twice, and Hydra, primarily rely on tracking activation counts for each row and issuing refreshes when a row reaches a predefined tracking threshold. However, these methods have inherent limitations, including inefficiencies in identifying rows genuinely at risk of bit flips. In this paper, we propose a novel framework called Rowhammer Vulnerability Count (RVC), which shifts the focus from activation count tracking to evaluating a row's actual vulnerability to bit flips. By selectively issuing refreshes only to rows on the verge of experiencing bit flips, RVC drastically reduces unnecessary refresh operations. We also demonstrate that prior works have incorrectly set tracking thresholds, leading to security flaws. Our evaluation shows that RVC achieves 95 - 99.99% improvement in mitigation induced refreshes when compared to Graphene, with no additional space overhead. Furthermore, RVC improves energy efficiency and reduces average LLC latency by up to 76.91%, making it a highly efficient and scalable solution for addressing Rowhammer in modern DRAM systems. These findings establish RVC as a superior approach for preventing Rowhammer, outperforming existing methods in both accuracy and efficiency.

Related papers

• PulseCol: Periodically Refreshed Column-Sparse Attention for Accelerating Diffusion Language Models [61.39458217121294]
  Inference in diffusion large language models (dLLMs) is computationally expensive.<n>Recent sparse attention methods for dLLMs mitigate this cost via block-sparse computation.<n>We introduce PulseCol, a periodically refreshed column-sparse attention method.
  arXiv  Detail & Related papers  (2026-05-20T07:06:54Z)
• Loaded Dice: Solving the Non-Selection Problem for Scalable Probabilistic RowHammer Defense [12.03490786085903]
  JEDEC introduced Per Row Activation Counting with the Alert Back-Off protocol as an optional DDR5 feature.<n> PRAC requires per-row counter cells that incur area overhead, and updating them on every activation lengthens DRAM timing parameters.<n>We propose PrISM, an intersection-based probabilistic mitigation that correlates sampled rows across windows.
  arXiv  Detail & Related papers  (2026-05-17T09:54:02Z)
• BadCLIP++: Stealthy and Persistent Backdoors in Multimodal Contrastive Learning [73.46118996284888]
  Research on backdoor attacks against multimodal contrastive learning models faces two key challenges: stealthiness and persistence.<n>We propose BadCLIP++, a unified framework that tackles both challenges.<n>For stealthiness, we introduce a semantic-fusion QR micro-trigger that embeds imperceptible patterns near task-relevant regions.<n>For persistence, we stabilize trigger embeddings via radius shrinkage and centroid alignment.
  arXiv  Detail & Related papers  (2026-02-19T08:31:16Z)
• Beyond SGD, Without SVD: Proximal Subspace Iteration LoRA with Diagonal Fractional K-FAC [50.36542772932594]
  Low-Rank Adaptation (LoRA) fine-tunes large models by learning low-rank updates on top of frozen weights.<n>In this work, we address the gap between training with full steps with low-rank projections (SVDLoRA) and LoRA fine-tuning.<n>We propose LoRSum, a memory-efficient subroutine that closes this gap for gradient descent.
  arXiv  Detail & Related papers  (2026-02-18T13:41:41Z)
• Decomposing and Composing: Towards Efficient Vision-Language Continual Learning via Rank-1 Expert Pool in a Single LoRA [50.97792275353563]
  We introduce a novel framework that restructures a single Low-Rank Adaptation (LoRA) module as a decomposable Rank-1 Expert Pool.<n>Our method learns to dynamically compose a sparse, task-specific update by selecting from this expert pool, guided by the semantics of the [Guided] token.
  arXiv  Detail & Related papers  (2026-01-30T10:54:51Z)
• Spark Transformer: Reactivating Sparsity in FFN and Attention [53.221448818147024]
  We introduce Spark Transformer, a novel architecture that achieves a high level of activation sparsity in both FFN and the attention mechanism.<n>This sparsity translates to a 2.5x reduction in FLOPs, leading to decoding wall-time speedups of up to 1.79x on CPU and 1.40x on GPU.
  arXiv  Detail & Related papers  (2025-06-07T03:51:13Z)
• QPRAC: Towards Secure and Practical PRAC-based Rowhammer Mitigation using Priority Queues [4.3423142741332255]
  JEDEC has introduced the Per Row Activation Counting (PRAC) framework for DDR5 and future DRAMs.<n> PRAC enables a holistic mitigation of Rowhammer attacks even at ultra-low Rowhammer thresholds.<n>This paper provides the first secure, scalable, and practical RowHammer solution using the PRAC framework.
  arXiv  Detail & Related papers  (2025-01-31T02:48:20Z)
• ORCHID: Streaming Threat Detection over Versioned Provenance Graphs [11.783370157959968]
  We present ORCHID, a novel Prov-IDS that performs fine-grained detection of process-level threats over a real time event stream. ORCHID takes advantage of the unique immutable properties of a versioned provenance graphs to iteratively embed the entire graph in a sequential RNN model. We evaluate ORCHID on four public datasets, including DARPA TC, to show that ORCHID can provide competitive classification performance.
  arXiv  Detail & Related papers  (2024-08-23T19:44:40Z)
• Randomized Line-to-Row Mapping for Low-Overhead Rowhammer Mitigations [0.716879432974126]
  Recently proposed secure Rowhammer mitigations rely on performing mitigative action on the aggressor rather than the victims. We propose Rubix, which breaks the spatial correlation in the line-to-row mapping by using an encrypted address to access the memory. We also propose Rubix-D, which dynamically changes the line-to-row mapping.
  arXiv  Detail & Related papers  (2023-08-28T21:22:15Z)
• DSAC: Low-Cost RowHammer Mitigation Using In-DRAM Stochastic and Approximate Counting Algorithm [3.8274879841876546]
  This paper provides the fundamental mechanisms of two types of row activation-induced bit flips.<n>It proposes in-DRAM protection techniques, which can achieve 133x lower Maximum Disturbance than the state-of-the-art counter-based algorithm.
  arXiv  Detail & Related papers  (2023-02-07T16:58:58Z)
• Cascaded Regression Tracking: Towards Online Hard Distractor Discrimination [202.2562153608092]
  We propose a cascaded regression tracker with two sequential stages. In the first stage, we filter out abundant easily-identified negative candidates. In the second stage, a discrete sampling based ridge regression is designed to double-check the remaining ambiguous hard samples.
  arXiv  Detail & Related papers  (2020-06-18T07:48:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.