ELDA: Towards Efficient and Lightweight Detection of Cache Pollution Attacks in NDN
Zhiwei Xu, Bo Chen, Ninghan Wang, Yujun Zhang, Zhongcheng Li

TL;DR
ELDA introduces a lightweight detection scheme using a novel sketching method to identify cache pollution attacks in NDN efficiently, aiming to protect network performance without heavy resource consumption.
Contribution
The paper presents ELDA, a novel lightweight detection scheme utilizing a new sketching technique to efficiently identify cache pollution attacks in NDN.
Findings
ELDA effectively detects CPA attacks with minimal resource usage.
Simulation results show high detection accuracy and low overhead.
ELDA outperforms existing detection methods in efficiency and resource consumption.
Abstract
As a promising architectural design for future Internet, named data networking (NDN) relies on in-network caching to efficiently deliver name-based content. However, the in-network caching is vulnerable to cache pollution attacks (CPA), which can reduce cache hits by violating cache locality and significantly degrade the overall performance of NDN. To defend against CPA attacks, the most effective way is to first detect the attacks and then throttle them. Since the CPA attack itself has already imposed a huge burden on victims, to avoid exhausting the remaining resources on the victims for detection purpose, we expect a lightweight detection solution. We thus propose ELDA, an Efficient and Lightweight Detection scheme against cache pollution Attacks, in which we design a Lightweight Flajolet-Martin (LFM) sketch to monitor the interest traffic. Our analysis and simulations demonstrate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
