A lightweight mechanism for detection of cache pollution attacks in Named Data Networking

被引:111
作者
Conti, Mauro [1 ]
Gasti, Paolo [2 ]
Teoli, Marco [1 ]
机构
[1] Univ Padua, Dept Math, I-35131 Padua, Italy
[2] New York Inst Technol, Sch Engn & Comp Sci, New York, NY 10023 USA
基金
美国国家科学基金会;
关键词
Named data networking; Cache pollution attack; Security;
D O I
10.1016/j.comnet.2013.07.034
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Content-Centric Networking (CCN) is an emerging paradigm being considered as a possible replacement for the current IP-based host-centric Internet infrastructure. In CCN, named content - rather than addressable hosts - becomes a first-class entity. Content is therefore decoupled from its location. This allows, among other things, the implementation of ubiquitous caching. Named-Data Networking (NON) is a prominent example of CCN. In NON, all nodes (i.e., hosts, routers) are allowed to have a local cache, used to satisfy incoming requests for content. This makes NDN a good architecture for efficient large scale content distribution. However, reliance on caching allows an adversary to perform attacks that are very effective and relatively easy to implement. Such attacks include cache poisoning (i.e., introducing malicious content into caches) and cache pollution (i.e., disrupting cache locality). This paper focuses on cache pollution attacks, where the adversary's goal is to disrupt cache locality to increase link utilization and cache misses for honest consumers. We show, via simulations, that such attacks can be implemented in NON using limited resources, and that their effectiveness is not limited to small topologies. We then illustrate that existing proactive countermeasures are ineffective against realistic adversaries. Finally, we introduce a new technique for detecting pollution attacks. Our technique detects high and low rate attacks on different topologies with high accuracy. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:3178 / 3191
页数:14
相关论文
共 25 条
  • [1] Acs G., 2013, ICDCS 2013
  • [2] [Anonymous], 2011, INT J ADV SOFT COMPU
  • [3] [Anonymous], 2012, UCLA
  • [4] [Anonymous], 1949, Human behaviour and the principle of least-effort
  • [5] Arlitt M, 2000, PERF E R SI, V27, P3, DOI [10.1145/346000.346003, 10.1145/362883.362920]
  • [6] AN OVERVIEW OF WEB CACHING REPLACEMENT ALGORITHMS
    Balamash, Abdullah
    Krunz, Marwan
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2004, 6 (02): : 44 - 56
  • [7] Breslau L., 1999, INFOCOM
  • [8] Chai WK, 2012, LECT NOTES COMPUT SC, V7289, P27, DOI 10.1007/978-3-642-30045-5_3
  • [9] Dan G., 2010, P 9 INT C PEER TO PE, P12
  • [10] Pollution attacks and defenses for Internet caching systems
    Deng, Leiwen
    Gao, Yan
    Chen, Yan
    Kumanovic, Aleksandar
    [J]. COMPUTER NETWORKS, 2008, 52 (05) : 935 - 956