Cloud Data Allocation for Members Data Using KASE

B TIRUPATHI KUMAR, SUMA MALAKA

Abstract


The capability of selectively sharing encrypted facts with one kind of users via public cloud storage may additionally substantially ease safety issues over inadvertent statistics leaks inside the cloud. A key undertaking to designing such encryption schemes lies in the efficient management of encryption keys. The favored flexibility of sharing any institution of selected documents with any organization of customers demands different encryption keys to be used for unique files. But, this additionally implies the necessity of securely dispensing to users a massive variety of keys for both encryption and seeks, and people customers will have to securely shop the acquired keys, and submit an equally huge variety of keyword trapdoors to the cloud for you to carry out search over the shared statistics. The implied need for comfy communication, storage, and complexity genuinely renders the approach impractical. Here, we cope with this sensible trouble, which is essentially omitted inside the literature, through providing the radical concept of key aggregate searchable encryption (kase) and instantiating the idea via a concrete kase scheme, wherein a records owner simplest wishes to distribute a single key to a user for sharing a huge variety of documents, and the user best needs to post a single trapdoor to the cloud for querying the shared files. The security analysis and overall performance evaluation both verify that our proposed schemes are provably comfy and nearly green. Index termss: searchable encryption, records sharing, cloud storage, records privacy.


Full Text:

PDF




Copyright (c) 2016 B TIRUPATHI KUMAR, SUMA MALAKA

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

 

All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 


Paper submission: ijr@pen2print.org