TY - GEN
T1 - Eliminating the threat of kernel stack overflows
AU - Wiseman, Yair
AU - Isaacson, Joel
AU - Lubovsky, Eliad
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=51949099257&partnerID=8YFLogxK
U2 - 10.1109/IRI.2008.4583015
DO - 10.1109/IRI.2008.4583015
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:51949099257
SN - 9781424426607
T3 - 2008 IEEE International Conference on Information Reuse and Integration, IEEE IRI-2008
SP - 116
EP - 121
BT - 2008 IEEE International Conference on Information Reuse and Integration, IEEE IRI-2008
T2 - 2008 IEEE International Conference on Information Reuse and Integration, IEEE IRI-2008
Y2 - 13 July 2008 through 15 July 2008
ER -