Dinghao Wu

Dinghao Wu

Auto-generated profile, based on publicly available information

Dinghao Wu

The Pennsylvania State University

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
18 January 2017 in IEEE Transactions on Software Engineering
Verified
Journal Article
Open access
LLLannan Luo
Lannan Luo
JMJiang Ming
Jiang Ming
DWDinghao Wu
Dinghao Wu
PLPeng Liu
Peng Liu
SZSencun Zhu
Sencun Zhu
Existing code similarity comparison methods, whether source or binary code based, are mostly not resilient to obfuscations. Identifying similar or identical code fragments among programs is very important in some applications. For example, one application is to detect illegal code reuse. In the code theft cases, emerging obfuscation techniques have made automated detection increasingly difficult. Another application is to identify cryptographic algorithms which are widely employed by modern malware to circumvent detection, hide network communications, and protect payloads among other purposes. Due to diverse coding styles and high programming flexibility, different implementation of the same algorithm may appear very distinct, causing automatic detection to be very hard, let alone code obfuscations are sometimes applied. In this paper, we propose a binary-oriented, obfuscation-resilient binary code similarity comparison method based on a new concept, longest common subsequence of semantically equivalent basic blocks , which combines rigorous program semantics with longest common subsequence based fuzzy matching. We model the semantics of a basic block by a set of symbolic formulas representing the input-output relations of the block. This way, the semantic equivalence (and similarity) of two blocks can be checked by a theorem prover. We then model the semantic similarity of two paths using the longest common subsequence with basic blocks as elements. This novel combination has resulted in strong resiliency to code obfuscation. We have developed a prototype. The experimental results show that our method can be applied to software plagiarism and algorithm detection, and is effective and practical to analyze real-world software.

29 March 2019 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
HMHaoyu Ma
Haoyu Ma
CJChunfu Jia
Chunfu Jia
SLShijia Li
Shijia Li
WZWantong Zheng
Wantong Zheng
DWDinghao Wu
Dinghao Wu

31 May 2016 in Journal of Computer Virology and Hacking Techniques
Verified
Journal Article
Closed access
PDF file
JMJiang Ming
Jiang Ming
ZXZhi Xin
Zhi Xin
PLPengwei Lan
Pengwei Lan
DWDinghao Wu
Dinghao Wu
PLPeng Liu
Peng Liu
BMBing Mao
Bing Mao

27 May 2018
Verified
Conference Paper
Open access
PDF file
PWPei Wang
Pei Wang
QBQinkun Bao
Qinkun Bao
LWLi Wang
Li Wang
SWShuai Wang
Shuai Wang
ZCZhaofeng Chen
Zhaofeng Chen
DWDinghao Wu
Dinghao Wu

26 August 2016
Verified
Book Chapter
Closed access
PDF file
DXDongpeng Xu
Dongpeng Xu
JMJiang Ming
Jiang Ming
DWDinghao Wu
Dinghao Wu

9 May 2015
Verified
Book Chapter
Open access
PDF file
JMJiang Ming
Jiang Ming
DXDongpeng Xu
Dongpeng Xu
DWDinghao Wu
Dinghao Wu
Identifying differences between two executable binaries (binary diffing) has compelling security applications, such as software vulnerability exploration, “1-day” exploit generation and software plagiarism detection. Recently, binary diffing based on symbolic execution and constraint solver has been proposed to look for the code pairs with the same semantics, even though they are ostensibly different in syntactics. Such logical-based method captures intrinsic differences of binary code, making it a natural choice to analyze highly-obfuscated malicious program. However, semantics-based binary diffing suffers from significant performance slowdown, hindering it from analyzing large-scale malware samples. In this paper, we attempt to mitigate the high overhead of semantics-based binary diffing with application to malware lineage inference. We first study the key obstacles that contribute to the performance bottleneck. Then we propose basic blocks fast matching to speed up semantics-based binary diffing. We introduce an union-find set structure that records semantically equivalent basic blocks. Managing the union-find structure during successive comparisons allows direct reuse of previously computed results. Moreover, we purpose to concretize symbolic formulas and cache equivalence queries to further cut down the invocation times of constraint solver. We have implemented our technique on top of iBinHunt and evaluated it on 12 malware families with respect to the performance improvement when performing intra-family comparisons. Our experimental results show that our methods can accelerate symbolic execution from \(2.8\) x to \(5.3\) x (with an average \(4.0\) x), and reduce constraint solver invocation by a factor of \(3.0\) x to \(6.0\) x (with an average \(4.3\) x).