Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.29027

Beyond Tokens: NumAnchor for Address-Grounded Numeric Operand Representation in Assembly Language Models

Kun Liu·Keith Mitchell·Xin Hu·Jiangcheng Yu·Chenke Luo·Zhengming Ding·Haotian Zhang·Jiang Ming
View original source ↗Read source document ↗Export metadata ↓

Abstract

Assembly language models (ALMs) are becoming important for automated binary analysis, yet their token-level interfaces often obscure numeric-like operands. In two corpora, such operands account for 45.7% and 40.9% of operand occurrences and may denote branch targets, global data, stack slots, constants, or unresolved pointer-derived values. Existing normalization strategies often lose their identities and structural relationships. We present NumAnchor, an input-boundary adapter that represents recoverable numeric-like operands as typed, canonicalized program entities. NumAnchor encodes code, data, and stack context in compact structural side descriptors, preserving entity identity and locality without increasing the host sequence length. These descriptors are fused into input embeddings before the first Transformer layer, while the host architecture, pretraining objectives, and downstream protocols remain unchanged. Probing frozen instruction-level embeddings yields 98.7% hierarchical-location accuracy and AUROC scores of 0.932 and 0.907 for jump and call target alignment, respectively, showing that the encoded structural information remains recoverable. Across multiple ALM families, NumAnchor achieves relative improvements of up to 35.0% in Recall@1 and 31.7% in MRR on 10k-candidate function retrieval, and improves execution-aware type recovery by up to 5.2 F1 points. Ablations show complementary gains from code, data, and stack descriptors with modest overhead.

Explore related subjects

cs.CR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kun Liu, Keith Mitchell, Xin Hu, Jiangcheng Yu, Chenke Luo, Zhengming Ding, Haotian Zhang, Jiang Ming. 2026-10-21. Beyond Tokens: NumAnchor for Address-Grounded Numeric Operand Representation in Assembly Language Models. https://arxiv.org/abs/2610.29027

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

SweepMark: Query-Free and High-Fidelity Attacks on Robust Audio Watermarking

Audio watermarking embeds imperceptible signals into speech to trace misuse in text-to-speech (TTS) synthesis. Existing removal attacks may retain watermark-related artifacts or degrade speech quality when suppressing them. We propose SweepMark, a query-free black-box attack that targets these artifacts without access to target watermarking models or paired clean and watermarked samples. Our key insight is that watermark embedding introduces spectral patterns that are not fully aligned with natural speech, including persistent structures that conventional speech enhancement may retain. Diverse Artifact Learning extracts complementary stationary and non-stationary patterns, using customized spectral artifacts added to public speech to learn persistent structures without target watermark examples. Adaptive Artifact Scaling then combines and amplifies these patterns for subtraction while constraining distortion. Across two speech datasets and four watermarking methods, SweepMark achieves average attack success rates of 92% and 96%, with higher perceptual quality scores overall than the evaluated adaptive attacks. Automatic speech recognition evaluation indicates that linguistic content is largely preserved. Further experiments with three TTS systems show high attack success against two synthesis-resistant watermarking methods in speech generated after fine-tuning on attacked recordings.

cs.CR↗
arXiv2026

CoSec: Benchmarking Agent Security in Communities

LLM agents operate in persistent collaborative environments involving multiple users, communities, memories, files, and tools. Community boundaries may remain fixed or evolve with changes in membership, roles, composition, and relationships. Agents must complete legitimate tasks and prevent unauthorized disclosure of protected information. Existing evaluations do not fully examine these risks in agent systems. We introduce \textbf{CoSec}, an executable benchmark for evaluating privacy and authorization enforcement in LLM agent systems operating within and across communities. CoSec contains 208 canonical scenarios spanning fixed and evolving boundaries, protected information belonging to the agent owner or other participants, and attacks through dialogue, environmental content, persistent memory, and composed workflows. CoSec executes complete agent systems with persistent sessions, memory, files and tools. It verifies information flows against the active authorization state using execution traces and artifacts. Across harness and model configurations, agents frequently complete benign tasks but violate privacy and authorization boundaries. Privacy behavior varies across harnesses, attack surfaces, and community states, revealing how memory, files, tools, and workflows can carry protected information beyond its authorized scope. These findings show that task utility does not imply privacy or authorization compliance and that authorization in community settings remains an unresolved security challenge for persistent LLM agents.

cs.CR↗
arXiv2026

Regular Syndrome Decoding Is Easier Than Previously Estimated

The Regular Syndrome Decoding (RSD) problem is a structured variant of classical Syndrome Decoding and underlies a growing number of efficient cryptographic constructions, including zero knowledge protocols, pseudorandom correlation generators, and MPC in the Head signatures. Although RSD is generally believed to be computationally hard, recent works have shown that algebraic attacks can outperform information set decoding on important RSD parameter regimes. Building on this line of work, we revisit the concrete hardness of RSD and show that many widely used parameter sets are substantially easier to solve than previously estimated. This improvement stems from a refined hybrid algebraic attack that exposes and removes a previously overlooked source of concrete complexity: the joint blockwise placement of zero coordinate guesses and syndrome based variable eliminations. Rather than treating the two guessing stages and linear elimination as largely separate choices, our method coordinates them across all regular blocks so that the guessing penalty is balanced while sufficient equations are retained for linearization. This gives a systematic block balancing principle for the entire guess reduce solve pipeline. We reassess several RSD based applications, including Ferret, Wolverine, and committed VOLE. Our estimates place at least one parameter set per application below its 128 bit target, with losses approaching 67 bits. On PCG benchmarks, we improve previous best attack costs by up to 29.77 and 25.91 bits over non binary and binary fields, respectively. Moreover, for the revised 128 bit PCG parameter sets of Liu et al. evaluated here, estimated attack costs are all below $2^{111}$ field operations. These results substantially revise the concrete security landscape of RSD and indicate that several existing parameter choices overestimate the hardness of their underlying RSD instances.

cs.CR↗