Paper Details

The explosive growth of on-line Social Networks (OSNs) over the past few years has redefined the approachfolks act with existing friends and particularly create new friends. Some works propose to let folks become friends if theyneed similar profile attributes. However, profile matching involves Associate inherent privacy risk of exposing nonpublic profile info to strangers within the computer network. the prevailing solutions to the matter commit to shieldusers’ privacy by in camera computing the intersection or intersection cardinality of the profile attribute sets of 2 users.These schemes have some limitations and may still reveal users’ privacy. during this paper, we have a tendency toleverage community structures to redefine the OSN model and propose a sensible uneven social proximity live between 2users. Then, supported the projected uneven social proximity, we have a tendency to style 3 non-public matchingprotocols, which give totally different privacy levels and may shield users’ privacy higher than the previous works. wehave a tendency to additionally analyze the computation and communication price of those protocols. Finally, we have atendency to validate our projected uneven proximity live victimisation real social network information and conduct indepth simulations to guage the performance of the projected protocols in terms of computation price, communicationprice, total time period, and energy consumption. The results show the effectualness of our projected proximity live andhigher performance of our protocols over the progressive protocols.

Vishakha Ashok Salunkhe, Prof. D. O. Shamkuwar, “Asymmetric Social Proximity Based Private Matching Protocols for Online Social Networks”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 1, pp. 378-382, January 2017.