BibTeX:

@article{IJIRSTV3I5019,
     title={Keyword Search on Public Key Ciphertexts with Reduced Overhead using a Query Based Ranking System},
     author={CP Ramya, Vipin KM and Mary Mareena},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={3},
     number={5},
     pages={69--73},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV3I5019.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}

Since it is necessary to store data on different storage devices so to have privacy and security. It is desirable to encrypt the data before storing them. As the data is stored in a third party storage device in encrypted form it is very difficult to search data in its encrypted form, thus making the retrieval process difficult in large scale databases. There are many mechanisms to search and retrieve the encrypted data. The most trending searching method is based on keyword search on public key cipher texts. Existing systems takes enormous time to search and retrieve the encrypted set of keywords. This paper proposes a semantically secure searching mechanism by structuring the searchable cipher text with hidden relations with trapdoor corresponding to each keyword providing minimum information about the relation to the search algorithm. Here we add a ranking system for faster retrieval of frequently used files. This feature is useful when there is huge number of matched files, but the user only needs a small subset from those files hence by reducing the overall searching overhead.

Key Word Search, Identity based Encryption, Ciphertext Security, Weil Pairing