Accelerated search over encrypted cloud data

• Published in: 2017 IEEE International Conference on Big Data and Smart Computing (BigComp) pp. 170 - 177
• Main Authors: Boucenna, Fateh, Nouali, Omar, Dabah, Adel, Kechid, Samir
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-02-2017
• Subjects: Cloud computing; Computer architecture; data privacy; Encryption; Graphics processing units; Indexes; parallel computing; searchable encryption; Servers
• ISSN: 2375-9356
• DOI: 10.1109/BIGCOMP.2017.7881734

Companies and other organizations such as hospitals seek more and more to enjoy the benefits of cloud computing in terms of storage space and computing power. However, outsourced data must be encrypted in order to be protected against possible attacks. Therefore, traditional information retrieval systems (IRS) are no longer effective and must be adapted in order to work over encrypted cloud data. In addition, in order to provide the ability to search over an encrypted index, we use the vector model to represent documents and queries which is the most used in the literature. During the search process, the query vector must be compared with each document vector which is a time consuming process since the data collection is generally huge. Consequently, the search performance is degraded and the search process is too slow. To overcome this drawback, we propose the use of High Performance Computing (HPC) architectures to accelerate the search over encrypted cloud data. Indeed, we propose several techniques that take benefit from Graphics Processing Unit (GPU) and computer cluster architectures by distributing the work between different threads. In addition, in order to get the best performance, we design our solutions so that they can process several queries simultaneously. The experimental study using 400.000 documents demonstrates the efficiency of our proposals by reaching a speed-up around 46×.