Jeongwoo Kim

Jeongwoo Kim

Auto-generated profile, based on publicly available information

Jeongwoo Kim

Department of Computer Science and Engineering, Chungnam National University, Daejeon, South Korea

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 March 2023 in IEEE Access
Verified
Journal Article
Open access
JKJeongwoo Kim
Jeongwoo Kim
JPJoon-Young Paik
Joon-Young Paik
ECEun-Sun Cho
Eun-Sun Cho
The role of malware classification is crucial in addressing the explosive increase in malware variants. By classifying malware instances into malware families, malware analysts can apply appropriate techniques and tools to handle malware variants in each family. Using high-level representations of malware, such as disassembled codes, yields meaningful classification performance. However, malware classification based on disassembled codes depends on the practically implausible assumption that every malware is correctly reversed by disassemblers. Unfortunately, sophisticated malware, which has anti-disassembly capabilities, seeks to confuse disassemblers, yielding incorrectly disassembled codes. In this study, we focus on malware family classification, which requires no disassembly, and propose a new CNN-based malware classification model using non-disassembled malware files (i.e., binary files). Our model associates two modalities: “malware images” and “structural entropies,” which are converted and extracted from binary files. Both modalities have different granularities of bytes and chunks that complement each other. The model adopts a cross-modal attention mechanism to combine the features of the two modalities by moderating their expressive limitations. We validate our model using three popular datasets from the Kaggle Microsoft Malware Classification, Malimg, and BODMAS datasets. The experimental results show that our model identifies malware families with a higher degree of accuracy than previous methods and does not require the burden of disassembling.

7 November 2022
Verified
Conference Paper
Open access
SKSeoyeon Kang
Seoyeon Kang
JKJeongwoo Kim
Jeongwoo Kim
ECEun-Sun Cho
Eun-Sun Cho
SCSeokwoo Choi
Seokwoo Choi
Program obfuscation is one of the frequently used methods to make malware hard to analyze. Among the various obfuscation techniques, Mixed Boolean-Arithmetic (MBA) obfuscation, which mixes arithmetic and Boolean operations in an expression, is often considered hard to solve. Recently, synthesis-based methods have emerged to simplify MBA-obfuscated expressions. However, despite promising results, they still have limitations. Fortunately, recent work in super optimization shows that stochastic synthesis is generally sped up by a proper restart strategy. We adopt this principle to enhance the performance of existing works. Experimental results show that we would achieve improvement in the rate of correct answers and better length reduction.

15 August 2022 in arXiv
Verified
Preprint
Open access
PDF file
SMSeong-Kyun Mok
Seong-Kyun Mok
SKSeoyeon Kang
Seoyeon Kang
JKJeongwoo Kim
Jeongwoo Kim
ECEun-Sun Cho
Eun-Sun Cho
SCSeokwoo Choi
Seokwoo Choi
MBA (mixed boolean and arithmetic) expressions are hard to simplify, so used for malware obfuscation to hinder analysts' diagnosis. Some MBA simplification methods with high performance have been developed, but they narrowed the target to "linear" MBA expressions, which allows efficient solutions based on logic/term-rewriting. However such restrictions are not appropriate for general forms of MBA expressions usually appearing in malware. To overcome this limitation, we introduce a "semi-linear" MBA expression, a new class of MBA expression extended from a linear MBA expression, and propose a new MBA simplifier called "SSLEM", based on a simplification idea of semi-linear MBA expressions and program synthesis