Securing heap memory by data pointer encoding

doi:10.1016/j.future.2011.02.006

Securing heap memory by data pointer encoding

2012-10-01

1

PRE

AI

DOI：10.1016/j.future.2011.02.006

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2011 Elsevier B.V. All rights reserved.

Keywords:

Data pointer encoding

Heap memory

Heap overflow attack

Dual-linked list

Securing heap memory by data pointer encoding

Abstract

Journal

Organization