Searcharxiv⌕ Search

subject

cs.CR

cs.CR: explore 594 source-linked works published from 2022 to 2026, with original documents and citations.

This collection is a preview while coverage and quality are evaluated.

Search within this collection

Coverage and selection

Includes records with this source-supplied label or an explicit phrase match in their metadata. Matches indicate a mention, not proof that a paper uses a method or tests a material. Source versions are consolidated by DOI.

Sources: arxiv. Collection updated 2026-09-16. Counts describe this index, not the complete source archives.

Dataset Protection via Watermarked Canaries in Retrieval-Augmented LLMs

Retrieval-Augmented Generation (RAG) has become an effective method for enhancing large language models (LLMs) with up-to-date knowledge. However, it may pose a risk of copyright infringement, as IP datasets may be incorporated into the knowledge database by malicious Retrieval-Augmented LLMs (RA-LLMs) without authorization. To protect the rights of the dataset owner, an effective dataset membership inference algorithm for RA-LLMs is needed. In this work, we introduce a novel approach, \textit{CanaryTrace}, to safeguard the ownership of text datasets and effectively detect unauthorized use by RA-LLMs. Our approach preserves the original data completely unchanged while protecting it by inserting specifically designed canary documents into the IP dataset. These canary documents are created with synthetic content and embedded watermarks to ensure uniqueness, consistency, and statistical provability. During the detection process, unauthorized usage is identified by querying the canary documents and analyzing the responses of RA-LLMs for statistical evidence of the embedded watermark. Our experimental results demonstrate high query efficiency, detectability, and consistency, along with minimal perturbation to the original dataset, all without compromising the performance of the RAG system.

cs.CR↗

BadPatches: Routing-Aware Backdoor Attacks on Vision Mixture-of-Experts

Mixture-of-Experts (MoE) architectures have gained significant traction for reducing computational costs in deep neural networks by activating only a sparse subset of parameters during inference. While this efficiency makes MoE highly attractive for scaling vision tasks, its patch-based processing mechanism inherently disrupts traditional, routing-agnostic backdoor attacks by fragmenting or discarding adversarial triggers. To expose the vulnerabilities of this architecture, we introduce BadPatches, a novel routing-aware trigger application strategy specifically designed for patch-based MoE (pMoE) models and MoE-based vision transformers. Rather than applying a global pattern across the entire image, BadPatches encapsulates triggers within targeted image patches, ensuring they are consistently routed to and processed by the active experts. Our evaluations demonstrate that BadPatches achieves a high Attack Success Rate (ASR) at lower poisoning rates than routing-agnostic triggers, reaching over 83.2% ASR with a poisoning rate of only 0.01%, and scaling to a 96.8% ASR at 0.05%, while preserving the model's clean accuracy. Furthermore, the attack remains effective in gray-box scenarios where the adversary lacks complete knowledge of the model's patch routing configuration. Finally, we evaluate fine-pruning as a potential defense mechanism, revealing that pruning alone is insufficient to mitigate the attack; successful backdoor removal strictly requires the fine-tuning stage. These findings highlight the fragility of sparse vision architectures and underscore the need for routing-aware defenses.

cs.CR↗

FAA Framework: A Large Language Model-Based Approach for Credit Card Fraud Investigations

Credit card fraud mitigation plays a significant role in modern society. While fraud detection systems are essential, they often struggle to keep pace with the constantly evolving fraud techniques. As a result, fraud investigation is an important complementary process required for continuously improving detection models, identifying emerging fraud patterns, providing case explanations of to stakeholders, and maintaining customers' trust. However, fraud analysts are overwhelmed with an enormous number of alerts generated by credit card transaction monitoring systems. Each alert investigation requires careful attention, domain expertise, and thorough documentation of the investigation outcomes, leading to alert fatigue. To address this challenge, we introduce the first Fraud Investigation Assistant (FIA) framework, which employs multimodal large language models (LLMs) to automate key steps of credit card fraud investigation and generate explanatory reports. FIA leverages the reasoning, code execution, and vision capabilities of LLMs to collect relevant and logically consistent evidence while maintaining relatively short investigation trajectories. Experiments with the Sparkov and CCTD datasets show that FIA gradually improves the F1 score while investigating borderline cases, reaching 8% improvement after only 1,500 additional investigations. These results suggest that LLM-based agents can assist with automating substantial parts of the fraud investigation process and may be particularly useful for resolving ambiguous alerts.

