A Survey of Exploitation Techniques and Defenses for Program Data Attacks

被引:11
作者
Wang, Ye [1 ]
Li, Qingbao [1 ]
Chen, Zhifeng [1 ]
Zhang, Ping [1 ]
Zhang, Guimin [1 ]
机构
[1] State Key Lab Math Engn & Adv Comp, Zhengzhou 450001, Henan, Peoples R China
基金
中国国家自然科学基金;
关键词
Control plane; Data plane; DOP; ROP; Gadget; PDA; CONTROL-FLOW INTEGRITY; MEMORY SAFETY; RANDOMIZATION; PREVENTION; SECURITY;
D O I
10.1016/j.jnca.2020.102534
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, program data attacks (PDA) have become a popular topic in the field of network security. PDAs are memory corruption vulnerability exploitation techniques that target the control plane and data plane in the target program without injecting any code. We divide PDAs into return-oriented programming (ROP) attacks and data-oriented programming (DOP) attacks, and pioneering research has shown that PDAs are Turing-complete. However, although PDAs have been known for a long time, their threats have not been adequately addressed. In this survey, we followed a systematic research method to introduce a series of statistical analyses of a corpus of publications; then, we systematized the current knowledge on PDA exploits and effective defence mechanisms. Methods have been classified according to the approach that they follow and we have identified three protection approaches: L1 defence, L2 defence and L3 defence. This systematization suggests that stronger policies are needed, especially protection methods against DOP attacks. Furthermore, the summarization of current techniques shows that performance and compatibility problems are the main barriers to widespread adoption. We remind researchers in the security community to recognize the significance of these properties in the real world and hope that this systematization of knowledge will help them find new solutions to make progress in this area.
引用
收藏
页数:16
相关论文
共 127 条
[1]  
Abadi Martin, 2005, P 12 ACM C COMPUTER, P340
[2]  
Andersen LO, 1994, PROGRAM ANAL SPECIAL
[3]  
[Anonymous], 2019, ARXIV190501858
[4]  
[Anonymous], 2018, ARXIV180604355
[5]  
[Anonymous], SUNDAY TIMES
[6]  
[Anonymous], INT 64 IA 32 ARCH SO
[7]  
[Anonymous], 2014, P 21 ANN NETW DISTR
[8]  
[Anonymous], DATA FLOW BENDING EF
[9]  
[Anonymous], P NETW DISTR SYST SE
[10]  
[Anonymous], 2008, WOOT