From Fleet to Lab: Revisiting the Security and Complexity of Industrial Rowhammer Mitigation

• URL: http://arxiv.org/abs/2608.26072v1
• Date: Wed, 26 Aug 2026 17:38:45 GMT
• Title: From Fleet to Lab: Revisiting the Security and Complexity of Industrial Rowhammer Mitigation
• Abstract summary: This paper studies efficient and secure Rowhammer mitigation at the Memory-Controller (MC)<n>Rowhammer mitigation faces a fundamental tradeoff between tracking storage and mitigation rate.<n>Microsoft recently deployed Sigries, an MC-side Rowhammer defense that combines an under-provisioned Misra-Gries tracker with a row-sampling fallback.
• Score: 2.1198879079315573
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper studies efficient and secure Rowhammer mitigation at the Memory-Controller (MC). Rowhammer mitigation faces a fundamental tradeoff between tracking storage and mitigation rate: precise trackers (such as Misra-Gries) avoid unnecessary mitigations but require large CAM structures, whereas sampling-based schemes (such as PARA) require no storage but incur frequent mitigations even when not under attack. Microsoft recently deployed Sigries, an MC-side Rowhammer defense that combines an under-provisioned Misra-Gries tracker with a row-sampling fallback, in its Azure Cobalt 200 SoC. Sigries observed that the tracker-to-sampling transition can be insecure, and claimed the reverse transition is always safe. Our analysis shows that this transition is also vulnerable, and a Round-Robin Attack across sub-banks reduces the MTTF of Sigries to about 1 second, 8 orders of magnitude below the 13 years with PARA. Sigries also suffers from CAM complexity and high storage overheads. Our proposal, FiRM (Filtered Rowhammer Mitigation), is based on the insight that, for a secure design, the tracking-mode and sampling-mode should not be configured independently but co-designed to ensure the system remains secure not only in both modes but also during transitions. FiRM incurs zero slowdown for benign workloads, since they do not exceed the filtering threshold, and also replaces the complex CAM-based tracker with simple SRAM filters. To handle stressful patterns, we propose FiRM-P (probabilistic) and FiRM-D (deterministic). FiRM-P uses varying probabilities during transitions and steady state to ensure both security and low performance overhead. FiRM-D provides guaranteed deterministic security by modulating the rate of mitigation. Both FiRM-P and FiRM-D have less storage overhead than Sigries. Our paper shows that a principled approach can avoid both the insecurity and the complexity of Sigries.

Related papers

• SMTrap: Cost-Effective DoS Attacks Against Large Reasoning Models via SMT Conflict Guidance [47.25502169851139]
  Existing LRM-DoS methods rely heavily on model feedback to synthesize attack queries.<n>We propose emphsearch amplification, a model-feedback-free LRM-DoS paradigm.
  arXiv  Detail & Related papers  (2026-08-19T13:51:31Z)
• S$^3$AM: A Single-Stream SAM with Reliability-Calibrated Frequency Adapter for Multi-modal Salient Object Detection [74.15663758681849]
  Single-stream framework integrates reliability-calibrated frequency adaptation into the adopted SAM backbone for MSOD.<n>Experiments on RGB-D, RGB-T, and RGB-NIR salient object detection benchmarks validate that the proposed framework achieves competitive performance.
  arXiv  Detail & Related papers  (2026-08-18T08:05:00Z)
• Robust Shielding for Safe Reinforcement Learning [55.99069346593732]
  Shielding is an effective approach to formally guarantee the safety of reinforcement learning agents in Markov decision processes (MDPs)<n>We introduce a novel shielding framework for robust MDPs with sets of transition probabilities.<n>Our experiments show that our shields for learned MDPs guarantee safety in unknown MDPs while recovering strong expected return as the number of samples increases.
  arXiv  Detail & Related papers  (2026-05-29T19:01:12Z)
