Manuscript Number : CSEIT172625
Protected and Effective Profile Matching in Mobile Social Networks
Authors(2) :-Gurunadham R, Redapangu Saidulu
Recently, mobile social networks (MSNs) have been widely discussed due to the rapid growth of smart mobile devices. This work focuses on mobile D2D social networks (MDSNs), where users in an MSN are physical neighbors. An important social application of MDSNs is common profile matching (CPM), which refers to the scenario where a group of smart phone users meet in a small region (such as a ball room) and these users are interested in identifying the common attributes among them from their personal profiles efficiently via short-range (such as D2D) communications. For example, a group of strangers may want to find common hobbies, friends, or countries they visited before, and a group of students may want to know the common courses they have ever taken. Assuming that users in an MDSN form a fully connected network, we formulate three versions, namely all-common, _-common, and top--popular, of the CPM problem. The first problem is an extension of an earlier work, while the latter two problems are newly defined. We present solutions based on the basic and the iterative Bloom filters. Evaluation results show that our mechanisms are quite communication-efficient.
Assistant Professor, Department of Computer Science and Engineering, CVSR College of Engineering, Venkatapur, Telangana, India
M.Tech Scholar, Department of Computer Science and Engineering, CVSR College of Engineering, Venkatapur, Telangana, India
CPM, MSN, Iterative Bloom Filters
- M. Li, N. Cao, S. Yu, and W. Lou, "FindU: Private-Preserving Personal Profile Matching in Mobile Social Networks," in Proc. IEEEINFOCOM, 2011, pp. 2435 - 2443.
- M. J. Freedman, K. Nissim, and B. Pinkas, "Efficient Private Matching and Set Intersection," in Proc. EUROCRYPT Spring-Verlag, 2004, pp. 1-19.
- R. L. Rivest, A. Shamir, and Y. Tauman, "How to Leak a Secret," in Proc. ASIACRYPT. Springer-Verlag, 2001, pp. 552-565.
- D. Boneh, C. Gentry, B. Lynn, and H. Shacham, "Aggregate and Verifiably Encrypted Signatures from Bilinear Maps," in Proc.EUROCRYPT. Springer-Verlag, 2003, pp. 416-432.
- A. Sorniotti and R. Molva, "Secret Interest Groups (SIGs) in Social Networks with an Implementation on Facebook," in Proc. ACMSAC, 2010, pp. 621-628.
- R. Agrawal, A. Evfimievski, and R. Srikant, "Information Sharing Across Private Databases," in Proc. ACM SIGMOD, 2003, pp. 86-97.
- C. Hazay and Y. Lindell, "Efficient Protocols for Set Intersection and Pattern Matching with Security against Malicious and Covert Adversaries," in Proc. TCC Springer-Verlag, 2008, pp. 155-175.
- P. Paillier, "Public-Key Cryptosystems Based on Composite Degree Residuosity Classes," in Proc. EUROCRYPT. Springer-Verlag, 1999, pp.223-238.
- C. Wang, Q. Wang, K. Ren, and W. Lou, "Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing," in Proc.IEEE INFOCOM, 2010, pp. 525-533
- R. Li and C. Wu, "An Unconditionally Secure Protocol for Multi-Party Set Intersection," in Proc. ACNS. Springer-Verlag, 2007, pp. 226-236.
- D. Dachman-Soled, T. Malkin, M. Raykova, and M. Yung, "Efficient Robust Private Set Intersection," in Proc. International Conferenceon Applied Cryptography and Network Security.Springer-Verlag, 2009, pp. 125-142.
- E. D. Cristofaro and G. Tsudik, "Practical Private Set Intersection Protocols with Linear Complexity," in Proc. FC, 2010, pp. 143-159.
- L. Kissner and D. Song, "Privacy-Preserving Set Operations," in Proc.CRYPT. Springer-Verlag, 2005, pp. 241-257.
Published in : Volume 2 | Issue 6 | November-December 2017
Date of Publication : 2017-12-31
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 32-36
Manuscript Number : CSEIT172625
Publisher : Technoscience Academy
URL : http://ijsrcseit.com/CSEIT172625