Generating Searchable Public-Key Ciphertexts With Hidden Structures For Fast Keyword Search

ABSTRACT:

Existing semantically secure public-key searchable encryption schemes take search time linear with the total number of the cipher texts. This makes retrieval from large-scale databases prohibitive. To alleviate this problem, this paper proposes Searchable Public-Key Cipher texts with Hidden Structures (SPCHS) for keyword search as fast as possible without sacrificing semantic security of the encrypted keywords. In SPCHS, all keyword-searchable cipher texts are structured by hidden relations, and with the search trapdoor corresponding to a keyword, the minimum information of the relations is disclosed to a search algorithm as the guidance to find all matching cipher texts efficiently. We construct a SPCHS scheme from scratch in which the cipher texts have a hidden star-like structure. We prove our scheme to be semantically secure in the Random Oracle (RO) model. The search complexity of our scheme is dependent on the actual number of the ciphertexts containing the queried keyword, rather than the number of all ciphertexts. Finally, we present a generic SPCHS construction from anonymous identity-based encryption and collision-free full-identity malleable Identity-Based Key Encapsulation Mechanism (IBKEM) with anonymity. We illustrate two collision-free full-identity malleable IBKEM instances, which are semantically secure and anonymous, respectively, in the RO and standard models. The latter instance enables us to construct an SPCHS scheme with semantic security in the standard model.

AIM

To improve search performance in PEKS without sacrificing semantic security if one can organize the cipher texts with elegantly designed but hidden relations.

SCOPE

It focus on enabling search over encrypted keywords to be as efficient as the search for unencrypted keywords, such that a cipher text containing a given keyword can be retrieved in time complexity logarithmic in the total number of all cipher texts.

EXISTING SYSTEM

Existing semantically secure PEKS schemes take search time linear with the total number of all cipher texts. This makes retrieval from large-scale databases prohibitive. Therefore, more efficient search performance is crucial for practically deploying PEKS schemes. An encryption scheme is deterministic if the encryption algorithm is deterministic. focus on enabling search over encrypted keywords to be as efficient as the search for unencrypted keywords, such that a cipher text containing a given keyword can be retrieved in time complexity logarithmic in the total number of all cipher texts. This is reasonable because the encrypted keywords can form a tree-like structure when stored according to their binary values.

DISADVANTAGES:

1. Keyword  privacy can be guaranteed only for keywords that are a priori hard to guess by the adversary
2.  It certain information of a message leaks inevitably via the cipher text of the keywords since the encryption is deterministic.

 PROPOSED SYSTEM

The concept of Searchable Public-key Cipher texts with Hidden Structures (SPCHS) and its semantic security. In this new concept, keyword searchable cipher texts with their hidden structures can be generated in the public key setting; with a keyword search trapdoor, partial relations can be disclosed to guide the discovery of all matching cipher texts. Semantic security is defined for both the keywords and the hidden structures. It is worth noting that this new concept and its semantic security are suitable for keyword-searchable cipher texts with any kind of hidden structures. In contrast, the concept of traditional PEKS does not contain any hidden structure among the PEKS cipher

text correspondingly, its semantic security is only defined for the keywords.

ADVANTAGES

1.  To  solve some challenging problems in public-key searchable encryption
2.  To achieve retrieval completeness verification.

 SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

·       Processor  -   Pentium –III

·      Speed            -    1.1 Ghz

·      RAM             -    256 MB(min)

·      Hard Disk              -   20 GB

·      Floppy Drive         -    1.44 MB

·      Key Board             -    Standard Windows Keyboard

·      Mouse           -    Two or Three Button Mouse

·      Monitor                 -    SVGA

SOFTWARE REQUIREMENTS:-

·      Operating System          : Windows  7                                  

·      Front End                      : JSP AND SERVLET

·      Database                       : MYSQL

REFERENCE:

Xu, P.Wu, Q. ; Wang, W. ; Susilo, W. “GENERATING SEARCHABLE PUBLIC-KEY CIPHERTEXTS WITH HIDDEN STRUCTURES FOR FAST KEYWORD SEARCH” IEEE Transactions on Information Forensics and Security, VOL PP, ISS 99,JUNE 2015.