C Rajasekhar Reddy, B Sivakumar


This focuses on encrypted data search, which is a vital means of protecting the privacy of file encryption before outsourcing in cloud computing or, in general, on almost all network-based information systems in which servers cannot be totally reliable. We officially demonstrate that our proposed plan is selectively secure against the selected keyword attack. We've created a single, authoritative, scalable search in an encrypted data plan that supports multiple data users and multiple data collaborators. We differentiate between features and keywords in our design. Keywords are the actual content of the files, while the attributes refer to the attributes of the user. In addition, using proxy encryption and slow file encryption techniques, the proposed plan is more relevant to the cloud outsourcing model and is efficient at eliminating the user. Unlike the existing public key search scheme, our plan can achieve scalability and system improvement at the same time. Unlike a search plan with native file encryption, our plan lets you search for approved, adaptable keywords in arbitrarily structured data. The appearance of complexity is a straight line to the amount of attributes within the system versus the number of authorized users. Thus, the one-to-many license mechanism is best suited for any huge system, for example, cloud. Proposed ABKS-UR plan and verification of the results verification mechanism through a real-world dataset and the complexity of an approximation calculation in relation to the conjugation process.


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.

S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving secure, scalable, and fine-grained data access control in cloud computing,” in Proc. IEEE Conf. Comput. Commun., 2010, pp. 1–9.

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-Based Keyword Search with Fine-Grained Owner-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.

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.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2018, 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