cs.CR↗

On the Consistency and Performance of the Iterative Bayesian Update

In many situations, estimating the distribution of users' data concerning certain attributes is important. To facilitate this estimation while safeguarding users' privacy, the local privacy model is commonly employed, in which each user applies a local protection mechanism to release a noisy version of their original data to the data collector. The original distribution is then estimated using methods such as Matrix Inversion (INV), RAPPOR's estimator, and iterative Bayesian update (IBU). In this article, we experimentally demonstrate that IBU significantly outperforms the other methods when user data is protected through metric privacy mechanisms. We also explain the mathematical reason for the suboptimal performance of INV under those metric privacy mechanisms. Conversely, IBU exhibits performance similar to INV under typical mechanisms of local differential privacy, specifically the k-RR and RAPPOR. In addition, we investigate IBU's consistency, which is a crucial property as it means that the estimate converges to the true distribution as the number of data points increases. In the literature, IBU is claimed to be consistent, but there is no proof for this claim. We provide a formal proof of consistency leveraging the fact that IBU is a maximum likelihood estimator. Finally, we examine scenarios involving an infinite alphabet for sensitive data and propose a method allowing IBU to operate effectively in these situations.

cs.CR↗

SoK: Systematizing Generation, Characteristics, and Defenses in LLM-Generated Phishing

The rapid advancement of Large Language Models (LLMs), with their growing abuse in phishing, has enabled phishing content, including deceptive pretexts and other persuasive elements, to be generated at a scale difficult to achieve manually. This growing misuse of LLMs in phishing raises questions about potential LLM-driven changes in phishing characteristics, associated security implications for users, and the resulting challenges to existing defenses. While prior research has examined individual dimensions, including threats of LLM abuse, LLM-driven phishing, user susceptibility to phishing, and phishing defenses, these efforts remain fragmented and have not been consolidated into a comprehensive understanding of how these dimensions interrelate. To address this research gap, we provide a systematic examination of the LLM-generated phishing landscape, including a taxonomy of LLM manipulation methods, characteristics associated with LLM-generated phishing threats, and a taxonomy of defenses aligned with these manipulation methods. We also benchmark five academic and five industrial phishing detectors across datasets associated with different LLM-based generation methods. We further extract insights and research gaps that suggest promising directions for future research in this growing area. Our findings underscore the need for countermeasures that are evaluated across LLM generators and manipulation strategies. Our work provides a systematic foundation for studying LLM-generated phishing, enabling more consistent comparison and evaluation across the community.

cs.CR↗

NeuroBreak: Unveil Internal Jailbreak Mechanisms in Large Language Models

Jailbreak attacks bypass the safety alignment of large language models (LLMs) to elicit harmful outputs, yet the vast parameter space makes diagnosing the underlying failure mechanisms extremely challenging. We present NeuroBreak, a visual analytics system that helps experts progressively unpack jailbreak mechanisms from layer-level semantics down to neuron-level behaviors. A layer-wise probing pipeline traces how harmful representations evolve across layers, while a dual-dimensional character--behavior categorization reveals each safety-related neuron's inherent tendency and contextual contribution. These analyses are made interpretable through tailored visualization designs: a task-driven probing projection that reveals safety decision boundaries, a dual-stream semantic evolution flow that traces cross-layer semantic shifts, and a character--behavior chord graph that unifies neuron roles, attribution scores, and collaborative relations in a single view with in-situ causal verification. Quantitative evaluations and case studies show that NeuroBreak uncovers safety failure causes and provides actionable insights for strengthening LLM defenses.

cs.CR↗

PRISE: Privacy-pReserving Image Searchable Encryption Scheme for Intelligent Vehicle Systems

