提出首个隐蔽的比特翻转攻击,让大模型输出变差却仍像正常文本。
SilentStriker:Toward Stealthy Bit-Flip Attacks on Large Language Models
- 用关键词抑制替代困惑度,平衡攻击效果与输出自然性。
- 迭代渐进搜索策略提升攻击成功率,实测优于现有方法。
- 适合研究模型安全、对抗攻击的学者或工程师参考。
大语言模型在关键领域广泛应用,其安全性问题日益受关注。尽管提示注入等输入攻击已有深入研究,但利用硬件漏洞篡改模型参数的比特翻转攻击(BFAs)却鲜少被重视。现有方法难以兼顾性能下降与输出自然性,易被发现。本文提出 SilentStriker,首个能有效降低任务性能同时保持输出自然性的隐蔽比特翻转攻击。核心创新在于针对输出长度可变、输出空间庞大的特点,重新设计损失函数:不再依赖困惑度,而是以关键输出词为目标进行抑制,实现攻击效果与隐蔽性的联合优化。此外,采用迭代渐进搜索策略最大化攻击效力。实验表明,SilentStriker 显著优于现有基线,在不破坏生成文本自然性的前提下成功实施攻击。
原文摘要 · Abstract (English)
The rapid adoption of large language models (LLMs) in critical domains has spurred extensive research into their security issues. While input manipulation attacks (e.g., prompt injection) have been well studied, Bit-Flip Attacks (BFAs) -- which exploit hardware vulnerabilities to corrupt model parameters and cause severe performance degradation -- have received far less attention. Existing BFA methods suffer from key limitations: they fail to balance performance degradation and output naturalness, making them prone to discovery. In this paper, we introduce SilentStriker, the first stealthy bit-flip attack against LLMs that effectively degrades task performance while maintaining output naturalness. Our core contribution lies in addressing the challenge of designing effective loss functions for LLMs with variable output length and the vast output space. Unlike prior approaches that rely on output perplexity for attack loss formulation, which inevitably degrade output naturalness, we reformulate the attack objective by leveraging key output tokens as targets for suppression, enabling effective joint optimization of attack effectiveness and stealthiness. Additionally, we employ an iterative, progressive search strategy to maximize attack efficacy. Experiments show that SilentStriker significantly outperforms existing baselines, achieving successful attacks without compromising the naturalness of generated text.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。