Public Key Encryption with Content Search

Today's network faces problems over secure communication so various methods are developed to deal with problems. Previous Technique deals with the public key encryption with semantic security. In this technique the sender sends or uploads any file to the server with one keyword and at another end receiver downloads the file by searching the desired keyword but server is not able to reveal anything. Existing systems take searching time linear with the actual numbers of cipher texts. This makes difficult to retrieve the keywords from large scale database. To tackle with this problem we can implement the SPCHS but the pervious one doesn’t tackle with the content searching. In this paper we provide solution for this by implementing the SPCHS algorithm for content searching. The SPCHS generates the keyword searchable cipher texts so following same technique we are generating content searchable cipher texts with provision of search trapdoor which is corresponds to the content. In the generation of hidden structures we are applying the chain of content searchable cipher texts and this structure is useful to make search fast. In this technique the search complexity is linear with the actual queried content. While working with the SPCHS we are constructing it by using identity based encryption and collision free, full identity malleable and Identity Based Key Encapsulation Mechanism. Such type of content searching is very useful in case to filter the unwanted spam file or mails. Finally we present SPCHS algorithm for content searching and reporting the spam mail to the server.