PReFilter: An efficient privacy-preserving Relay Filtering scheme for delay tolerant networks

Without direct path, information delivery in sparse delay tolerant networks (DTNs) typically relies on intermittent relays, making the transmission not only unreliable but also time consuming. To make the matter even worse, the source nodes may transmit some encrypted “junk” information, similar as the spam emails in current mail systems, to the destinations; without effective control, the delivery of encrypted junk information would significantly consume the precious resource of DTN and accordingly throttle the network efficiency. To address this challenging issue, we propose PReFilter, an efficient privacy-preserving relay filter scheme to prevent the relay of encrypted junk information early in DTNs. In PReFilter, each node maintains a specific filtering policy based on its interests, and distributes this policy to a group of “friends” in the network in advance. By applying the filtering policy, the friends can filter the junk packets which are heading to the node during the relay. Note that the keywords in the filtering policy may disclose the node's interest/preference to some extent, harming the privacy of nodes, a privacy-preserving filtering policy distribution technique is introduced, which will keep the sensitive keywords secret in the filtering policy. Through detailed security analysis, we demonstrate that PReFilter can prevent strong privacy-curious adversaries from learning the filtering keywords, and discourage a weak privacy-curious friend to guess the filtering keywords from the filtering policy. In addition, with extensive simulations, we show that PReFilter is not only effective in the filtering of junk packets but also significantly improve the network performance with the dramatically reduced delivery cost due to the junk packets.

[1]  Yin Zhang,et al.  Incentive-aware routing in DTNs , 2008, 2008 IEEE International Conference on Network Protocols.

[2]  Rafael M. Gasca,et al.  Efficient packet filtering in wireless ad hoc networks , 2008, IEEE Communications Magazine.

[3]  Alex X. Liu,et al.  Collaborative firewalling in wireless networks , 2011, 2011 Proceedings IEEE INFOCOM.

[4]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[5]  Xiaodong Lin,et al.  Pi: A practical incentive protocol for delay tolerant networks , 2010, IEEE Transactions on Wireless Communications.

[6]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[7]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[8]  Xiaodong Lin,et al.  An Opportunistic Batch Bundle Authentication Scheme for Energy Constrained DTNs , 2010, 2010 Proceedings IEEE INFOCOM.

[9]  Yuguang Fang,et al.  MASK: anonymous on-demand routing in mobile ad hoc networks , 2006, IEEE Transactions on Wireless Communications.

[10]  Xiaodong Lin,et al.  SPRING: A Social-based Privacy-preserving Packet Forwarding Protocol for Vehicular Delay Tolerant Networks , 2009, 2010 Proceedings IEEE INFOCOM.

[11]  Reihaneh Safavi-Naini,et al.  An Efficient Signature Scheme from Bilinear Pairings and Its Applications , 2004, Public Key Cryptography.

[12]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[13]  Angelos D. Keromytis,et al.  Deny-by-Default Distributed Security Policy Enforcement in Mobile Ad Hoc Networks , 2009, SecureComm.

[14]  Kang-Won Lee,et al.  RelayCast: Scalable multicast routing in Delay Tolerant Networks , 2008, 2008 IEEE International Conference on Network Protocols.

[15]  Rafael M. Gasca,et al.  Mesh Network Firewalling with Bloom Filters , 2007, 2007 IEEE International Conference on Communications.

[16]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.