Achieving Cloud Data Sharing Using Searchable Key Aggregate Encryption BDCaM

SEEE DIGIBOOK ON ENGINEERING & TECHNOLOGY, VOL. 01, APRIL 2020 PP.(27-31)
Abstract– One of the most important features of cloud storage is called Data Sharing, and it allows users to collaborate on files. However, the question that is constantly on everyone’s mind is how to share data with other users of cloud storage in a way that is safe, effective, and flexible. The preferred adaptability of disseminating any collection of selected credentials with any assembly of the user’s challenges different encryption keys to be used for different credentials. On the other hand, this also involves the obligation of steadily distributing to users a massive amount of keys for both encryption and search around, and those users will be required to securely store the traditional keys, and put forward an equally hefty number of keyword trapdoors to the cloud in order to perform search over the shared data. In addition, this involves the obligation of gradually distributing to users a massive amount of keys for both encryption and rummage around. A brand new public-key cryptosystem with the capability of producing cipher texts of a constant size is referred to as KASE. In order to safely share the data, an advanced key sharing system that is based on hint text methodology has been formed. When all of the data sharing is finished, the key aggregate will be different from how it originally appeared. Therefore, the user is unable to correctly guess the key aggregate cryptosystem, and this method provides a more efficient solution than the ones that are currently available.
Index Terms – Data Security, Cloud, Integrity, Bulk Request, Bulk Response, and Dynamic;
REFERENCE

[1] 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.
[2] C. Chu, S. Chow, W. Tzeng, et al. “Key- Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage”, IEEE Transactions on Parallel and Distributed Systems, 2014, 25(2): 468-477. [3]X. Liu, Y. [3] 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.
[4] Chow, W. Tzeng, et al. “Key- Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage”, IEEE Transactions on Parallel and Distributed Systems, 2014, 25(2): 468-477.
[5] X. Song, D.Wagner, A. Perrig. “Practical techniques for searches on encrypted data”, IEEE Symposium on Security and Privacy, IEEE Press, pp. 44C55, 2000.
[6] 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.
[7] P. Van,S. Sedghi, JM. Doumen. “Computationally efficient searchable symmetric encryption”, Secure Data Management, pp. 87-100, 2010.
[8] 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.
[9] D. Boneh, C. G, R. Ostrovsky, G. Persiano. “Public Key Encryption with Keyword Search”, EUROCRYPT 2004, pp. 506C522, 2004.
[10] Y. Hwang,P. Lee. “Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System”, In: Pairing-Based318
Cryptography C Pairing 2007, LNCS, pp. 2-22, 2007.
[11] J. Li, Q. Wang, C. Wang. “Fuzzy keyword search over encrypted data in cloud computing”, Proc. IEEE INFOCOM, pp. 1-5, 2010.
[12] C. Bosch, R. Brinkma,P. Hartel. “Conjunctive wildcard search over encrypted data”, Secure Data Management. LNCS, pp. 114-127, 2011.
[13] C. Dong, G. Russello, N. Dulay. “Shared and searchable encrypted data for untrusted servers”, Journal of Computer Security, pp. 367-397, 2011.
[14] F. Zhao, T. Nishide, K. Sakurai. Multi-User Keyword Search Scheme for Secure Data Sharing with Fine-Grained Access Control. Information Security and Cryptology, LNCS, pp. 406-418, 2012.
[15] J. W. Li, J. Li, X. F. Chen, et al. “Efficient Keyword Search over Encrypted Data with Fine- Grained Access Control in Hybrid Cloud”, In: Network and System Security 2012, LNCS, pp. 490-502, 2012.

Ganeshkumar G, Yamini D, Gokul D, Jeevanekasha, Kabilan K, Lakshmi P
Department of Information Technology,
Rathinam Technical Campus,
Coimbatore, India

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top