Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud Storage

Authors(4) :-Rupali Khairnar, Gayatri Nikhade, Kavita Kad, Aasha Gade

Keyword search under the multi-tenancy setting is a more common scenario. In such a scenario, the data owner would like to share a document with a group of authorized users, and each user who has the access right can provide a trapdoor to perform the keyword search over the shared document, namely, the “multi-user searchable encryption" (MUSE) scenario. Some recent work focus to such a MUSE scenario, although they all adopt single-key combined with access control to achieve the goal. In, MUSE schemes are constructed by sharing the documents searchable encryption key with all users who can access it, and broadcast encryption is used to achieve coarse-grained access control. attribute based encryption (ABE) is applied to achieve fine-grained access control aware keyword search. As a result, in MUSE, the main problem is how to control which users can access which documents, whereas how to reduce the number of shared keys and trapdoors is not considered. Key aggregate searchable encryption can provide the solution for the latter, and it can make MUSE more efficient and practical. The aim of proposed work is to design an Extended Cryptographic Mechanism for Secured Data Sharing in Cloud using Multiple Keys. Data sharing is an important functionality in cloud storage. In this project, we show how to securely, efficiently, and flexibly share data with others in cloud storage. We describe new public-key crypto-systems that produce cipher texts such that efficient delegation of decryption rights for any set of cipher texts is possible.

Authors and Affiliations

Rupali Khairnar
Computer Department, Savitribai Phule, Pune University, Nashik, Maharashtra, India
Gayatri Nikhade
Computer Department, Savitribai Phule, Pune University, Nashik, Maharashtra, India
Kavita Kad
Computer Department, Savitribai Phule, Pune University, Nashik, Maharashtra, India
Aasha Gade
Computer Department, Savitribai Phule, Pune University, Nashik, Maharashtra, India

Searchable Encryption, Data Sharing, Cloud Storage, Data Privacy

  1. C. Chang and H. C. Huang, \Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage," Inf. Sci., vol. 192, no. 1, pp. 3949, Jun. 2012.
  2. S. M. Chow, Y. J. He, L. C. K. Hui, and S.-M. Yiu, \SPICE - Simple Privacy-Preserving Identity-Management for Cloud Environment," in Applied Cryptography and Network Security. ACNS 2012, ser. LNCS, vol. 7341. Springer, 2012, pp. 526543. pp. 173184, 2011.
  3. Hardesty, Secure computers arent so secure, \MIT press,"2009,http://www.physorg.com/news176107396.html.
  4. Goyal, O. Pandey, A. Sahai, and B. Waters, \Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data, Proc," 13th ACM Conf. Computer and Comm. Security (CCS 06),pp. 89-98, 2006.
  5. S.M. Chow, Y. Dodis, Y. Rouselakis, and B. Waters, \Practical Leakage- Resilient Identity-Based Encryption from Simple Assumptions ," in Proc. ACM Conf. Computer and Comm. Security, pp. 152-161, 2010.
  6. Ateniese, A.D. Santis, A.L. Ferrara, and B. Masucci, \Provably-Secure Time-Bound Hierarchical Key Assignment Schemes, ,"J. Cryptology.,vol. 25, no. 2, pp. 243-270, 2012.
  7. Guo, Y. Mu, Z. Chen, and L. Xug, \Multi-Identity Single-Key Decryption without Random Oracles", in Proceedings of Information Security and Cryptology (Inscrypt 07), ser. LNCS, vol. 4990. Springer, 2007, pp. 384398.

Publication Details

Published in : Volume 2 | Issue 6 | November-December 2016
Date of Publication : 2016-12-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 458-462
Manuscript Number : IJSRST162677
Publisher : Technoscience Academy

Print ISSN : 2395-6011, Online ISSN : 2395-602X

Cite This Article :

Rupali Khairnar, Gayatri Nikhade, Kavita Kad, Aasha Gade, " Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud Storage", International Journal of Scientific Research in Science and Technology(IJSRST), Print ISSN : 2395-6011, Online ISSN : 2395-602X, Volume 2, Issue 6 , pp.458-462, November-December-2016.
Journal URL : http://ijsrst.com/IJSRST162677

Article Preview