A Survey on Implementing Graph Encryption for Top-k Nearest Keyword Search

Authors(4) :-Swati Shinde, Shweta Kotame, Nikita Dhokchaule, Pradnya Barve

Now a days the security demands of data outsourcing applications is increasing and it is becoming an important issue in sustainable smart cities. Client’s data which is encrypted has been widely accepted by industry. As the clouds and edges are not far trusted encryption of data should be done at client side and then it should be outsource. Therefore, it is challenging issue that how to correctly encrypt the data so that encrypted and remotely stored data can be queried to get it back. We noticed that not so much people have worked on approaches for graph –structured data encryption and support for graph queries answering so it is still lacking in studies. In this paper, we investigate one graph encryption method called top-K Nearest Keyword(kNk) searches .it is an important graph query type, several indexes are design to store information which is necessary to answer queries and to maintain the privacy or security about the graph .It may be vertex identifiers, keywords and edges. Our graph encryption methods are secure or not is demonstrated by theoretical proofs and experiments which is done on real-world datasets.

Authors and Affiliations

Swati Shinde
Department of Information Technology, S.N.D college of Engineering and Research center, Savitribai Phule Pune University, Yeola, Nasik, India
Shweta Kotame
Department of Information Technology, S.N.D college of Engineering and Research center, Savitribai Phule Pune University, Yeola, Nasik, India
Nikita Dhokchaule
Department of Information Technology, S.N.D college of Engineering and Research center, Savitribai Phule Pune University, Yeola, Nasik, India
Pradnya Barve
Department of Information Technology, S.N.D college of Engineering and Research center, Savitribai Phule Pune University, Yeola, Nasik, India

Graph Encryption, Clouds, Edges, Top-K Nearest Keyword Search.

  1. D. X. Song, D. Wagner, and A. Perrig. Practical techniques for searching on encrypted data. In IEEE Symposium on Security and Privacy, SP'00, pages 44-55, 2000.
  2. M. Chase and S. Kamara. Structured encryption and controlled disclosure. In ASIACRYPT, pages 577-594. Springer, 2010.
  3. Pengtao Xie and Eric Xing. CryptGraph: Privacy Graph Analytics on encrypted Graph. School of Computer Science, Carnegie Mellon University Pittsburg.
  4. C.R. Barde, Pooja Katkade, Deepali Shewale, Rohit Khatale. Secured multiple-keyword search over Encrypted Cloud Data. Department of computer, GESRHSCOE, Nasik, Maharashtra.
  5. Babitha M.P, K.R. Ramesh Babu. Secure Cloud storage using AES encryption. Department of IT, Government Engineering College Idukki, Kerala.

Publication Details

Published in : Volume 2 | Issue 6 | November-December 2017
Date of Publication : 2017-12-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 188-191
Manuscript Number : CSEIT1725209
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Swati Shinde, Shweta Kotame, Nikita Dhokchaule, Pradnya Barve, "A Survey on Implementing Graph Encryption for Top-k Nearest Keyword Search", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 6, pp.188-191, November-December-2017.
Journal URL : http://ijsrcseit.com/CSEIT1725209

Article Preview

Follow Us

Contact Us