Major Domus Redux: Privacy in Mobile Social P2P Networks

Social networks have seen an unprecedented surge of interest in the past few years. Traditionally, they are restricted to central server farms which collect huge amounts of private information from their users. This fails to address two key issues which we expect to shape future social networks: (1) including mobility and location awareness and (2) privacy concerns of the users. Our paper addresses the locality challenge by providing a distributed wireless peer-to-peer infrastructure, which enables discovering of user profiles of nearby users and their friends. More importantly, using easy-to-understand mechanisms that preserve your privacy and render the storage of plain data unnecessary, our system facilitates meeting new friends and recognising old friends in a crowd. Unlike prior approaches in social networking, we focus on utilising mobile devices that establish direct connections to each other, broadcasting camouflaged information that preserve user privacy without losing the ability of similarity finding using a technology based on a graph representation of a user’s data-set and subsequently mapped on a Bloom filter. Furthermore, our approach can be generalised to utilise an inherent property of social networks, namely transitivity, that makes it even more common to get into contact with new, like-minded people.

[1]  David P. Woodruff,et al.  Private inference control , 2004, CCS '04.

[2]  Michael Mitzenmacher,et al.  Compressed bloom filters , 2001, PODC '01.

[3]  Rafail Ostrovsky,et al.  Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[4]  Haoyu Song,et al.  Fast packet classification using bloom filters , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.

[5]  Bernard Chazelle,et al.  The Bloomier filter: an efficient data structure for static support lookup tables , 2004, SODA '04.

[6]  Vitaly Shmatikov,et al.  How To Break Anonymity of the Netflix Prize Dataset , 2006, ArXiv.

[7]  Stefan Agamanolis,et al.  Toward wearable social networking with iBand , 2005, CHI Extended Abstracts.

[8]  Marcel Waldvogel,et al.  Bringing efficient advanced queries to distributed hash tables , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[9]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[10]  Marcel Waldvogel,et al.  Bloom Filters: One Size Fits All? , 2007, 32nd IEEE Conference on Local Computer Networks (LCN 2007).

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

[12]  Alfred C. Weaver,et al.  Social Networking , 2008, Computer.

[13]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[14]  Jie Wu,et al.  Theory and Network Applications of Dynamic Bloom Filters , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[15]  Marcel Waldvogel,et al.  Bloom Filters: One Size Fits All? , 2007 .

[16]  Sushil Jajodia,et al.  The inference problem: a survey , 2002, SKDD.

[17]  Scott Counts,et al.  Incorporating physical co-presence at events into digital social networking , 2005, CHI EA '05.

[18]  Haoyu Song,et al.  Fast hash table lookup using extended bloom filter: an aid to network processing , 2005, SIGCOMM '05.

[19]  Sozo Inoue,et al.  Supporting Colocated Interactions Using RFID and Social Network Displays , 2006, IEEE Pervasive Computing.

[20]  Rebecca Montanari,et al.  Context-Aware Middleware for Anytime, Anywhere Social Networks , 2007, IEEE Intelligent Systems.

[21]  Bill Cheswick,et al.  Privacy-Enhanced Searches Using Encrypted Bloom Filters , 2004, IACR Cryptol. ePrint Arch..