With the continuous advancement of intelligent vehicle technology, the image data generated by vehicles has become increasingly critical in various applications, including driver assistance, traffic monitoring, and safety warning systems. However, this growing reliance on image data also raises pressing concerns regarding its security and privacy protection. Searchable encryption technology, as an effective means to protect data security, shows significant potential for application in the field of intelligent vehicles. In this paper, we propose a novel Privacy-pReserving Image Searchable Encryption Scheme (PRISE) to address the security and privacy challenges associated with image data in intelligent vehicles. The PRISE scheme employs Multilinear Principal Component Analysis (MPCA) to extract data features and integrates symmetric encryption and matrix encryption techniques to ensure image privacy protection. To enhance search efficiency, we utilize a Mahalanobis distance-based fuzzy C-means (FCM) clustering method, which accelerates the search process on the cloud server. We conducted comprehensive experiments to evaluate our proposed scheme, and the results were consistent with our analytical findings, confirming the security of our approach. Comparative experiments with existing schemes demonstrated that our proposed method achieves higher accuracy while maintaining a comparable query time.

cs.CR↗

Large Language Models for Agentic NetOps and AIOps: Architectures, Evaluation, and Safety

Large language models (LLMs) are increasingly being used in network operations (NetOps) and artificial intelligence for IT operations (AIOps) for tasks ranging from telemetry retrieval and incident diagnosis to configuration planning and bounded remediation. As these systems acquire greater access to operational tools, a central question is whether operational assurance develops commensurately with the authority granted to them. This survey examines that question through a structured, evidence-stratified review of agentic NetOps and AIOps, spanning directly evaluated LLM systems, operational mechanisms, transferred evidence, and normative guidance. We organise the field around autonomy, tool scope, evidence traces, assurance controls, evaluation, security, and governance, and introduce an operational assurance contract that links each autonomy level to permitted tools, required evidence, independent gates, execution budgets, rollout and rollback duties, and audit requirements. The synthesis indicates a capability-assurance gap: evidence is comparatively strong for read-oriented assistance and tool-grounded diagnosis, but becomes substantially less complete as systems approach configuration change, bounded execution, and closed-loop operation. We therefore develop a workflow-level evaluation framework covering evidence quality, tool use, policy and invariant compliance, staged execution, recovery, calibration, cost, and human intervention, together with a threat model for prompt-borne attacks, compromised operational evidence, excessive agency, privilege boundaries, and auditability. The resulting view treats agentic NetOps and AIOps as constrained operational control, in which increasing autonomy requires correspondingly stronger evidence, independently enforced safeguards, and recovery mechanisms.

cs.NI↗

Hidden Thoughts Are Not Secret: Reasoning Trace Exposure in LLMs

Reasoning traces have become a valuable form of learning signals for improving and transferring the capabilities of large language models. In particular, detailed traces can help distill reasoning behavior from stronger teacher models into weaker student models. The value of capability transfer has motivated many deployed systems with reasoning models to hide raw internal traces and expose at most summaries and answers to users. As a result, we ask whether such interface-level trace hiding prevents users from obtaining useful reasoning supervision through prompting. We study this question with Reasoning Exposure Prompting (REP), a lightweight in-context elicitation method that uses shadow-model-generated demonstrations wrapped in auxiliary code-like formats to raise user-visible reasoning traces from a victim model. Across the common reasoning dataset, different victim models, and different student model distillation, REP substantially increases similarity between exposed and REP-conditioned internal traces while preserving useful reasoning signals.

cs.AI↗

An Embarrassingly Simple Detector for Model Extraction Attacks in Large Language Model API Traffic

Large language models (LLMs) are increasingly deployed through hosted APIs, making model extraction a practical threat to model ownership and service security. Individual extraction queries often resemble benign requests, while existing evaluations often focus on single-query anomaly scoring or pure benign-versus-attacker user settings. We formulate model extraction monitoring as benign-calibrated traffic-window distribution testing: embed incoming queries into a semantic space and test whether their aggregate distribution deviates from historical benign traffic. We instantiate this formulation with maximum mean discrepancy (MMD), using only benign-vs-benign comparisons to set the decision threshold. We evaluate on fourteen attacker-normal query pairs from four extraction scenarios and compare with adapted PRADA, SEAT, CAP, DATE, marginal Mahalanobis, and pseudo-class energy baselines. Across three random seeds, MMD achieves 0.3% benign FPR, 100.0% pure-attacker TPR, 90.5% average TPR over attacker fractions, and 95.1% balanced accuracy. These results show that benign-calibrated distribution testing is a strong empirical baseline for model extraction detection in both user-level and mixed multi-user LLM API traffic.

