K.S.R.

COLLEGE OF ENGINEERING
(AUTONOMOUS)

Dynamic Protected Query Integration

in
Road Networks
Project Phase -1

Guided by,
Mrs.M.K.Nivodhini M.E.,
Asst Professor-CSE

Presented by,
M.Sai Arun Prasath(1333015)
II-M.E-CSE

Content

Abstract
Introduction
Literature Survey
Existing System
Proposed System
System Architecture
Modules Description
Conclusion
References

Abstract
Authentication on Location based services contributes major
process of extracting queries from client
Since database is protected from third party violation can be
completely avoided
The vigorous secure family of encryption technique with
k-NN used
Service Provider will be the responsible for indexing the data,
query process with instance updating from the Data Owners

Introduction
Process of analyzes a large amount of data to find new and
hidden information that improves business efficiency

k-Nearest Neighbors algorithm is a method used for

categorize (classification) and estimate the relationship
among variables (regression).

01/26/15

Literature Survey

Authentication and Integrity in

Outsourced Databases
In spatial database outsourcing, a data owner
delegates its data management tasks to a Location-Based Service
(LBS), which indexes the data with an Authenticated Data
Structure (ADS). The LBS receives queries (ranges, nearest
neighbors) originating from several clients/subscribers.
Methodology
Presented a novel approach based on signature aggregation
techniques. Specically, we proposed a secure and practical
Condensed-RSA scheme which performs well in the Unied Client
as well as the Multi-Querier models.

Authentication of moving k nn queries

A moving k NN query continuously reports the k
nearest neighbors of a moving query point. In addition to the
query result, a service provider that evaluates moving queries
often returns mobile clients a safe region that bounds the
validity of query results to minimize the communication cost
between the two parties

Verifying spatial queries using voronoi

neighbors
location-based services and the abundant usage of smart phones
and GPS enabled devices, the necessity of outsourcing spatial data
has grown rapidly over the past few years. Nevertheless, in the
database outsourcing paradigm, the authentication of the query
results on the client remains a challenging problem.

Voronoi-based k nearest neighbor

search for spatialnetwork databases
The shortest network distance
(e.g., shortest path, shortest time) between objects
(e.g., the vehicle and the restaurants)
It depend on the connectivity of the network rather than the
objects locations. The majority of the existing work on KNN
queries is based on either computing the distance between a query
and the objects on-line, or utilizing index structures. The solution
proposed by the first group is based on the fact that the current
algorithms.

Spatial outsourcing for location-based

services
The LBS receives and processes spatial queries, (e.g.,
ranges, k nearest-neighbors) from clients. Since the LBS
is not the real owner of the data, the client must be able to
verify the soundness and completeness of the results.
Soundness means that every record in the result set is
present in the owner's database and not modified.
Completeness means that no valid result is missing.

Database Outsourcing
Frameworks

Existing System
Existing system had solved query verification problem simply

Previous NN queries in spatial network by progressively expand

road segments around the query point

To speed up the NN search, they pre-compute shortest paths

between all the vertices in the network

Disadvantages
Pre-computation- based approaches incur high I/O and
computation costs
None of the proposed mechanisms have considered the
query integrity problem
Suffer from efficiency-degraded index structure due to the
storage of additional hashes and its absence of updating
Existing technique are not flexible enough .They support only
restricted operations
Prohibitively expensive for practical uses

Proposed System

To upgrade the efficiency shortest path (Dijikstras)algorithm

with k- nearest query processing is proposed

For security concern AES algorithm with message

authentication technique has been enriched

Advantages

It will reduce the verification cost for serviced clients

Complete avoidance of security violation from Service

Provider

An effective algorithm will show the client side queries in

low selectivity

SYSTEM ARCHITECTURE

Spatial
distance
-calculation
Shortest pathlookup

Reposito
ry

Data
Encryption

Owner-side
process

Signing
Data

Cloud
Service
provider

Ciphe
r

Text

Data

Data
Maintenance

Client side data

After
authenticat
progress
ion

POINTS OF INTEREST retrieval

Required
query
processing

Outsourcing to
cloud service
as encrypted
format

Client side
process

Modules
Multi-Data Owners k-NN surveillance
State of data preserving
Records Validating Process
SP side maintenance
User side interrogation

Multi-Data Owners k-NN surveillance

DO computes a pre-processing work on the POI set and the
under-lying road network.
Data contents and registered client information has been updated
with its attributes.
Distance can be calculated for each intermediate location by
using Euclidean distance method.
Find Nearest neighbors by using k-NN algorithm.

State of Data Preserving

A complete information has to kept securely on repository.
Data preserving can be processed through cryptographic
technique.
An updated information is encrypted by using AES(Advanced
Encryption Standard)algorithm.

01/26/15

19

Records Validating Process

Data has to be signed for specific access control purpose after
converting into cipher text.
By using digital signature technique, information can be
completely validated by data owners for registered user.
On ending this module a complete data set by end of this
outsourcing into cloud service provider.

01/26/15

20

SP Side Maintenance
The information receiving from data owners will be saved as
cipher text.
Due to this third party will not able to obtain the original
information easily.
Spatial & neighbors signatures details storage will avoid the
maintenance cost from owner side.

01/26/15

21

User Side Interrogation

Process can be initialized by Client authentication.
This is online progress in between user & provider side.
POI can be retrieved as located in repository when user send
request to the cloud.
Final response will included POI with shortest distance value.

01/26/15

22

CONCLUSION
In this proposed system two schemes to support secure k nearest
neighbor query processing the Dijikstras algorithm with encryption
algorithm. They both use mutable-Order Preserving Encoding (mOPE) as a building block. Dijikstra provides exact results, but its
performance overhead may be higher. k-NN only offers
approximate NN results, but with better performance. In addition,
the accuracy of k-NN is very close to that of the exact method. In
order to investigate the complex secure evaluation functions on
cipher texts, such as skyline queries and research formal security
protection guarantees against the client, to prevent it from
learning anything other than the received k query results.

01/26/15

23

REFERENCES
[1] Yinan Jing,Member, IEEE,Ling Hu, Wei-Shinn Ku,Senior Member,
IEEE, Authentication of k Nearest Neighbor Query on Road
Networks vol. 26, no. 6, June 2014.
[2] F. Gens. (2011, Oct. 20). IDCs new IT cloud services forecast:
2009- 2013 [Online].
[3] H.Hacigms, S.Mehrotra and B.R.Iyer,Providing database as a
service ,in Proc. 18th ICDE,SanJose,CA,USA,2002,pp. 2938.
[4] Google Maps [Online]. Available: http://maps.google.com/
[5] M. Erwig, The graph voronoi diagram with applications, Netw.,
vol. 36, no. 3, pp. 156163, Oct. 2000.
01/26/15

24

[6] U. Demiryurek and C. Shahabi, Indexing network voronoi diagrams,inProc.17thInt.Conf.DASFAA,Busan,SouthKorea,2012, pp.

526543.
[7] E. W. Dijkstra, A note on two problems in connexion with graphs,
Num. Math., vol. 1, no. 1, pp. 269271, Dec. 1959.
[8] F. Li. (2012 Apr. 2). Real Datasets for Spatial Databases [Online].
Available: http://www.cs.utah.edu/lifeifei/SpatialDataset.htm
[9] C. Cachin and M. Schunter, A cloud you can trust, IEEE
Spectrum, vol. 48, no. 12, pp. 2851, Dec. 2011
[10] A. Fiat, Batch RSA, J. Cryptology, vol. 10, no. 2, pp. 7588,
1997.
01/26/15

25