Ahmad Nazri, Zainol (2008) Analyzing The Stack-Based Buffer Overflow Problem. Masters thesis, Universiti Utara Malaysia.
Ahmad_Nazri_Zainol.pdf
Restricted to Registered users only
Download (1MB) | Request a copy
Ahmad_Nazri_Zainol.pdf
Download (242kB) | Preview
Abstract
It is interesting to know that a buffer overflow problem still exist today despite of many researches have been conducted in a period of more than 20 years. This study takes an opportunity to analyze one of the dominant buffer overflow problem type, a stack-based buffer overflow. A controlled experimental demonstration has been carried out to emulate a stack-based buffer overflow exploit. During the process, main conditions why and how the exploit happens will be identified, analyzed and documented. The findings showed that more works can be done at the coding stage to prevent the problem before the damage (exploit) occurs which normally happen after the software product has been distributed. In this case more resources have been wasted such as cost, man-hour and time. Hence, several practical suggestions with its own advantageous have been
highlighted for further research and implementation. In addition, the findings should be very useful inputs in designing and implementing new buffer overflow detection and
prevention mechanisms.
Item Type: | Thesis (Masters) |
---|---|
Supervisor : | UNSPECIFIED |
Item ID: | 1064 |
Subjects: | T Technology > T Technology (General) T Technology > T Technology (General) > T58.5-58.64 Information technology Q Science > QA Mathematics > QA76 Computer software |
Divisions: | College of Arts and Sciences (CAS) |
Date Deposited: | 10 Jan 2010 07:14 |
Last Modified: | 24 Jul 2013 12:10 |
Department: | Faculty of Information Technology |
URI: | https://etd.uum.edu.my/id/eprint/1064 |