Profile Matching Scheme in Mobile Social Networks using iCPM Protocol
Main Article Content
Abstract
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 used.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
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. Osmania University , Hyderabad. His Research areas are Computer Networks, Mobile Computing