.png){kind=icon}
Return
Towards Efficient Verifiable Boolean Search Over Encrypted Cloud Data
.png){kind=icon}
PRE
AI
DOI：10.1109/TCC.2021.3118692.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
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
Journal
I
IF:
5
Papers:
1.9K
Citations:
4.3K
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
Catalytic Hydrogenolysis of Biphenylene with Platinum, Palladium, and Nickel Phosphine Complexes
PREAI
ShareSave View more