Skip to main navigation Skip to search Skip to main content

Towards Efficient Verifiable Boolean Search Over Encrypted Cloud Data

  • Feng Li
  • , Jianfeng Ma
  • , Yinbin Miao*
  • , Zhiquan Liu
  • , Kim-Kwang Raymond Choo
  • , Ximeng Liu
  • , Robert H. Deng
  • *Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

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. © 2021 IEEE.
Original languageEnglish
Pages (from-to)839-853
JournalIEEE Transactions on Cloud Computing
Volume11
Issue number1
Online published8 Oct 2021
DOIs
Publication statusPublished - Jan 2023

Research Keywords

  • Privacy
  • Servers
  • Cryptography
  • Encryption
  • Cloud computing
  • Keyword search
  • Data privacy
  • Searchable encryption
  • boolean search
  • verifiability
  • forward privacy
  • backward privacy
  • SYMMETRIC-ENCRYPTION

Fingerprint

Dive into the research topics of 'Towards Efficient Verifiable Boolean Search Over Encrypted Cloud Data'. Together they form a unique fingerprint.

Cite this