INTRODUCTIONThe explosive growth of cloud computing provides many organizations a way of storing their information in the clouds and utilizing the cheap computing resources effectively. Many businesses want to ensurethat information stored in clouds remains confidential and not easily accessible to non-privileged users. The preference is to store the encrypted unstructured documents over the cloud. The businesses also want to run searches on encrypted unstructured document databases in a fast and effective manner, is an active area of research among the researchers.In the literature, searchable symmetric encryption [14] is a helpful technique that allows the user to perform queries over the encrypted documents. However, a faster search over a large collection of encrypted unstructured documents is not possible. There are two high-level approaches to design reasonably efficient and secure schemes using the searchable symmetric encryption; dynamic and static. In Dynamic Searchable Symmetric Encryption (DSSE) [14,15,18,19,20,24], encrypted keyword searches should be supported even after the documents are randomly inserted or deleted from the collections. In this approach, one of the first notable papers by Goh presented an algorithm for a document index construction based on the secure word [1,2,15]. Goh also presented a technique to perform searches on these secure word indexes without having to decrypt the complete document. This scheme provides linear time search over a document collection.The second approach is Static Searchable Symmetric Encryption (SSSE) [16,17,22,23], work on static data i.e., there is a setup phase that produces an encrypted index for a set of collection of documents and after that phase no insertion or deletion of documents is supported. In static approach, first notable paper by Curtmola et al. [17]