Cetus: an efficient symmetric searchable encryption against file-injection attack with SGX

Huang, Yanyu; Lv, Siyi; Liu, Zheli; Song, Xiangfu; Li, Jin; Yuan, Yali; Dong, Changyu

doi:10.1007/s11432-020-3039-x

Cited by 6 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More concretely, we can evaluate ii-bitmap index inside the Trusted Execution Environment. There have been many DSSE works showing how the Trusted Execution Environment helps improve efficiency while maintaining high security [24], [25], [26], [27], [28]. We leave the detailed construction as an open problem to interested readers.…”

Section: B Experimental Resultsmentioning

confidence: 99%

Dynamic Searchable Symmetric Encryption With Strong Security and Robustness

Dou,

Dan,

et al. 2024

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

Dynamic Searchable Symmetric Encryption (DSSE) is a prospective technique in the field of cloud storage for secure search over encrypted data. A DSSE client can issue update queries to an honest-but-curious server for adding or deleting his ciphertexts to or from the server and delegate keyword search over those ciphertexts to the server. Numerous investigations focus on achieving strong security, like forward-and-Type-I −backward security, to reduce the information leakage of DSSE to the server as much as possible. However, the existing DSSE with such strong security cannot keep search correctness and stable security (or robustness, in short) if irrational queries are issued by the client, like duplicate add or delete queries and the delete queries for removing non-existed entries, to the server unintentionally. Hence, this work proposes two new DSSE schemes, named SR-DSSEa and SR-DSSE b , respectively. Both two schemes achieve forward-and-Type-I − -backward security while keeping robustness when irrational queries are issued. In terms of performance, SR-DSSEa has more efficient communication costs and roundtrips than SR-DSSE b . In contrast, SR-DSSE b has a more efficient search performance than SR-DSSEa. Its search performance is close to the existing DSSE scheme with the same security but fails to achieve robustness.

show abstract

Section: B Experimental Resultsmentioning

confidence: 99%

Dynamic Searchable Symmetric Encryption With Strong Security and Robustness

Dou,

Dan,

et al. 2024

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

show abstract

“…Stefanov et al [18] claimed forward privacy by stating that the same search tokens should not match a newly inserted document. File injection attacks [20] can destroy encrypted systems when an SSE scheme lacks forward privacy. Owing to the need for and importance of accommodating multiple users in some systems, several schemes have been developed with the aim of addressing this requirement, as documented in [23,24,29].…”

Section: Previous Workmentioning

confidence: 99%

“…A brief discussion of this concept was presented in [16], and a more detailed discussion in [17][18][19]. Recently, file injection attacks were introduced in [20]. Dynamic SSE schemes now require forward privacy as an essential attribute.…”

Section: Introductionmentioning

confidence: 99%

Fast Multi-User Searchable Encryption with Forward and Backward Private Access Control

Bulbul,

Abduljabbar,

Najem

et al. 2024

JSAN

View full text Add to dashboard Cite

Untrusted servers are servers or storage entities lacking complete trust from the data owner or users. This characterization implies that the server hosting encrypted data may not enjoy full trust from data owners or users, stemming from apprehensions related to potential security breaches, unauthorized access, or other security risks. The security of searchable encryption has been put into question by several recent attacks. Currently, users can search for encrypted documents on untrusted cloud servers using searchable symmetric encryption (SSE). This study delves deeply into two pivotal concepts of privacy within dynamic searchable symmetric encryption (DSSE) schemes: forward privacy and backward privacy. The former serves as a safeguard against the linkage of recently added documents to previously conducted search queries, whereas the latter guarantees the irretrievability of deleted documents in subsequent search inquiries. However, the provision of fine-grained access control is complex in existing multi-user SSE schemes. SSE schemes may also incur high computation costs due to the need for fine-grained access control, and it is essential to support document updates and forward privacy. In response to these issues, this paper suggests a searchable encryption scheme that uses simple primitive tools. We present a multi-user SSE scheme that efficiently controls access to dynamically encrypted documents to resolve these issues, using an innovative approach that readily enhances previous findings. Rather than employing asymmetric encryption as in comparable systems, we harness low-complexity primitive encryption tools and inverted index-based DSSE to handle retrieving encrypted files, resulting in a notably faster system. Furthermore, we ensure heightened security by refreshing the encryption key after each search, meaning that users are unable to conduct subsequent searches with the same key and must obtain a fresh key from the data owner. An experimental evaluation shows that our scheme achieves forward and Type II backward privacy and has much faster search performance than other schemes. Our scheme can be considered secure, as proven in a random oracle model.

show abstract