.png){kind=icon}
返回
An Efficient Oblivious Random Data Access Scheme in Cloud Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/TCC.2022.3173260.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the development of cloud computing and cloud storage techniques, much attention has been focused on the privacy protection of outsourced data. Existing searchable encryption solutions can ensure the confidentiality and availability of data stored on the cloud. However, searchable encryption is vulnerable to statistical inference attacks, which exploit the disclosure of access patterns on encrypted indexes and encrypted file sets, which has become a potential way to reveal user privacy. Oblivious randomaccess memory (ORAM) is an important means of concealing access patterns, yet its direct use in searchable encryptions is expensive. This paper presents a scheme for efficient and oblivious access to encrypted databases through encrypted indexes. This scheme is a hybrid ORAM scheme, which utilizes semi-homomorphic encryption to performcalculations in the ciphertext domain, overcoming the limitations of the huge overhead associated with Path-ORAM. For excessive amounts of data, semi-homomorphic encryption can significantly reduce communication and storage overhead. Our scheme can achieve high-security encrypted search and update operations at the same time. Moreover, the execution speed of ODS-Tree is 2-8x faster than that of ORAM-based schemes. In addition, the proposed scheme reduces the data block transmission and storage costs compared to existing frameworks.
Keyword:
Access pattern
cloud computing
oblivious random access
期刊
I
IF:
5
论文数:
1.9K
被引数:
4.3K
机构
引用论文
分享收藏分享收藏分享收藏分享收藏M-SSE: An Effective Searchable Symmetric Encryption With Enhanced Security for Mobile Devices.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容