Efficient Return Address Verification Based on Dislocated Stack
| العنوان: | Efficient Return Address Verification Based on Dislocated Stack |
|---|---|
| المؤلفون: | Li Jinfeng, Chen Liwei, Shi Gang, Yongyue Li, Dan Meng, Xu Qizhen |
| المصدر: | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39:3398-3407 |
| بيانات النشر: | Institute of Electrical and Electronics Engineers (IEEE), 2020. |
| سنة النشر: | 2020 |
| مصطلحات موضوعية: | business.industry, Call stack, Computer science, Code reuse, 02 engineering and technology, Computer Graphics and Computer-Aided Design, 020202 computer hardware & architecture, Control flow, Stack (abstract data type), Embedded system, 0202 electrical engineering, electronic engineering, information engineering, Overhead (computing), Message authentication code, Electronic design automation, Electrical and Electronic Engineering, business, Software |
| الوصف: | Return-oriented programming (ROP) is a prevalent code reuse technique that hijacks a program’s control flow by modifying its return addresses on the stack. Researchers have proposed some return address verification methods by using the message authentication code (MAC). But these approaches suffer from high performance overhead. In this article, we first propose Dislocated Stack, a new kind of stack layout in which a previous return address would be pushed onto the current stack frame and the current return address would be stored into a hardware buffer on function calls. Based on Dislocated Stack, we design two new verification approaches, Lazy Verification and Batch Verification. Lazy Verification does not verify a return address popped from stack until it is going to be used for return. Batch Verification verifies a couple of return addresses at one time. We implemented these two designs on RISC-V architecture and quantitatively analyzed their effect on QEMU. Our experiments show that Lazy Verification reduces over 99% verifications on function returns and incurs only 1.23% performance overhead; while in Batch Verification, the overhead is merely 0.78%. The result demonstrates that these two approaches are highly efficient for return address verification. |
| تدمد: | 1937-4151 0278-0070 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::9a34f7fc262b70c3d6230a38dfe39f46 https://doi.org/10.1109/tcad.2020.3012645 |
| حقوق: | CLOSED |
| رقم الأكسشن: | edsair.doi...........9a34f7fc262b70c3d6230a38dfe39f46 |
| قاعدة البيانات: | OpenAIRE |
كن أول من يترك تعليقا!