Public Key Encryption With Conjunctive Field Free Keyword Search Scheme

Abstract

Searchable encryption allows a remote server to search over encrypted documents without knowing the sensitive data contents. Prior searchable symmetric encryption schemes focus on single keyword search. Conjunctive Keyword Searches (CKS) schemes improve system usability by retrieving the matched documents. In this type of search, the user has to repeatedly perform the search protocol for many times. Most of existent (CKS) schemes use conjunctive keyword searches with fixed position keyword fields, this type of search is not useful for many applications, such as unstructured text. In our paper, we propose a new public key encryption scheme based on bilinear pairings, the scheme supports conjunctive keyword search queries on encrypted data without needing to specify the positions of the keywords where the keywords can be in any arbitrary order. Instead of giving the server one trapdoor for each keyword in the conjunction set, we use a bilinear map per a set of combined keywords to make them regarded as one keyword. In another meaning, the proposed method will retrieve the data in one round of communication between the user and server. Furthermore, the search process could not reveal any information about the number of keywords in the query expression. Through analysis section we determine how such scheme could be used to guarantee fast and secure access to the database.

A Hybrid Improved Zhou and Wornell’s Inspired Fully Homomorphic Encryption Scheme for Securing Big Data Computation in Cloud Environment

“…Cluster based mechanism has been presented for mitigating DDoS attacks. Nguyen and Choi [14] in 2016 have presented a method which aids in identification of DDoS attacks based on the network conditional parameters. With reference to the key features the key variable are chosen and based on thenearest neighbor method the network conditions and performance are classified.…”