Mengsha Kou

Mengsha Kou

Auto-generated profile, based on publicly available information

Mengsha Kou

School of Computing Technologies, RMIT University, Melbourne, Australia

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

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

Representative Publications

View All Publications
12 April 2026
Verified
Conference Paper
Open access
MKMengsha Kou
Mengsha Kou
XXXiaoyu Xia
Xiaoyu Xia
ZWZiqi Wang
Ziqi Wang
IKIbrahim Khalil
Ibrahim Khalil
RLRuikun Luo
Ruikun Luo
MXMinhui Xue
Minhui Xue

9 February 2026 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
MKMengsha Kou
Mengsha Kou
XXXiaoyu Xia
Xiaoyu Xia
IKIbrahim Khalil
Ibrahim Khalil
ZWZiqi Wang
Ziqi Wang
XZXiuzhen Zhang
Xiuzhen Zhang
MXMinhui Xue
Minhui Xue
Caching web data on edge servers has become a common practice in latency-sensitive services to minimize data retrieval delays for web users. However, the geographic distribution of edge servers and frequent data transmissions make these systems vulnerable to security threats, particularly cache pollution attacks (CPAs). In such attacks, malicious users send excessive requests for unpopular data at abnormal frequencies, causing irrelevant content to be cached and degrading the system’s performance. Traditional CPAs, though impactful in conventional caching systems, are less effective in edge environments where user requests are more diverse and edge servers collaborate in caching strategies. In this paper, we identify a novel attack named data flipping attack (DFA) that targets the data transmission process among edge servers. This attack manipulates request distribution by swapping the frequencies of popular and unpopular data requests, all while maintaining other characteristics like request timing and user identity. This tactic disrupts caching strategies without raising suspicion. Experimental results indicate DFA is independent of user request patterns and demonstrates substantial effectiveness and robustness, successfully forcing edge web users to retrieve data from the cloud across various scales and configurations of edge networks. Furthermore, it evades detection by state-of-the-art methods that rely on specific distribution patterns, such as the Zipf distribution. To counter this attack, we propose an effective defense method that alters the request distribution by frequency distillation, mitigating its impact.