Enthusiasm for ensuring the information protection in secure searchable distributed storage. In this paper, we research the security of a notable cryptographic primitive, in particular, public key encryption with keyword search (PEKS) which is exceptionally valuable in numerous utilizations of cloud storage. Keyword Search for Secure Cloud Storage with Dual-Server Public Key Encryption PABBU SREENU 1, K. SADA SHIVA RAO 2, D. PRATIBHA 3 1PG Scholar, Dept of CSE, Sri Indu Institute of Engineering & Technology, Hyderabad, TS, India, Email: [email protected].
Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud Storage. by:. in:. note:Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud StorageABSTRACT:The capability of selectively sharing encrypted data with different users via public cloud storage may greatly ease security concerns over inadvertent data leaks in the cloud. A key challenge to designing such encryption schemes lies in the efficient management of encryption keys. The desired flexibility of sharing any group of selected documents with any group of users demands different encryption keys to be used for different documents. However, this also implies the necessity of securely distributing to users a large number of keys for both encryption and search, and those users will have to securely store the received keys, and submit an equally large number of keyword trapdoors to the cloud in order to perform search over the shared data.
The implied need for secure communication, storage, and complexity clearly renders the approach impractical. In this paper, we address this practical problem, which is largely neglected in the literature, by proposing the novel concept of key aggregate searchable encryption (KASE) and instantiating the concept through a concrete KASE scheme, in which a data owner only needs to distribute a single key to a user for sharing a large number of documents, and the user only needs to submit a single trapdoor to the cloud for querying the shared documents. The security analysis and performance evaluation both confirm that our proposed schemes are provably secure and practically efficient.PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):EXISTING SYSTEM:. There is a rich literature on searchable encryption, including SSE schemes and PEKS schemes.
![]()
In contrast to those existing work, in the context of cloud storage, keyword search under the multi-tenancy setting is a more common scenario.
AbstractSearchable encryption is of increasing interest for protecting the data privacy in secure searchable cloud storage. In this paper, we investigate the security of a well-known cryptographic primitive, namely, public key encryption with keyword search (PEKS) which is very useful in many applications of cloud storage. Unfortunately, it has been shown that the traditional PEKS framework suffers from an inherent insecurity called inside keyword guessing attack (KGA) launched by the malicious server. To address this security vulnerability, we propose a new PEKS framework named dual-server PEKS (DS-PEKS). As another main contribution, we define a new variant of the smooth projective hash functions (SPHFs) referred to as linear and homomorphic SPHF (LH-SPHF). We then show a generic construction of secure DS-PEKS from LH-SPHF.
To illustrate the feasibility of our new framework, we provide an efficient instantiation of the general framework from a Decision Diffie-Hellman-based LH-SPHF and show that it can achieve the strong security against inside the KGA.
Comments are closed.
|
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |