Authenticating Location-Based Skyline

Queries in Arbitrary Subspaces

Abstract

With the ever-increasing use of smartphones and tablet devices, location-based

services (LBSs) have experienced explosive growth in the past few years. To scale
up services, there has been a rising trend of outsourcing data management to Cloud
service providers, which provide query services to clients on behalf of data owners.
However, in this data-outsourcing model, the service provider can be untrustworthy
or compromised, thereby returning incorrect or incomplete query results to clients,
intentionally or not. Therefore, empowering clients to authenticate query results is
imperative for outsourced databases. In this paper, we study the authentication
problem for location-based arbitrary-subspace skyline queries (LASQs), which
represent an important class of LBS applications. We propose a basic Merkle
Skyline R-tree method and a novel Partial S4-tree method to authenticate one-shot
LASQs. For the authentication of continuous LASQs, we develop a prefetchingbased approach that enables clients to compute new LASQ results locally during
movement, without frequently contacting the server for query re-evaluation.
Experimental results demonstrate the efficiency of our proposed methods and
algorithms under various system settings.

Existing system
With the ever-increasing use of smart phones and tablet devices, location-based
services (LBSs) have experienced explosive growth in the past few years. To scale
up services, there has been a rising trend of outsourcing data management to Cloud
service providers, which provide query services to clients on behalf of data owners.
However, in this data-outsourcing model, the service provider can be untrustworthy
or compromised, thereby returning incorrect or incomplete query results to clients,
intentionally or not. Therefore, empowering clients to authenticate query results is
imperative for outsourced databases.
Proposed system

In this paper, we study the authentication problem for location-based arbitrarysubspace skyline queries (LASQs), which represent an important class of LBS
applications. We propose a basic Merkle Skyline R-tree method and a novel Partial
S4-tree method to authenticate one-shot LASQs. For the authentication of
continuous LASQs, we develop a prefetching-based approach that enables clients to
compute new LASQ results locally during movement, without frequently contacting
the server for query re-evaluation. Experimental results demonstrate the efficiency of
our proposed methods and algorithms under various system settings.

MODULES:
1. Users
2. Mobile Service Provider
3. Location Server

MODULES DESCRIPTION:
Users:
The users in our model use some location-based service provided by the location
server LS. For example, what is he nearest ATM or restaurant? The purpose of the
mobile service provider SP is to establish and maintain the communication
between the location server and the user. The location server LS owns a set of POI
records ri for 1ri . Each record describes a POI, giving GPS coordinates to its
location (xgps,ygps), and a description or name about what is at the location.
Mobile Service Provider:
We reasonably assume that the mobile service provider SP is a passive entity and is
not allowed to collude with the LS. We make this assumption because the SP can
determine the whereabouts of a mobile device, which, if allowed to collude with
the LS, completely subverts any method for privacy. There is simply no
technological method for preventing this attack. As a consequence of this

assumption, the user is able to either use GPS (Global Positioning System) or the
mobile service provider to acquire his/her coordinates.
Location Server:
We are assuming that the mobile service provider SP is trusted to maintain the
connection, we consider only two possible adversaries. Each and every one for
individual communication direction. We consider the case in which the user is the
adversary and tries to obtain more than he/she is allowed. Next we consider the
case in which the location server LS is the adversary, and tries to uniquely
associate a user with a grid coordinate.

System Configuration:Hardware Configuration: Processor

Speed

Pentium IV
1.1 Ghz

RAM

256 MB(min)

Hard Disk

20 GB

Key Board

Standard Windows Keyboard

Mouse

Two or Three Button Mouse

Monitor

SVGA

Software Configuration: Operating system

Windows XP/7.

 Coding Language

JAVA/J2EE

IDE

Netbeans 7.4

Database

MYSQL