Creating Searchable Public-Key Ciphertexts with Hidden Structure for Efficient Keyword Search

Abstract

Old system public-key searchable encryption schemes get semantically secure it takes massive search time linear with the complete vary of the cipher texts. This makes retrieval from large-scale databases preventative. To alleviate this downside, this paper proposes Searchable Public-Key Ciphertexts with Hidden Structures (SPCHS) for keyword search as fast as attainable while not sacrificing linguistics security of the encrypted keywords. In SPCHS, all keyword-searchable ciphertexts ar structured by hid- den relations, and with the search trapdoor admire a keyword, the minimum information of the relations is disclosed to a look algorithmic program as a result of the steering to hunt out all matching ciphertexts efficiently. Construct a SPCHS theme from scratch within that the ciphertexts have a hidden star-like structure. prove our theme to be semantically secure inside the Random Oracle (RO) model. The search quality of our theme depends on the actual vary of the ciphertexts containing the queried keyword, rather than the amount of all ciphertexts. Finally, gift a generic SPCHS construction from anonymous identity-based encryp- tion and collision-free full-identity malleable Identity-Based Key Encapsulation Mechanism with obscurity.