R-OO-KASE: Revocable Online/Offline Key Aggregate Searchable Encryption

Data Science and Engineering

Devesh C. Jinwala¹  Mukti Padhya¹ 

[1] Department of Computer Engineering, Sardar Vallabhbhai National Institute of Technology (SVNIT), Surat, India;

关键词: Searchable encryption;    Data sharing;    Data retrieval;    Cloud server;    Multi-keyword search;    Online/offline encryption;    Revocation;    94A60;    68P25;   

DOI  :  10.1007/s41019-020-00136-y

来源: Springer

【 摘 要 】

The existing Key Aggregate Searchable Encryption (KASE) schemes allow searches on the encrypted dataset using a single query trapdoor, with a feature to delegate the search rights of multiple files using a constant size key. However, the operations required to generate the ciphertext and decrypt it in these schemes incur higher computational costs, due to the computationally expensive pairing operations in encryption/decryption. This makes the use of such schemes in resource-constrained devices, such as Radio Frequency Identification Devices, Wireless Sensor Network nodes, Internet of Things nodes, infeasible. Motivated with the goal to reduce the computational cost, in this paper, we propose a Revocable Online/Offline KASE (R-OO-KASE) scheme, based on the idea of splitting the encryption/decryption operations into two distinct phases: online and offline. The offline phase computes the majority of costly operations when the device is on an electrical power source. The online phase generates final output with the minimal computational cost when the message (or ciphertext) and keywords become known. In addition, the proposed scheme R-OO-KASE also offers multi-keyword search capability and allows the data owners to revoke the delegated rights at any point in time, the two features are not supported in the existing schemes. The security analysis and empirical evaluations show that the proposed scheme is efficient to use in resource-constrained devices and provably secure as compared to the existing KASE schemes.

【 授权许可】

CC BY