Towards Efficient Verifiable Boolean Search Over Encrypted Cloud Data

doi:10.1109/TCC.2021.3118692

Towards Efficient Verifiable Boolean Search Over Encrypted Cloud Data

2023-01-01

12

PRE

AI

Kim‐Kwang Raymond Choo

DOI：10.1109/TCC.2021.3118692

Original

Original request for help

Save

Abstract

En 中文

Symmetric Searchable Encryption (SSE) schemes facilitate searching over encrypted data, and have been extensively explored to improve function, efficiency or security. There are, however, additional functions that we need to consider in a real-world setting. For example, forward and backward privacy are required to adequately secure newly added documents and deleted documents in Dynamic SSE (DSSE) schemes, and support boolean search (that allows users to search over encrypted data using basic boolean operations) to achieve improved efficiency and retrieval accuracy. Therefore, in this article we first construct the Verifiable Boolean Search over encrypted data (VBS), and then improve VBS to achieve Forward and Backward privacy (VBS-FB). Finally, we formally prove the security of our proposed schemes, and evaluate their performance using real-world datasets.

Keywords:

Privacy

Servers

Cryptography

Encryption

Cloud computing

Keyword search

Data privacy

Searchable encryption

boolean search

verifiability

forward privacy

backward privacy

Towards Efficient Verifiable Boolean Search Over Encrypted Cloud Data

Abstract

Journal

Organization