NBP: Namespace-based privacy to counter timing-based attack in named data networking

Abstract NDN is one of the most prominent candidates for the future network. It has a data-centric network architecture in which fetching of content, forwarding requests, and routing is done through the name of the content. Content caching is an essential feature in NDN as its performance depends upon its efficiency of caching contents. Cache in NDN is open for all types of requesters. An attacker can probe an interest packet and find out whether the content corresponding to the interest packet is cached or not by observing the time difference between the timestamps at which the content is received and the request is sent. This attack is called timing-based attack (TBA). Existing solutions for TBA are based on securing individual contents. Therefore, they use large size table, which have data related to each content. Managing these large tables is expensive in terms of space and time. Also, the existing approaches fail to mitigate TBA or can be attacked by the attacker. To counter these limitations a Namespace-Based Privacy (NBP) approach has been proposed for content generation and handling its privacy. Additionally, an approach is proposed which detects the attack pattern at the gateway router itself and triggers the countermeasure in case of attack. The results prove that the proposed approach is better than the existing eminent approaches.

[1]  Naveen Kumar,et al.  A Triggered Delay-based Approach against Cache Privacy Attack in NDN , 2018, Int. J. Networked Distributed Comput..

[2]  George Kingsley Zipf,et al.  Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology , 2012 .

[3]  Patrick Crowley,et al.  Named data networking , 2014, CCRV.

[4]  Ning Wang,et al.  COMET: Content mediator architecture for content-aware networks , 2011, 2011 Future Network & Mobile Summit.

[5]  Aziz Mohaisen,et al.  Timing Attacks on Access Privacy in Information Centric Networks and Countermeasures , 2015, IEEE Transactions on Dependable and Secure Computing.

[6]  Yongdae Kim,et al.  Protecting access privacy of cached contents in information centric networks , 2012, CCS.

[7]  David Barkai Technologies for sharing and collaborating on the Net , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[8]  Patrick Valduriez,et al.  Principles of Distributed Database Systems , 1990 .

[9]  Hao Che,et al.  Hierarchical Web caching systems: modeling, design and experimental results , 2002, IEEE J. Sel. Areas Commun..

[10]  Mario Gerla,et al.  Centrality-based caching for privacy in Information-Centric Networks , 2016, MILCOM 2016 - 2016 IEEE Military Communications Conference.

[11]  Sunyoung Han,et al.  Detecting router cache snooping in Named Data Networking , 2012, 2012 International Conference on ICT Convergence (ICTC).

[12]  Mauro Conti,et al.  Privacy-Aware Caching in Information-Centric Networking , 2019, IEEE Transactions on Dependable and Secure Computing.

[13]  Mauro Conti,et al.  Cache Privacy in Named-Data Networking , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[14]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM 2007.

[15]  Mohit P. Tahiliani,et al.  GCPiN: Group caching for privacy in named data networking , 2017, 2017 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS).

[16]  Pablo Rodriguez,et al.  Privacy Implications of Ubiquitous Caching in Named Data Networking Architectures , 2012 .

[17]  Yang Su,et al.  Protecting router cache privacy in named data networking , 2015, 2015 IEEE/CIC International Conference on Communications in China (ICCC).

[18]  Philippe Robert,et al.  A versatile and accurate approximation for LRU cache performance , 2012, 2012 24th International Teletraffic Congress (ITC 24).

[19]  Bengt Ahlgren,et al.  A survey of information-centric networking , 2012, IEEE Communications Magazine.

[20]  Deborah Estrin,et al.  Named Data Networking (NDN) Project , 2010 .