Kernel stack overflows elimination

Yair Wiseman, Joel Isaacson, Eliad Lubovsky, Pinchas Weisberg

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


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, the authors 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.

Original languageEnglish
Title of host publicationAdvanced Operating Systems and Kernel Applications
Subtitle of host publicationTechniques and Technologies
PublisherIGI Global
Number of pages14
ISBN (Print)9781605668505
StatePublished - 2009
Externally publishedYes


Dive into the research topics of 'Kernel stack overflows elimination'. Together they form a unique fingerprint.

Cite this