DocumentCode
2349848
Title
Eliminating the threat of kernel stack overflows
Author
Wiseman, Yair ; Isaacson, Joel ; Lubovsky, Eliad
Author_Institution
Computer Science Department, The Open University, Israel
fYear
2008
fDate
13-15 July 2008
Firstpage
116
Lastpage
121
Abstract
The Linux kernel stack has a fixed size. There is no mechanism to prevent the kernel from overflowing the stack. Hackers can exploit this bug to put unwanted information in the memory of the operating system and gain control over the system. In order to prevent this problem, we introduce a dynamically sized kernel stack that can be integrated into the standard Linux kernel. The well-known paging mechanism is reused with some changes, in order to enable the kernel stack to grow.
Keywords
Computer bugs; Computer hacking; Computer science; Hardware; Kernel; Linux; Memory management; Operating systems; Protection; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Reuse and Integration, 2008. IRI 2008. IEEE International Conference on
Conference_Location
Las Vegas, NV, USA
Print_ISBN
978-1-4244-2659-1
Electronic_ISBN
978-1-4244-2660-7
Type
conf
DOI
10.1109/IRI.2008.4583015
Filename
4583015
Link To Document