arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.19489cs.NE
收藏

在对抗性环境中进化汇编代码

Evolving Assembly Code in an Adversarial Environment

Irina Maliukov, Gera Weiss, Oded Margalit, Achiya Elyasaf

AI总结:

本文通过遗传编程和机器学习模因算子进化汇编代码,用于 CodeGuru 竞赛中对抗人类幸存者,发现并利用其弱点,为网络安全中的代码弱点检测与修复提供新方法。

摘要:

在这项工作中,我们为 CodeGuru 竞赛进化汇编代码。目标是创建一个幸存者——一个在共享内存中运行时间最长的汇编程序,通过抵抗来自对手幸存者的攻击并发现它们的弱点。为了进化出顶尖的求解器,我们为汇编语言指定了巴科斯范式(BNF),并使用遗传编程(GP)从头合成代码。我们通过运行 CodeGuru 游戏来评估幸存者,对手是人类编写的获胜幸存者。我们进化出的程序发现了它们训练时所针对的程序中的弱点,并利用了这些弱点。为了进一步推动进化,我们实现了模因算子,利用机器学习有效地探索解空间。这项工作对网络安全有重要应用,因为我们利用进化来检测幸存者中的弱点。汇编 BNF 是领域无关的;因此,通过修改适应度函数,它可以检测代码弱点并帮助修复它们。最后,CodeGuru 竞赛为在对抗性环境中分析 GP 和代码进化提供了一个新颖的平台。为了支持这一方向的进一步研究,我们对进化出的幸存者及其发现的弱点进行了详尽的定性分析。

英文摘要:

In this work, we evolve Assembly code for the CodeGuru competition. The goal is to create a survivor -- an Assembly program that runs the longest in shared memory, by resisting attacks from adversary survivors and finding their weaknesses. For evolving top-notch solvers, we specify a Backus Normal Form (BNF) for the Assembly language and synthesize the code from scratch using Genetic Programming (GP). We evaluate the survivors by running CodeGuru games against human-written winning survivors. Our evolved programs found weaknesses in the programs they were trained against and utilized them. To push evolution further, we implemented memetic operators that utilize machine learning to explore the solution space effectively. This work has important applications for cyber-security as we utilize evolution to detect weaknesses in survivors. The Assembly BNF is domain-independent; thus, by modifying the fitness function, it can detect code weaknesses and help fix them. Finally, the CodeGuru competition offers a novel platform for analyzing GP and code evolution in adversarial environments. To support further research in this direction, we provide a thorough qualitative analysis of the evolved survivors and the weaknesses found.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