FindU: Privacy-preserving personal profile matching in mobile social networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 2435-2443

  Li, Ming ^a   Cao, Ning ^a   Yu, Shucheng ^b   Lou, Wenjing ^a  

^a WORCESTER POLYTECHNIC INSTITUTE   (United States)

^b UNIVERSITY OF ARKANSAS AT LITTLE ROCK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST MATCH; EXISTING SYSTEMS; MATCHING SCHEME; MINIMAL INFORMATION; MOBILE SOCIAL NETWORKS; PERFORMANCE EVALUATION; PERSONAL PREFERENCES; PERSONAL PROFILE; PHYSICAL PROXIMITY; PRIVACY PRESERVING; SECURE MULTI-PARTY COMPUTATION; SECURITY ANALYSIS; SENSITIVE INFORMATIONS; STATE-OF-THE-ART SCHEME; USER PRIVACY;

SOCIAL NETWORKING (ONLINE);

WIRELESS NETWORKS;

EID: 79960878565     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935065     Document Type: Conference Paper

References (35)

1. "Magnetu." [Online]. Available: http://magnetu.com
2. J. Manweiler, R. Scudellari, and L. P. Cox, "Smile: encounter-based trust for mobile social services," in ACM CCS '09, 2009, pp. 246-255.
3. "Familiar strangers." [Online]. Available: http://www.paulos. net/research/intel/familiarstranger/index.htm
4. Z. Yang, B. Zhang, J. Dai, A. Champion, D. Xuan, and D. Li, "E-smalltalker: A distributed mobile system for social networking in physical proximity," in IEEE ICDCS '10, June. 2010.
5. R. Lu, X. Lin, X. Liang, and X. Shen, "A secure handshake scheme with symptoms-matching for mhealthcare social network," Mobile Networks and Applications, pp. 1-12, 2010.
6. M. Li, S. Yu, W. Lou, and K. Ren, "Group device pairing based secure sensor association and key management for body area networks," in IEEE INFOCOM '10, Mar. 14-19 2010, pp. 1-9.
7. M. Freedman, K. Nissim, and B. Pinkas, "Efficient private matching and set intersection," in EUROCRYPT'04. Springer-Verlag, 2004, pp. 1-19.
8. A. C. Yao, "Protocols for secure computations," in SFCS '82, 1982, pp. 160-164.
9. Q. Ye, H. Wang, and J. Pieprzyk, "Distributed private matching and set operations," in ISPEC'08, 2008, pp. 347-360.
10. E. D. Cristofaro and G. Tsudik, "Practical private set intersection protocols with linear complexity," in Financial Cryptography and Data Security '10, 2010.
11. L. Kissner and D. Song, "Privacy-preserving set operations," in CRYPTO '05, LNCS. Springer, 2005, pp. 241-257.
12. Y. Qi and M. J. Atallah, "Efficient privacy-preserving k-nearest neighbor search," in IEEE ICDCS '08, 2008, pp. 311-319.
13. M. Shaneck, Y. Kim, and V. Kumar, "Privacy preserving nearest neighbor search," in Machine Learning in Cyber Trust, 2009, pp. 247-276.
14. U. Manber, "Finding similar files in a large file system," in USENIX WINTER 1994 TECHNICAL CONFERENCE, 1994, pp. 1-10.
15. Y. Sang, H. Shen, and N. Xiong, "Efficient protocols for privacy preserving matching against distributed datasets," in ICICS '06. Springer - Verlag, 2006, pp. 210-227.
16. D. Dachman-Soled, T. Malkin, M. Raykova, and M. Yung, "Efficient robust private set intersection," in ACNS '09, 2009, pp. 125-142.
17. R. Li and C. Wu, "An unconditionally secure protocol for multi-party set intersection," in ACNS '07, 2007, pp. 226-236.
18. G. S. Narayanan, T. Aishwarya, A. Agrawal, A. Patra, A. Choudhary, and C. P. Rangan, "Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security," in CANS '09. Springer - Verlag, Dec. 2009, pp. 21-40.
19. M. Shaneck and Y. Kim, "Efficient cryptographic primitives for private data mining," in HICSS '10, 2010, pp. 1-9.
20. C. Hazay and Y. Lindell, "Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries," in TCC'08, 2008, pp. 155-175.
21. S. Jarecki and X. Liu, "Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection," in TCC '09. Berlin, Heidelberg: Springer-Verlag, 2009, pp. 577-594.
22. R. Agrawal, A. Evfimievski, and R. Srikant, "Information sharing across private databases," in SIGMOD '03. New York, NY, USA: ACM, 2003, pp. 86-97.
23. J. Vaidya and C. Clifton, "Secure set intersection cardinality with application to association rule mining," J. Comput. Secur., vol. 13, no. 4, pp. 593-622, 2005.
24. M. von Arb, M. Bader, M. Kuhn, and R. Wattenhofer, "Veneta: Serverless friend-of-friend detection in mobile social networking," in IEEE WIMOB '08, Oct. 2008, pp. 184 -189.
25. Y. Li, J. Tygar, and J. Hellerstein, "Private matching," in Computer Security in the 21st Century, 2005, pp. 25-50.
26. F. Emekci, D. Agrawal, A. E. Abbadi, and A. Gulbeden, "Privacy preserving query processing using third parties," in ICDE '06, 2006, p. 27.
27. S. S. M. Chow, J.-H. Lee, and L. Subramanian, "Two-party computation model for privacy-preserving queries over distributed databases," in NDSS, 2009.
28. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11, pp. 612-613, 1979.
29. J. C. Benaloh, "Secret sharing homomorphisms: Keeping shares of a secret secret (extended abstract)," in CRYPTO '86, 1987, pp. 251-260.
30. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," in ACM STOC '88, 1988, pp. 1-10.
31. R. Gennaro, M. O. Rabin, and T. Rabin, "Simplified vss and fast-track multiparty computations with applications to threshold cryptography," in ACM PODC '98, 1998, pp. 101-111.
32. M. Li, N. Cao, S. Yu, and W. Lou, "Findu: Privacy-preserving personal profile matching in mobile social networks." [Online]. Available: http://ece.wpi.edu/~mingli/findu.pdf
33. T. Nishide and K. Ohta, "Multiparty computation for interval, equality, and comparison without bit-decomposition protocol," in PKC'07, pp. 343-360.
34. E. Kiltz, "Unconditionally secure constant round multi-party computation for equality, comparison, bits and exponentiation," in TCC '05. Springer, 2005.
35. "Ns2," http://www.isi.edu/nsnam/ns.