Efficient secure similarity computation on encrypted trajectory data

Outsourcing database to clouds is a scalable and cost-effective way for large scale data storage, management, and query processing. Trajectory data contain rich spatio-temporal relationships and reveal many forms of individual sensitive information (e.g., home address, health condition), which neces...

Full description

Saved in:
Bibliographic Details
Published in:2015 IEEE 31st International Conference on Data Engineering pp. 66 - 77
Main Authors: An Liu, Kai Zhengy, Lu Liz, Guanfeng Liu, Lei Zhao, Xiaofang Zhou
Format: Conference Proceeding
Language:English
Published: IEEE 01.04.2015
Subjects:
Encryption
Protocols
Query processing
Trajectory
ISSN:1063-6382
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Outsourcing database to clouds is a scalable and cost-effective way for large scale data storage, management, and query processing. Trajectory data contain rich spatio-temporal relationships and reveal many forms of individual sensitive information (e.g., home address, health condition), which necessitate them to be encrypted before being outsourced for privacy concerns. However, efficient query processing over encrypted trajectory data is a very challenging task. Though some achievements have been reported very recently for simple queries (e.g., SQL queries, kNN queries) on encrypted data, there is rather limited progress on secure evaluation of trajectory queries because they are more complex and need special treatment. In this paper, we focus on secure trajectory similarity computation that is the cornerstone of secure trajectory query processing. More specifically, we propose an efficient solution to securely compute the similarity between two encrypted trajectories, which reveals nothing about the trajectories, but the final result. We theoretically prove that our solution is secure against the semi-honest adversaries model as all the intermediate information in our protocols can be simulated in polynomial time. Finally we empirically study the efficiency of the proposed method, which demonstrates the feasibility of our solution.
ISSN:1063-6382
DOI:10.1109/ICDE.2015.7113273