Investigating the Privacy versus Forwarding Accuracy Tradeoff in Opportunistic Interest-Casting

INVESTIGATING THE PRIVACY VERSUS FORWARDING ACCURACY TRADEOFF IN OPPORTUNISTIC INTEREST-CASTING

ABSTRACT:

Many mobile social networking applications are based on a “friend proximity detection” step, according to which two mobile users try to jointly estimate whether they have friends in common, or share similar interests, etc. Performing “friend proximity detection” in a privacy-preserving way is fundamental to achieve widespread acceptance of mobile social networking applications. However, the need of privacy preservation is often at odds with application-level performance of the mobile social networking application, since only obfuscated information about the other user’s profile is available for optimizing performance. In this paper, we study for the first time the fundamental tradeoff between privacy preservation and application-level performance in mobile social networks. More specifically, we consider a mobile social networking application for opportunistic networks called interest-casting. In the interest-casting model, a user wants to deliver a piece of information to other users sharing similar interests (“friends”), possibly through multi-hop forwarding. In this paper, we propose a privacy-preserving friend proximity detection scheme based on a protocol for solving the Yao’s “Millionaire’s Problem”, and we introduce three interest-casting protocols achieving different tradeoffs between privacy and accuracy of the information forwarding process. The privacy versus accuracy tradeoff is analyzed both theoretically, and through simulations based on a real-world mobility trace. The results of our study demonstrate for the first time that privacy preservation is at odds with forwarding accuracy, and that the best tradeoff between these two conflicting goals should be identified based on the application-level requirements.

EXISTING SYSTEM:

WITH the increasing penetration rate of smart phones, tablets, etc., mobile social networks are being considered the natural evolution of online social networks. Mobile social networks display several advantages over online social networks, such as larger potential user base more than 5.6 billion mobile phone subscribers versus about 500 millions broadband Internet users, enabling location- aware social applications, possibility of ubiquitously running social networking applications without Internet access, and so on. Mobile social networking applications have been recently introduced in the market, as well as in the academic community. As mentioned above, mobile social networks enable novel, location-based services, such as friend’s proximity detection. In the context of mobile social networks, the term friend is used to refer to a person (potentially, a stranger) with whom a user might be interested in getting in touch with, where the notion of friendship used for detection depends on the specific application scenario.

DISADVANTAGES OF EXISTING SYSTEM:

v Malicious User can perform Serious attacks without prior Knowledge.

PROPOSED SYSTEM:

In this paper, we study for the first time the fundamental tradeoff between privacy preservation and application-level performance in mobile social networks. More specifically, we consider a mobile social networking application for opportunistic networks called interest-casting. In the interest-casting model, a user wants to deliver a piece of information to other users sharing similar interests (“friends”), possibly through multi-hop forwarding. In this paper, we propose a privacy-preserving friend proximity detection scheme based on a protocol for solving the Yao’s “Millionaire’s Problem”, and we introduce three interest-casting protocols achieving different tradeoffs between privacy and accuracy of the information forwarding process. The privacy versus accuracy tradeoff is analyzed both theoretically, and through simulations based on a real-world mobility trace. The results of our study demonstrate for the first time that privacy preservation is at odds with forwarding accuracy, and that the best tradeoff between these two conflicting goals should be identified based on the application level requirements.

ADVANTAGES OF PROPOSED SYSTEM:

v It resolves Risks during file exchanging.

v It blocks malicious users.

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

Processor             -       Pentium –IV

Speed                  -       1.1 Ghz

RAM                   -       512 MB(min)

Hard Disk            -       40 GB

Key Board           -       Standard Windows Keyboard

Mouse                 -       Two or Three Button Mouse

Monitor                       -       LCD/LED

SOFTWARE REQUIREMENTS:

Operating system        :       Windows XP.

Coding Language       :       JAVA

Data Base            :       SQL

Tool                    :       Netbeans

REFERENCE:

Gianpiero Costantino, Fabio Martinelli, and Paolo Santi,“Investigating the Privacy versus Forwarding Accuracy Tradeoff in Opportunistic Interest-Casting” IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 13, NO. 4, APRIL 2014