• $D^2$-Monitor: Dynamic Safety Monitoring for Diffusion LLMs via Hesitation-Aware Routing [63.49501120848927]
  Safety monitoring for large language models (D-LLMs) remains largely unexplored.<n>We propose $D2$-Monitor, a bi-level safety monitor for D-LLMs.<n>$D2$-Monitor adopts a lightweight probe as an always-on monitor to jointly estimate hesitation and perform base classification.
  arXiv  Detail & Related papers  (2026-05-25T14:22:21Z)
• 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)
• GLiGuard: Schema-Conditioned Classification for LLM Safeguard [5.918280835312565]
  We introduce textbfGLiGuard, a bidirectional encoder adapted from GLiNER2 for LLM content moderation.<n>The key idea is to encode task definitions and label semantics directly into the input sequence as structured token schemas.<n>GLiGuard achieves F1 scores competitive with 7B--27B decoder-based guards despite being 23--90$times$ smaller.
  arXiv  Detail & Related papers  (2026-05-08T16:44:07Z)
• RankGuide: Tensor-Rank-Guided Routing and Steering for Efficient Reasoning [10.68221932401407]
  Large reasoning models (LRMs) incur substantial inference latency and computational overhead.<n>We propose RankGuide, a framework that improves the efficiency and effectiveness of collaboration through tensor-rank-guided steering.<n>RankGuide reduces latency by up to $1.75times compared to LRM, while maintaining competitive accuracy relative to prior methods.
  arXiv  Detail & Related papers  (2026-04-17T20:51:04Z)
• LLM Readiness Harness: Evaluation, Observability, and CI Gates for LLM/RAG Applications [51.56484100374058]
  We present a readiness harness for LLM and RAG applications that turns evaluation into a deployment decision workflow.<n>The system combines automated benchmarks, OpenTelemetry observability, and CI quality gates under a minimal API contract.<n>We evaluate the harness on ticket-routing and BEIR tasks with full Azure matrix coverage.
  arXiv  Detail & Related papers  (2026-03-28T18:03:32Z)
• Are Reasoning LLMs Robust to Interventions on Their Chain-of-Thought? [79.86483056611105]
  Reasoning LLMs generate step-by-step chains of thought before giving an answer.<n>How robust are these reasoning traces to disruptions that occur within them?<n>We introduce a controlled evaluation framework that perturbs a model's own CoT at fixed timesteps.
  arXiv  Detail & Related papers  (2026-02-07T10:02:58Z)
• COSMO-RL: Towards Trustworthy LMRMs via Joint Safety and Stability [101.80200069234377]
  We present COSMO-RL, a mixed reinforcement learning framework that trains LMRMs under multimodal, multitask, and multiobjective signals.<n>Our approach aims to let safety and capability grow together in one stable pipeline rather than competing during alignment.
  arXiv  Detail & Related papers  (2025-10-05T13:30:03Z)
• Probabilistic Tracker Management Policies for Low-Cost and Scalable Rowhammer Mitigation [5.597216094757414]
  In recent years, solutions like TRR have been deployed in DDR4 DRAM to track aggressor rows and then issue a mitigative action by refreshing neighboring rows. Such in-DRAM solutions are resource-constrained (only able to provision few tens of counters to track aggressor rows) and are prone to thrashing based attacks, that have been used to fool them. In this work, we demonstrate secure and scalable rowhammer mitigation using resource-constrained trackers.
  arXiv  Detail & Related papers  (2024-04-24T23:57:58Z)
• ScionFL: Efficient and Robust Secure Quantized Aggregation [36.668162197302365]
  We introduce ScionFL, the first secure aggregation framework for federated learning. It operates efficiently on quantized inputs and simultaneously provides robustness against malicious clients. We show that with no overhead for clients and moderate overhead for the server, we obtain comparable accuracy for standard FL benchmarks.
  arXiv  Detail & Related papers  (2022-10-13T21:46:55Z)

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.