Poojitha . M

Generating Searchable Public-key Ciphertext with Hidden Structures for fast keyword search.

In today’s world, various methods are being deployed to establish a secure communication and fast keyword searching over a network. The existing semantic secure Public-key Encryption with Keyword Search (PEKS) takes linear search time with the total number of ciphertexts which makes it time consuming. Hence retrieval of keywords from the large-scale database is restricted. To tackle with this drawback, our paper gives complete study on Searchable Public-Key Ciphertexts with Hidden Structures (SPCHS) for fast keyword search without sacrificing the linguistic security of encrypted keywords. The keyword searchable ciphertexts are structured by hidden relations, which reveals only a part of information to match the ciphertext efficiently preserving the privacy of the data. Hence the time taken by SPCHS for the keyword search depends on actual number of ciphertext containing queried keyword. To achieve retrieval completeness verification, we use a hidden ring like structure that is the last