High-Speed High-Security Public Key Encryption with Keyword Search

Abstract

Data privacy is one of the main concerns for clients who rely on cloud storage services. Standard encryption techniques can offer confidentiality; however, they prevent search capabilities over the encrypted data, thereby significantly degrading the utilization of cloud storage services. Public key Encryption with Keyword Search (PEKS) schemes offer encrypted search functionality to mitigate the impacts of privacy versus data utilization dilemma. PEKS schemes allow any client to encrypt their data under a public key such that the cloud, using the corresponding trapdoor, can later test whether the encrypted records contain certain keywords. Despite this great functionality, the existing PEKS schemes rely on extremely costly operations at the server-side, which often introduce unacceptable cryptographic delays in practical applications. Moreover, while data outsourcing applications usually demand long-term security, existing PEKS schemes do not offer post-quantum security. In this paper, we propose (to the best of our knowledge) the first postquantum secure PEKS scheme that is also significantly more computationally efficient than the existing (non-post-quantum) PEKS schemes. By harnessing the recently developed tools in lattice-based cryptography, the proposed scheme significantly outperforms the existing PEKS schemes in terms of computational overhead. For instance, the test (search) operation per item at the cloud side is approximately 36× faster than that of the most prominent pairing-based scheme in the literature (for 192-bit security). The proposed PEKS scheme also offers faster encryptions at the client side, which is suitable for mobile devices.

Privacy-Preserving Preselection for Protected Biometric Identification Using Public-Key Encryption With Keyword Search

“…More precisely, a PEKS scheme is defined as a tuple of four algorithms PEKS = (KeyGen, PEKS, Trapdoor, Test) [8]:…”

“…• PEKS for privacy-preserving preselection. A latticebased public-key encryption with keyword search (PEKS) scheme [8] is applied to achieve an privacypreserving search based on soft-biometric attributes on an encrypted biometric reference database. The preselection approach does not reveal any additional information about the data subjects.…”

Lattice-Based Public Key Searchable Encryption from Experimental Perspectives

“…We chose Amazon Web Server (AWS) as the server in our system, a commodity hardware and an ARM Cortex-A53 as the client machines. One can easily see the importance of a fullfledged implementation when comparing the benchmark provided from the simulation results in [19] and the benchmark results of the implementation in Section 4. Detailed experimental results are further explained in Section 4.…”

“…We highlight the main differences of this article and its preliminary version in [19] as follows: (i) We provide a full-fledged implementation of NTRU-PEKS and its most efficient counterpart (i.e., BCOP [5]) on commodity hardware, ARM processor and cloud server. (ii) We introduce the first LWE-based PEKS scheme in the standard model (LWE-PEKS) with a security reduction to the worst-case latticebased problems.…”

Advanced Searchable Encryption: An Adaptively Secure Keyword Search for Matrix-type Storages

“…There are many directions on the research of PEKS. For example, some schemes [24][25][26] are constructed to possess resistance against for a quantum attack by founding on lattice-based cryptography. Other direction is to prohibit reusing a token (namely, a trapdoor), Sharma et al proposed a scheme which can evaluate the freshness of the token in [27].…”