Securing heap memory by data pointer encoding

Future Generation Computer Systems(2012)

Cited 3|Views1
No score
Abstract
Since pointer variables frequently cause programs to crash in unexpected ways, they often pose vulnerability abused as immediate or intermediate targets. Although code pointer attacks have been historically dominant, data pointer attacks are also recognized as realistic threats. This paper presents how to secure heap memory from data pointer attacks, in particular, heap overflow attacks. Our protection scheme encrypts the data pointers used for linking free chunks, and decrypts the pointers only before dereferencing. We also present a list structure with duplicate links that is harder to break than the conventional linked list structure. Our experiment shows that the proposed data pointer encoding is effective and has slightly better performance than the integrity check of link pointers in GNU's standard C library.
More
Translated text
Key words
pointer variable,link pointer,heap overflow attack,securing heap memory,data pointer,heap memory,pointer encoding,proposed data,code pointer attack,data pointer attack,dual-linked list,list structure,data pointer encoding
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined