Generating Searchable Public-Key Cipher Texts with Hidden Structures for Fast Keyword Search

Abstract

— Present day’s definition of protection of public- key finding encryption idea take find time linear with the total number of the cipher texts. This makes renewal from large-scale databases preventing. To eradicate this problem, this paper introduce finding Public-Key Cipher texts with Hidden Structures (SPCHS) for keyword find as quick as possible without losing definition protection of the encrypted keywords. In SPCHS, all keyword-finding cipher texts are efficient by private relations, and with the find trapdoor identical to a keyword, the minimal message of the relations is expose to a find algorithm as the advice to search all identical cipher texts effortlessly. We construct a SPCHS chart from scratch in which the cipher texts have a private star-like structure. We prove our chart to be definition protection in the Random Oracle (RO) model. The find complication of our chart is defenseless t on the actual number of the cipher texts involving the queried keyword, rather than the number of all cipher texts. Finally, we present a generic SPCHS construction from nameless identity-based encryption and collision-free full-identity malleable Identity-Based Key Encapsulation Mechanism (IBKEM) with anonymity. We illuminate two collision-free full-identity malleable IBKEM instances, which are semantically secure and anonymous, respectively, in the RO and standard models. The recent instance enables us to construct an SPCHS chart with semantic protection in the standard model.