Achieving Pattern Hidden Symmetric Searchable Encryption Based on Oblivious Polynomial Evaluation

This paper proposes a symmetric searchable encryption scheme that hides both search pattern and access pattern. The protocol allows users to obtain correct search results on ciphertexts without leaking privacy. We introduce an efficient and secure Oblivious polynomial evaluation protocol (ESOPE) to achieve pattern hiding. Compared to existing schemes, our approach eliminates the need for auxiliary participants, thereby reducing the risk of privacy breaches. Moreover, our protocol demonstrates significant improvements in both time efficiency and storage efficiency across datasets of various sizes.