Multi-keyword Cipher-text Retrieval Method for Smart Grid Edge Computing*

Zhu, Jing; Wu, Tao; Li, Jintao; Liu, Yanbin; Jiang, Qiqi

doi:10.1088/1742-6596/1754/1/012076

Cited by 3 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Li et al [23] proposed a searchable symmetric encryption scheme applied in smart grid data in 2019, similar to [5] using pseudo-random functions to construct the scheme with simplicity and ease of updating. Zhu et al [24] improved the scheme of [23] by adding multikeyword and fuzzy keyword search using the N-Gram algorithm and Hamming distance in 2021. Moreover, some searchable encryption schemes were constructed based on the Bloom flter principle [4,25,26], but most of them directly use the Bloom flter as the index, which is not easy to update and have false positive.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Searchable Symmetric Encryption Scheme for Smart Grid Data

Xiong

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

In recent years, the combination of power systems and IoT (Internet of things) has become a new generation of smart grid. Cloud computing is used to provide storage and computing services for smart grid data due to its convenience. Generally, searchable encryption technology is considered a feasible solution to guarantee data security and support search function. Li proposed a searchable symmetric encryption scheme based on pseudo-random function for smart grid data in 2019. In this paper, we propose a more efficient and more secure searchable symmetric encryption scheme for smart grid data. The scheme improves the search efficiency by introducing the Bloom filter and changing the structure of the index. Specifically, we first narrow the search scope and then perform a second search, which eliminates the false positive caused by the introduction of the Bloom filter. At the same time, we assign an ID to each piece of data (a row of data) in a tabular dataset, store the hash value of the ID (adding salt) in the index, and the search results are returned by the server contain none of the ID information, which improves security. Experiments on real data show that our scheme is 52% more efficient than the previous scheme.

show abstract

Section: Introductionmentioning

confidence: 99%

An Efficient Searchable Symmetric Encryption Scheme for Smart Grid Data

Xiong

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

Secure query processing for smart grid data using searchable symmetric encryption

Souror,

Badawy,

El-Fishawy

2024

J Supercomput

View full text Add to dashboard Cite

In the last decade, the smart grid has utilized many modern technologies and applications compared with the conventional grid. Cloud computing offers numerous managed services and storage solutions for smart grid data. To balance security, privacy, efficiency, and utility, more efforts should be made to keep up with the rapid evolution of technology. Searchable encryption techniques are widely considered an intelligent solution to ensure data privacy and security while maintaining the functionality to search over encrypted data. In this paper, we propose a more reliable and efficient searchable symmetric encryption scheme for smart grid data. It is a dynamic keyword searchable scheme that uses a symmetric cipher based on a key hashing algorithm (DKS-SCKHA) to generate a secure index. This scheme eliminates the false-positive issue associated with the use of bloom filters and narrows the scope of the retrieved search results. Additionally, it efficiently supports both partial and exact query processing on the encrypted database. Both theoretical and security analyses demonstrate the efficiency and security of the DKS-SCKHA scheme compared to other previous schemes. Comprehensive experiments on a smart grid dataset showed that the DKS-SCKHA scheme is 35–68% more efficient than the schemes compared in this paper. The DKS-SCKHA scheme supports three keyword search scenarios: single, conjunctive, and disjunctive. Furthermore, the DKS-SCKHA scheme is extended to support dynamic fuzzy keyword search on the encrypted database (DEFKS-SCKHA). We evaluated the security and efficiency of the DEFKS-SCKHA scheme through security analysis and experimental evaluation. Theoretical analysis shows that the proposed scheme is secure against known-ciphertext and known-background attacks.

show abstract