Publication Type : Journal Article
Publisher : Communications in Computer and Information Science
Source : Communications in Computer and Information Science, Springer Verlag, Volume 746, p.250-258 (2017)
Url : https://www.scopus.com/inward/record.uri?eid=2-s2.0-85034611168&doi=10.1007%2f978-981-10-6898-0_21&partnerID=40&md5=61ab983e54181459c29c1c6e9065bf06
ISBN : 9789811068973
Campus : Coimbatore
School : School of Engineering
Center : TIFAC CORE in Cyber Security
Department : cyber Security
Year : 2017
Abstract : Opaque Predicates are one of the most covert methods employed by obfuscators to mitigate the risk of reverse engineering of code. Detecting the presence of opaque predicates in a program is an arduous problem since, it is challenging to differentiate between the conditional expressions present in the program and the extraneous expressions added by the obfuscator. This paper addresses a number of limitations encountered in the previous work due to dynamic analysis and proposes an improved algorithm for the detection of opaque predicates, with better efficiency and runtime. We propose a two phased approach for detecting the presence of opaque predicates - building an extractor to extract mathematical expressions from conditional statements and a decision engine which determines if the expressions are opaque predicates or not. © 2017, Springer Nature Singapore Pte Ltd.
Cite this Research Publication : R. K. R. Prakash, Amritha, P. P., and Sethumadhavan, M., “Opaque Predicate Detection by Static Analysis of Binary Executables”, Communications in Computer and Information Science, vol. 746, pp. 250-258, 2017.