Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/IRI.2008.4583015 | PROCEEDINGS OF THE 2008 IEEE INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION |
Keywords | Field | DocType |
operating system,hardware,computer bugs,kernel,computer science,resource management,memory management,operating systems,linux,gain control | JFFS2,sysfs,Computer science,Call stack,Kernel preemption,Configfs,Process control block,procfs,Operating system,Linux kernel,Embedded system | Conference |
Citations | PageRank | References |
1 | 0.39 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yair Wiseman | 1 | 158 | 14.60 |
| Joel Isaacson | 2 | 1 | 0.39 |
| Eliad Lubovsky | 3 | 1 | 0.39 |