Efficient Proofs of Software Exploitability for Real-world Processors.

Matthew Green 0001, Mathias Hall-Andersen,Eric Hennenfent,Gabriel Kaptchuk, Benjamin Perez,Gijs Van Laer

IACR Cryptology ePrint Archive(2023)

引用 0|浏览51
暂无评分
摘要
We consider the problem of proving in zero-knowledge the existence of vulnerabilities in executables compiled to run on real-world processors. We demonstrate that it is practical to prove knowledge of real exploits for real-world processor architectures without the need for source code and without limiting our consideration to narrow vulnerability classes. To achieve this, we devise a novel circuit compiler and a toolchain that produces highly optimized, non-interactive zero-knowledge proofs for programs executed on the MSP430, an ISA commonly used in embedded hardware. Our toolchain employs a highly optimized circuit compiler and a number of novel optimizations to construct efficient proofs for program binaries. To demonstrate the capability of our system, we test our toolchain by constructing proofs for challenges in the Microcorruption capture the flag exercises.
更多
查看译文
关键词
software exploitability,efficient proofs,real-world
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要