cs.CR↗

Let Them Steal: Trapping Large Language Model Extraction Attacks with Knowledge Honeypot

Large language models deployed as commercial APIs are vulnerable to model extraction attacks, while existing defenses either act too late or degrade utility for legitimate users. We propose \textbf{Knowledge Trap}, a defense that redirects extraction attacks toward low-transferability knowledge through a \emph{Honeypot Knowledge Graph} (HKG) and breadcrumb-guided exploration. Instead of blocking queries or perturbing outputs, Knowledge Trap consumes the attacker's limited query budget on knowledge with negligible downstream utility while preserving benign-user performance. Experiments in medical and financial domains show that Knowledge Trap reduces surrogate Agreement by 6.2\% on average without degrading legitimate-user accuracy, outperforming existing defenses that impose measurable user impact. These results suggest that defending knowledge-space traversal is a practical direction for mitigating LLM extraction attacks.

cs.CR↗

Proof-of-Execution Memory: Defending LLM Agents Against Forged-Reasoning Attacks by Verifying What Actually Happened

LLM agents are stateless and rely on external memory to carry context between steps. Because agents treat that memory as trustworthy, an adversary who can write to it can steer their behavior. The FARMA attack does this with no malicious command: it inserts fabricated entries into the agent's reasoning memory claiming a required safety step is already done, so the agent skips it. SENTINEL, the defense proposed with FARMA, scores entries against a fixed list of suspicious wordings; its authors note that an attacker who knows the list can reword the forgery and evade it, and leave this open. We show the gap is worse than stated. An automated attacker that simply asks a language model to reword the forgery evades SENTINEL on its first try, reducing its protection to zero on every model tested. We also find a capability paradox: the attack succeeds far more often on stronger models (98-100% on GPT-4o and GPT-4o-mini) than on Llama-3.1-8B (44%), because more capable agents follow reworded claims more faithfully, so the threat grows with capability. We propose Proof-of-Execution Memory (PoEM), which does not inspect memory at all. PoEM keeps a separate, tamper-evident, HMAC-chained ledger of the safety steps that actually executed, writable only by the trusted action layer, and allows a skip only if the ledger confirms real execution. An attacker can change what memory says but cannot forge a ledger entry for a step that never ran, so rewording no longer helps. Across three models and three scenarios, PoEM drives attack success to 0% while leaving legitimate operation intact (0% false positives in eight of nine cells, 1.7% in the ninth, within sampling noise), whereas SENTINEL wrongly blocks 33-50% of legitimate operations. PoEM also withstands attacks aimed at itself, adds microseconds of overhead, and works unchanged in a real LangChain agent. PoEM protects exactly the decisions it gates.

cs.CR↗

Bootstrapping Mutual Attestation with Kleene's Second Recursion Theorem

Remote attestation is a procedure by which a system (such as a Trusted Execution Environment) proves its own configuration to a remote peer. Here, the configuration includes the measurements (hash digests) of software components. When multiple nodes perform mutual attestation, each node must maintain the reference values for its peers' measurements. We refer to this as the reference-value bootstrapping problem for mutual attestation. In this paper, we formulate the problem as a fixed-point equation and solve it directly using Kleene's second recursion theorem. In our approach, nodes can reconstruct one another's source code, thereby allowing each node to derive the reference values at runtime. When a source code itself is deployed, as with a Python script, a node derives the peer's reference value directly from its reconstructed source. When a build artifact is deployed, as with AWS Nitro Enclaves, a node instead reproducibly builds the peer's artifact from its reconstructed source and derives the reference value from it. As a proof of concept, we develop transpilers in Python and Nix to generate mutually referencing programs. Using these transpilers, we demonstrate the mutual derivation of reference values for the two deployment models mentioned above. Our solution is architecture-independent, requires no trusted third party, and works with existing attestation stacks without modification.

