FastGeo Efficient Geometric Range Queries
FastGeo Efficient Geometric Range Queries
Spatial Data
ABSTRACT:
Spatial data have wide applications, e.g., location-based services, and geometric
range queries (i.e., finding points inside geometric areas, e.g., circles or polygons)
are one of the fundamental search functions over spatial data. The rising demand of
outsourcing data is moving large-scale datasets, including large-scale spatial
datasets, to public clouds. Meanwhile, due to the concern of insider attackers and
hackers on public clouds, the privacy of spatial datasets should be cautiously
preserved while querying them at the server side, especially for location-based and
medical usage. In this paper, we formalize the concept of Geometrically
Searchable Encryption, and propose an efficient scheme, named FastGeo, to
protect the privacy of clients’ spatial datasets stored and queried at a public server.
With FastGeo, which is a novel two-level search for encrypted spatial data, an
honest-but-curious server can efficiently perform geometric range queries, and
correctly return data points that are inside a geometric range to a client without
learning sensitive data points or this private query. FastGeo supports arbitrary
geometric areas, achieves sublinear search time, and enables dynamic updates over
encrypted spatial datasets. Our scheme is provably secure, and our experimental
results on real-world spatial datasets in cloud platform demonstrate that FastGeo
can boost search time over 100 times.
EXISTING SYSTEM:
Wang et. al. proposed a scheme, which particularly retrieves points inside a
circle over encrypted data by using a set of concentric circles.
Zhu et al. also built a scheme for circular range search over encrypted spatial
data. Unfortunately, these two schemes exclusively work for circles, and do
not apply to other geometric areas.
Other existing system, leverages Bloom filters and their properties, where a
data point is represented as a Bloom filter, a geometric range query is also
formed as a Bloom filter, and the result of an inner product of these two
Bloom filters correctly indicates whether a point is inside a geometric area.
Its advanced version with R-trees can achieve logarithmic search on average.
Due to the potential threats of inside attackers and hackers, the privacy of
spatial datasets in public clouds should be carefully taken care of,
particularly in location-based and medical applications.
For instance, a compromise of AWS by an inside attacker or hacker would
put millions of Yelp users’ sensitive locations under the spotlight.
Does not reveal search decisions (such as inside or outside) over encrypted
data, which limits its usage in search.
PROPOSED SYSTEM:
SYSTEM ARCHITECTURE:
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
System : Pentium Dual Core.
Hard Disk : 120 GB.
Monitor : 15’’ LED
Input Devices : Keyboard, Mouse
Ram : 1GB.
SOFTWARE REQUIREMENTS:
Boyang Wang, Ming Li, Member, IEEE, and Li Xiong, Member, IEEE, “FastGeo:
Efficient Geometric Range Queries on Encrypted Spatial Data”, IEEE
Transactions on Dependable and Secure Computing, 2017.