Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
11-2013
Abstract
Heap based buffer overflows are a dangerous class of vulnerability. One countermeasure is randomizing the location of heap memory blocks. Existing techniques segregate the address space into clusters, each of which is used exclusively for one block size. This approach requires a large amount of address space reservation, and results in lower location randomization for larger blocks.
Discipline
Information Security
Research Areas
Information Security and Trust
Publication
Information and Communications Security: 15th International Conference, ICICS 2013, Beijing, China, November 20-22: Proceedings
Volume
8233
First Page
1
Last Page
16
ISBN
9783319027265
Identifier
10.1007/978-3-319-02726-5_1
Publisher
Springer Verlag
City or Country
Beijing, China
Citation
TEY, Chee Meng and GAO, Debin.
Defending against heap overflow by using randomization in nested virtual clusters. (2013). Information and Communications Security: 15th International Conference, ICICS 2013, Beijing, China, November 20-22: Proceedings. 8233, 1-16.
Available at: https://ink.library.smu.edu.sg/sis_research/2036
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://dx.doi.org/10.1007/978-3-319-02726-5_1