Toward practical encrypted email that supports private, regular-expression searches

Abstract

In this paper, we develop a protocol to enable private regular-expression searches on encrypted data stored at a server. A novelty of the protocol lies in allowing a user to securely delegate an encrypted search query to a proxy, which interacts with the server where the user's data are stored encrypted to produce the search result for the user. The privacy of the query and the data are both provably protected against an arbitrarily malicious server and an honestbut-curious proxy under rigorous security definitions. We then detail a series of optimizations to our initial design that achieve an order-of-magnitude performance improvement over the original protocol. We demonstrate the practicality of the resulting protocol through measurements of private regular-expression searches on a real-world email dataset.

A systematic review on the status and progress of homomorphic encryption technologies

“…However, this cryptosystem is also based on the same steps as its counterparts. Kocabas et al [58], Papadimitriou et al [59], Yakoubov et al [38], and Thayananthan and Albeshri [60] have explored security issues in big data and concluded that either homomorphic encryption based on ElGamal and Paillier algorithms suit most big data applications [61,62,35,10,63]. The other area that has received more attention regarding security and the prospect of using homomorphism is cloud computing, especially in respect to di erent healthcare application and data storage systems [51].…”