mlsanityData to 7 Oct 2026

ELDA: Towards Efficient and Lightweight Detection of Cache Pollution Attacks in NDN

arXiv 1511.03005 ↗First posted 10 Nov 2015cs.CR cs.NI cs.PFcited by 1

Not on the map. Why?

Abstract (arXiv)

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 that, by consuming a few computation and memory resources, ELDA can effectively and efficiently detect CPA attacks.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 10 Nov 2015.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.