Deobfuscating APK with Graph Matchmaking
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 106 === Java source code can be obtained by decompiling its bytecode, therefore, obfuscation by modifying the names of packages, classes, and methods is usually adopted as a means to reduce the readability to protect the source code. In this research work, we address t...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2018
|
Online Access: | http://ndltd.ncl.edu.tw/handle/5n78c5 |
id |
ndltd-TW-106NTU05392092 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-106NTU053920922019-07-25T04:46:48Z http://ndltd.ncl.edu.tw/handle/5n78c5 Deobfuscating APK with Graph Matchmaking 利用圖媒合達成APK原始碼反混淆 Yu-Ching Hsu 徐有慶 碩士 國立臺灣大學 資訊工程學研究所 106 Java source code can be obtained by decompiling its bytecode, therefore, obfuscation by modifying the names of packages, classes, and methods is usually adopted as a means to reduce the readability to protect the source code. In this research work, we address the obfuscation through the following three steps: 1. transform Java programs into their corresponding graphs, 2. collect sub-graphs from the graphs of non-obfuscated programs to form patterns as a basis for similarity calculation, and 3. compare the similarity of graphs to obtain a most probable name for the unknown node. An experiment is also conducted to evaluate the benefit of our proposed approach with the extant CRF approach to show that our proposed approach is statistically more significant in improving the precision of predicting entity type than the extant CRF approach. 李允中 2018 學位論文 ; thesis 53 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 106 === Java source code can be obtained by decompiling its bytecode, therefore, obfuscation by modifying the names of packages, classes, and methods is usually adopted as a means to reduce the readability to protect the source code. In this research work, we address the obfuscation through the following three steps: 1. transform Java programs into their corresponding graphs, 2. collect sub-graphs from the graphs of non-obfuscated programs to form patterns as a basis for similarity calculation, and 3. compare the similarity of graphs to obtain a most probable name for the unknown node.
An experiment is also conducted to evaluate the benefit of our proposed approach with the extant CRF approach to show that our proposed approach is statistically more significant in improving the precision of predicting entity type than the extant CRF approach.
|
author2 |
李允中 |
author_facet |
李允中 Yu-Ching Hsu 徐有慶 |
author |
Yu-Ching Hsu 徐有慶 |
spellingShingle |
Yu-Ching Hsu 徐有慶 Deobfuscating APK with Graph Matchmaking |
author_sort |
Yu-Ching Hsu |
title |
Deobfuscating APK with Graph Matchmaking |
title_short |
Deobfuscating APK with Graph Matchmaking |
title_full |
Deobfuscating APK with Graph Matchmaking |
title_fullStr |
Deobfuscating APK with Graph Matchmaking |
title_full_unstemmed |
Deobfuscating APK with Graph Matchmaking |
title_sort |
deobfuscating apk with graph matchmaking |
publishDate |
2018 |
url |
http://ndltd.ncl.edu.tw/handle/5n78c5 |
work_keys_str_mv |
AT yuchinghsu deobfuscatingapkwithgraphmatchmaking AT xúyǒuqìng deobfuscatingapkwithgraphmatchmaking AT yuchinghsu lìyòngtúméihédáchéngapkyuánshǐmǎfǎnhùnxiáo AT xúyǒuqìng lìyòngtúméihédáchéngapkyuánshǐmǎfǎnhùnxiáo |
_version_ |
1719229990017433600 |