Do Not Tell Me What I Cannot Do! (The Constrained Device Shouted under the Cover of the Fog): Implementing Symmetric Searchable Encryption on Constrained Devices

Author(s):  
Eugene Frimpong ◽  
Alexandros Bakas ◽  
Hai-Van Dang ◽  
Antonis Michalas
2020 ◽  
Vol 5 (4) ◽  
pp. 391-418
Author(s):  
Mukti Padhya ◽  
Devesh C. Jinwala

Abstract 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.


Accessible Encryption (SE) permits a client in accordance with transfer records in accordance with the astronaut and according to seem thru it of a faraway manner while defending the security concerning each the statistics yet the inquiries. Right now, entrust a generative then the simple in imitation of actualize Symmetric Searchable Encryption Scheme because instance (SSE) [4]. This tale takes the some round concerning correspondence namely O(n) instances on calculations upstairs n range regarding records . We likewise presented some other variety of Search Pattern Privacy, as gives a percentage about safety on the spillage structure trapdoor [4]. We also advocate the modifications over our graph because of batch inquire who can not reap the versatile vagary recipe. The current method offers the appropriateness whilst maintaining stuff about the data classified, that is viable so much such has advise bother among the full altar about the demand bill and wants in accordance with remove watchwords now the archives are eke out away. We likewise recommend adjustments in our format so the graph execute be utilized upon the potent enemies at the fee on various rounds of transmission yet the inclination space. [6]We may eke exhibit our layout on a range of commercial enterprise datasets. Likewise correct now, utilizes the Hash tying strategy instead than band over encryption action because file for consideration majority which makes such splendid for light poise applications. We are the first in imitation of suggest pardon trapdoors between Symmetric Searchable Encryption because the tussock search.


Sign in / Sign up

Export Citation Format

Share Document