2023
DOI: 10.1109/tcc.2021.3118692
|View full text |Cite
|
Sign up to set email alerts
|

Towards Efficient Verifiable Boolean Search Over Encrypted Cloud Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 33 publications
0
4
0
Order By: Relevance
“…Recent works [5,22,27,36] employed homomorphic encryption to support SE functions. Specifically, both full homomorphic encryption (FHE) [27] and partially homomorphic encryption (PHE) [5,22,36] have been adopted due to their ability to perform operations directly on encrypted data, eliminating the need for decryption. In the case where the basic search operations are needed and efficiency is a primary concern, PHE is a better choice.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Recent works [5,22,27,36] employed homomorphic encryption to support SE functions. Specifically, both full homomorphic encryption (FHE) [27] and partially homomorphic encryption (PHE) [5,22,36] have been adopted due to their ability to perform operations directly on encrypted data, eliminating the need for decryption. In the case where the basic search operations are needed and efficiency is a primary concern, PHE is a better choice.…”
Section: Related Workmentioning
confidence: 99%
“…To provide more search capability, there are schemes that can support both multiple keyword and Boolean expressions [4,21,27] which deal with more complexity of the index structure and search conditions.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…With the development of blockchain technology, many scholars apply blockchain technology to cloud data integrity audits [23].…”
Section: Related Workmentioning
confidence: 99%