Papers

Peer-reviewed Last author Corresponding author Open access
Jul, 2020

Identification of kernel memory corruption using kernel memory secret observation mechanism

IEICE Transactions on Information and Systems
  • Kuzuno, H.
  • ,
  • Yamauchi, T.

Volume
E103D
Number
7
First page
1462
Last page
1475
Language
English
Publishing type
Research paper (scientific journal)
DOI
10.1587/transinf.2019ICP0011
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

Copyright © 2020 The Institute of Electronics, Information and Communication Engineers. Countermeasures against attacks targeting an operating system are highly effective in preventing security compromises caused by kernel vulnerability. An adversary uses such attacks to overwrite credential information, thereby overcoming security features through arbitrary program execution. CPU features such as Supervisor Mode Access Prevention, Supervisor Mode Execution Prevention and the No eXecute bit facilitate access permission control and data execution in virtual memory. Additionally, Linux reduces actual attacks through kernel vulnerability affects via several protection methods including Kernel Address Space Layout Randomization, Control Flow Integrity, and Kernel Page Table Isolation. Although the combination of these methods can mitigate attacks as kernel vulnerability relies on the interaction between the user and the kernel modes, kernel virtual memory corruption can still occur (e.g., the eBPF vulnerability allows malicious memory overwriting only in the kernel mode). We present the Kernel Memory Observer (KMO), which has a secret observation mechanism to monitor kernel virtual memory. KMO is an alternative design for virtual memory can detect illegal data manipulation/writing in the kernel virtual memory. KMO determines kernel virtual memory corruption, inspects system call arguments, and forcibly unmaps the direct mapping area. An evaluation of KMO reveals that it can detect kernel virtual memory corruption that contains the defeating security feature through actual kernel vulnerabilities. In addition, the results indicate that the system call overhead latency ranges from 0.002 μs to 8.246 μs, and the web application benchmark ranges from 39.70 μs to 390.52 μs for each HTTP access, whereas KMO reduces these overheads by using tag-based Translation Lookaside Buffers.

Link information
DOI
https://doi.org/10.1587/transinf.2019ICP0011
DBLP
https://dblp.uni-trier.de/rec/journals/ieicetd/KuzunoY20
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000545550500004&DestApp=WOS_CPL
URL
http://search.ieice.org/bin/summary.php?id=e103-d_7_1462
URL
https://dblp.uni-trier.de/db/journals/ieicetd/ieicetd103.html#KuzunoY20
Scopus
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85091538578&origin=inward Open access
Scopus Citedby
https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=85091538578&origin=inward
ID information
  • DOI : 10.1587/transinf.2019ICP0011
  • ISSN : 1745-1361
  • ISSN : 0916-8532
  • eISSN : 1745-1361
  • DBLP ID : journals/ieicetd/KuzunoY20
  • ORCID - Put Code : 91428112
  • SCOPUS ID : 85091538578
  • Web of Science ID : WOS:000545550500004

Export
BibTeX RIS