Defending against heap overflow by using randomization in nested virtual clusters
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 addr...
Saved in:
Main Authors: | TEY, Chee Meng, GAO, Debin |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2013
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2036 https://ink.library.smu.edu.sg/context/sis_research/article/3035/viewcontent/icics13.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Concolic testing heap-manipulating programs
by: PHAM, Long H., et al.
Published: (2019) -
Defending against Packet Injection Attacks in Unreliable Ad Hoc Networks
by: GU, Qijun, et al.
Published: (2005) -
Defending against Additive Attacks with Maximal Errors in Watermarking Relational Databases
by: LI, Yingjiu, et al.
Published: (2004) -
ROPecker: A Generic and Practical Approach For Defending Against ROP Attack
by: CHENG, Yueqiang, et al.
Published: (2014) -
Defending against redirect attacks in mobile IP
by: DENG, Robert H., et al.
Published: (2002)