Adversarial Attacks and Defenses in Large Language Models: Old and New Threats
Leo Schwinn, David Dobre, Stephan Günnemann, Gauthier Gidel
TL;DR
The paper investigates the fragile robustness of Large Language Models (LLMs) and the prevalence of flawed defense evaluations that risk overestimating protection. It argues for NLP-specific prerequisites, including clearly defined threat models and standardized benchmarks, and introduces embedding-space attacks as a practical threat model for open-source LLMs. Through analysis of a recent defense, it demonstrates how robustness claims can be circumvented under relaxed threat-model assumptions, and it highlights the efficiency of embedding-space attacks (e.g., rapid trigger formation on open-source models). The work calls for rigorous evaluation guidelines and threat-model design to curb the looming adversarial arms race and safeguard real-world deployments.
Abstract
Over the past decade, there has been extensive research aimed at enhancing the robustness of neural networks, yet this problem remains vastly unsolved. Here, one major impediment has been the overestimation of the robustness of new defense approaches due to faulty defense evaluations. Flawed robustness evaluations necessitate rectifications in subsequent works, dangerously slowing down the research and providing a false sense of security. In this context, we will face substantial challenges associated with an impending adversarial arms race in natural language processing, specifically with closed-source Large Language Models (LLMs), such as ChatGPT, Google Bard, or Anthropic's Claude. We provide a first set of prerequisites to improve the robustness assessment of new approaches and reduce the amount of faulty evaluations. Additionally, we identify embedding space attacks on LLMs as another viable threat model for the purposes of generating malicious content in open-sourced models. Finally, we demonstrate on a recently proposed defense that, without LLM-specific best practices in place, it is easy to overestimate the robustness of a new approach.
