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

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 preserving data availability. Most of them leak access and search patterns to the cloud server (CS) to gain better performance. Such leakages will be used to recover private information. Meanwhile, semi-honestly secure searchable encryption (SE) cannot prevent attacks done by the malicious server such as returning the false search result. Therefore, it is still a challenge to prevent malicious CS misbehavior, and preserve patterns, simultaneously. This article proposes OpenSE to solve the aforementioned problems. First, this article constructs FastOPE as a major building block. With the oblivious polynomial evaluation (OPE) protocol, the verifiable SE 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 data sets to compare OpenSE with some state-of-the-art works in terms of the running time of the 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.