cs.CR↗

GhostTac: Manipulating Tactile Sensors without Physical Contact

Tactile sensors are integral components of modern robotic systems, enabling robots to perceive and interact with the physical environment through tactile feedback. Despite their importance, the physical-layer security of tactile sensors has received little attention in prior work. In this paper, we present GhostTac, to the best of our knowledge, the first contactless attack that manipulates tactile sensing via electromagnetic interference (EMI). We identify that EMI exploits the nonlinear rectification and limited bandwidth amplification effects, allowing carefully crafted EMI signals to be converted into a persistent DC offset that bypasses on-board filtering and induces stable measurement deviations. Building on this mechanism, GhostTac enables fine-grained and controllable manipulation of sensor outputs by reshaping the spatial distribution and manipulating the magnitude at the targeted location. Such interference can induce unintended and harmful robot behaviors, such as causing a domestic robot to exert excessive force, resulting in physical damage or human injury. We evaluate GhostTac on 10 sensor modules and 2 dexterous hands, covering 15 tactile sensors of different types, and demonstrate consistent attack effectiveness across all tested devices. We further present three case studies on tactile grasping, slip detection, and material classification to illustrate practical impacts in real robotic tasks. We envision that our findings shed light on a new physical attack vector against tactile sensing in robotic systems.

cs.CR↗

Black Box Cryptanalysis of AES128

This paper presents computational results of cryptanalysis of AES using the Local Inversion by Black Box computations of the forward encryption and utilizes these results to develop a practically feasible approach for the key recovery of the full scale AES128 under Known Plaintext Attack (KPA). It is shown that complete recovery of unknown key bits is possible upto $80$ bits in a practically feasible time and memory in random KPA situation by sequential computation when remaining $48$ bits are known. The results of key recovery in $64$, $72$ and $80$ bit unknown cases are extrapolated to predict the period of the iterative sequence generated in the local inversion approach for the full $128$ bit unknown key case and a strategy is proposed to search the actual period by brute force parallel search of the sequence period with $10$ free bits defining the search space. Then it is shown that the actual key can be verified in polynomial time by fast powering of the forward encryption map. Hence this strategy shows that the key recovery problem for AES128 under KPA has a chance of success in practically feasible time for a majority of the plaintexts. Local inversion approach to cryptanalysis using black box computations is a universal method applicable to a vast variety of key recovery and map inversion problems. Hence the results presented in this paper are representative of estimates of cryptanalysis of other ciphers which can be considered almost as strong as AES128 as encryption functions.

cs.CR↗

CARVY-FL: Client Anticlustering for Robust Voting in Provably Secure Federated Learning

Federated learning (FL) enables collaborative training without directly sharing raw data, but remains vulnerable to malicious clients. Voting-based FL improves robustness by partitioning clients into groups, training one model per group, and aggregating predictions by plurality voting. However, under class-disjoint non-IID data, distribution-oblivious grouping can yield highly variable certified accuracy (CA). We propose CARVY-FL, which estimates client distribution types from one-epoch model updates and uses anticlustering to increase within-group distributional diversity. Under a fixed grouping, CARVY-FL retains the voting-based CA guarantee while increasing vote margins. Experiments on MNIST and Fashion-MNIST show higher CA than FLCert. Under BadNets with model replacement, CARVY-FL improves the AUC of 100-ASR by 11.1% and 14.9%, respectively.

cs.CR↗

A Comprehensive Survey on Linguistic Steganography: Methods, Countermeasures, Evaluation, and Challenges

