OpenSE: Efficient Verifiable Searchable Encryption With Access and Search Pattern Hidden for Cloud-IoT

IEEE Internet of Things Journal(2023)

引用 0|浏览1
暂无评分
摘要
The Internet of Things (IoT) has greatly changed our lives and generated a large amount of data. Cloud storage helps IoT limited-resource IOT devices process the massive data. However, cloud servers are untrusted in most scenarios as they may illegally obtain sensitive data. Although existing symmetric searchable encryption (SSE) schemes can protect the privacy of outsourced data while preserve data availability, Most of them leak access and search patterns to the cloud server to gain better performance. Such leakages will be used to recover private information. Meanwhile, semi-honestly secure searchable encryption cannot prevent attacks done by the malicious server such as returning the false search result. Therefore, it is still a challenge to prevent malicious cloud server misbehavior, and preserve patterns, simultaneously. This paper proposes OpenSE to solve the aforementioned problems. First, this paper constructs FastOPE as a major building block. With the OPE protocol, the verifiable searchable encryption OpenSE can be trivially realized. After that, security proofs show that OpenSE is secure against malicious cloud servers with access and search pattern hidden. Finally, we implement experiments on real datasets to compare OpenSE with some state-of-the-art works in terms of running time of setup phase and search phase as well as storage overhead. The experimental results show that OpenSE outperforms the state-of-the-art works in terms of setup phase and storage overhead. In addition, the theoretic comparison shows that OpenSE outperforms most existing works in terms of security, in which OpenSE enjoys both verifiability and pattern hidden.
更多
查看译文
关键词
Cloud-Internet of Things,Oblivious Polynomial Evaluation,Polynomial Commitment Scheme
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要