Public key encryption with keyword search secure against keyword guessing attacks without random oracle

Abstract

. Public key encryption with keyword search secure against keyword guessing attacks without random oracle. Information Sciences, 238 221-241.Public key encryption with keyword search secure against keyword guessing attacks without random oracle AbstractThe notion of public key encryption with keyword search (PEKS) was put forth by Boneh et al. to enable a server to search from a collection of encrypted emails given a "trapdoor" (i.e., an encrypted keyword) provided by the receiver. The nice property in this scheme allows the server to search for a keyword, given the trapdoor. Hence, the verifier can merely use an untrusted server, which makes this notion very practical. Following Boneh et al. 's work, there have been subsequent works that have been proposed to enhance this notion. Two important notions include the so-called keyword guessing attack and secure channel free, proposed by Byun et al. and Baek et al., respectively. The former realizes the fact that in practice, the space of the keywords used is very limited, while the latter considers the removal of secure channel between the receiver and the server to make PEKS practical. Unfortunately, the existing construction of PEKS secure against keyword guessing attack is only secure under the random oracle model, which does not reflect its security in the real world. Furthermore, there is no complete definition that captures secure channel free PEKS schemes that are secure against chosen keyword attack, chosen ciphertext attack, and against keyword guessing attacks, even though these notions seem to be the most practical application of PEKS primitives. In this paper, we make the following contributions. First, we define the strongest model of PEKS which is secure channel free and secure against chosen keyword attack, chosen ciphertext attack, and keyword guessing attack. In particular, we present two important security notions namely IND-SCF-CKCA and IND-KGA. The former is to capture an inside adversary, while the latter is to capture an outside adversary. Intuitively, it should be clear that IND-SCF-CKCA captures a more stringent attack compared to IND-KGA. Second, we present a secure channel free PEKS scheme secure without random oracle under the well known assumptions, namely DLP, DBDH, SXDH and truncated q-ABDHE assumption. Our contributions fill the gap in the literature and hence, making the notion of PEKS Keywords without, against, random, oracle, secure, encryption, key, public, guessing, search, keyword, attacks AbstractThe notion of public key encryption with keyword search (PEKS) was put forth by Boneh et al. to enable a server to search from a collection of encrypted emails given a "trapdoor" (i.e., an encrypted keyword) provided by the receiver. The nice property in this scheme allows the server to search for a keyword, given the trapdoor. Hence, the verifier can merely use an untrusted server, which makes this notion very practical. Following Boneh et al.'s work, there have been subsequent works that have been proposed to enhance this notion. T...

Search pattern leakage in searchable encryption: Attacks and new construction

“…For this reason, the search pattern is also leaked in searchable asymmetric encryption (a.k.a. public key encryption with keyword search, PEKS), whose query algorithms are probabilistic [8,6,20,12]. Therefore, randomizing query algorithm only contributes to defend outer adversaries but not inner adversaries (e.g., cloud administrators).…”

Searchable Encryption: A Review

“…In addition, works done to support single keyword search [11], [13], multi-keyword search and ranking [3], [14], [15], subset query and range query [16], [17] and fuzzy multi-keyword search [18], [19]. Most of the previous work done on SE to improve secrecy motivated by adversary activity [20], [21]. Some adversary activities include brute force attack [20], search/access pattern leakage [8], [21] and DDoS attack [5].…”

“…Most of the previous work done on SE to improve secrecy motivated by adversary activity [20], [21]. Some adversary activities include brute force attack [20], search/access pattern leakage [8], [21] and DDoS attack [5]. To proof that any scheme or algorithm developed was resistant enough from attacks or adversary activities, system model and threat model were constructed for experimental purposes [3], [14].…”

Implementation of E-Health Cloud System Using Timing Enabled Proxy Re-encryption function (Re-dtPECK)

“…In the year 2013 [7], Fang et al proposed SCF-PEKS proposal without random oracle. In this scheme, the receiver is chosen by the server(designated tester) which can perform a test to verify the relationship between cipher text and trapdoor.…”