Range query is one of the most frequently used queries for online data analytics. Providing such a query service could be expensive for the data owner. With the development of services computing and cloud computing, it has become possible to outsource large databases to database service providers and let the providers maintain the range-query service. With outsourced services, the data owner can greatly reduce the cost in maintaining computing infrastructure and data-rich applications. We propose the Random Space Encryption (RASP) approach that allows efficient range search with stronger attack resilience than existing efficiency-focused approaches. The RASP data perturbation method combines order preserving encryption, dimensionality expansion, random noise injection, and random projection, to provide strong resilience to attacks on the perturbed data and queries. It also preserves multidimensional ranges, which allows existing indexing techniques to be applied to speedup range query processing. The kNN-R algorithm is designed to work with the RASP range query algorithm to process the kNN queries. We use RASP to generate indexable auxiliary data that is resilient to prior knowledge enhanced attacks. Range queries are securely transformed to the encrypted data space and then efficiently processed with a two-stage processing algorithm. Keywords— RASP, query services in the cloud, privacy, range query, kNN query
[1]
Keke Chen,et al.
RASP: efficient multidimensional range query on attack-resilient encrypted databases
,
2011,
CODASPY '11.
[2]
Stavros Papadopoulos,et al.
Nearest neighbor search with strong location privacy
,
2010,
Proc. VLDB Endow..
[3]
Gene Tsudik,et al.
A Privacy-Preserving Index for Range Queries
,
2004,
VLDB.
[4]
Feifei Li,et al.
Dynamic authenticated index structures for outsourced databases
,
2006,
SIGMOD Conference.
[5]
Rafail Ostrovsky,et al.
Searchable symmetric encryption: improved definitions and efficient constructions
,
2006,
CCS '06.
[6]
Xiaofeng Meng,et al.
Integrity Auditing of Outsourced Data
,
2007,
VLDB.
[7]
Keke Chen,et al.
VISTA: Validating and Refining Clusters Via Visualization
,
2004,
Inf. Vis..
[8]
Eyal Kushilevitz,et al.
Private information retrieval
,
1998,
JACM.
[9]
Keke Chen,et al.
Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation
,
2012,
IEEE Transactions on Knowledge and Data Engineering.
[10]
Ramakrishnan Srikant,et al.
Order preserving encryption for numeric data
,
2004,
SIGMOD '04.
[11]
Brent Waters,et al.
Conjunctive, Subset, and Range Queries on Encrypted Data
,
2007,
TCC.
[12]
Radu Sion,et al.
Query Execution Assurance for Outsourced Databases
,
2005,
VLDB.