Searchable encryption using polynomial function and modular arithmetic
Muhammad Ahtazaz Ahsan, Musarat Sabilah, Md Abdullah Al Imran, Mohd Yamani Idna Idris · 2017
With the advent of cloud computing more and more IT and business organizations are migrating to cloud for its entrancing features of computing and storage infrastructure. At the same, security, privacy of cloud computing is not at satisfactory level. To make things worse, clouds inherent nature brought new set of security issues. Specially, the cloud storage causes dilemma between two important factors: confidentiality and search facility. To preserve the confidentiality of data, user encrypts before outsourcing to cloud which deters user to search on encrypted data. An appropriate solution to the problem is searchable encryption (SE). In this paper, we study existing schemes of SE and enlist two security requirements: secure tag (or trapdoor) irreversibility and dynamic update of index. Lastly, we propose a searchable encryption scheme based on polynomial function and modular arithmetic. Our security analysis shows that, proposed scheme holds the necessary properties for SE.