Call for Paper - March 2023 Edition
IJCA solicits original research papers for the March 2023 Edition. Last date of manuscript submission is February 20, 2023. Read More

Review on Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2016
R. Rakesh, Anoop S.

R Rakesh and Anoop S.. Article: Review on Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing. International Journal of Computer Applications 139(2):1-7, April 2016. Published by Foundation of Computer Science (FCS), NY, USA. BibTeX

	author = {R. Rakesh and Anoop S.},
	title = {Article: Review on Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing},
	journal = {International Journal of Computer Applications},
	year = {2016},
	volume = {139},
	number = {2},
	pages = {1-7},
	month = {April},
	note = {Published by Foundation of Computer Science (FCS), NY, USA}


An efficient cryptographic approach for data sharing where data is shared among a group of users as Data sharing is an important functionality in cloud storage. How to securely and efficiently share a collection of data related to any subject areas with others in cloud storage. Development of new novel concept of Key- Aggregate Searchable Encryption (KASE). This concept is implemented through development of a concrete key-aggregate searchable encryption framework scheme. This scheme is described as where a data owner only needs to generate and distribute a single aggregate key to a data user for sharing a large number of documents and on the other side user only needs to submit a single aggregate trapdoor to the cloud server, so that he/she can query over the shared documents by the help of generated single aggregate trapdoor. This proposed scheme is perfectly more secure and practically efficient. It is an effective method which is considered as best solution to build a practical data sharing system based on public cloud storage. A detailed review of various methods used for data access controls and encryption is presented and a brief comparison among the discussed methods is given.


  1. Cloud-Storage,
  2. Amazon Web Services (AWS),
  3. Google App Engine,
  4. Microsoft Azure,
  5. 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.
  6. X. Liu, Y. Zhang, B. Wang, and J. Yan. “Mona: secure multi-owner data sharing for dynamic groups in the cloud”, IEEE Transactions on Parallel and Distributed Systems, 2013, 24(6): 1182-1191.
  7. 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.
  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. P. Van,S. Sedghi, JM. Doumen. “Computationally efficient searchable symmetric encryption”, Secure Data Management, pp. 87-100, 2010.
  11. 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.
  12. D. Boneh, C. G, R. Ostrovsky, G. Persiano. “Public Key Encryption with Keyword Search”, EUROCRYPT 2004, pp. 506C522, 2004.
  13. Y. Hwang, P. Lee. “Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System”, In: Pairing-Based Cryptography C Pairing 2007, LNCS, pp. 2-22, 2007.
  14. J. Li, Q. Wang, C. Wang. “Fuzzy keyword search over encrypt-ed data in cloud computing”, Proc. IEEE INFOCOM, pp. 1-5, 2010.
  15. C. Bosch, R. Brinkma, P. Hartel. “Conjunctive wildcard search over encrypted data”, Secure Data Management. LNCS, pp. 114-127, 2011
  16. C. Dong, G. Russello, N. Dulay. “Shared and searchable encrypted data for untrusted servers”, Journal of Computer Security, pp. 367-397, 2011.
  17. 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.
  18. 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.
  19. J. Li, K. Kim. “Hidden attribute-based signatures without anonymity revocation”, Information Sciences, 180(9): 1681- 1689, Elsevier, 2010.
  20. 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,, 2013.
  21. 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.
  22. 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.
  23. 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.
  24. B. Wang, B. Li, and H. Li, “Knox: Privacy-Preserving Auditing for Shared Data with Large Groups in the Cloud”, Proc. 10th Intl Conf. Applied Cryptography and Network Security, pp. 507-525, 2012.
  25. D. Boneh, C. Gentry, B. Waters. “Collusion resistant broadcast encryption with short ciphertexts and private keys”, Advances in CryptologyCCRYPTO 2005, pp. 258-275, 2005.
  26. 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.
  27. D. Boneh, B. Lynn, H. Shacham. “Short signatures from the Weil pairing”, Advances in Cryptology ASIACRYPT 2001, pp. 514-532, 2001
  28. L. B. Oliveira, D. F. Aranha, E. Morais, et al. “Tinytate: Computing the tate pairing in resource-constrained sensor nodes”, IEEE Sixth IEEE International Symposium on Network Computing and Applications, pp. 318-323, 2007.
  29. D. Boneh, C. Gentry and B. Waters. “Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys”, CRYPTO05, pp. 258C275, 2005.
  30. M. Li, W. Lou, K. Ren. “Data security and privacy in wireless body area networks”, Wireless Communications, IEEE, 17(1): 51-58, 2010.
  31. R. A. Popa ,N. Zeldovich. “Multi-key searchable encryption”. Cryptology ePrint Archive, Report 2013/508, 2013.
  32. PBC library: The pairing-based cryptography library.
  33. K. Ren, C.Wang, Q.Wang et al., “Security challenges for the public cloud”, IEEE Internet Computing, volume. 16, no. 1, pp. 6973, 2012.
  34. S. Ruj, A. Nayak, and I. Stojmenovic, “Dacc: Distributed access control in clouds”, in Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on. IEEE, 2011, pp.9198.
  35. M. Chase, “Multi-authority attribute based encryption”, in Theory of Cryptography. Springer, 2007, pp. 515534.
  36. T Parameswaran, S Vanitha, K S Arvind, “An Efficient Sharing of Personal Health Records Using DABE in Secure Cloud Environment” International Journal of Advanced Research in Computer Engineering and Technology (IJARCET) Volume 2, Issue 3, March 2013


Cloud Storage Provider, Outsourcing, Attribute based Encryption, Key-Aggregate Cryptosystem