## Cryptology ePrint Archive: Report 2018/1003

Secure Data Retrieval On The Cloud: Homomorphic Encryption Meets Coresets

Adi Akavia and Dan Feldman and Hayim Shaul

Abstract: Secure report is the problem of a client that retrieves all records matching specified attributes from a database table at the server (e.g. cloud), as in SQL SELECT queries, but where the query and the database are encrypted. Here, only the client has the secret key, but still the server is expected to compute and return the encrypted result. Secure report is theoretically possible with Fully Homomorphic Encryption (FHE). However, the current state-of-the-art solutions are realized by a polynomial of degree that is at least linear in the number $m$ of records, which is too slow in practice even for very small databases.

We present the first solution that is realized by a polynomial that attains degree independent of the number of records $m$, as well as the first implementation of an FHE solution to Secure report. This is by suggesting a novel paradigm that forges a link between cryptography and modern data summarization techniques known as coresets (core-sets), and sketches in particular. The key idea is to compute only a coreset of the desired report. Since the coreset is small, the client can quickly decode the desired report that the server computes after decrypting the coreset.

We implemented our main reporting system in an open source library. This is the first implemented system that can answer such database queries when processing only FHE encrypted data and queries. As our analysis promises, the experimental results show that we can run Secure report queries on billions records in minutes on an Amazon EC2 server, compared to less than a hundred-thousands in previous FHE based solutions.

Category / Keywords: applications / secure search, secure report, fully homomorphic encryption, arithmetic circuit, low degree, implementation, secure outsourcing Date: received 17 Oct 2018

Date: received 17 Oct 2018, last revised 15 Jan 2019

Contact author: hayim shaul at gmail com

Available format(s): PDF | BibTeX Citation

Short URL: ia.cr/2018/1003

[ Cryptology ePrint archive ]