Data Inference from Encrypted Databases: A Multi-dimensional Order-Preserving Matching Approach

01/23/2020
by   Yanjun Pan, et al.
0

Due to increasing concerns of data privacy, databases are being encrypted before they are stored on an untrusted server. To enable search operations on the encrypted data, searchable encryption techniques have been proposed. Representative schemes use order-preserving encryption (OPE) for supporting efficient Boolean queries on encrypted databases. Yet, recent works showed the possibility of inferring plaintext data from OPE-encrypted databases, merely using the order-preserving constraints, or combined with an auxiliary plaintext dataset with similar frequency distribution. So far, the effectiveness of such attacks is limited to single-dimensional dense data (most values from the domain are encrypted), but it remains challenging to achieve it on high-dimensional datasets (e.g., spatial data) which are often sparse in nature. In this paper, for the first time, we study data inference attacks on multi-dimensional encrypted databases (with 2-D as a special case). We formulate it as a 2-D order-preserving matching problem and explore both unweighted and weighted cases, where the former maximizes the number of points matched using only order information and the latter further considers points with similar frequencies. We prove that the problem is NP-hard, and then propose a greedy algorithm, along with a polynomial-time algorithm with approximation guarantees. Experimental results on synthetic and real-world datasets show that the data recovery rate is significantly enhanced compared with the previous 1-D matching algorithm.

READ FULL TEXT
research
10/09/2017

SOPE: A Spatial Order Preserving Encryption Model for Multi-dimensional Data

Due to the increasing demand for cloud services and the threat of privac...
research
11/25/2018

Faster CryptoNets: Leveraging Sparsity for Real-World Encrypted Inference

Homomorphic encryption enables arbitrary computation over data while it ...
research
09/07/2018

Pushing the Limits of Encrypted Databases with Secure Hardware

Encrypted databases have been studied for more than 10 years and are qui...
research
08/10/2021

Secure k-Anonymization over Encrypted Databases

Data protection algorithms are becoming increasingly important to suppor...
research
01/11/2020

Accelerating Forward and Backward Private Searchable Encryption Using Trusted Execution

Searchable encryption (SE) is one of the key enablers for building encry...
research
04/12/2022

Scalable privacy-preserving cancer type prediction with homomorphic encryption

Machine Learning (ML) alleviates the challenges of high-dimensional data...
research
10/25/2017

Optimizing relinearization in circuits for homomorphic encryption

Fully homomorphic encryption (FHE) allows an untrusted party to evaluate...

Please sign up or login with your details

Forgot password? Click here to reset