Cryptology ePrint Archive: Report 2019/874

ABDKS Attribute-Based Encryption with Dynamic Keyword Search in Fog Computing

Fei Meng and Mingqiang Wang

Abstract: Attribute-based encryption with keyword search (ABKS) achieves both fine-grained access control and keyword search. However, in the previous ABKS schemes, the search algorithm requires that each keyword between the target keyword set and the ciphertext keyword set be the same, otherwise the algorithm doesn't output any search result, which is not conducive to use. Moreover, the previous ABKS schemes are vulnerable to what we call a \emph{peer-decryption attack}, that is, the ciphertext may be eavesdropped and decrypted by an adversary who has sufficient authorities but no information about the ciphertext keywords.

In this paper, we provide a new system in fog computing, the ciphertext-policy attribute-based encryption with dynamic keyword search (ABDKS). In ABDKS, the search algorithm requires only \emph{one} keyword to be identical between the two keyword sets and outputs the corresponding correlation which reflects the number of the same keywords in those two sets. In addition, our ABDKS is resistant to peer-decryption attack, since the decryption requires not only sufficient authority but also at least one keyword of the ciphertext. Beyond that, the ABDKS shifts most computational overheads from resource constrained users to fog nodes. The security analysis shows that the ABDKS can resist Chosen-Plaintext Attack (CPA) and Chosen-Keyword Attack (CKA).

Category / Keywords: public-key cryptography / Fog computing; Outsourcing; Access control; Attribute-based encryption; Keyword search

Date: received 30 Jul 2019, last revised 11 Dec 2019

Contact author: mengfei_sdu at 163 com

Available format(s): PDF | BibTeX Citation

Version: 20191211:085725 (All versions of this report)

Short URL: ia.cr/2019/874


[ Cryptology ePrint archive ]