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...

Full description

Saved in:

Bibliographic Details
Main Authors:	TEY, Chee Meng, GAO, Debin
Format:	text
Language:	English
Published:	Institutional Knowledge at Singapore Management University 2013
Subjects:	Information Security
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

id	sg-smu-ink.sis_research-3035
record_format	dspace
spelling	sg-smu-ink.sis_research-30352014-02-04T11:54:04Z Defending against heap overflow by using randomization in nested virtual clusters TEY, Chee Meng GAO, Debin 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. 2013-11-20T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/2036 info:doi/10.1007/978-3-319-02726-5_1 https://ink.library.smu.edu.sg/context/sis_research/article/3035/viewcontent/icics13.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Information Security
institution	Singapore Management University
building	SMU Libraries
continent	Asia
country	Singapore Singapore
content_provider	SMU Libraries
collection	InK@SMU
language	English
topic	Information Security
spellingShingle	Information Security TEY, Chee Meng GAO, Debin Defending against heap overflow by using randomization in nested virtual clusters
description	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.
format	text
author	TEY, Chee Meng GAO, Debin
author_facet	TEY, Chee Meng GAO, Debin
author_sort	TEY, Chee Meng
title	Defending against heap overflow by using randomization in nested virtual clusters
title_short	Defending against heap overflow by using randomization in nested virtual clusters
title_full	Defending against heap overflow by using randomization in nested virtual clusters
title_fullStr	Defending against heap overflow by using randomization in nested virtual clusters
title_full_unstemmed	Defending against heap overflow by using randomization in nested virtual clusters
title_sort	defending against heap overflow by using randomization in nested virtual clusters
publisher	Institutional Knowledge at Singapore Management University
publishDate	2013
url	https://ink.library.smu.edu.sg/sis_research/2036 https://ink.library.smu.edu.sg/context/sis_research/article/3035/viewcontent/icics13.pdf
_version_	1770571777931476992

Defending against heap overflow by using randomization in nested virtual clusters

Similar Items