Temporary keyword search seek on secret information in a cloud condition is the principle focal point of this exploration. The cloud suppliers are not completely trusted. In this way, it is important to redistribute information in the encoded frame. In the attribute based keyword search (ABKS) plans, the approved clients can produce some hunt tokens and send them to the cloud for running the pursuit task. These hunt tokens can be utilized to remove all the ciphertexts which are created whenever and contain the comparing temporary keyword search. Since this may prompt some data spillage, it is increasingly secure to propose a plan in which the hunt tokens can just concentrate the ciphertexts produced in a predefined time interim. To this end, in this paper, we present another cryptographic crude called key policy -attribute based temporary keyword search(KPABTKS) which give this property. To assess the security of our conspire, we formally demonstrate that our proposed plan accomplishes the watchword mystery property and is secure against specifically picked watchword assault (SCKA) both in the arbitrary prophet demonstrate and under the hardness of Decisional Bilinear Diffie-Hellman (DBDH) suspicion. Moreover, we demonstrate that the intricacy of the encryption calculation is direct concerning the quantity of the included qualities. Execution assessment demonstrates our plan`s reasonableness

Searchable encryption, attribute-based encryption, Temporary keyword search, cloud security

[1] Q. Zheng, S. Xu, and G. Ateniese, “Vabks: Verifiable attribute-based keyword search over outsourced encrypted data,” in INFOCOM, 2014 Proceedings IEEE. IEEE, 2014, pp. 522–530.
[2] A. Sahai and B. Waters, “Fuzzy identity-based encryption,” in Advances in Cryptology–EUROCRYPT 2005. Springer, 2005, pp. 457–473.
[3] M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, “Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions,” in Advances in Cryptology–CRYPTO 2005. Springer, 2005, pp. 205–222.
[4] Y. Yu, J. Ni, H. Yang, Y. Mu, and W. Susilo, “Efficient public key encryption with revocable keyword search,” Security and Communication Networks, vol. 7, no. 2, pp. 466–472, 2014.
[5] E.-J. Goh et al., “Secure indexes.” IACR Cryptology ePrint Archive, vol. 2003, p. 216, 2003.
[6] Z. Fu, X. Wu, C. Guan, X. Sun, and K. Ren, “Toward efficient multikeyword fuzzy search over encrypted outsourced data with accuracy improvement,” IEEE Transactions on Information Forensics and Security, vol. 11, no. 12, pp. 2706–2716, 2016.
[7] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-preserving multikeyword ranked search over encrypted cloud data,” IEEE Transactions on parallel and distributed systems, vol. 25, no. 1, pp. 222–233, 2014.
[8] H. Li, Y. Yang, T. H. Luan, X. Liang, L. Zhou, and X. S. Shen, “Enabling fine-grained multi-keyword search supporting classified sub-dictionaries over encrypted cloud data,” IEEE Transactions on Dependable and Secure Computing, vol. 13, no. 3, pp. 312–325, 2016.
[9] A. Awad, A. Matthews, Y. Qiao, and B. Lee, “Chaotic searchable encryption for mobile cloud storage,” IEEE Transactions on Cloud Computing, vol. PP, no. 99, pp. 1–1, 2017.
[10] J. Li, D. Lin, A. C. Squicciarini, J. Li, and C. Jia, “Towards privacypreserving storage and retrieval in multiple clouds,” IEEE Transactions on Cloud Computing, vol. 5, no. 3, pp. 499–509, July 2017.
[11] J. Li, R. Ma, and H. Guan, “Tees: An efficient search scheme over encrypted data on mobile cloud,” IEEE Transactions on Cloud Computing, vol. 5, no. 1, pp. 126–139, Jan 2017.
[12] J. Baek, R. Safavi-Naini, and W. Susilo, “Public key encryption with keyword search revisited,” in Computational Science and Its Applications– ICCSA 2008. Springer, 2008, pp. 1249–1259.
[13] H. Yin, Z. Qin, J. Zhang, L. Ou, and K. Li, “Achieving secure, universal, and fine-grained query results verification for secure search scheme over encrypted cloud data,” IEEE Transactions on Cloud Computing, vol. PP, no. 99, pp. 1–1, 2017.
[14] K. Liang and W. Susilo, “Searchable attribute-based mechanism with efficient data sharing for secure cloud storage,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 9, pp. 1981–1992, 2015.
[15] J. Han, W. Susilo, Y. Mu, and J. Yan, “Attribute-based oblivious access control,” The Computer Journal, vol. 55, no. 10, pp. 1202–1215, 2012.
[16] “Attribute-based data transfer with filtering scheme in cloud computing,” The Computer Journal, vol. 57, no. 4, pp. 579–591, 2014.
[17] Y. Shi, Q. Zheng, J. Liu, and Z. Han, “Directly revocable key-policy attribute-based encryption with verifiable ciphertext delegation,” Information Sciences, vol. 295, pp. 221–231, 2015.
[18] J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-policy attribute-based encryption,” in Security and Privacy, 2007. SP’07. IEEE Symposium on. IEEE, 2007, pp. 321–334.
[19] H. Deng, Q. Wu, B. Qin, J. Domingo-Ferrer, L. Zhang, J. Liu, and W. Shi, “Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts,” Information Sciences, vol. 275, pp. 370–384, 2014.
[20] A. Balu and K. Kuppusamy, “An expressive and provably secure ciphertext-policy attribute-based encryption,” Information Sciences, vol. 276, pp. 354–362, 2014.
[21] J. Han, W. Susilo, Y. Mu, J. Zhou, and M. H. A. Au, “Improving privacy and security in decentralized ciphertext-policy attribute-based encryption,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 3, pp. 665–678, 2015.
[22] J. Han, W. Susilo, Y. Mu, and J. Yan, “Privacy-preserving decentralized key-policy attribute-based encryption,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 11, pp. 2150–2162, 2012.