2026· IEEE Transactions on Information Forensics and Security· Vol 21, pp. 8616-8630· 0 citations· 50 references
Abstract
Dynamic Searchable Symmetric Encryption (DSSE) enables efficient searches over encrypted data but often suffers from search pattern leakage, allowing adversaries to infer sensitive information. While schemes using Oblivious RAM (ORAM) mitigate leakage, their high cost hinders large-scale applications. Dory adopts a multi-server architecture with distributed point functions (DPFs) to reduce leakage and improve performance. However, a key limitation of this architecture is the lack of a mechanism to track and hold malicious servers accountable. Although Dory assumes malicious servers, it does not provide a way to monitor their behavior or enforce accountability. This represents an important challenge for the system. Moreover, Dory only supports single-keyword queries and works in the single-client setting, which limits its practicality. We propose <monospace>Tramy</monospace>, a more practical DSSE scheme that allows multiple clients to access the dataset with conjunctive queries. More importantly, it can track malicious servers. <monospace>Tramy</monospace> also hides the search pattern and achieves forward and backward privacy. To achieve these, we propose a new primitive called <monospace>M</monospace>atrix-based <monospace>M</monospace>ulti-<monospace>P</monospace>oint <monospace>R</monospace>etrieval (<monospace>MMPR</monospace>) to protect the search pattern and introduce a novel data structure—<monospace>M</monospace>alice-<monospace>D</monospace>efend <monospace>B</monospace>loom <monospace>F</monospace>ilter (<monospace>MDBF</monospace>). This data structure can not only support conjunctive queries, but also enable integrity verification on the server’s response results, thereby significantly enhancing security. <monospace>Tramy</monospace> supports precise authorization for multiple clients and constructs an access mechanism for multi-client scenarios. Finally, comprehensive benchmark tests show that, compared to the state-of-the-art, <monospace>Tramy</monospace> can effectively resist adaptive adversaries and achieve up to <inline-formula> <tex-math notation="LaTeX">$20\times $ </tex-math></inline-formula> performance improvements.
A novel VMKSE scheme (VMKSE-BFF) is presented by adopting BFF, which can simultaneously support verifiability of and secure data sharing in a multi-user setting and a comparison with the existing VMKSE schemes is provided.
Yandong Su, Bing-Hang Wang, Yan-Jie Xiang et al.· Mathematics· 0 citations
A practical searchable symmetric encryption (SSE) should allow users to privately store documents on untrusted servers with the abilities to (1) search with multiple keywords, and (2) add or delete documents dynamically. The oblivious cross tag (OXT) construction from Crypto’13 is the most efficient SSE scheme that all...
M. A. Abdelraheem, Sanjay Bhattacherjee, Théo Henault et al.· International Journal of Inf...· 0 citations
It is proved that TriVer satisfies client data privacy, aggregation correctness, and aggregation-result non-forgeability in the Random Oracle Model under ECDLP hardness, HPRF pseudorandomness, and hash collision resistance, against a fully malicious server that may collude with a subset of aggregators and clients.
Guang-Ye Zhu, Liqiang Wu, Wei-Dong Du· Journal of King Saud Univers...· 0 citations
This work proposes lightweight multi-secret-key protocols for private average aggregation based on RLWE-based Homomorphic Encryption, which substantially reduces ciphertext expansion and online cost, while preserving practical homomorphic aggregation performance.
Miguel Morona-Mínguez, Fernando Pérez-González, A. Pedrouzo-Ulloa· 0 citations