The Fragility of Trigger-Tag Mechanisms for Misuse Detection in Open-Weight LLMs
Organizations: MBZUAI, UAE · National University of Singapore · A*STAR Institute of Advanced Intelligence and Computing
Abstract
Open-weight language models can be downloaded, modified, and deployed beyond their developers' control, limiting the effectiveness of centrally enforced safeguards. Recent work has therefore proposed trigger-tag mechanisms that produce a detectable signal when a model is used under a target condition, such as generating phishing contents. Although these mechanisms borrow from established techniques, their use for conditional misuse detection in open-weight LLMs is relatively new. Therefore, existing research works have not systematically studied the robustness of trigger-tag mechanisms under adversarial attacks. To close this gap, (i)~we formalize trigger-tags and distinguish token-level trigger-tags, which introduce watermark-inspired signals during decoding, from weight-level trigger-tags, which learn backdoor-inspired associations between target conditions and detectable model behavior. Furthermore, (ii)~we introduce \Untag, a unified attack framework that organizes their mechanism-specific attack surfaces into a common taxonomy. We evaluate representative token-level and weight-level trigger-tags using phishing as a case study. We find that while trigger-tags may provide useful evidence in controlled settings, our attacks render the existing trigger-tag mechanisms to be entirely ineffective. Consequently, we argue that these mechanisms should not be treated as robust misuse detectors when attackers can transform outputs or modify open weights.
Figures & tables
| Attack surface | Security dependency | Attack vector | Applies to | Framework implementation |
|---|---|---|---|---|
| Output-side | Explicit tag remains in the observed output | Surface Cleanup | Both | Sanitization, ASCII normalization, Whitespace cleanup, etc |
| Output-side | Tag survives semantic regeneration of the output | Semantic Rewriting | Both | Paraphrasing, summarization, expansion, and translation round-trips |
| Output-side | Defender’s keyed token distribution survives re-generation | Tag Overwrite | Token-level | Rewriting under an independently keyed token-level trigger-tag |
| Model-side | Learned tag survives downstream model adaptation | Fine-tuning | Weight-level | Continued fine-tuning of the tagged checkpoint |
| Model-side | Learned tag survives parameter removal | Pruning | Weight-level | Magnitude pruning of the tagged checkpoint |
| Model-side | Tag is not concentrated in a removable representation subspace | Contrastive Subspace Removal | Weight-level | Contrastive SVD projection with matched-rank random-subspace controls |
| Method | Authors | Venue / Year | Class |
|---|---|---|---|
| Paladin-Base | Pang et al. [ 22 ] | NDSS 2026 | Weight-level |
| Paladin-Pro | Pang et al. [ 22 ] | NDSS 2026 | Weight-level |
| LLM-Mark | Xu et al. [ 23 ] | WMARK 2025 | Weight-level |
| KGW | Kirchenbauer et al. [ 24 ] | ICML 2023 | Token-level |
| EXP | Kuditipudi et al. [ 33 ] | TMLR 2024 | Token-level |
| Unigram | Zhao et al. [ 34 ] | ICLR 2024 | Token-level |
| Model Mechanism TPR (%) FPR (%) | |
|---|---|
| Token-level | Llama3 KGW EXP Unigram SynthID Qwen2.5 KGW EXP Unigram SynthID |
| Weight-level | Llama2 Paladin-Base explicit Paladin-Base implicit Paladin-Pro explicit Paladin-Pro implicit LLM-Mark Llama3 Paladin-Base explicit Paladin-Base implicit Paladin-Pro explicit Paladin-Pro implicit LLM-Mark Qwen2.5 Paladin-Base explicit Paladin-Base implicit Paladin-Pro explicit Paladin-Pro implicit LLM-Mark |
| Surface cleanup | Semantic rewriting | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Model | Mechanism | Baseline | Marker stripping | ASCII normalization | Whitespace cleanup | Markdown removal | Email sanitization | Paraphrasing | Summarization | Expansion | Translation round-trip | |
| Token-level | Llama3 | KGW | ||||||||||
| EXP | ||||||||||||
| Unigram | ||||||||||||
| SynthID | ||||||||||||
| Qwen2.5 | KGW | |||||||||||
| Surface cleanup | Semantic rewriting | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Model | Mechanism | Baseline | Marker stripping | ASCII normalization | Whitespace cleanup | Markdown removal | Email sanitization | Paraphrasing | Summarization | Expansion | Translation round-trip | |
| Weight-level | Llama2 | Paladin-Base explicit | ||||||||||
| Paladin-Base implicit | ||||||||||||
| Llama3 | Paladin-Pro explicit | |||||||||||
| Paladin-Pro implicit | ||||||||||||
| Qwen2.5 | Paladin-Pro explicit | |||||||||||
| After overwrite | |||||
|---|---|---|---|---|---|
| Model | Mechanism | Clean -TPR | -TPR | -TPR | |
| Token-level | Llama3 | KGW | |||
| EXP | |||||
| Unigram | |||||
| SynthID | |||||
| Qwen2.5 | KGW | ||||
| White-box modification | ||||||
|---|---|---|---|---|---|---|
| Model | Mechanism | Baseline | Fine-tuning | Pruning | SVD removal | |
| Weight-level | Llama2 | Paladin-Base explicit | ||||
| Paladin-Base implicit | ||||||
| Paladin-Pro explicit | ||||||
| Paladin-Pro implicit | ||||||
| LLM-Mark | ||||||
| Cosine similarity | PPL ratio | ||||||||||
| Model | Mechanism | Paraphrasing | Summarization | Expansion | Translation round-trip | Original PPL | Paraphrasing | Summarization | Expansion | Translation round-trip | |
| Weight-level | Llama2 | Paladin-Base explicit | 0.977 | 0.980 | 0.972 | 0.979 | 3.24 | 1.15 | 1.05 | 0.97 | 1.07 |
| Paladin-Base implicit | 0.911 | 0.909 | 0.902 | 0.925 | 20.61 | 0.20 | 0.19 | 0.17 | 0.27 | ||
| Llama3 | Paladin-Pro | 0.977 | 0.971 | 0.974 | 0.965 | 1.75 | 1.66 | 1.51 | 1.47 | 1.46 | |
| Qwen2.5 | Paladin-Pro | 0.981 | 0.978 | 0.981 | 0.973 | 1.77 | 1.38 | 1.22 | 1.23 | 1.39 | |
| Token-level | Llama3 | KGW | 0.973 | 0.971 | 0.970 | 0.959 | 3.09 | 1.32 | 1.25 | 1.08 | 1.41 |
| PPL ratio | ||||||
|---|---|---|---|---|---|---|
| Model | Mechanism | Unmodified PPL | Fine-tuning | Pruning | SVD removal | |
| Weight-level | Llama2 | Paladin-Base explicit | 11.2 | 2.63 | 1.31 | 1.69 |
| Paladin-Pro explicit | 10.7 | 2.50 | 1.22 | 1.48 | ||
| LLM-Mark | 9.4 | 3.03 | 0.99 | 0.92 | ||
| Llama3 | Paladin-Base explicit | 12.2 | 2.03 | 1.19 | 1.51 | |
| Paladin-Pro explicit | 10.7 | 2.35 | 1.41 | 1.72 | ||
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Adversarial Attacks on LLMs
Adversarial attacks on large language models probe how crafted inputs, internal changes, and agent interactions bypass safety or disrupt reliable behavior.
See all 355 papers