Securing heap memory by data pointer encoding
- Authors
- Kim, Kyungtae; Pyo, Changwoo
- Issue Date
- Oct-2012
- Publisher
- ELSEVIER
- Keywords
- Data pointer encoding; Heap memory; Heap overflow attack; Dual-linked list
- Citation
- FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, v.28, no.8, pp.1252 - 1257
- Journal Title
- FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE
- Volume
- 28
- Number
- 8
- Start Page
- 1252
- End Page
- 1257
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/18883
- DOI
- 10.1016/j.future.2011.02.006
- ISSN
- 0167-739X
- 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. (C) 2011 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/18883)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.