Dynamic Searchable Symmetric Encryption (DSSE) empowers cloud servers to execute search queries on encrypted user documents while maintaining the encryption of both queries and documents. This technology also supports efficient updates to the document set by the user. However, most current DSSE approaches rely on the “honest-but-curious” server model, where the cloud server is expected to follow the protocol without deviation. Given that cloud servers are not always fully trustworthy, this assumption can be problematic in real-world scenarios. In our paper, we introduce a new forward-private DSSE scheme that includes efficient result verification. To achieve this, the server must provide a “verification token” with the search results to confirm the integrity of the data returned. We enhance retrieval efficiency by using a customized \(B^{+}\) tree to store verification token values and a tailored linked-list data structure. Our cost-effective scheme supports both document updates and searches. Security proofs and performance evaluations demonstrate the scheme’s practicality, efficiency, and robust security.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

An Innovative DSSE Framework: Ensuring Data Privacy and Query Verification in Untrusted Cloud Environments

  • Khosro Salmani

摘要

Dynamic Searchable Symmetric Encryption (DSSE) empowers cloud servers to execute search queries on encrypted user documents while maintaining the encryption of both queries and documents. This technology also supports efficient updates to the document set by the user. However, most current DSSE approaches rely on the “honest-but-curious” server model, where the cloud server is expected to follow the protocol without deviation. Given that cloud servers are not always fully trustworthy, this assumption can be problematic in real-world scenarios. In our paper, we introduce a new forward-private DSSE scheme that includes efficient result verification. To achieve this, the server must provide a “verification token” with the search results to confirm the integrity of the data returned. We enhance retrieval efficiency by using a customized \(B^{+}\) tree to store verification token values and a tailored linked-list data structure. Our cost-effective scheme supports both document updates and searches. Security proofs and performance evaluations demonstrate the scheme’s practicality, efficiency, and robust security.