Privacy preserving search scheme over encrypted data in cloud

Authors(1) :-S. Himachand

Due to the increasing quality of cloud computing, more and more information owners are actuated to source their information to cloud servers for nice convenience and reduced price in information management. However, sensitive information ought to be encrypted before outsourcing for privacy necessities, that obsoletes information utilization like keyword-based document retrieval. during this paper, we present a secure multi-keyword stratified search theme over encrypted cloud information, that at the same time supports dynamic update operations like deletion and insertion of documents. Specifically, the vector area model and therefore the widely-used TFIDF model are combined in the index construction and question generation. we construct a special tree-based index structure and propose a “Greedy Depth-first Search” algorithmic rule to produce economical multi-keyword stratified search. The secure kNN algorithmic rule is employed to cipher the index and question vectors, and in the meantime guarantee correct connection score calculation between encrypted index and question vectors. so as to resist statistical attacks, phantom terms are additional to the index vector for bright search results . owing to the utilization of our special tree-based index structure, the planned theme can do sub-linear search time and upset the deletion and insertion of documents flexibly. Extensive experiments are conducted to demonstrate the potency of the planned theme.

Authors and Affiliations

S. Himachand
MCA, Sri Padmavathi College of Computer Sciences and Technology , Tiruchanoor, Andhra Pradesh, India

Searchable encryption, multi-keyword ranked search, dynamic update, cloud computing

  1. K. Ren, C.Wang, Q.Wang et al., "Security challenges for the public cloud," IEEE Internet Computing, vol. 16, no. 1, pp. 69–73, 2012.
  2. S. Kamara and K. Lauter, "Cryptographic cloud storage," in Financial Cryptography and Data Security. Springer, 2010, pp. 136– 149.
  3. C. Gentry, "A fully homomorphic encryption scheme," Ph.D. dissertation, Stanford University, 2009.
  4. O. Goldreich and R. Ostrovsky, "Software protection and simulation on oblivious rams," Journal of the ACM (JACM), vol. 43, no. 3, pp. 431–473, 1996.
  5. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, "Public key encryption with keyword search," in Advances in Cryptology- Eurocrypt 2004. Springer, 2004, pp. 506–522.
  6. D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. Skeith III, "Public key encryption that allows pir queries," in Advances in Cryptology-CRYPTO 2007. Springer, 2007, pp. 50–67.
  7. D. X. Song, D. Wagner, and A. Perrig, "Practical techniques for searches on encrypted data," in Security and Privacy, 2000. S&P 2000. Proceedings. 2000 IEEE Symposium on. IEEE, 2000, pp. 44– 55.
  8. E.-J. Goh et al., "Secure indexes." IACR Cryptology ePrint Archive, vol. 2003, p. 216, 2003.
  9. Y.-C. Chang and M. Mitzenmacher, "Privacy preserving keyword searches on remote encrypted data," in Proceedings of the Third international conference on Applied Cryptography and Network Security. Springer-Verlag, 2005, pp. 442–455.
  10. R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, "Searchable symmetric encryption: improved definitions and efficient constructions," in Proceedings of the 13th ACM conference on Computer and communications security. ACM, 2006, pp. 79–88.
  11. J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, "Fuzzy keyword search over encrypted data in cloud computing," in INFOCOM, 2010 Proceedings IEEE. IEEE, 2010, pp. 1–5.
  12. M. Kuzu, M. S. Islam, and M. Kantarcioglu, "Efficient similarity search over encrypted data," in Data Engineering (ICDE), 2012 IEEE 28th International Conference on. IEEE, 2012, pp. 1156–1167.
  13. C. Wang, K. Ren, S. Yu, and K. M. R. Urs, "Achieving usable and privacy-assured similarity search over outsourced cloud data," in INFOCOM, 2012 Proceedings IEEE. IEEE, 2012, pp. 451–459.
  14. B. Wang, S. Yu, W. Lou, and Y. T. Hou, "Privacy-preserving multikeyword fuzzy search over encrypted data in the cloud," in IEEE INFOCOM, 2014.
  15. P. Golle, J. Staddon, and B. Waters, "Secure conjunctive keyword search over encrypted data," in Applied Cryptography and Network Security. Springer, 2004, pp. 31–45.

Try to solve the new Formula Cube! It works exactly like a Rubik's Cube but it is only $2, from China. Learn to solve it with the tutorial on or use the solver to calculate the solution in a few steps.

Publication Details

Published in : Volume 4 | Issue 2 | March-April 2018
Date of Publication : 2018-03-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 463-466
Manuscript Number : CSEIT184180
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

S. Himachand, "Privacy preserving search scheme over encrypted data in cloud", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.463-466, March-April-2018.
Journal URL :

Follow Us

Contact Us