Public Key Encryption with ’Fixed and Short Length’ Keyword Search

Abstract

Cloud computing has emerged as a new technology that aims to provide unlimited virtualized resources to clients and enterprises. As services and huge sensitive data are being moved to the cloud server, a new challenge arises as to how to use the migrated data in a way that preserves privacy. Due to privacy concerns, important data should be encrypted before uploading onto cloud servers, so that only authenticated clients can access the data. Searchable encryption techniques allow the clients to search the encrypted data. Public key encryption with keyword search (PEKS) is a scheme of searchable encryption using a public key solution. In our scheme, we present a novel public key encryption with the 'fixed and short length' keyword search which reduce the size of the keyword space and get keywords with a fixed and short length. Further, we employe the Bloom filters (BFs), which can accelerate the search process with a large amount of keywords. We also analyse the security of our construction in the random oracle model.

Enhance manet usability for encrypted data retrieval from cloud computing

“…Song et al [1] first define and suggest the conception of searchable encryption (SE), which is a cryptographic primitive that allows users to perform a keyword-based search on encrypted files [1][2][3][4], as completely as on a plaintext dataset. Searchable encryption can be classified into two fields: symmetric searchable encryption (SSE) [1,5] and asymmetric searchable encryption (ASE) [6][7][8][9][10].…”