Privacy-enhanced social-network routing

An opportunistic network of mobile nodes can be created when mobile devices work together to create an ad hoc store-and-forward architecture, with messages forwarded via intermediary encountered nodes. Social-network routing has been proposed to route messages in such networks: messages are sent via nodes in the sender's or recipient's friends list. Simple social-network routing, however, may broadcast these friends lists, which introduces privacy concerns. This paper studies mechanisms for enhancing privacy while using social-network routing. We first present a threat analysis of the privacy risks in social-network routing, and then introduce two complementary methods for enhancing privacy in social-network routing by obfuscating the friends lists used to inform routing decisions. We evaluate these methods using three real-world datasets, and find that it is possible to obfuscate the friends lists without leading to a significant decrease in routing performance, as measured by delivery cost, delay and ratio. We quantify the increase in security provided by this obfuscation, with reference to the classes of attack which are mitigated.

[1]  Saikat Guha,et al.  NOYB: privacy in online social networks , 2008, WOSN '08.

[2]  Alexandre Viejo,et al.  Using social networks to distort users' profiles generated by web search engines , 2010, Comput. Networks.

[3]  Wong Fei Mun Social Network Sites , 2014, Encyclopedia of Social Network Analysis and Mining.

[4]  Refik Molva,et al.  Privacy and confidentiality in context-based and epidemic forwarding , 2010, Comput. Commun..

[5]  S. Belle,et al.  Consistent deniable lying : privacy in mobile social networks , 2008 .

[6]  Philippe Oechslin,et al.  Making a Faster Cryptanalytic Time-Memory Trade-Off , 2003, CRYPTO.

[7]  Mostafa H. Ammar,et al.  PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Marco Conti,et al.  Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution , 2008, Pervasive Mob. Comput..

[9]  Christopher Krügel,et al.  A Practical Attack to De-anonymize Social Network Users , 2010, 2010 IEEE Symposium on Security and Privacy.

[10]  Roy Friedman,et al.  Locating cache proxies in manets , 2004, MobiHoc '04.

[11]  Wg.Cdr. Pongphet Congpuong How to lie With Statistics , 2013 .

[12]  Nathan Eagle,et al.  CRAWDAD dataset mit/reality (v.2005-07-01) , 2005 .

[13]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[14]  Klaus Wehrle,et al.  SimBetAge: utilizing temporal changes in social networks for pocket switched networks , 2009, U-NET '09.

[15]  Danah Boyd,et al.  Social network sites: definition, history, and scholarship , 2007, IEEE Engineering Management Review.

[16]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[17]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

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

[19]  David Lazer,et al.  Inferring friendship network structure by using mobile phone data , 2009, Proceedings of the National Academy of Sciences.

[20]  George Varghese,et al.  Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications , 2001, SIGCOMM 2001.

[21]  Ian R. Kerr,et al.  Lessons from the Identity Trail: Anonymity, Privacy and Identity in a Networked Society , 2009 .

[22]  Vitaly Shmatikov,et al.  De-anonymizing Social Networks , 2009, 2009 30th IEEE Symposium on Security and Privacy.

[23]  Jörg Ott,et al.  Working day movement model , 2008, MobilityModels '08.

[24]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

[25]  Paul Jones,et al.  Secrets and Lies: Digital Security in a Networked World , 2002 .

[26]  Claude Castelluccia,et al.  Packet Coding for Strong Anonymity in Ad Hoc Networks , 2006, 2006 Securecomm and Workshops.

[27]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[28]  Niki Pissinou,et al.  Mobile and Wireless Network Security and Privacy , 2007 .

[29]  Refik Molva,et al.  Privacy in Content-Based Opportunistic Networks , 2009, 2009 International Conference on Advanced Information Networking and Applications Workshops.

[30]  Iain Parris,et al.  Privacy-enhanced social network routing in opportunistic networks , 2010, 2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).

[31]  Saleem N. Bhatti,et al.  Exploiting Self-Reported Social Networks for Routing in Ubiquitous Computing Environments , 2008, 2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

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

[33]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[34]  Wei Tsang Ooi,et al.  CRAWDAD dataset nus/contact (v.2006-08-01) , 2006 .

[35]  Matthew K. Wright,et al.  PEON: privacy-enhanced opportunistic networks with applications in assistive environments , 2009, PETRA '09.

[36]  Pan Hui,et al.  Promoting tolerance for delay tolerant network research , 2008, CCRV.

[37]  Paul F. Syverson,et al.  Onion routing , 1999, CACM.

[38]  Licia Capra,et al.  Habit: Leveraging human mobility and social network for efficient content dissemination in Delay Tolerant Networks , 2009, 2009 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops.

[39]  Leszek Lilien,et al.  The Concept of Opportunistic Networks and their Research Challenges in Privacy and Security , 2007 .

[40]  Wei Tsang Ooi,et al.  Analysis and implications of student contact patterns derived from campus schedules , 2006, MobiCom '06.

[41]  László Dóra,et al.  Hide-and-Lie: enhancing application-level privacy in opportunistic networks , 2010, MobiOpp '10.

[42]  Jie Wu,et al.  Routing in a cyclic mobispace , 2008, MobiHoc '08.