Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/649
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAGARWAL, RAHUL KUMAR-
dc.date.accessioned2010-12-31T06:54:07Z-
dc.date.available2010-12-31T06:54:07Z-
dc.date.issued2008-07-18-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/649-
dc.descriptionME THESISen_US
dc.description.abstractToday a majority of security exploits have a memory corruption component. These attacks depend on corrupting some process memory and either injecting a shellcode and executing that or using some system calls with malicious parameters to harm victim machine and to replicate. The existing approaches either provide insufficient randomness or require source code modification. Insufficient randomness allows attacker to use Brute-Force attacks and source code modification doesn’t seem to be viable solution for all the software available on the internet which are the biggest reservoir of the memory corruption attacks. In this paper we propose PriCryp, a prophylactic security technique that makes efficient and effective use of ASLR and ISR to provide prioritized cryptographic runtime code block randomization. Here we make key observation that system calls are almost always used in memory corruption attacks by the attackers. We make use of cryptographic algorithms to scramble data var...en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTD439;67-
dc.subjectprophylactic security techniqueen_US
dc.subjectRANDOMIZATIONen_US
dc.titlePRIORITIZED RUNTIME ADDRESS RANDOMIZATION FOR BUFFER OVERFLOW EXTENUATIONen_US
Appears in Collections:M.E./M.Tech. Computer Technology & Applications

Files in This Item:
File Description SizeFormat 
Rahul+Kumar+Agrawal+-+10193+-+14CTA06.pdf1.39 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.