Skip to content

69 results for β€œARM”

What you seeeverything
  1. Optimality and Efficiency of Higher-Order Rank-Based Side-Channel Attacks against Inner Product Masking Schemes

    HO-ASPA (Higher-Order Adjusted Spearman Coefficient Analysis) is a rank-based, non-profiling side-channel distinguisher. The paper derives its optimal form against two-share Boolean masking and inner product masking under Hamming weight and LSB leakage. It finds no significant gap between higher and lower orders for HO-ASPA, unlike HO-CPA, and reports that it beats Kruskal-Wallis-based attacks in simulated and real-world experiments.

    eprint.iacr.orgpaperAdded 31 Oct 2026, published 29 Oct 2026πŸ›‘οΈ Security

  2. Quantize by Doing: Task-Guided Mixed-Precision Quantization of Vision-Language-Action Models

    QbD-VLA is a mixed-precision post-training quantization method for vision-language-action models. It uses task success from short closed-loop evaluations to assign weight and activation bit widths, accounting for interactions between components. On four VLA models across all four LIBERO suites it holds task performance at about 4-bit weights and under 6-bit activations. The gain on SIMPLER is small. On a Franka Research 3 arm, X-VLA shows no detected loss, but Ο€0.5 fails.

    arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🧠 AI

  3. CRISP: Co-designing Pruning and Scheduling for Efficient MoE Inference on Edge Servers

    CRISP is a combination-aware framework that co-designs pruning and runtime scheduling for Mixture-of-Experts inference on memory-constrained edge platforms. It reorders neurons by importance so one stored expert supports several execution widths, gives hot, warm and cold expert combinations different widths, and overlaps expert loading with computation. On Mixtral-8x7B and DeepSeek-MoE-16B it raises throughput up to 2.1x at the same memory budget, with accuracy loss limited to 3.6%.

    arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🧠 AI

  4. Falcon Key Recovery from Joint Sampler Leakages

    Falcon Key Recovery from Joint Sampler Leakages is an ePrint paper presenting a power side-channel attack on Falcon and FN-DSA that fuses three SamplerZ leakages (exponent class of the center, sign bit, proposal magnitude). It turns them into slab and halfspace constraints solved by softplus interval regression, with no LLL or BKZ. On PQClean Falcon-512 (ARM Cortex-M4) it recovered all 50 keys with at most 34 signatures; on c-fn-dsa it recovered 38 of 50 keys within 200 signatures.

    eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  5. AK_QMUL at ArGuard Shared Tasks: A Single Fine-Tuned JAIS for Arabic Harmful-Prompt Detection

    AK_QMUL's system for the ArGuard-2026 shared tasks fine-tunes JAIS-6.7B with 4-bit QLoRA and a linear head on the last-token representation. For binary safe/unsafe detection (B1) it uses a four-way head over dialect register and AraSafe MSA augmentation, reaching macro-F1 0.984. For seven-way harm domain (B2) it averages five seeds, reaching 0.790. Both ranked first. Bully is the weakest class.

    arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026🧠 AI

  6. Non-profiled Single-Trace ML-DSA Secret Key Recovery by Horizontal Distribution Analysis

    Non-profiled single-trace side-channel attack on ML-DSA-65 (Dilithium) running on ARM Cortex-M4, by Linus Backlund and Elena Dubrova (KTH). It compares observed sample distributions with expected Hamming weight leakage using a Gaussian mixture model, and stacks partitioned trace segments for multiple observations. Information-set decoding corrects misclassifications; with a 2^70 enumeration budget, the full secret key is recovered from one trace in 99% of attacks, using secret key unpacking as the attack point.

    eprint.iacr.orgpaperPublished and added 26 Oct 2026πŸ›‘οΈ Security

  7. SentryBench: A Cost-Sensitive Benchmark for Adversarial Robustness of Tool-Using LLM Agents in Public-Safety Deployments

    SentryBench is a benchmark for tool-using LLM agents in public-safety deployments. It scores attack success, over-refusal (missing a real emergency) and over-reaction (unwarranted action) on a cost-sensitive frontier, using real emergency-call transcripts, disaster messages and injection payloads. Across 840 episodes on three frontier models and three defenses, refuse-more caution pushed over-refusal to 100 percent on two models, while a trust-gating wrapper gave the lowest harm.

    arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026🧠 AI

  8. SentryBench: A Cost-Sensitive Benchmark for Adversarial Robustness of Tool-Using LLM Agents in Public-Safety Deployments

    SentryBench is a benchmark for tool-using LLM agents in public-safety settings (public alerts, responder dispatch, citizen-record queries). It scores attack success, over-refusal and over-reaction on a cost-sensitive frontier, using real emergency-call transcripts and real injection/jailbreak payloads. Across 840 episodes on three frontier models and three defenses, refuse-more caution raised over-refusal to 100 percent on two models, while a trust-gating wrapper gave the lowest harm on every model.

    arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026πŸ›‘οΈ Security

  9. UAV-SwarmAgent: Scalable Multi-UAV Reconnaissance and Task Allocation via Code Generation and Vision-Language Reasoning

    UAV-SwarmAgent is a hierarchical multi-agent system where an operator gives one natural-language sentence and a ground-station agent writes and runs code that produces per-UAV routes. A vision-language model grounds targets in an aerial map, and worker agents verify incidents with a compact onboard model. In simulation it located the incident in 244 of 255 missions (95.7%), and flight time followed an Amdahl-type law with speedup bounded at 1.52x for one to five UAVs.

    arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026🧠 AI

  10. On Task, Off Track: Benchmarking LLM and Agent Robustness to Near-Target Prompt Injection

    NTBench (Near-Target Benchmark) tests LLM and agent robustness to near-target prompt injection, where injected instructions steer a response toward a plausible but incorrect or harmful outcome instead of abandoning the task. It builds reference-guided target-instruction pairs on existing datasets, with human validation, and evaluates seven LLMs on ten language datasets and two agent benchmarks. Attack success rose 9.3 to 35.8 points (incorrect targets) and 1.7 to 17.3 points (harmful targets) over fixed-target baselines.

    arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026πŸ›‘οΈ Security

  11. Semantically Rich, Metrically Affect-Blind: A Geometric Blind Spot in Modern Text Embedders

    Sentiment-Injected Sentence Embeddings (SISE) addresses a finding across eleven frozen text encoders (2021 to 2026): linear probes recover sentence polarity at up to 91.3% accuracy, but cosine similarity separates polarity by only 0.003-0.064. A small supervised-contrastive head (0.13M-0.69M parameters) trained on CPU raises retrieval MAP by up to 26 points, but the 128-d head loses 38-41 STS-B Spearman points. The paper also releases the Attribute Alignment Gap diagnostic.

    arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026🧠 AI

  12. RingTrace: Model-Free Spatio-Temporal Detection and Core Attribution for Cache Side-Channels

    RingTrace is a monitoring framework that detects Flush+Reload cache side-channel attacks by combining per-core cache-miss counters with slice activity across uncore CBoxes. Its Joint Spatio-Temporal Attribution (JSTA) builds a joint-activity matrix without model training: the largest entry is the screening score and row sums point to a candidate core. The authors report detection before secret leakage, fewer false alarms under heavy memory load, and negligible runtime overhead on commodity processors.

    eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026πŸ›‘οΈ Security

  13. Efficient NTRU+ Implementations on Cortex-M

    Efficient NTRU+ Implementations on Cortex-M presents NTRU+ KEM implementations built on 3-way NTTs for Arm Cortex-M0+, M3, M4 and M7. It adds omega-folded front layers that handle ternary inputs without modular reduction. The speed-optimized version cuts execution time by up to 52.43% against the official optimized C code. The memory-optimized version cuts peak stack use by up to 82.60%.

    eprint.iacr.orgpaperAdded 21 Oct 2026, published 20 Oct 2026πŸ›‘οΈ Security

  14. FN-DSA on Arm Cortex-M55: Revisiting a Floating-Point Lattice Signature with Native FP64 and Helium

    FN-DSA on Arm Cortex-M55 is an ePrint paper presenting the first FN-DSA (NIST post-quantum signature) implementation on this core that reproduces the reference known-answer tests and runs in constant time. It uses the native FP64 FPU for signing and Helium (MVE) for NTT, key-generation FFT and Keccak, with SLOTHY rescheduling. Key generation, signing and verification are up to 1.23x, 1.93x and 1.30x faster than the reference, and four-signature batch verification up to 1.75x.

    eprint.iacr.orgpaperPublished and added 20 Oct 2026πŸ›‘οΈ Security

  15. Efficient and Compact High-order Masking Raccoon on Memory Constrained Devices

    The paper presents the first efficient, compact implementation of high-order masked Raccoon (lattice-based signature, CRYPTO 2024) on ARM Cortex-M4, up to 32 masking orders. It uses 3+3+3 layer-merged 32-bit NTT/INTT with lazy reduction, a negative double Montgomery reduction, and one-shot SHAKE256 sampling (at least 1.80x faster). It beats the reference by 1.85x-2.25x and masked Dilithium3 at orders 2, 4 and 8. Second-order leakage tests show DPA resistance once micro-architectural transitional leakage is mitigated.

    eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026πŸ›‘οΈ Security

  16. DPA-style Attacks on VOLE-in-the-Head Signature Schemes

    Presents the first DPA-style power side-channel attack framework against VOLE-in-the-Head signature schemes, targeting the secret witness whose recovery enables forging signatures on arbitrary messages. It analyzes leakage from sensitive intermediate values in VOLE correlations and proposes six attack classes (two vertical, four horizontal) on FAEST and SDitH, both in NIST's third round of additional signatures. Attacks are validated with simulated leakage under varying noise and real measurements on three ARM Cortex-M4 devices.

    eprint.iacr.orgpaperPublished and added 17 Oct 2026πŸ›‘οΈ Security

  17. GLOBE: Evolving Structured Agentic Memory for E-commerce Product Optimization in Generative Search

    GLOBE is an agentic framework that optimizes e-commerce product listings for generative search by storing strategies in an evolving handbook of explicit, field-scoped behaviors. An Editor applies behaviors and gets rank-based feedback, a Reflector turns it into updates, a Moderator removes redundant proposals, and a Curator commits changes. Harmful behaviors are deactivated. Structured behaviors beat monolithic prompt optimization and transfer to unseen product categories.

    arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026🧠 AI

  18. Secure Compilation of Probabilistic Side-Channel Countermeasures

    Presents a language- and leakage-model-agnostic framework for provably secure compilation of probabilistic side-channel countermeasures. It uses a deterministic leakage-preservation relation that implies preservation of d-NI, d-SNI and cryptographic constant-time without probabilistic proof obligations. The authors prove in Rocq that a model of the Jasmin compiler's core pipeline and several optimizing passes preserve security in the value-probing model with glitches. They also add source-level annotations to harden against transition leakage and release libmasking, an arbitrary-order masked gadget library in Jasmin that compiles to ARM and RISC-V, with C bindings and hardware benchmarks.

    eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026πŸ›‘οΈ Security

  19. Identify, Classify, Act: Per-Instruction Controlled Compliance for LLMs over External Data

    EDIC is a decomposed reward framework that trains LLMs to decide, for each instruction embedded in external data such as documents or tool returns, whether to follow or reject it. A judge initialized with SFT and refined with GRPO attributes compliance per instruction and yields separate rewards for beneficial and harmful compliance. On Qwen3-4B it raises harmful-rejection by up to 7.7% and Arena-Hard-Auto utility by 12.5% over the strongest prior defense.

    arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026🧠 AI

  20. Identify, Classify, Act: Per-Instruction Controlled Compliance for LLMs over External Data

    EDIC is a decomposed reward framework for per-instruction compliance in LLMs that read external data, where one document or tool return mixes legitimate directives with injected ones. A generative judge, trained with SFT then GRPO, attributes compliance per instruction and produces RL rewards for beneficial and harmful compliance. On Qwen3-4B it raises harmful rejection by up to 7.7% and Arena-Hard-Auto utility by 12.5% across five benchmarks.

    arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026πŸ›‘οΈ Security

  21. Value as Memory: Online Value-Guided Post-training for General Robot Policies

    Value as Memory (VaM) is a post-training framework for generalist robot policies. It addresses partial observability and the delayed feedback of offline post-training. Value caching conditions actions on recent value predictions as task-progress memory. Online real-world RL combines offline demonstrations, off-policy interventions and on-policy rollouts, and moves from offline RL warmup to autonomous learning with sparse rewards. On long-horizon deformable-object and contact-rich manipulation tasks it gains 29.4% mean absolute success rate from value caching and 32.8% from online learning over matched offline training. The online schedule runs 8x as many policy iterations under the same gradient-step budget, with over 2x lower time per gradient step from concurrent data collection and training.

    arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

  22. Game2Real-Bench: Do Toy Games Reveal and Transfer to Real-World Visual Reasoning?

    Game2Real-Bench tests whether vision-language model performance on procedurally generated toy games predicts real-world visual reasoning, and whether game examples help transfer. It has 1,000 verifiable game samples and 400 real-world samples, matched by shared reasoning requirements (fine-grained perception, spatial reasoning, constraint reasoning, sequential planning). Across 25 VLMs, game and real scores correlate strongly (Pearson/Spearman 0.935). One-shot game-to-real transfer on four models improves constraint reasoning for several but hurts fine-grained perception. The authors also release Game2Real-Dataset, with about 24K verified game samples across 18 tasks and 65 QA families.

    arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026🧠 AI

  23. Breaking First-Order Masked Kyber with Belief Propagation Alone

    Preprint recovering the long-term key of a first-order masked Kyber768 implementation on an ARM Cortex-M4 from about 2200 decapsulation power traces using only valid ciphertexts. A profiled neural network estimates Hamming-weight distributions of both arithmetic shares, which are turned into likelihoods on decryption noise and combined by a belief-propagation solver with Gaussian interference approximation and an Onsager (AMP) correction, recovering all 1536 secret and error coefficients without lattice reduction. It shows first-order masking is insufficient against combined second-order leakage, and that least squares, greedy solvers and lattice hints (BKZ block size 624 to 505 at 2000 traces) do worse.

    eprint.iacr.orgpaperAdded 14 Oct 2026, published 12 Oct 2026πŸ›‘οΈ Security

  24. Can agents whose sole duty is to keep humans alive be hijacked to kill? Delayed multi-turn derived-action trap attacks in simulated high-stakes environments

    Paper testing whether an LLM agent operating life support in the NASA-derived BioSim lunar habitat simulation can be induced by delayed prompt injection, hidden in truthful S-band telemetry, to shut down life support and hold the shutdown while the crew suffocates. It compares Claude, GPT and Grok configurations: Claude mostly refuses and cites the living crew, GPT shows some susceptibility, and Grok given a "trusted commission" framing more often cuts life support. It also varies the framing of the message (trusted commission, peer, untrusted source) and uses a harmless-procedure-drop attack as a proxy for whether life is valued intrinsically. Code and traces are open-sourced.

    arxiv.orgpaperAdded 15 Oct 2026, published 10 Oct 2026πŸ›‘οΈ Security

  25. Efficient Vectorized Implementation of MQOM

    ePrint paper presenting a vectorized implementation of the MQOM v2.1 post-quantum signature scheme (a NIST additional-signature candidate). It uses a transpose-enabled paired-matrix trick to cut wasted SIMD work and memory traffic. It benchmarks key generation, signing, verification and memory on Arm NEON, x86 AVX2 and AVX-512, with peak dynamic memory down by up to 39.43%. Supplementary experiments check how the matrix-layout optimization carries over to the Round-3 MQOM v3 code. Useful for practitioners assessing the deployment cost of post-quantum signatures.

    eprint.iacr.orgpaperAdded 14 Oct 2026, published 10 Oct 2026πŸ›‘οΈ Security

  26. Beyond the Monolithic Interface: A Research Agenda for Plural Conversational AI

    A narrative review in HCI arguing that the single-voice chatbot interface causes three harms: cognitive offloading, ideological narrowing of user beliefs, and epistemic compression of cultural and value diversity. It proposes multi-persona interfaces, which show several personas to the user at once, as a low-cost fix. The design draws on game design and participatory simulation (magic circle, role differentiation, persona embodiment). It offers a taxonomy for designing such interfaces and calls for empirical studies that link technical pluralistic alignment methods to real human-AI interaction.

    arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026🧠 AI

  27. LTBD: Learnable Trust-Boundary Delimiters for Prompt Injection Defense

    Introduces Learnable Trust-Boundary Delimiters (LTBD), a defense against prompt injection that uses a few learnable delimiters to mark trusted user instructions versus untrusted external data, without changing LLM parameters. It reports 0.00% ASR on AlpacaFarm and 0.11-0.19% on TaskTracker, outperforming inference-time defenses and rivaling training-based ones with negligible overhead. It also holds up against adaptive attacks where the adversary knows the defense.

    arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026πŸ›‘οΈ Security

  28. SLDR: Defending Against Malicious Fine-tuning via Selective Layers Recovery and Dynamic Routing

    SLDR is a post-fine-tuning defense against malicious fine-tuning-as-a-service attacks, where an attacker fine-tunes an aligned LLM on a legitimate-looking task to covertly erode its refusal behavior. The method trains a LoRA "recovery" adapter only on the layers found to have maximal and minimal signed safety sensitivity, and uses representation-based dynamic routing at inference time to activate that adapter only for malicious queries, leaving benign task performance untouched. On Llama3.1 fine-tuned for SST2, it cuts the average harmful-output score from 11.54 to 0.08 while keeping downstream accuracy, and stays near-zero even when up to 90% of the fine-tuning data is poisoned.

    arxiv.orgpaperAdded 9 Oct 2026, published 7 Oct 2026πŸ›‘οΈ Security

  29. SLDR: Defending Against Malicious Fine-tuning via Selective Layers Recovery and Dynamic Routing

    SLDR is a post-fine-tuning defense that protects aligned LLMs from malicious fine-tuning-as-a-service attacks, which can quietly erode refusal behavior while keeping task performance intact. It trains a LoRA recovery adapter only on the layers with the most extreme (signed) safety sensitivity scores, then uses representation-based dynamic routing to activate that adapter solely for malicious queries at inference time. Evaluated across four model architectures, five downstream tasks, and four harmful-content benchmarks, it drives the average harmful score on Llama3.1/SST2 from 11.54 down to 0.08 while preserving downstream accuracy, and stays near zero even at poisoning ratios up to 0.9.

    arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🧠 AI

  30. Compromise Is Not Consequence: Evaluating Task-Scoped Authorization in LLM Agents with Paired Replay

    This paper introduces a paired-replay testbed that samples a single LLM agent request and replays the identical malicious action, resource, and arguments under four authorization conditions: broad bearer tokens, scoped JWTs, sender-constrained tokens, and Open Policy Agent policies. Across 128 scenarios in four tool domains and five local model configurations, broad-bearer tokens let roughly 9 to 38 percent of attacked, post-exposure decisions execute harmful actions, while all three scoped conditions recorded zero harmful executions; a supplementary AgentDojo extension found 11 of 24 injected attacks succeeded under broad policy versus 0 of 24 under scoping. The authors frame this as evidence that scoping contains cross-action and cross-resource consequences of prompt injection, not that it prevents the injection itself.

    arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026πŸ›‘οΈ Security

Showing 30 of 69

Show more