HAMSA: Hijacking Aligned Compact Models via Stealthy Automation

IF 0.8 4区 数学 Q3 MATHEMATICS
A. S. Krylov, I. I. Vagizov, D. S. Korzh, M. Douiba, A. Guezzaz, V. N. Kokh, S. D. Erokhin, E. V. Tutubalina, O. Y. Rogov
{"title":"HAMSA: Hijacking Aligned Compact Models via Stealthy Automation","authors":"A. S. Krylov,&nbsp;I. I. Vagizov,&nbsp;D. S. Korzh,&nbsp;M. Douiba,&nbsp;A. Guezzaz,&nbsp;V. N. Kokh,&nbsp;S. D. Erokhin,&nbsp;E. V. Tutubalina,&nbsp;O. Y. Rogov","doi":"10.1134/S1064562425700425","DOIUrl":null,"url":null,"abstract":"<p>Large Language Models (LLMs), especially their compact efficiency-oriented variants, remain susceptible to jailbreak attacks that can elicit harmful outputs despite extensive alignment efforts. Existing adversarial prompt generation techniques often rely on manual engineering or rudimentary obfuscation, producing low-quality or incoherent text that is easily flagged by perplexity-based filters. We present an automated red-teaming framework that evolves semantically meaningful and stealthy jailbreak prompts for aligned compact LLMs. The approach employs a multi-stage evolutionary search, where candidate prompts are iteratively refined using a population-based strategy augmented with temperature-controlled variability to balance exploration and coherence preservation. This enables the systematic discovery of prompts capable of bypassing alignment safeguards while maintaining natural language fluency. We evaluate our method on benchmarks in English (In-The-Wild Jailbreak Prompts on LLMs), and a newly curated Arabic one derived from In-The-Wild Jailbreak Prompts on LLMs and annotated by native Arabic linguists, enabling multilingual assessment.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 2","pages":"425 - 432"},"PeriodicalIF":0.8000,"publicationDate":"2026-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562425700425.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Doklady Mathematics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1134/S1064562425700425","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Large Language Models (LLMs), especially their compact efficiency-oriented variants, remain susceptible to jailbreak attacks that can elicit harmful outputs despite extensive alignment efforts. Existing adversarial prompt generation techniques often rely on manual engineering or rudimentary obfuscation, producing low-quality or incoherent text that is easily flagged by perplexity-based filters. We present an automated red-teaming framework that evolves semantically meaningful and stealthy jailbreak prompts for aligned compact LLMs. The approach employs a multi-stage evolutionary search, where candidate prompts are iteratively refined using a population-based strategy augmented with temperature-controlled variability to balance exploration and coherence preservation. This enables the systematic discovery of prompts capable of bypassing alignment safeguards while maintaining natural language fluency. We evaluate our method on benchmarks in English (In-The-Wild Jailbreak Prompts on LLMs), and a newly curated Arabic one derived from In-The-Wild Jailbreak Prompts on LLMs and annotated by native Arabic linguists, enabling multilingual assessment.

HAMSA:通过隐形自动化劫持对齐紧凑型模型
大型语言模型(llm),尤其是它们紧凑的、面向效率的变体,仍然容易受到越狱攻击的影响,尽管进行了大量的校准工作,但这种攻击可能会导致有害的输出。现有的对抗性提示生成技术通常依赖于人工工程或基本混淆,产生低质量或不连贯的文本,这些文本很容易被基于困惑的过滤器标记出来。我们提出了一个自动化的红队框架,它为对齐的紧凑llm提供了语义上有意义和隐蔽的越狱提示。该方法采用多阶段进化搜索,使用基于种群的策略和温度控制的可变性来迭代改进候选提示,以平衡探索和一致性保存。这使得系统地发现能够绕过对齐保护的提示,同时保持自然语言的流畅性。我们在英语(法学硕士上的in - the - wild Jailbreak Prompts)基准测试中评估了我们的方法,以及在法学硕士上的in - the - wild Jailbreak Prompts中衍生的新管理的阿拉伯语基准测试,并由本地阿拉伯语语言学家进行了注释,从而实现了多语言评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Doklady Mathematics
Doklady Mathematics 数学-数学
CiteScore
1.00
自引率
16.70%
发文量
39
审稿时长
3-6 weeks
期刊介绍: Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书