mlsanityData to 7 Oct 2026

Adjacent Words, Divergent Intents: Jailbreaking Large Language Models via Task Concurrency

arXiv 2510.21189 ↗First posted 24 Oct 2025cs.CRcited by 13

On the map: LLM safety and security → Jailbreaking

Abstract (arXiv)

Despite their superior performance on a wide range of domains, large language models (LLMs) remain vulnerable to misuse for generating harmful content, a risk that has been further amplified by various jailbreak attacks. Existing jailbreak attacks mainly follow sequential logic, where LLMs understand and answer each given task one by one. However, concurrency, a natural extension of the sequential scenario, has been largely overlooked. In this work, we first propose a word-level method to enable task concurrency in LLMs, where adjacent words encode divergent intents. Although LLMs maintain strong utility in answering concurrent tasks, which is demonstrated by our evaluations on mathematical and general question-answering benchmarks, we notably observe that combining a harmful task with a benign one significantly reduces the probability of it being filtered by the guardrail, showing the potential risks associated with concurrency in LLMs. Based on these findings, we introduce textttJAIL-CON, an iterative attack framework that underlineJAILbreaks LLMs via task underlineCONcurrency. Experiments on widely-used LLMs demonstrate the strong jailbreak capabilities of textttJAIL-CON compared to existing attacks. Furthermore, when the guardrail is applied as a defense, compared to the sequential answers generated by previous attacks, the concurrent answers in our textttJAIL-CON exhibit greater stealthiness and are less detectable by the guardrail, highlighting the unique feature of task concurrency in jailbreaking LLMs.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Placed in Jailbreaking, one of 12 directions in LLM safety and security. First posted on arXiv 24 Oct 2025.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 12.

13 papers.

Sort:

By area: