Executing Boolean Queries on an Encrypted Bitmap Index

Abdelraheem, Mohamed Ahmed; Gehrmann, Christian; Lindström, Malin; Nordahl, Christian

doi:10.1145/2996429.2996436

Cited by 7 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In single-keyword search scheme ( Song, Wagner & Perrig, 2000 ; Curtmola et al, 2006 ; Wang et al, 2010 ; Kamara, Papamanthou & Roeder, 2012 ), the server returns some irrelevant results, while the multi-keyword search ( Cash et al, 2013 ; Lai et al, 2018 ; Xu et al, 2018 ; Wang et al, 2018 ; Liang et al, 2020 ; Hozhabr, Asghari & Javadi, 2021 ; Liang et al, 2021 ) gains higher search accuracy and more accurate results. To further improve search efficiency, Abdelraheem et al (2016) proposed an SSE scheme on encrypted bitmap indexes to support multi-keyword search, but requires two rounds of interactions with the cloud server. Zuo et al (2019) proposed a secure SSE scheme based on bitmap index which supports dynamic operations with forward and backward security, but this scheme lacks the verification of the results.…”

Section: Related Workmentioning

confidence: 99%

Towards efficient verifiable multi-keyword search over encrypted data based on blockchain

Zhang

Yuan

et al. 2022

PeerJ Computer Science

View full text Add to dashboard Cite

Searchable symmetric encryption (SSE) provides an effective way to search encrypted data stored on untrusted servers. When the server is not trusted, it is indispensable to verify the results returned by it. However, the existing SSE schemes either lack fairness in the verification of search results, or do not support the verification of multiple keywords. To address this, we designed a multi-keyword verifiable searchable symmetric encryption scheme based on blockchain, which provides an efficient multi-keyword search and fair verification of search results. We utilized bitmap to build a search index in order to improve search efficiency, and used blockchain to ensure fair verification of search results. The bitmap and hash function are combined to realize lightweight multi-keyword search result verification, compared with the existing verification schemes using public key cryptography primitives, our scheme reduces the verification time and improves the verification efficiency. In addition, our scheme supports the dynamic update of files and realizes the forward security in update. Finally, formal security analysis proves that our scheme is secure against Chosen-Keyword Attacks (CKA), experimental analysis demonstrations that our scheme is efficient and viable in practice.

show abstract

Section: Related Workmentioning

confidence: 99%

Towards efficient verifiable multi-keyword search over encrypted data based on blockchain

Zhang

Yuan

et al. 2022

PeerJ Computer Science

View full text Add to dashboard Cite

show abstract

“…Additionally, some researchers had suggested some encryption schemes that can support complex retrieval such as conjunctive keyword search, subset search, range query, and semantic keyword search [22][23][24][25], which improved retrieval accuracy and provided more complex retrieval expressions for the user. Abdelraheem et al [26] presented a query evaluation scheme that combined SSE with Bitmap indexes. However, it required two rounds of interaction with the cloud server.…”

Section: Related Workmentioning

confidence: 99%

A Lightweight Blockchain-based Public-Key Authenticated Encryption with Multi-Keyword Search for Cloud Computing

Chen

Lin

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

Cloud computing can provide users with sufficient computing resources, storage, and bandwidth to meet their needs. Data security and privacy protection are among the new threats faced by users. Searchable encryption is the combination of search technology and encryption technology. Searchable encryption can upload the user’s data to the cloud server after special encryption, and can realize the function of retrieving according to keywords. Comparatively to symmetric searchable encryption (SSE), public key searchable encryption (PEKS) simplifies key management greatly. However, most existing public key authenticated encryption with keyword search (PAEKS) schemes are based bilinear pairing, making them computationally expensive. Apart from this, complex retrieval requirements and the integrity of the results had not been considered. To address these problems, we propose a blockchain-based PAEKS schemes supporting multi-keyword queries and integrity verification. In addition, we provide security proofs for the PAEKS scheme under the decisional oracle Diffie-Hellman (DODH) assumption. This scheme a scheme that requires less storage and computational power than other schemes of the same kind.

show abstract

“…Query Generation. We used a standard single-keyword SSE scheme where a Bitmap encrypted index is used similar to the single-keyword Bitmap index scheme described in [1,20,13] to transform each target relational database into a separate searchable encryption relational database. We conducted four experiments per each target dataset where different sets of random queries within the target protected database are issued in each experiment.…”

Section: Query and Record Recovery Attacksmentioning

confidence: 99%

Data Privacy Management, Cryptocurrencies and Blockchain Technology

García-Alfaro¹,

Navarro‐Arribas²,

Hartenstein

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We point out the risks of protecting relational databases via Searchable Symmetric Encryption (SSE) schemes by proposing an inference attack exploiting the structural properties of relational databases. We show that record-injection attacks mounted on relational databases have worse consequences than their file-injection counterparts on unstructured databases. Moreover, we discuss some techniques to reduce the effectiveness of inference attacks exploiting the access pattern leakage existing in SSE schemes. To the best of our knowledge, this is the first work that investigates the security of relational databases protected by SSE schemes.

show abstract

Executing Boolean Queries on an Encrypted Bitmap Index

Cited by 7 publications

References 15 publications

Towards efficient verifiable multi-keyword search over encrypted data based on blockchain

Towards efficient verifiable multi-keyword search over encrypted data based on blockchain

A Lightweight Blockchain-based Public-Key Authenticated Encryption with Multi-Keyword Search for Cloud Computing

Data Privacy Management, Cryptocurrencies and Blockchain Technology

Contact Info

Product

Resources

About