Privacy-Preserving Profile Matching for Proximity-Based Mobile Social Networking

Proximity-based mobile social networking (PMSN) refers to the social interaction among physically proximate mobile users. The first step toward effective PMSN is for mobile users to choose whom to interact with. Profile matching refers to two users comparing their personal profiles and is promising for user selection in PMSN. It, however, conflicts with users' growing privacy concerns about disclosing their personal profiles to complete strangers. This paper tackles this open challenge by designing novel fine-grained private matching protocols. Our protocols enable two users to perform profile matching without disclosing any information about their profiles beyond the comparison result. In contrast to existing coarse-grained private matching schemes for PMSN, our protocols allow finer differentiation between PMSN users and can support a wide range of matching metrics at different privacy levels. The performance of our protocols is thoroughly analyzed and evaluated via real smartphone experiments.

[1]  Virgil D. Gligor,et al.  A New Privacy-Enhanced Matchmaking Protocol , 2013, NDSS.

[2]  L. B. Milstein,et al.  Theory of Spread-Spectrum Communications - A Tutorial , 1982, IEEE Transactions on Communications.

[3]  Xiaohui Liang,et al.  Secure handshake with symptoms-matching: the essential to the success of mhealthcare social network , 2010, BODYNETS.

[4]  Wayne Gramlich,et al.  Cryptographic Protocol for Trustable Match Making , 1985, 1985 IEEE Symposium on Security and Privacy.

[5]  Jaap-Henk Hoepman,et al.  Private Handshakes , 2007, ESAS.

[6]  Refik Molva,et al.  A Provably Secure Secret Handshake with Dynamic Controlled Matching , 2009, SEC.

[7]  Yongdae Kim,et al.  Efficient Cryptographic Primitives for Private Data Mining , 2010, 2010 43rd Hawaii International Conference on System Sciences.

[8]  Dina Katabi,et al.  Secure In-Band Wireless Pairing , 2011, USENIX Security Symposium.

[9]  Ming Li,et al.  FindU: Privacy-preserving personal profile matching in mobile social networks , 2011, 2011 Proceedings IEEE INFOCOM.

[10]  Bart Goethals,et al.  On Private Scalar Product Computation for Privacy-Preserving Data Mining , 2004, ICISC.

[11]  Mikhail J. Atallah,et al.  A secure protocol for computing dot-products in clustered and distributed environments , 2002, Proceedings International Conference on Parallel Processing.

[12]  Anthony Vetro,et al.  Privacy-preserving approximation of L1 distance for multimedia applications , 2010, 2010 IEEE International Conference on Multimedia and Expo.

[13]  Lei Yang,et al.  Accurate online power estimation and automatic battery behavior based power model generation for smartphones , 2010, 2010 IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS).

[14]  Aggelos Kiayias,et al.  Privacy-Preserving Information Markets for Computing Statistical Data , 2009, Financial Cryptography.

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

[16]  José M. Molina López,et al.  Secure Matchmaking of Fuzzy Criteria between Agents , 2003, KES.

[17]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[18]  Guanhua Yan,et al.  Fine-grained private matching for proximity-based mobile social networking , 2012, 2012 Proceedings IEEE INFOCOM.

[19]  Catherine A. Meadows,et al.  A More Efficient Cryptographic Matchmaking Protocol for Use in the Absence of a Continuously Available Third Party , 1986, 1986 IEEE Symposium on Security and Privacy.

[20]  Peng Ning,et al.  Mitigating DoS attacks against broadcast authentication in wireless sensor networks , 2008, TOSN.

[21]  Marina Blanton,et al.  Secret Handshakes with Dynamic and Fuzzy Matching , 2007, NDSS.

[22]  Wenliang Du,et al.  Privacy-preserving cooperative statistical analysis , 2001, Seventeenth Annual Computer Security Applications Conference.

[23]  Emiliano De Cristofaro,et al.  Practical Private Set Intersection Protocols with Linear Complexity , 2010, Financial Cryptography.

[24]  Dawn Xiaodong Song,et al.  Privacy-Preserving Set Operations , 2005, CRYPTO.

[25]  Dong Xuan,et al.  E-SmallTalker: A Distributed Mobile System for Social Networking in Physical Proximity , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

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

[27]  Roger Wattenhofer,et al.  VENETA: Serverless Friend-of-Friend Detection in Mobile Social Networking , 2008, 2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[28]  Ari Juels,et al.  Client puzzles: A cryptographic defense against connection depletion , 1999 .

[29]  Wenliang Du,et al.  Protocols for Secure Remote Database Access with Approximate Matching , 2001, E-Commerce Security and Privacy.

[30]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[31]  Wenliang Du,et al.  Privacy-preserving collaborative filtering using randomized perturbation techniques , 2003, Third IEEE International Conference on Data Mining.

[32]  Yin Zhang,et al.  Secure friend discovery in mobile social networks , 2011, 2011 Proceedings IEEE INFOCOM.

[33]  Rui Zhang,et al.  JR-SND: Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks , 2011, 2011 31st International Conference on Distributed Computing Systems.

[34]  Huaxiong Wang,et al.  Distributed Private Matching and Set Operations , 2008, ISPEC.