An accurate and efficient two‐phase scheme for detecting Android cloned applications. (19th September 2020)

• Record Type: Journal Article
• Authors: Xie, Jiahao; Yan, Xiai; Lin, Yaping; Wei, Jianhao
• Is Part Of: Concurrency and computation. Volume 33:Number 5(2021)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2020-09-19
• Subjects: android -- clone detection -- merged layout tree -- software security -- user interface; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.6009
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: The fast‐growing Android application market has attracted more and more application developers. However, many plagiarists use decompiled tools to modify original applications to get clones, which has become a serious threat. For detecting cloned applications, most of the existing schemes do not consider the detected accuracy and time consumption at the same time. In this article, we propose a two‐phase detection scheme to achieve fast and accurate clone detection in large‐scale applications . In the rapid screening phase, a fix‐length minhash summary is constructed for each application and the locality‐sensitive hashing (LSH) algorithm is used to obtain suspicious cloned applications quickly. In the accurate detection phase, by merging and pruning the layout and interaction information of all user interfaces (UIs) at the application runtime, we obtain the birthmark named merged layout tree (MLT), which can resist nested obfuscation and repacking attack. Finally, cloned apps are detected by calculating the similarity between MLTs from suspicious cloned apps. We evaluate our detection scheme in two app datasets (nearly 170, 000 Android applications) and compare it with the state‐of‐the‐art clone detection methods. Extensive experiments show that our method has high accuracy and efficiency for clone detection in large‐scale apps.