| 注册
首页|期刊导航|福建师范大学学报(自然科学版)|基于不经意随机访问机的对称可搜索加密技术研究进展

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

樊松林 陈兰香

福建师范大学学报(自然科学版)2026,Vol.42Issue(2):43-53,11.
福建师范大学学报(自然科学版)2026,Vol.42Issue(2):43-53,11.DOI:10.12046/j.issn.1000-5277.2025120044

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

Advances in ORAM-Based Symmetric Searchable Encryption

樊松林 1陈兰香1

作者信息

  • 1. 福建师范大学计算机与网络空间安全学院,福建 福州 350117
  • 折叠

摘要

Abstract

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.

关键词

对称可搜索加密/访问模式/搜索模式/不经意随机访问机/隐藏泄漏

Key words

symmetric searchable encryption/access pattern/search pattern/oblivious random access machine/leakage suppression

分类

信息技术与安全科学

引用本文复制引用

樊松林,陈兰香..基于不经意随机访问机的对称可搜索加密技术研究进展[J].福建师范大学学报(自然科学版),2026,42(2):43-53,11.

基金项目

国家自然科学基金项目(62072105) (62072105)

福建省自然科学基金项目(2024J01068) (2024J01068)

福建师范大学学报(自然科学版)

1000-5277

访问量0
|
下载量0
段落导航相关论文