Shuai He

Shuai He

Auto-generated profile, based on publicly available information

Shuai He

Huazhong University of Science and Technology

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
8 July 2024 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
SJShuai Jiang
Shuai Jiang
CFCai Fu
Cai Fu
SHShuai He
Shuai He
JLJianqiang Lv
Jianqiang Lv
LHLansheng Han
Lansheng Han
HHHong Hu
Hong Hu
Binary Code Similarity Detection (BCSD) is a fundamental binary analysis technique in the area of software security. Recently, advanced deep learning algorithms are integrated into BCSD platforms to achieve superior performance on well-known benchmarks. However, real-world large programs embed more complex diversities due to different compilers, various optimization levels, multiple architectures and even obfuscations. Existing BCSD solutions suffer from low accuracy issues in such complicated real-world application scenarios. In this paper, we propose BinCola, a novel Transformer-based dual diversity-sensitive contrastive learning framework that comprehensively considers the diversity of compiler options and candidate functions in the real-world application scenarios and employs the attention mechanism to fuse multi-granularity function features for enhancing generality and scalability. BinCola simultaneously compares multiple candidate functions across various compilation option scenarios to learn the differences caused by distinct compiler options and different candidate functions. We evaluate BinCola’s performance in a variety of ways, including binary similarity detection and real-world vulnerability search in multiple application scenarios. The results demonstrate that BinCola achieves superior performance compared to state-of-the-art (SOTA) methods, with improvements of 2.80%, 33.62%, 22.41%, and 34.25% in cross-architecture, cross-optimization level, cross-compiler, and cross-obfuscation scenarios, respectively.

28 April 2020 in IEEE Access
Verified
Journal Article
Open access
JSJianhua Song
Jianhua Song
SHShuai He
Shuai He
HYHui Yao
Hui Yao
In the RFID system, the tag collision problem seriously affects the efficiency of tag identification. Among the anti-collision algorithms, tree-based anti-collision algorithms are popular for the reason that they can ensure that the tags can theoretically 100% be identified by readers. As multi-reader scenarios are more and more widely used in complex internet of things environments, there are more collision slots and idle slots in traditional anti-collision algorithms, which affects the efficiency of the algorithm. We propose a tree-based multi-reader interactive anti-collision algorithm (TMIA) for multi-reader tag identification scenarios to solve the problems above. Readers optimize the broadcast prefix sequence by sharing the broadcast results. The proposed algorithm works in two phases: In the first phase, the reader selects a suitable broadcast prefix by the multi-reader inverse probability function (MIPF) to reduce the initial redundant collision in tag identification. In the second phase, the priority of the broadcast prefix is adjusted through the information exchange between readers, the readers thus avoid broadcasting a large number of invalid prefixes. Theoretical analysis and simulation results show that TMIA has a lower total number of slots and better system efficiency than existing tree-based algorithms. TMIA also greatly reduce the number of collision slots.

12 April 2024
Verified
Conference Paper
Open access
SHShuai He
Shuai He
CFCai Fu
Cai Fu
HHHong Hu
Hong Hu
JCJiahe Chen
Jiahe Chen
JLJianqiang Lv
Jianqiang Lv
SJShuai Jiang
Shuai Jiang
Recent methods have demonstrated that machine learning (ML) based static malware detection models are vulnerable to adversarial attacks. However, the generated malware often fails to generalize to production-level anti-malware software (AMS), as they usually involve multiple detection methods. This calls for universal solutions to the problem of malware variants generation. In this work, we demonstrate how the proposed method, MalwareTotal, has allowed malware variants to continue to abound in ML-based, signature-based, and hybrid anti-malware software. Given a malicious binary, we develop sequential bypass tactics that enable malicious behavior to be concealed within multi-faceted manipulations. Through 12 experiments on real-world malware, we demonstrate that an attacker can consistently bypass detection (98.67%, and 100% attack success rate against ML-based methods EMBER and MalConv, respectively; 95.33%, 92.63%, and 98.52% attack success rate against production-level anti-malware software ClamAV, AMS A, and AMS B, respectively) without modifying the malware functionality. We further demonstrate that our approach outperforms state-of-the-art adversarial malware generation techniques both in attack success rate and query consumption (the number of queries to the target model). Moreover, the samples generated by our method have demonstrated transferability in the real-world integrated malware detector, VirusTotal. In addition, we show that common mitigation such as adversarial training on known attacks cannot effectively defend against the proposed attack. Finally, we investigate the value of the generated adversarial examples as a means of hardening victim models through an adversarial training procedure, and demonstrate that the accuracy of the retrained model against generated adversarial examples increases by 88.51 percentage points.

11 June 2025
Verified
Conference Paper
Open access
SHShuai He
Shuai He
HYHao Yan
Hao Yan
WLWenke Li
Wenke Li
SHSheng Hong
Sheng Hong
XGXiaowei Guo
Xiaowei Guo
CFCai Fu
Cai Fu

1 January 2026 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
XGXiaowei Guo
Xiaowei Guo
XLXiaofan Liu
Xiaofan Liu
CWChuanhao Wan
Chuanhao Wan
SHShuai He
Shuai He
SJShuai Jiang
Shuai Jiang
CFCai Fu
Cai Fu

6 August 2025 in Information Sciences
Verified
Journal Article
Closed access
JLJianqiang Lv
Jianqiang Lv
CFCai Fu
Cai Fu
QYQiwen Yan
Qiwen Yan
SHShuai He
Shuai He
SJShuai Jiang
Shuai Jiang
MLMing Liu
Ming Liu