Xiaohui Kuang

Xiaohui Kuang


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
18 February 2020
Verified
Book Chapter
Closed access
PDF file
MZMing Zhang
Ming Zhang
HLHu Li
Hu Li
XKXiaohui Kuang
Xiaohui Kuang
LPLing Pang
Ling Pang
ZWZhendong Wu
Zhendong Wu

20 January 2020 in Mobile Networks and Applications
Verified
Journal Article
Closed access
PDF file
YZYutian Zhou
Yutian Zhou
YTYu-An Tan
Yu-An Tan
QZQuanxin Zhang
Quanxin Zhang
XKXiaohui Kuang
Xiaohui Kuang
YHYahong Han
Yahong Han
JHJingjing Hu
Jingjing Hu

2 December 2020 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
XLXiang Li
Xiang Li
YNYuanPing Nie
YuanPing Nie
Zhi WangZhi Wang
Zhi Wang
XKXiaohui Kuang
Xiaohui Kuang
KQKefan Qiu
Kefan Qiu
GZGang Zhao
Gang Zhao
For malware detection, current state-of-the-art research concentrates on machine learning techniques. Binary -gram OpCode features are commonly used for malicious code identification and classification with high accuracy. Binary OpCode modification is much more difficult than modification of image pixels. Traditional adversarial perturbation methods could not be applied on OpCode directly. In this paper, we propose a bidirectional universal adversarial learning method for effective binary OpCode perturbation from both benign and malicious perspectives. Benign features are those OpCodes that represent benign behaviours, while malicious features are OpCodes for malicious behaviours. From a large dataset of benign and malicious binary applications, we select the most significant benign and malicious OpCode features based on the feature SHAP value in the trained machine learning model. We implement an OpCode modification method that insert benign OpCodes into executables as garbage codes without execution and modify malicious OpCodes by equivalent replacement preserving execution semantics. The experimental results show that the benign and malicious OpCode perturbation (BMOP) method could bypass malicious code detection models based on the SVM, XGBoost, and DNN algorithms.

1 January 2015 in International Journal of Computer and Communication Engineering
Verified
Journal Article
Closed access
QJQi Jin
Qi Jin
MHMinhuan Huang
Minhuan Huang
XKXiaohui Kuang
Xiaohui Kuang

15 September 2022 in arXiv
Verified
Preprint
Open access
PDF file
YSYucheng Shi
Yucheng Shi
YHYahong Han
Yahong Han
YTYu-An Tan
Yu-An Tan
XKXiaohui Kuang
Xiaohui Kuang
Vision transformers (ViTs) have demonstrated impressive performance and stronger adversarial robustness compared to Convolutional Neural Networks (CNNs). On the one hand, ViTs' focus on global interaction between individual patches reduces the local noise sensitivity of images. On the other hand, the neglect of noise sensitivity differences between image regions by existing decision-based attacks further compromises the efficiency of noise compression, especially for ViTs. Therefore, validating the black-box adversarial robustness of ViTs when the target model can only be queried still remains a challenging problem. In this paper, we theoretically analyze the limitations of existing decision-based attacks from the perspective of noise sensitivity difference between regions of the image, and propose a new decision-based black-box attack against ViTs, termed Patch-wise Adversarial Removal (PAR). PAR divides images into patches through a coarse-to-fine search process and compresses the noise on each patch separately. PAR records the noise magnitude and noise sensitivity of each patch and selects the patch with the highest query value for noise compression. In addition, PAR can be used as a noise initialization method for other decision-based attacks to improve the noise compression efficiency on both ViTs and CNNs without introducing additional calculations. Extensive experiments on three datasets demonstrate that PAR achieves a much lower noise magnitude with the same number of queries.