0% found this document useful (0 votes)
17 views5 pages

FastGeo Efficient Geometric Range Queries

The document presents FastGeo, a novel scheme for Geometrically Searchable Encryption that allows efficient geometric range queries on encrypted spatial data while preserving privacy. FastGeo supports arbitrary geometric areas and achieves sublinear search times, significantly improving performance over existing systems by over 100 times. The proposed method ensures that sensitive data remains confidential even when queried by an honest-but-curious server.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views5 pages

FastGeo Efficient Geometric Range Queries

The document presents FastGeo, a novel scheme for Geometrically Searchable Encryption that allows efficient geometric range queries on encrypted spatial data while preserving privacy. FastGeo supports arbitrary geometric areas and achieves sublinear search times, significantly improving performance over existing systems by over 100 times. The proposed method ensures that sensitive data remains confidential even when queried by an honest-but-curious server.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

FastGeo: Efficient Geometric Range Queries on Encrypted

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.

DISADVANTAGES OF EXISTING SYSTEM:

 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:

 In this paper, we formalize the concept of Geometrically Searchable


Encryption (GSE), which is evolved from the definitions of SE schemes but
focuses on answering geometric queries.
 We propose a GSE scheme, named FastGeo, which can efficiently retrieve
points inside a geometric area without revealing private data points or
sensitive geometric range queries to a honest-but curious server.
 Instead of directly evaluating compute then- compare operations, our main
idea is to convert spatial data and geometric range queries to a new form,
denoted as equality-vector form, and leverage a two-level search as our key
solution to verify whether a point is inside a geometric range, where the first
level securely operates equality checking with PRF and the second level
privately evaluates inner products with Shen-Shi-Waters encryption (SSW)

ADVANTAGES OF PROPOSED SYSTEM:


 With the embedding of a hash table and a set of link lists in our two-level
search as a novel structure for spatial data, FastGeo can achieve sublinear
search and support arbitrary geometric ranges (e.g., circles and polygons).
 FastGeo not only provides highly efficient updates over encrypted spatial
data, but also improves search performance over 100x.
 We formalize the definition of GSE and its leakage function, and rigorously
prove data privacy and query privacy with indistinguishability under
selective chosen plaintext attacks.
 Fast-Geo is highly efficient over a real-world spatial dataset.

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:

 Operating system : Windows 7.


 Coding Language : ASP.NET,C#.NET
 Tool : Visual Studio 2008
 Database : SQL SERVER 2005
REFERENCE:

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.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy