Welcome to the InfoSci Platform
Kernel Stack Overflows Elimination

Kernel Stack Overflows Elimination

Yair Wiseman, Joel Isaacson, Eliad Lubovsky, Pinchas Weisberg
Copyright: © 2010 |Pages: 14
ISBN13: 9781605668505|ISBN10: 1605668508|EISBN13: 9781605668512
DOI: 10.4018/978-1-60566-850-5.ch001
Cite Chapter Cite Chapter

MLA

Wiseman, Yair, et al. "Kernel Stack Overflows Elimination." Advanced Operating Systems and Kernel Applications: Techniques and Technologies, edited by Yair Wiseman and Song Jiang, IGI Global, 2010, pp. 1-14. https://doi.org/10.4018/978-1-60566-850-5.ch001

APA

Wiseman, Y., Isaacson, J., Lubovsky, E., & Weisberg, P. (2010). Kernel Stack Overflows Elimination. In Y. Wiseman & S. Jiang (Eds.), Advanced Operating Systems and Kernel Applications: Techniques and Technologies (pp. 1-14). IGI Global. https://doi.org/10.4018/978-1-60566-850-5.ch001

Chicago

Wiseman, Yair, et al. "Kernel Stack Overflows Elimination." In Advanced Operating Systems and Kernel Applications: Techniques and Technologies, edited by Yair Wiseman and Song Jiang, 1-14. Hershey, PA: IGI Global, 2010. https://doi.org/10.4018/978-1-60566-850-5.ch001

Export Reference

Mendeley
Favorite

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

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.