Fully anonymous profile matching in mobile social networks

IEEE Journal on Selected Areas in Communications

Volumn 31, Issue 9, 2013, Pages 641-655

  Liang, Xiaohui ^a   Li, Xu ^b   Zhang, Kuan ^a   Lu, Rongxing ^c   Lin, Xiaodong ^d   Shen, Xuemin Sherman ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b INRIA   (France)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^d UNIVERSITY OF ONTARIO INSTITUTE OF TECHNOLOGY   (Canada)

Author keywords

homomorphic encryption; Mobile social network; oblivious transfer; privacy preservation; profile matching

Indexed keywords

HO-MOMORPHIC ENCRYPTIONS; MOBILE SOCIAL NETWORKS; OBLIVIOUS TRANSFER; PRIVACY PRESERVATION; PROFILE MATCHING;

COMMUNICATION;

SOCIAL NETWORKING (ONLINE);

EID: 84883345595     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2013.SUP.0513056     Document Type: Article

References (50)

1. "Comscore," http://www.comscoredatamine.com/.
2. A. G. Miklas, K. K. Gollu, K. K. W. Chan, S. Saroiu, P. K. Gummadi, and E. de Lara, "Exploiting social interactions in mobile systems," in Ubicomp, 2007, pp. 409-428.
3. S. Ioannidis, A. Chaintreau, and L. Massoulié, "Optimal and scalable distribution of content updates over a mobile social network," in Proc. IEEE INFOCOM, 2009, pp. 1422-1430.
4. R. Lu, X. Lin, and X. Shen, "Spring: A social-based privacy-preserving packet forwarding protocol for vehicular delay tolerant networks," in Proc. IEEE INFOCOM, 2010, pp. 632-640.
5. W. He, Y. Huang, K. Nahrstedt, and B. Wu, "Message propagation in adhoc-based proximity mobile social networks," in PERCOM workshops, 2010, pp. 141-146.
6. D. Niyato, P.Wang, W. Saad, and A. Hjørungnes, "Controlled coalitional games for cooperative mobile social networks," IEEE Trans. Veh. Technol., vol. 60, no. 4, pp. 1812-1824, 2011.
7. M. Motani, V. Srinivasan, and P. Nuggehalli, "Peoplenet: engineering a wireless virtual social network," in MobiCom, 2005, pp. 243-257.
8. M. Brereton, P. Roe, M. Foth, J. M. Bunker, and L. Buys, "Designing participation in agile ridesharing with mobile social software," in OZCHI, 2009, pp. 257-260.
9. E.Bulut and B.Szymanski, "Exploiting friendship relations for efficient routing in delay tolerant mobile social networks," IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 12, pp. 2254-2265, 2012.
10. Z. Yang, B. Zhang, J. Dai, A. C. Champion, D. Xuan, and D. Li, "E-smalltalker: A distributed mobile system for social networking in physical proximity," in ICDCS, 2010, pp. 468-477.
11. Q. Li, S. Zhu, and G. Cao, "Routing in socially selfish delay tolerant networks," in Proc. IEEE INFOCOM, 2010, pp. 857-865.
12. X. Liang, X. Li, T. H. Luan, R. Lu, X. Lin, and X. Shen, "Moralitydriven data forwarding with privacy preservation in mobile social networks," IEEE Trans. Veh. Technol., vol. 7, no. 61, pp. 3209-3222, 2012.
13. R. Gross, A. Acquisti, and H. J. H. III, "Information revelation and privacy in online social networks," in WPES, 2005, pp. 71-80.
14. F. Stutzman, "An evaluation of identity-sharing behavior in social network communities." iDMAa Journal, vol. 3, no. 1, pp. 10-18, 2006.
15. K. P. N. Puttaswamy, A. Sala, and B. Y. Zhao, "Starclique: guaranteeing user privacy in social networks against intersection attacks," in CoNEXT, 2009, pp. 157-168.
16. E. Zheleva and L. Getoor, "To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles," in WWW, 2009, pp. 531-540.
17. G. Chen and F. Rahman, "Analyzing privacy designs of mobile social networking applications," IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, vol. 2, pp. 83-88, 2008.
18. D. Balfanz, G. Durfee, N. Shankar, D. K. Smetters, J. Staddon, and H.-C. Wong, "Secret handshakes from pairing-based key agreements," in IEEE Symposium on Security and Privacy, 2003, pp. 180-196.
19. M. J. Freedman, K. Nissim, and B. Pinkas, "Efficient private matching and set intersection," in EUROCRYPT, 2004, pp. 1-19.
20. R. Lu, X. Lin, X. Liang, and X. Shen, "A secure handshake scheme with symptoms-matching for mhealthcare social network," ACM Mobile Networks and Applications (MONET), vol. 16, no. 6, pp. 683-694, 2011.
21. M. Li, N. Cao, S. Yu, and W. Lou, "Findu: Privacy-preserving personal profile matching in mobile social networks," in Proc. IEEE INFOCOM, 2011, pp. 2435-2443.
22. R. Zhang, Y. Zhang, J. Sun, and G. Yan, "Fine-grained private matching for proximity-based mobile social networking," in Proc. IEEE INFOCOM, 2012, pp. 1969-1977.
23. W. Dong, V. Dave, L. Qiu, and Y. Zhang, "Secure friend discovery in mobile social networks," in Proc. IEEE INFOCOM, 2011, pp. 1647-1655.
24. J. Freudiger, M. H. Manshaei, J.-P. Hubaux, and D. C. Parkes, "On noncooperative location privacy: a game-theoretic analysis," in ACM CCS, 2009, pp. 324-337.
25. R. Lu, X. Lin, H. Luan, X. Liang, and X. Shen, "Pseudonym changing at social spots: An effective strategy for location privacy in vanets," IEEE Trans. Veh. Technol., vol. 61, no. 1, pp. 86 -96, 2011.
26. J. Katz, A. Sahai, and B. Waters, "Predicate encryption supporting disjunctions, polynomial equations, and inner products," in EUROCRYPT, 2008, pp. 146-162.
27. N. Eagle and A. Pentland, "Social serendipity: mobilizing social software," IEEE Pervasive Computing, vol. 4, no. 2, pp. 28-34, 2005.
28. J. Teng, B. Zhang, X. Li, X. Bai, and D. Xuan, "E-shadow: Lubricating social interaction using mobile phones," in ICDCS, 2011, pp. 909-918.
29. B. Han and A. Srinivasan, "Your friends have more friends than you do: identifying influential mobile users through random walks," in MobiHoc, 2012, pp. 5-14.
30. Z. Yang, B. Zhang, J. Dai, A. C. Champion, D. Xuan, and D. Li, "E-smalltalker: A distributed mobile system for social networking in physical proximity," in ICDCS, 2010, pp. 468-477.
31. L. Kissner and D. X. Song, "Privacy-preserving set operations," in CRYPTO, 2005, pp. 241-257.
32. Q. Ye, H. Wang, and J. Pieprzyk, "Distributed private matching and set operations," in ISPEC, 2008, pp. 347-360.
33. D. Dachman-Soled, T. Malkin, M. Raykova, and M. Yung, "Efficient robust private set intersection," in ACNS, 2009, pp. 125-142.
34. S. Jarecki and X. Liu, "Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection," in TCC, 2009, pp. 577-594.
35. C. Hazay and Y. Lindell, "Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries," J. Cryptology, vol. 23, no. 3, pp. 422-456, 2010.
36. B. Goethals, S. Laur, H. Lipmaa, and T. Mielikainen, "On private scalar product computation for privacy-preserving data mining," in ICISC, 2004, pp. 104-120.
37. A. C.-C. Yao, "Protocols for secure computations (extended abstract)," in FOCS, 1982, pp. 160-164.
38. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game or a completeness theorem for protocols with honest majority," in STOC, 1987, pp. 218-229.
39. I. Ioannidis, A. Grama, and M. J. Atallah, "A secure protocol for computing dot-products in clustered and distributed environments," in ICPP, 2002, pp. 379-384.
40. I. F. Blake and V. Kolesnikov, "Strong conditional oblivious transfer and computing on intervals," in ASIACRYPT, 2004, pp. 515-529.
41. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in EUROCRYPT, 1999, pp. 223-238.
42. M. Naehrig, K. Lauter, and V. Vaikuntanathan, "Can homomorphic encryption be practical?" in CCSW, 2011, pp. 113-124.
43. R. Lu, X. Liang, X. Li, X. Lin, and X. Shen, "Eppa: An efficient and privacy-preserving aggregation scheme for secure smart grid communications," IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 9, pp. 1621-1631, 2012.
44. H. Ltkepohl, New introduction to multiple time series analysis. Springer, 2005.
45. X. Liang, X. Li, Q. Shen, R. Lu, X. Lin, X. Shen, and W. Zhuang, "Exploiting prediction to enable secure and reliable routing in wireless body area networks," in Proc. IEEE INFOCOM, 2012, pp. 388-396.
46. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11, pp. 612-613, 1979.
47. L. Sweeney, "k-anonymity: A model for protecting privacy," International J. Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570, 2002.
48. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau, "CRAWDAD trace cambridge/haggle/imote/infocom (v. 2006-01-31)," Jan. 2006.
49. D. J. Watts, "Small worlds: The dynamics of networks between order and randomness," J. Artificial Societies and Social Simulation, vol. 6, no. 2, 2003.
50. C. Bron and J. Kerbosch, "Finding all cliques of an undirected graph (algorithm 457)," Commun. ACM, vol. 16, no. 9, pp. 575-576, 1973. of Canada