A Scalable and Privacy-Preserving Named Data Networking Architecture Based on Bloom Filters

Currently, there are numbers of different architectural proposals for future internet that focus on content-centric networking as the alternative of the existing location-based networking. These architectures give more emphasis on the security part of their paradigms and pay little attention or ignore on issues of privacy in their architectural designs. In this paper we propose the Scalable and Privacy Preserving Routing Protocol in Named Data Networking (SP-NDN) by utilizing the multiple Bloom filters in order to ameliorate user's interest packet flow privacy and security during the transit. In contrast to existing schemes, we present a content-dependent key tree based on multicast key management protocol to integrate Bloom filter and multicast encryption that mitigates the leakage of the original user's keywords and precluding unauthorized users (eavesdroppers) from guessing the key words. Our schemes guarantee the high security and privacy of user's interest packet during the transmission and at the same time trying to minimize the possible increase number of false positives likely to happen when a content is queried.

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

[2]  Bengt Ahlgren,et al.  Secure Naming for a Network of Information , 2010, 2010 INFOCOM IEEE Conference on Computer Communications Workshops.

[3]  Pekka Nikander,et al.  Self-Routing Denial-of-Service Resistant Capabilities Using In-packet Bloom Filters , 2009, 2009 European Conference on Computer Network Defense.

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

[5]  K. J. Ray Liu,et al.  A scalable multicast key management scheme for heterogeneous wireless networks , 2004, IEEE/ACM Transactions on Networking.

[6]  Eric J. Harder,et al.  Key Management for Multicast: Issues and Architectures , 1999, RFC.

[7]  Scott Shenker,et al.  On preserving privacy in content-oriented networks , 2011, ICN '11.

[8]  J. D. Thornton,et al.  Named Data Networking ( NDN ) Project NDN-0001 October 31 , 2010 , 2010 .

[9]  Jörg Ott,et al.  Forwarding anomalies in Bloom filter-based multicast , 2011, 2011 Proceedings IEEE INFOCOM.

[10]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[11]  Gene Tsudik,et al.  ANDaNA: Anonymous Named Data Networking Application , 2011, NDSS.

[12]  Ahmed Waliullah Kazi Prefetching Bloom filters to control flooding in content-centric networks , 2010, CoNEXT '10 Student Workshop.

[13]  Pekka Nikander,et al.  LIPSIN: line speed publish/subscribe inter-networking , 2009, SIGCOMM '09.

[14]  Adnan Hassan Ghani,et al.  Secure in-packet Bloom Filter forwarding on the NetFPGA , 2010 .

[15]  Mohamed G. Gouda,et al.  Secure group communications using key graphs , 1998, SIGCOMM '98.

[16]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.