Linguistic steganography hides secret messages in natural language text. Large language models (LLMs) have reshaped the field, but a systematic account of how these scattered advances collectively reshape the field in this new era is still missing. We provide one along four axes: 148 steganographic methods, 60 linguistic steganalysis countermeasures, 23 evaluation metrics, and 9 open challenges, each with taxonomies, reviews, and adoption analyses. Cutting across these axes, we identify five specific paradigm shifts in the LLM era: (1) from covertext modification to prompt-only generation, (2) from heuristic to provable security, (3) from white-box symmetric LMs to black-box or asymmetric access, (4) from security-centric designs to joint optimization, and (5) from text-quality concerns to engineering issues. The survey aims to serve as both a reference and a roadmap for practical and responsible linguistic steganography in the LLM era.

cs.CR↗

UiAs: User-Independent 3D Facial Anti-Spoofing via Multi-modal Wireless Signals

Face authentication is widely deployed in security-sensitive applications, while increasingly realistic 3D spoofing attacks pose growing threats. High-fidelity 3D masks can reproduce facial appearance and geometry but cannot replicate the intrinsic physical responses of living tissue, which can be actively probed by wireless signals. However, the resulting liveness cues captured by wireless signals are entangled with user-dependent facial geometry, limiting cross-user generalization. We present UiAs, a multimodal user-independent 3D facial anti-spoofing system using electromagnetic (mmWave) and mechanical (acoustic) waves. The two modalities share similar user-dependent geometric variations, allowing UiAs to suppress them through cross-modal subtraction while preserving modality-specific liveness cues. Their complementary physical responses further improve live/spoof discrimination. In practical deployments, multiple materials (e.g., skin, hair, eyeglasses, or face coverings) may also bias liveness representations, while spoofing materials are diverse and open-ended. UiAs addresses both through skin-anchored contrastive learning. We evaluate UiAs with real 3D spoofing attacks, which achieves 93.25\% accuracy for unseen users without user-specific physical-signal enrollment.

cs.CR↗
Compare source metadata on this page
WorkPublishedSource identifierSource
Dataset Protection via Watermarked Canaries in Retrieval-Augmented LLMs2026-08-292502.10673arxiv
BadPatches: Routing-Aware Backdoor Attacks on Vision Mixture-of-Experts2026-08-292505.01811arxiv
FAA Framework: A Large Language Model-Based Approach for Credit Card Fraud Investigations2026-08-292506.11635arxiv
On the Consistency and Performance of the Iterative Bayesian Update2026-08-292508.09980arxiv
SoK: Systematizing Generation, Characteristics, and Defenses in LLM-Generated Phishing2026-08-292508.21457arxiv
NeuroBreak: Unveil Internal Jailbreak Mechanisms in Large Language Models2026-08-292509.03985arxiv
PRISE: Privacy-pReserving Image Searchable Encryption Scheme for Intelligent Vehicle Systems2026-08-292603.26219arxiv
Large Language Models for Agentic NetOps and AIOps: Architectures, Evaluation, and Safety2026-10-052605.12729arxiv
Hidden Thoughts Are Not Secret: Reasoning Trace Exposure in LLMs2026-08-292606.00642arxiv
An Embarrassingly Simple Detector for Model Extraction Attacks in Large Language Model API Traffic2026-08-292606.05725arxiv
Let Them Steal: Trapping Large Language Model Extraction Attacks with Knowledge Honeypot2026-08-292606.15810arxiv
Proof-of-Execution Memory: Defending LLM Agents Against Forged-Reasoning Attacks by Verifying What Actually Happened2026-08-292608.16032arxiv
Bootstrapping Mutual Attestation with Kleene's Second Recursion Theorem2026-09-302608.20671arxiv
GhostTac: Manipulating Tactile Sensors without Physical Contact2026-08-292608.20817arxiv
Black Box Cryptanalysis of AES1282026-08-292608.22904arxiv
CARVY-FL: Client Anticlustering for Robust Voting in Provably Secure Federated Learning2026-08-292608.28992arxiv
A Comprehensive Survey on Linguistic Steganography: Methods, Countermeasures, Evaluation, and Challenges2026-08-292608.29077arxiv
UiAs: User-Independent 3D Facial Anti-Spoofing via Multi-modal Wireless Signals2026-08-292608.29084arxiv

These are bibliographic comparisons, not experimental rankings. Follow the original document for methods and conditions.