Group Data Sharing via Cloud Storage by using Key-Aggregate Searchable Encryption (KASE)
|
International Journal of P2P Network Trends and Technology (IJPTT) | |
© 2016 by IJPTT Journal | ||
Volume - 6 Issue - 2 |
||
Year of Publication : 2016 | ||
Authors : P.Shyam Sunder, Dr.k.Venkateshwar Rao |
Citation
P.Shyam Sunder, Dr.k.Venkateshwar Rao "Group Data Sharing via Cloud Storage by using Key-Aggregate Searchable Encryption (KASE)". International Journal of P2P Network Trends and Technology (IJPTT), V6(2):27-30 Mar - Apr 2016, ISSN:2249-2615, www.ijpttjournal.org, Published by Seventh Sense Research Group.
Abstract
The capacity of including the choice imparting scrambled information to various clients through open distributed storage might enormously simplicity security worries over not proposed information spills in the cloud. A key test to planning such encryption plans to be supportable in the proficient administration of encryption keys. The fancied adaptability of imparting any gathering of chose reports to any gathering of clients requirement for something else encryption keys to be utilized for various records. Be that as it may, this likewise suggests the dire need of safely conveying to clients countless for both encryption and seek, and those clients will need to shielded from risk store the got keys, and present a similarly substantial number of catchphrase trapdoors to the cloud keeping in mind the end goal to perform look over the mutual information inferred requirement for secure correspondence, stockpiling, and many-sided quality obviously to provide for somebody the methodology illogical. In this work an information proprietor just needs to disperse a solitary key to a client for sharing an expansive number of records, and the client just needs to present a solitary trapdoor to the cloud for questioning the common archives. Client Revocation is utilized for Key Updation. Forward Secrecy and Backward Secrecy is utilized.
References
1. Baojiang Cui, Zheli Liu_ and Lingyu Wang Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud Storage
2. S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing”, Proc. IEEE INFOCOM, pp. 534-542, 2010.
3. X. Liu, Y. Zhang, B. Wang, and J. Yan. “Mona: secure multiowner data sharing for dynamic groups in the cloud”, IEEE Transactions on Parallel and Distributed Systems, 2013, 24(6): 1182- 1191.
4. C. Chu, S. Chow, W. Tzeng, etal. “Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage”, IEEE Transactions on Parallel and Distributed Systems, 2014, 25(2): 468-477.
5. R. Curtmola, J. Garay, S. Kamara, R. Ostrovsky. “Searchable symmetric encryption: improved definitions and efficient constructions”, In: Proceedings of the 13th ACM conference on Computer and Communications Security, ACM Press, pp. 79-88, 2006.
6. S. Kamara, C. Papamanthou, T. Roeder. “Dynamic searchable symmetric encryption”, Proceedings of the 2012 ACM conference on Computer and communications security (CCS), ACM, pp. 965- 976, 2012.
7. D. Boneh, C. G, R. Ostrovsky, G. Persiano. “Public Key Encryption with Keyword Search”, EUROCRYPT 2004, pp. 506C522,2004.
8. X. Song, D. Wagner, A. Perrig.“Practical techniques for searches on encrypted data”, IEEE Symposium on Security and Privacy, IEEE Press, pp. 44C55, 2000.
9. R. Curtmola, J. Garay, S. Kamara, R. Ostrovsky. “Searchable symmetric encryption: improved definitions and efficient constructions”, In: Proceedings of the 13th ACM conference on Computer and Communications Security, ACM Press, pp. 79- 88, 2006.
10. S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing”, Proc. IEEE INFOCOM, pp. 534-542, 2010.
11. R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance: The Essential of Bread and Butter of Data Forensics in Cloud Computing”, Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010.
Keywords
Cloud Computing, Encryption, Decryption, Cipher text, Data Encryption, Information Storage & Retrieval.