Exploiting Service Similarity for Privacy in Location-Based Search Queries

Exploiting Service Similarity for Privacy in Location-Based Search Queries

ABSTRACT:

Location-based applications utilize the positioning capabilities of a mobile device to determine the current location of a user, and customize query results to include neighboring points of interests. However, location knowledge is often perceived as personal information. One of the immediate issues hindering the wide acceptance of location-based applications is the lack of appropriate methodologies that offer fine grain privacy controls to a user without vastly affecting the usability of the service. While a number of privacy-preserving models and algorithms have taken shape in the past few years, there is an almost universal need to specify one’s privacy requirement without understanding its implications on the service quality. In this paper, we propose a user-centric location-based service architecture where a user can observe the impact of location inaccuracy on the service accuracy before deciding the geo-coordinates to use in a query. We construct a local search application based on this architecture and demonstrate how meaningful information can be exchanged between the user and the service provider to allow the inference of contours depicting the change in query results across a geographic area. Results indicate the possibility of large default privacy regions (areas of no change in resultset) in such applications.

EXISTING SYSTEM:

v Location obfuscation has been extensively investigated in the context of privacy. Obfuscation has been earlier achieved either through the use of dummy queries or cloaking regions. In the dummy query method, a user hides her actual query (with the true location) among a set of additional queries with incorrect locations.

v Data model to augment uncertainty to location data using circular regions around all objects. They use imprecise queries that hide the location of the query issuer and yield probabilistic results.

v Gedik and Liu develop a location privacy architecture where each user can specify maximum temporal and spatial tolerances for the cloaking regions. Drawing inspiration from the concept of k-anonymity in database privacy, Gedik and Liu enforce a location k-anonymity requirement while creating the cloaking regions. This requirement ensures that the user will not be uniquely located inside the region in a given period of time.

v Ghinita et al. propose a decentralized architecture to construct an anonymous spatial region, and eliminate the need for the centralized anonymizer. In their approach, mobile nodes utilize a distributed protocol to self-organize into a fault-tolerant overlay network, from which a k-anonymous cloaking set of users can be determined.

DISADVANTAGES OF EXISTING SYSTEM:

Ø Parameter specification remains the biggest hindrance to real-world application of these techniques. Even when a user has advanced knowledge to comprehend the implications of a parameter setting on location privacy, the impact on service is unknown in these approaches.

Ø The lack of appropriate methodologies that offer fine grain privacy controls to a user without vastly affecting the usability of the service.

PROPOSED SYSTEM:

] We propose a novel architecture to help identify privacy and utility tradeoffs in an LB The architecture has a user-centric design that delays the sharing of a location coordinate until the user has evaluated the impact of its accuracy on the service quality.

] Precise geo-locations are necessary for result set accuracy when the queried objects exist as a dense cluster in the search area.

ADVANTAGES OF PROPOSED SYSTEM:

·        The proposed approach can precisely reveal the area boundaries within which the result set is fully preserved (a default privacy level).

·        We observe a high degree of precision in estimating the area boundaries when user requirements on result set accuracy are relaxed (i.e., location sensitivity is hardened).

·        Approximate inferencing algorithms can be used to reduce the communication overhead.

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

REFERENCE:

Rinku Dewri, Member, IEEE, and Ramakrisha Thurimella, “Exploiting Service Similarity for Privacy in Location-Based Search Queries”. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 25, NO. 2, FEBRUARY 2014