Profile Matching Scheme in Mobile Social Networks using iCPM Protocol
R.SEETHARAM , , , ,
Affiliations Lecturer in Computer Science Department
When the expanding utilization of cell phones in mobile social networks (MSNs) are turning into an interwoven
part of individuals' lives there are numerous security protecting profile matching principle. In the event that we consider the
client profile distinctive clients will have diverse occurrences of profiles so we will group the profile of clients into their nonanonymity, contingent secrecy, and full obscurity. The primary point is to focus the general likeness of two profiles as
opposed to their connection in specific qualities. It checks whether the difference measure of the two profiles is large,
equivalent or littler than predefined edge esteem. We can actualize the above matching plan. In existing structure the whole
clients straight forwardly circulate their complete profiles for others to interest. In this paper a profile matching application is
actualized which helps the customer to find the people whose profile is best matched with different people. It proposes the
security convention which helps from profiling, builds the protection with the goal that less data about the client profile is
uncovered. To give security to the data some exceptional conventions like ICPM, IPPM, ECPM and ECPM+ are making
R.SEETHARAM ."Profile Matching Scheme in Mobile Social Networks using iCPM Protocol". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 01,pp.13-17, January - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I13.pdf,
Keywords : Profile matching, Privacy preservation, mobile social networks
 W. Dong, V. Dave, L. Qiu, and Y. Zhang, â€šSecure friend discovery in mobile social networks,â€› in Proceedings of IEEE INFOCOM, 2011.
 I. Ioannidis, A. Gama, and M. Atallah, â€šA secure protocol for computing dot-products in clustered and distributed environments,â€› in Proceedingsof IEEE ICPP, 2002.
 L. Zhang, X. Ding, Z. Wan, M. Gu, and X. Li, â€šWiface: A secure geosocial networking system using wifi-based multi-hop manet,â€› in ACMMobiSys MCS workshop, 2010.
 K. Okamoto, W. Chen, and X.-Y. Li, â€šRanking of closeness centrality for large-scale social networks,â€› in FAW, 2008.
 S.-J. Tang, J. Yuan, X. Mao, X.-Y. Li, W. Chen, and G. Dai, â€šRelationship classification in large scale online social networks and its impact on information,â€› in Proceedings of IEEE INFOCOM, 2011.
 L. Zhang, X.-Y. Li, J. Lei, J. Sun, Y. Liu, â€šMechanism design for finding experts using locally constructed social referral web,â€› in TPDS, 2013
 M. Von Arb, M. Bader, M. Kuhn, and R. Wattenhofer, â€šVeneta: Server less friend-of-friend detection in mobile social networking,â€› in Proceedings of IEEE WIMOB, 2008.
 Z. Yang, B. Zhang, J. Dai, A. C. Champion, D. Xuan, and D. Li, â€šE-small talker: A distributed mobile system for social networking in physical proximity,â€› in Proceedings of IEEE ICDCS, 2010.
 M. Li, N. Cao, S. Yu, and W. Lou, â€šFind u: Privacypreserving personal profile matching in mobile social networks,â€› in Proceedings of IEEEINFOCOM, 2011.
 R. Lu, X. Lin, H. Luan, X. Liang, and X. Shen, â€šPseudonym changing atsocial spots: An effective strategy for location privacy in vanets,â€› IEEE Transactions on Vehicular Technology, vol. 61, no. 1, pp. 86 â€“ 96, 2011.
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.