基于不经意随机访问机的对称可搜索加密技术研究进展OA

Symmetric searchable encryption SSE)enables users to outsource encrypted data to honest-but-curious cloud servers while retaining the ability to execute search queries over cipher-text.However,despite encryption,the interaction between users and the server can still disclose sensi-tive information,such as access and search patterns,thereby posing significant security risks to SSE systems.Oblivious random access machine ORAM)techniques address this issue by concealing data access behaviors through access-pattern obfuscation and have consequently been integrated into a va-riety of SSE schemes to suppress such leakage.Nevertheless,ORAM-based approaches suffer from in-herent limitations,including high computational complexity and substantial communication overhead.Starting from the underlying design and implementation mechanisms of SSE and ORAM,this study explores the security-efficiency trade-offs in their integrated schemes,systematically surveys the state-of-the-art in ORAM-based SSE,and proposes potential directions for future research in this area.