Asymmetric Social Proximity Based Private Matching Protocols for Online Social Networks
- 1. ASYMMETRIC SOCIALPROXIMITY BASED PRIVATE MATCHING PROTOCOLS FOR ONLINE SOCIAL NETWORKS
- 2. ABSTRACT: • The explosive growth of Online Social Networks (OSNs) over the past few years has redefined the way people interact with existing friends and especially make new friends. Some works propose to let people become friends if they have similar profile attributes. However, profile matching involves an inherent privacy risk of exposing private profile information to strangers in the cyberspace. The existing solutions to the problem attempt to protect users’ privacy by privately computing the intersection or intersection cardinality of the profile attribute sets of two users. These schemes have some limitations and can still reveal users’ privacy. In this paper, we leverage community structures to redefine the OSN model and propose a realistic asymmetric social proximity measure between two users. Then, based on the proposed asymmetric social proximity, we design three private matching protocols, which provide different privacy levels and can protect users’ privacy better than the previous works. We also analyze the computation and communication cost of these protocols. Finally, we validate our proposed asymmetric proximity measure using real social network data and conduct extensive simulations to evaluate the performance of the proposed protocols in terms of computation cost, communication cost, total running time, and energy consumption. The results show the efficacy of our proposed proximity measure and better performance of our protocols over the state-of- the-art protocols.
- 3. EXISTING SYSTEM: • In OSNs and Mobile Social Networks (MSNs), many distributed solutions to privately finding the social proximity between two users have been proposed. • The most common way of determining friendship between two people is through profile matching, i.e. finding out if they have common profile attributes, like interests, symptoms, or some other social coordinates. • In some cases, the number of common friends also serves as the proximity measure between two users. Such previous works employ various cryptographic tools to protect the privacy of the profile information of the users in the private matching process.
- 4. DISADVANTAGES OF EXISTING SYSTEM: • In an existing system malicious user can execute the protocol with any user and leave without letting him/her do the same. • The server knows all the users’ private information and becomes a single point of failure. Thus, if the server gets compromised, all users’ privacy is at risk.
- 5. PROPOSED SYSTEM: • In this paper, we leverage community structures to redefine the OSN model, and propose an asymmetric social proximity between two users. • In particular, we consider that each OSN user is affiliated with some communities (or groups), which the user weighs differently. We notice that the communities can actually tell a lot about their members. • There can be a wide variety of communities in an OSN like a university community, a department community, a fan community of an artist, movies, or sports, and a community of certain professions. Besides, we notice that in real life people also value their friendships differently. • Thus, we propose an asymmetric social proximity between two users, which is the cumulative weight of the common communities to one user considering both his/her and his/her friends’ perceptions. We also design three different private matching protocols based on the proposed asymmetric social proximity.
- 6. ADVANTAGES OFPROPOSED SYSTEM: • Through our proposed measure between two users in an OSN, which considers both each user’s and his/her friends’ perceptions on the common communities between the two users. • Our protocol L3P with the highest privacy level ensures that two users will not know any of their common communities before they become friends. • Our protocols protect users’ privacy better than the previous works based on symptoms, interests, and the number of common friends, with lower computation and communication cost.
- 8. MODULES: • Network Model • Asymmetric Distributed Social Proximity Measurement • Private Matching Protocols • Privacy Module
- 9. MODULES DESCRIPTION: • Network Model Consider an online social network (OSN) where users store their own and friends’ information on their devices. Such an OSN can be a decentralized OSN like that in, where no single server has information about all users, and two users can communicate via the Internet to establish a friendship. It can also be an MSN where two users’ in close proximity can utilize Bluetooth or Wi-Fi to communicate for private matching. In addition, the network considered herein also includes the scenarios in centralized OSNs like Facebook, Google+, where users may not always be connected to the servers and can use the information stored in their mobile devices to find friends without the servers’ involvement. Note that we consider social friendships bidirectional, mutual, and reciprocating. • Asymmetric Distributed Social Proximity Measurement In order to measure the social proximity between two users in an OSN without revealing their privacy, we utilize the users’ overall community sets instead of their private profiles. The intuition behind this is that two persons who both have a lot of close friends in the same several communities can probably be friends. In particular, we take the following parameters into account. First, as mentioned before, a user in an OSN divides his/her friends into different friend circles, which represent different friendship weights to the user.
- 10. • Private Matching Protocols In this module, we propose three novel and efficient social proximity based private matching protocols with different privacy levels. Before we delve into details, we first present some definitions below. An Initiator is an OSN user who initiates a protocol for calculating social proximity. In other words, an Initiator is an OSN user who asks another user (a Responder) for friendship. A Responder, upon the request from an Initiator, replies by following the protocol. Besides, when an Initiator asks a Responder for friendship, it should be the Responder who determines whether or not to accept the request by executing the protocol to find the social proximity. • Privacy Module The Initiator uses semantically secure homomorphic encryption to encrypt the coefficients of the polynomial. In the protocol, the Responder determines whether or not to accept the Initiator’s request for a social friendship only based on their common overall communities, which may not characterize the social proximity well. In the L2P protocol, the Responder determines whether or not to be friends with the Initiator based on the community based social proximity, while the Initiator still can only make his final decision based on their common communities
- 11. SYSTEM REQUIREMENTS: HARDWARE REQUIREMENTS: • System : Pentium IV 2.4 GHz. • Hard Disk : 40 GB. • Floppy Drive : 1.44 Mb. • Monitor : 15 VGA Colour. • Mouse : Logitech. • Ram : 512 Mb. SOFTWARE REQUIREMENTS: • • Operating system : Windows XP/7. • Coding Language : JAVA/J2EE • IDE : Netbeans 7.4 • Database : MYSQL
- 12. REFERENCE: Arun Thapa, Member, IEEE, Ming Li, Member, IEEE, Sergio Salinas, Student Member, IEEE, and Pan Li, Member, IEEE, “Asymmetric Social Proximity Based Private Matching Protocols for Online Social Networks”, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 26, NO. 6, JUNE 2015.