DISARM: Target Electronic Device Informed Mitigation of Software Runtime Side-Channel Vulnerabilities

• URL: http://arxiv.org/abs/2606.19807v1
• Date: Thu, 18 Jun 2026 05:22:38 GMT
• Title: DISARM: Target Electronic Device Informed Mitigation of Software Runtime Side-Channel Vulnerabilities
• Abstract summary: Program runtime or timing attacks exploit variations in a program's execution times to extract sensitive information.<n>We propose DISARM, a joint hardware-software methodology for mitigating runtime side-channel vulnerabilities.<n>We implement DISARM to support C, C++, and Java source codes and validate it across 22 standard benchmarks.
• Score: 2.537406035246369
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Program runtime or timing attacks exploit variations in a program's execution times to extract sensitive information from the program (e.g. encryption keys, sensitive variable data, intellectual property). State-of-the-art solutions to runtime side-channel attacks attempt to balance the execution time of the sensitive code for different control flow paths to eliminate the timing leakage. However, during the mitigation process, most techniques do not consider the underlying hardware or device on which the target program is supposed to run on. This can lead to over-fixing (unnecessary extra operations), under-fixing (not solving the imbalance properly), and even failures. We propose DISARM, a joint hardware-software methodology (unlike any existing solution) for mitigating runtime side-channel vulnerabilities that utilizes timing values from real embedded devices to generate targeted software fixes. We implement DISARM to support C, C++, and Java source codes and validate it across 22 standard benchmarks. DISARM outperforms state-of-the-art solutions such as PENDULUM and DifFuzzAR in terms of execution time overhead, code size overhead, and correctness on five different embedded or edge devices.

Related papers

• JENGA: Exploiting Counter-Based RowHammer Countermeasures to Break Real-Time Predictability [35.57593915694623]
  We study the impact of RowHammer countermeasures on the timing behaviour of real-time systems.<n>We introduce JENGA, an attack in which an attacker-controlled task manipulates the internal state of the RowHammer countermeasure mechanism.<n>We show that such an attack can delay tasks up to 200% of their WCET, making the initial time-safety assumptions unsafe.
  arXiv  Detail & Related papers  (2026-09-01T11:08:10Z)
• DALC-CT: Dynamic Analysis of Low-Level Code Traces for Constant-Time Verification [0.08749675983608168]
  We propose a novel approach for verifying constant-time programs based on dynamic analysis of low-level execution traces.<n>We developed an open-source tool called DALC-CT, for the constant-time verification of programs using this approach.
  arXiv  Detail & Related papers  (2026-04-18T04:47:54Z)
• SOL-ExecBench: Speed-of-Light Benchmarking for Real-World GPU Kernels Against Hardware Limits [33.140868197031985]
  SOL-ExecBench is a benchmark of 235 optimization problems extracted from 124 production and emerging AI models.<n>It measures performance against analytically derived Speed-of-Light (SOL) bounds computed by SOLAR.<n>We report a SOL Score that quantifies how much of the gap between a release-defined scoring baseline and the hardware SOL bound a candidate kernel closes.
  arXiv  Detail & Related papers  (2026-03-19T17:30:02Z)
• AgentDropoutV2: Optimizing Information Flow in Multi-Agent Systems via Test-Time Rectify-or-Reject Pruning [34.06688334066569]
  AgentDropoutV2 is a test-time rectify-or-reject pruning framework designed to dynamically optimize MAS information flow without retraining.<n>Our approach acts as an active firewall, intercepting agent outputs and employing a retrieval-augmented to iteratively correct errors.<n> Empirical results on extensive math benchmarks show that AgentDropoutV2 significantly boosts the MAS's task performance.
  arXiv  Detail & Related papers  (2026-02-26T17:31:43Z)
• BASICS: Binary Analysis and Stack Integrity Checker System for Buffer Overflow Mitigation [0.0]
  Cyber-Physical Systems have played an essential role in our daily lives, providing critical services such as power and water.<n>Traditional vulnerability discovery techniques struggle with scalability and precision when applied directly to the binary code of C programs.<n>This work introduces a novel approach designed to overcome these limitations by leveraging model checking and concolic execution techniques.
  arXiv  Detail & Related papers  (2025-11-24T20:11:41Z)
• LibIHT: A Hardware-Based Approach to Efficient and Evasion-Resistant Dynamic Binary Analysis [4.42052953892569]
  LibIHT is a hardware-assisted tracing framework that captures program control-flow with minimal performance impact.<n>We implement LibIHT as an OS kernel module and user-space library, and evaluate it on both benign benchmark programs and adversarial anti-instrumentation samples.
  arXiv  Detail & Related papers  (2025-10-17T22:42:33Z)
• Detecting Hardware Trojans in Microprocessors via Hardware Error Correction Code-based Modules [49.1574468325115]
  Hardware Trojans (HTs) enable attackers to execute unauthorized software or gain illicit access to privileged operations.<n>This manuscript introduces a hardware-based methodology for detecting runtime HT activations using Error Correction Codes (ECCs) on a RISC-V microprocessor.
  arXiv  Detail & Related papers  (2025-06-18T12:37:14Z)
• SEPE-SQED: Symbolic Quick Error Detection by Semantically Equivalent Program Execution [34.48913676566932]
  Symbolic quick error detection (SQED) has greatly improved efficiency in formal chip verification. We propose a new variant called symbolic quick error detection by semantically equivalent program execution (SEPE-SQED) SEPE-SQED effectively detects single-instruction bugs by differentiating their impact on the original instruction and its semantically equivalent program.
  arXiv  Detail & Related papers  (2024-04-04T03:11:24Z)
• Securing Optimized Code Against Power Side Channels [1.589424114251205]
  Security engineers often sacrifice code efficiency by turning off compiler optimization and/or performing local, post-compilation transformations. This paper proposes SecConCG, a constraint-based compiler approach that generates optimized yet secure code.
  arXiv  Detail & Related papers  (2022-07-06T12:06:28Z)
• Fault-Aware Neural Code Rankers [64.41888054066861]
  We propose fault-aware neural code rankers that can predict the correctness of a sampled program without executing it. Our fault-aware rankers can significantly increase the pass@1 accuracy of various code generation models.
  arXiv  Detail & Related papers  (2022-06-04T22:01:05Z)

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.