G. Sindhu, Ch. Prasad


This document focuses on the search for encrypted data, a vital way to protect the privacy protection model to encrypt files before outsourcing in cloud computing, or perhaps in general in virtually any information system. Network where servers are not fully trusted. We officially verify that our proposed plan is selectively safe against the selected keyword attack. We designed a keyword search that was unique and scalable on an encrypted data plan that supports multiple data users and multiple data contributors. We differentiate features and keywords in our design. Keywords are real content of files, while attributes refer to user attributes. In addition, through the use of cryptographic and cryptographic encryption techniques, the proposed plan is more relevant to the cloud outsourcing model and has an effective user wipe. In contrast to the keyword search plan approved through the current public key, the company's plan can achieve system scalability and granule measurement at the same time. It does not look like a search plan with native file encryption, as our plan allows you to search for a keyword that relies on arbitrary data. The search complexity is in a straight line with the number of attributes within the system compared to the number of authorized users. Therefore, the mechanism of delegation from one to many is more suitable for any comprehensive system, for example, the cloud. ABKS-UR's proposed plan and verification of the verification mechanism of the results by the real data set and the complexity of the computational calculations in relation to the matching process.


Attribute-Based Keyword Search; Fine-Grained Owner-Enforced Search Authorization; Multi-User Search;


R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: Improved definitions and efficient constructions,” in Proc. 13th ACM Conf. Comput. Commun. Security, 2006, pp. 79–88.

M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu, “Plutus: Scalable secure file sharing on untrusted storage,” in Proc. 2nd USENIX Conf. File Storage Technol., 2003, vol. 42, pp. 29–42.

W. Sun, B. Wang, N. Cao, M. Li, W. Lou, Y. T. Hou, and H. Li, “Verifiable privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking,” IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 11, pp. 3025–3035, Nov. 2014.

D. Boneh and M. Franklin, “Identity-based encryption from the Weil pairing,” in Proc. 21st Annu. Int. Cryptol. Conf. Adv. Cryptol., 2001, pp. 213–229.

Wenhai Sun, Student Member, IEEE, Shucheng Yu, Member, IEEE,Wenjing Lou, Fellow, IEEE, Y. Thomas Hou, Fellow, IEEE, and Hui Li, Member, IEEE, “Protecting Your Right: Verifiable Attribute-BasedKeyword Search with Fine-GrainedOwner-Enforced Search Authorizationin the Cloud”, ieee transactions on parallel and distributed systems, vol. 27, no. 4, april 2016.

J. Katz, A. Sahai, and B. Waters, “Predicate encryption supporting disjunctions, polynomial equations, and inner products,” in Proc. 27th Annu. Int. Conf. Adv. Cryptol. Theory Appl. Cryptograph. Techn., 2008, pp. 146–162.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2021, All rights reserved.|

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at