Yanwei Sun

Yanwei Sun

Auto-generated profile, based on publicly available information

Yanwei Sun

School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
20 May 2018 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
LYLihua Yin
Lihua Yin
YSYanwei Sun
Yanwei Sun
ZWZhen Wang
Zhen Wang
YGYunchuan Guo
Yunchuan Guo
FLFenghua Li
Fenghua Li
BFBinxing Fang
Binxing Fang
Security measurement matters to every stakeholder in network security. It provides security practitioners the exact security awareness. However, most of the works are not applicable to the unknown threat. What is more, existing efforts on security metric mainly focus on the ease of certain attack from a theoretical point of view, ignoring the “likelihood of exploitation.” To help administrator have a better understanding, we analyze the behavior of attackers who exploit the zero-day vulnerabilities and predict their attack timing. Based on the prediction, we propose a method of security measurement. In detail, we compute the optimal attack timing from the perspective of attacker, using a long-term game to estimate the risk of being found and then choose the optimal timing based on the risk and profit. We design a learning strategy to model the information sharing mechanism among multiattackers and use spatial structure to model the long-term process. After calculating the Nash equilibrium for each subgame, we consider the likelihood of being attacked for each node as the security metric result. The experiment results show the efficiency of our approach.

11 April 2022 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
HWHuanran Wang
Huanran Wang
HHHui He
Hui He
CSChen Song
Chen Song
HTHao Tang
Hao Tang
YSYanwei Sun
Yanwei Sun
WZWeizhe Zhang
Weizhe Zhang
Recently, mobile technology has become closely linked with our daily activities. Smartphones are used for multiple personal tasks involving private information, such as communication, healthcare, and banking. Therefore, there is a high demand for user-friendly authentication methods that prevent unauthorized access to sensitive information. This paper proposes a novel feature representation tactic for continuous authentication named Multiple Channels Biological Graph (MCBG). Unlike conventional techniques, MCBG divides the smartphone usage scenarios into more fine-grained cases, including the operation interval features. To this end, we extract the screen touch and handheld features from multiple built-in sensors without extra user interaction. We conduct experiments on 180 participants (130 adults and 50 minors) and investigate the sufficiency of different sensor combinations required to authenticate identity accurately. Results show that our MCBG-based model achieves 99.38% authentication accuracy within 1.9 seconds. Furthermore, MCBG also represents the intrinsic differences between grown-ups and minors, achieving 96% identification accuracy.

21 October 2024 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
YSYanwei Sun
Yanwei Sun
FRFei Ren
Fei Ren
JSJian Sun
Jian Sun
ZLZhiyi Liang
Zhiyi Liang
JZJiapeng Zhao
Jiapeng Zhao
While improving network performance, Mobile Edge Computing (MEC) faces significant security threats due to User Equipment (UE) vulnerabilities and insecure communication protocols. This enables attackers to insert malicious nodes into the entire system and propagate worms such as the Mirai, enabling activities like DDoS attacks and cryptocurrency mining. To reduce security risks, it is necessary to identify worm sources and predict their propagation accurately. However, in practice, there exist a large number of stealthy worms (nodes that infect stealthy worms work without exhibiting any abnormal behavior), making it challenging to accurately analyze their source and predict their propagation. To address this problem, our paper introduces a prediction scheme designed to analyze the propagation of stealthy worms originating from unknown sources. First, a Bayes rule-based observation algorithm is designed to correct false-negative nodes and increase the accuracy of identifying the propagation sources. Then, we design a branch-and-bound algorithm to effectively reduce the traversal space and improve the efficiency of calculating the upper and lower bounds. Finally, a series of experiments in four real networks are conducted to show the accuracy and efficiency of our scheme.