Cryptology ePrint Archive: Report 2019/874

Attribute-Based Encryption with Functional Keyword Search in Fog Computing

Fei Meng and Mingqiang Wang

Abstract: We provide a new frame in this paper, the ciphertext-policy attribute-based encryption with functional keyword search (ABFKS) in fog computing. The ABFKS achieves functional keyword search and peer-peeping resistance, which makes it more practical and secure, while in previous attribute-based encryption with keyword search (ABKS) schemes, keyword search function is limited and ciphertext is vulnerable to man-in-the-middle attacks by adversaries who have sufficient authorities. Specifically, in ABFKS, the search process requires only one keyword, instead of each keyword as previous schemes, to be identical between the target keyword set and the ciphertext keyword set, and outputs the correlation of those two sets. Besides, the ABFKS resists peeping from peers or superiors who have the same or more attributes.

Privacy and efficiency issues haven't been fully considered, therefore we provide a construction of ABFKS with privacy preserving, efficient attribute update and reverse outsourcing (ABKFS-PER). To be specific, we provide a novel method to protect the privacy of access structure by replacing each leaf node with an OR gate. In this scheme, every user has all the attributes in the cloud's view by adding fake ones so to protect the privacy of user authority. We propose a new method for attribute update, in which the key authority center only updates the user who needs update, not everyone. At last, we initially propose the concept of reverse outsourcing, namely the cloud outsourcing computational tasks to idle users to reduce its overhead.

Category / Keywords: Attribute-based encryption; Keyword search; Fog computing; Outsourcing; Privacy preserving.

Date: received 30 Jul 2019, last revised 5 Sep 2019

Contact author: mengfei_sdu at 163 com

Available format(s): PDF | BibTeX Citation

Version: 20190905:091310 (All versions of this report)

Short URL: ia.cr/2019/874


[ Cryptology ePrint archive ]