Key Aggregate Searchable Encryption for Group Data Sharing Via Cloud Data Storage
Main Article Content
Abstract
the ability of preferentially sharing encrypted data with unlike users through public cloud storage might really ease security distress, by possibility data disclose in the cloud. A key test to design such encryption idea lies in the well-organized management encryption keys. The preferred flexibility of allocating any group documents with any group of users by attaining weightage different encryption keys to be used for different documents. On the other hand, this involves the need of securely distributing to users by a large number of keys for both encryption and search, and those users have to progress to store the received keys. The indirect need for secure communication, storage, and complexity clearly cause the unreasonable approach. In this paper, we concentrate on this practical problem, by suggesting the novel concept of key aggregate searchable encryption (KASE) and instantiating the idea through a real KASE scheme, in which a data owner wants to share out a single key to a user for distributing a large number of documents, and the user needs to present a single trapdoor to the cloud for questioning the shared documents.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
Baojiang Cui, Zheli Liu and Lingyu Wang : Key-Aggregate Searchable Encryption for Group Data Sharing via Cloud Storage, IEEE Transactions On Computers, Vol. 6, No. 1, January 2014
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.
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.
C. Chu, S. Chow,W. Tzeng, et al. “KeyAggregate Cryptosystem for Scalable Data Sharing in Cloud Storage”, IEEE Transactions on Parallel and Distributed Systems, 2014, 25(2): 468-477.
X. Song, D.Wagner, A. Perrig. “Practical techniques for searches on encrypted data”, IEEE Symposium on Security and Privacy, IEEE Press, pp. 44C55, 2000.
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.
P. Van,S. Sedghi, JM. Doumen. “Computationally efficient searchable symmetric encryption”, Secure Data Management, pp.87- 100, 2010.
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.
D. Boneh, C. G, R. Ostrovsky, G. Persiano. “Public Key Encryption with Keyword Search”, EUROCRYPT 2004, pp. 506C522,2004.
Y. Hwang, P. Lee. “Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System”, In: PairingBased Cryptography C Pairing 2007, LNCS, pp. 2-22, 2007.
J. Li, Q. Wang, C. Wang. “Fuzzy keyword search over encrypted data in cloud computing”, Proc. IEEE INFOCOM, pp. 1-5, 2010.
C. Bosch, R. Brinkma, P. Hartel. “Conjunctive wildcard search over encrypted data”, Secure Data Management. LNCS, pp. 114- 127, 2011.
C. Dong, G. Russello, N. Dulay. “Shared and searchable encrypted data for untrusted servers”, Journal of Computer Security pp. 367-397, 2011.
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.
J. W. Li, J. Li, X. F. Chen, et al. “Efficient Keyword Search over Encrypted Data with FineGrained Access Control in Hybrid Cloud”, In: Network and System Security 2012, LNCS, pp. 490- 502, 2012.
J. Li, K. Kim. “Hidden attribute-based signatures without anonymity revocation”, Information Sciences, 180(9): 1681-1689, Elsevier, 2010.
X.F. Chen, J. Li, X.Y. Huang, J.W. Li, Y. Xiang. “Secure Outsourced Attribute-based Signatures”, IEEE Trans. on Parallel and Distributed Systems, DOI.ieeecomputersociety.org/10.1109/TPDS.2013. 180, 2013.
J.Li, X.F. Chen, M.Q. Li, J.W. Li, P. Lee, Wenjing Lou. “Secure Deduplication with Efficient and Reliable Convergent Key Management”, IEEE Transactions on Parallel and Distributed Systems, 25(6): 1615-1625, 2014.
Z. Liu, Z. Wang, X. Cheng, et al. “Multi-user Searchable Encryption with Coarser-Grained Access Control in Hybrid Cloud”, Fourth International Conference on Emerging Intelligent Data and Web Technologies (EIDWT), IEEE, pp. 249-255, 2013.
C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing”, Proc. IEEE INFOCOM, pp. 525-533, 2010.
B. Wang, B. Li, and H. Li, “Knox: PrivacyPreserving Auditing for Shared Data with Large Groups in the Cloud”, Proc. 10th Int’l Conf. Applied Cryptography and Network Security, pp. 507- 525, 2012.
D. Boneh, C. Gentry, B. Waters.“ Collusion resistant broadcast encryption with short ciphertexts and private keys”, Advances in CryptologyCCRYPTO 2005, pp. 258-275, 2005.
D. H. Phan, D. Pointcheval, S. F. Shahandashti, et al. “Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts”, International journal of information security, 12(4):251-265, 2013.
D. Boneh, B. Lynn, H. Shacham. “Short signatures from the Weil pairing”, Advances in Cryptology ASIACRYPT 2001, pp. 514-532, 2001.