Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2402.13517v1

Help | Advanced Search

Computer Science > Computation and Language

arXiv:2402.13517v1 (cs)
[Submitted on 21 Feb 2024 (this version) , latest version 30 Apr 2025 (v2) ]

Title: Round Trip Translation Defence against Large Language Model Jailbreaking Attacks

Title: 往返翻译防御大型语言模型越狱攻击

Authors:Canaan Yung, Hadi Mohaghegh Dolatabadi, Sarah Erfani, Christopher Leckie
Abstract: Large language models (LLMs) are susceptible to social-engineered attacks that are human-interpretable but require a high level of comprehension for LLMs to counteract. Existing defensive measures can only mitigate less than half of these attacks at most. To address this issue, we propose the Round Trip Translation (RTT) method, the first algorithm specifically designed to defend against social-engineered attacks on LLMs. RTT paraphrases the adversarial prompt and generalizes the idea conveyed, making it easier for LLMs to detect induced harmful behavior. This method is versatile, lightweight, and transferrable to different LLMs. Our defense successfully mitigated over 70% of Prompt Automatic Iterative Refinement (PAIR) attacks, which is currently the most effective defense to the best of our knowledge. We are also the first to attempt mitigating the MathsAttack and reduced its attack success rate by almost 40%. Our code is publicly available at https://github.com/Cancanxxx/Round_Trip_Translation_Defence
Abstract: 大型语言模型(LLMs)容易受到社会工程攻击,这些攻击对人类来说是可理解的,但需要高水平的理解能力才能让LLMs进行对抗。 现有的防御措施最多只能缓解不到一半的此类攻击。 为了解决这个问题,我们提出了往返翻译(RTT)方法,这是第一个专门设计用于防御LLMs社会工程攻击的算法。 RTT对对抗性提示进行改写并概括其传达的概念,使LLMs更容易检测到诱导的有害行为。 该方法具有通用性、轻量级,并且可以转移到不同的LLMs上。 我们的防御方法成功缓解了超过70%的提示自动迭代优化(PAIR)攻击,据我们所知,这是目前最有效的防御方法。 我们也是首次尝试缓解MathsAttack,并将其攻击成功率降低了近40%。 我们的代码可在 https://github.com/Cancanxxx/Round_Trip_Translation_Defence 公开获取。
Comments: 6 pages, 6 figures
Subjects: Computation and Language (cs.CL) ; Artificial Intelligence (cs.AI)
Cite as: arXiv:2402.13517 [cs.CL]
  (or arXiv:2402.13517v1 [cs.CL] for this version)
  https://doi.org/10.48550/arXiv.2402.13517
arXiv-issued DOI via DataCite

Submission history

From: Canaan Yung [view email]
[v1] Wed, 21 Feb 2024 03:59:52 UTC (8,288 KB)
[v2] Wed, 30 Apr 2025 05:13:56 UTC (8,288 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs.CL
< prev   |   next >
new | recent | 2024-02
Change to browse by:
cs
cs.AI

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号