A lightweight privacy preserving SMS-based recommendation system for mobile users

In this paper we propose a fully decentralized approach for recommending new contacts in the social network of mobile phone users. With respect to existing solutions, our approach is characterized by some distinguishing features. In particular, the application we propose does not assume any centralized coordination: it transparently collects and processes user information that is accessible in any mobile phone, such as the log of calls, the list of contacts or the inbox/outbox of short messages and exchanges it with other users. This information is used to recommend new friendships to other users. Furthermore, the information needed to perform recommendation is collected and exchanged between users in a privacy preserving way. Finally, information necessary to implement the application is exchanged transparently and opportunistically, by using the residual space in standard short messages occasionally exchanged between users. As a consequence, we do not ask users to change their habits in using SMS.

[1]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[2]  Michael R. Lyu,et al.  MatchSim: a novel similarity measure based on maximum neighborhood matching , 2012, Knowledge and Information Systems.

[3]  Bradley N. Miller,et al.  PocketLens: Toward a personal recommender system , 2004, TOIS.

[4]  Chanathip Namprempre,et al.  The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme , 2003, Journal of Cryptology.

[5]  Alan M. Frieze,et al.  Min-wise independent permutations (extended abstract) , 1998, STOC '98.

[6]  Robin I. M. Dunbar.  Grooming, Gossip and the Evolution of Language , 1996 .

[7]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[8]  Stefan Katzenbeisser,et al.  Protection and Retrieval of Encrypted Multimedia Content: When Cryptography Meets Signal Processing , 2007, EURASIP J. Inf. Secur..

[9]  Chris Clifton,et al.  Efficient privacy-preserving similar document detection , 2010, The VLDB Journal.

[10]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[11]  Walter Willinger,et al.  On unbiased sampling for unstructured peer-to-peer networks , 2009, TNET.

[12]  Ahmad-Reza Sadeghi,et al.  Efficient Privacy-Preserving Face Recognition , 2009, ICISC.

[13]  David W. McDonald,et al.  Social matching: A framework and research agenda , 2005, TCHI.

[14]  Marina Blanton,et al.  Secure and Efficient Protocols for Iris and Fingerprint Identification , 2011, ESORICS.

[15]  Geoffrey Zweig,et al.  Syntactic Clustering of the Web , 1997, Comput. Networks.

[16]  Alan M. Frieze,et al.  Min-Wise Independent Linear Permutations , 2000, Electron. J. Comb..

[17]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[18]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[19]  Rasmus Pagh,et al.  Finding associations and computing similarity via biased pair sampling , 2009, Knowledge and Information Systems.

[20]  Songwu Lu,et al.  A study of the short message service of a nationwide cellular network , 2006, IMC '06.

[21]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[22]  Walter Willinger,et al.  Sampling Techniques for Large, Dynamic Graphs , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[23]  Padraig Cunningham,et al.  A Taxonomy of Similarity Mechanisms for Case-Based Reasoning , 2009, IEEE Transactions on Knowledge and Data Engineering.

[24]  Fan Chung Graham,et al.  Random evolution in massive graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[25]  Piotr Indyk,et al.  A small approximately min-wise independent family of hash functions , 1999, SODA '99.

[26]  Minas Gjoka,et al.  Practical Recommendations on Crawling Online Social Networks , 2011, IEEE Journal on Selected Areas in Communications.

[27]  Emiliano De Cristofaro,et al.  Fast and Private Computation of Set Intersection Cardinality , 2011, IACR Cryptol. ePrint Arch..

[28]  Vincenzo Piuri,et al.  Privacy-preserving fingercode authentication , 2010, MM&Sec '10.

[29]  Alan M. Frieze,et al.  Min-Wise Independent Permutations , 2000, J. Comput. Syst. Sci..