TokenBreak: Bypassing Text Classification Models Through Token Manipulation
Kasimir Schulz, Kenneth Yeung, Kieran Evans

TL;DR
TokenBreak introduces a novel token manipulation attack that bypasses NLP classification defenses by exploiting tokenization strategies, revealing vulnerabilities in models and proposing a non-retraining defensive strategy.
Contribution
The paper presents TokenBreak, a new attack method exploiting tokenization to bypass text classification defenses, and offers a simple, non-retraining defense mechanism.
Findings
TokenBreak can successfully bypass classification models.
Vulnerability depends on tokenizer and model architecture.
Proposed defense adds protection without retraining.
Abstract
Natural Language Processing (NLP) models are used for text-related tasks such as classification and generation. To complete these tasks, input data is first tokenized from human-readable text into a format the model can understand, enabling it to make inferences and understand context. Text classification models can be implemented to guard against threats such as prompt injection attacks against Large Language Models (LLMs), toxic input and cybersecurity risks such as spam emails. In this paper, we introduce TokenBreak: a novel attack that can bypass these protection models by taking advantage of the tokenization strategy they use. This attack technique manipulates input text in such a way that certain models give an incorrect classification. Importantly, the end target (LLM or email recipient) can still understand and respond to the manipulated text and therefore be vulnerable to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpam and Phishing Detection · Adversarial Robustness in Machine Learning · Hate Speech and Cyberbullying Detection
