Author
Abstract
Cloud computing is cutting-edge technology greatly serving consumer oriented applications. It has the abilities of sharing selective encrypted knowledge by way of public cloud storage with a couple of customers which may alleviate protection over unintended information leaks in the cloud. Efficient key management is fundamental in encryption schemes. For sharing various records with one-of-a-kind organizations in cloud, separate encryption keys are required. Protection is required by way of owner to distribute large number of keys for encryption and shopping, and with the aid of users to store received keys. Users ought to put up equal number of trapdoors to the cloud for search operation. In such case elements of security, storage and complexity are required at its best performance. In this paper we addressed the quandary of comfy information sharing method in cloud storage and studied special searchable encryption systems with multi-user and multi-key schemes with aggregation of a couple of attributes to minimize storage complexity and give a boost to effectivity of search over shared data. A mannequin for Key-aggregate Searchable Encryption(KASE) scheme is proposed, wherein an information owner handiest necessitate to distribute a single key to a person for sharing a significant number of records, and the person best desires to put up a single trapdoor to the cloud for querying the shared documents.
Suggested Citation
T. Muneiah & D. K. Shareef, 2017.
"Secure Data Sharing In Distributed Cloud Storage Using a Novel Searchable Encryption,"
International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 2(6), pages 192-196, December.
Handle:
RePEc:jbh:ijsrcs:v2:y2017:i6:id:hcseit172617
Note: Article URL: https://ijsrcseit.com/CSEIT172617
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v2:y2017:i6:id:hcseit172617. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.