Searchable Deterministic Encryption against the Keyword Guessing Attack by Outside Attacker

Abstract

Searchable Deterministic Encryption (SDE) was proposed by Bellare et al. It aimed to improve the search performance of the traditional Public-Key Encryption with Keyword Search (PEKS). Both of SDE and PEKS are insecure under the Keyword Guessing Attack (KGA) by outsider attack in practice in terms of security. KGA generally refers that an eavesdropper is able to guess keywords by peeking over the communications of SDE using a brute-force method. However, the KGA attacks of SDE are different with PEKS because of the determinacy of SDE. To address the insecurity of SDE under the KGA attacks by outsider attackers, the specialties of SDE was extracted. Then, the Public Key Encryption (PKE) was used to solve this insecurity using a generic method. Searchable Deterministic Encryption (SDE) was proposed by Bellare et al. It aimed to improve the search performance of the traditional Public-Key Encryption with Keyword Search (PEKS). Both of SDE and PEKS are insecure under the Keyword Guessing Attack (KGA) by outsider attack in practice in terms of security. KGA generally refers that an eavesdropper is able to guess keywords by peeking over the communications of SDE using a brute-force method. However, the KGA attacks of SDE are different with PEKS because of the determinacy of SDE. To address the insecurity of SDE under the KGA attacks by outsider attackers, the specialties of SDE was extracted. Then, the Public Key Encryption (PKE) was used to solve this insecurity using a generic method.