Password-authenticated searchable encryption

Abstract

We introduce Password Authenticated Searchable Encryption (PASE), a novel searchable encryption scheme where a single human-memorizable password can be used to outsource (encrypted) data with associated keywords to a group of servers and later retrieve this data through the encrypted keyword search procedure. PASE ensures that only the legitimate user who knows the initially registered password can perform these operations. In particular, PASE guarantees that no single server can mount an offline attack on the user’s password or learn any information about the encrypted keywords. The concept behind PASE protocols extends previous concepts behind searchable encryption by removing the requirement on the client to store high-entropy keys, thus making the protocol device-agnostic on the user side. In this paper, we model the functionality of PASE along with two security requirements (indistinguishability against chosen keyword attacks and authentication) and propose an efficient direct construction in a two-server setting those security we prove in the standard model under the Decisional Diffie–Hellman assumption. Our constructions support outsourcing and retrieval procedures based on multiple keywords and allow users to change their passwords without any need for the re-encryption of the outsourced data. Our theoretical efficiency comparisons and experimental performance and scalability measurements show that the proposed scheme is practical and offers high performance in relation to computations and communications on the user side. The practicality of our PASE scheme is further demonstrated through its implementation within a JavaScript-based web application that can readily be executed on any (mobile) browser and remains practical for commodity user devices such as laptops and smartphones.

Key‐aggregate searchable encryption with multi‐user authorization and keyword untraceability for distributed IoT healthcare systems

“…Chen et al 28 The communication cost illustrates trapdoor and cipher-text of linear size with respect to number of keywords attached in a query set and number of keywords attached in a cipher-text, respectively. The proposed protocol incorporates minimal overhead in trapdoor and cipher-text sizes independent of overall keywords attached with cipher-text and in the query set.…”

“…To demonstrate the performance and efficiency, we evaluate storage space, communication and computation costs of the proposed protocol with similar modeled schemes of References 8,16,21,23,28,31 and 33 in Table 3. The storage cost illustrates constant size of aggregate key, trapdoor, and keyword cipher‐texts by utilizing PKBE protocol 36 and key‐aggregation method 8 .…”

“…Since key‐aggregation enabled efficient key management with compact trapdoors, the protocol's utility is ideal for centralized architectures. Chen et al 28 proposed password‐authenticated searchable encryption based on human‐memorizable ability to outsource encrypted data on the cloud. Their scheme relies upon memorizing initial passwords and registering them to perform search operations.…”

A Privacy Preserving Framework to Protect Sensitive Data in Online Social Networks

“…Chen et al (2020) [25] incorporated the search mechanism with a memorable user password. Although this method was proven computationally efficient concerning key management, it increased the design overhead while creating a distributed architecture to prevent dictionary attacks.…”

Key Update and Device Location of Internet of Things Based on Smart Contract

“…Step 1: Users carry their own identity information ID i and password PW i and select random r i to carry out password encryption and identity information encryption calculation [33]. e results are as follows:…”