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 条
  • [11] Improving proxy cache performance: Analysis of three replacement policies
    Dilley, J
    Arlitt, M
    [J]. IEEE INTERNET COMPUTING, 1999, 3 (06) : 44 - 50
  • [12] Dilley J., 1999, ENHANCEMENT VALIDATI, V69
  • [13] Eriksson B, 2010, LECT NOTES COMPUT SC, V6032, P171, DOI 10.1007/978-3-642-12334-4_18
  • [14] Guo L, 2007, PERF E R SI, V35, P359
  • [15] The Stretched Exponential Distribution of Internet Media Access Patterns
    Guo, Lei
    Tan, Enhua
    Chen, Songqing
    Xiao, Zhen
    Zhang, Xiaodong
    [J]. PODC'08: PROCEEDINGS OF THE 27TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2008, : 283 - +
  • [16] Guo Lei., 2005, 5 C INTERNET MEASURE, P35
  • [17] Heckmann Oliver., 2003, MOMETOOLS 03 P ACM S, P28
  • [18] Knuth D. E., ART COMPUTER PROGRAM, V2
  • [19] Distributed selfish caching
    Laoutaris, Nikolaos
    Smaragdakis, Georgios
    Bestavros, Azer
    Matta, Ibrahim
    Stavrakakis, Ioannis
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2007, 18 (10) : 1361 - 1376
  • [20] The LCD interconnection of LRU caches and its analysis
    Laoutaris, Nikolaos
    Che, Hao
    Stavrakakis, Ioannis
    [J]. PERFORMANCE EVALUATION, 2006, 63 (07) : 609 - 634