Open Access   Article Go Back

EEDS: An Efficient Multi Keyword Search Scheme over Encrypted Data on Mobile Cloud

M. Akhila1 , K. Madhavi2

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-6 , Page no. 588-593, Jun-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i6.588593

Online published on Jun 30, 2018

Copyright © M. Akhila, K. Madhavi . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: M. Akhila, K. Madhavi, “EEDS: An Efficient Multi Keyword Search Scheme over Encrypted Data on Mobile Cloud,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.588-593, 2018.

MLA Style Citation: M. Akhila, K. Madhavi "EEDS: An Efficient Multi Keyword Search Scheme over Encrypted Data on Mobile Cloud." International Journal of Computer Sciences and Engineering 6.6 (2018): 588-593.

APA Style Citation: M. Akhila, K. Madhavi, (2018). EEDS: An Efficient Multi Keyword Search Scheme over Encrypted Data on Mobile Cloud. International Journal of Computer Sciences and Engineering, 6(6), 588-593.

BibTex Style Citation:
@article{Akhila_2018,
author = {M. Akhila, K. Madhavi},
title = {EEDS: An Efficient Multi Keyword Search Scheme over Encrypted Data on Mobile Cloud},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {6 2018},
volume = {6},
Issue = {6},
month = {6},
year = {2018},
issn = {2347-2693},
pages = {588-593},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2226},
doi = {https://doi.org/10.26438/ijcse/v6i6.588593}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i6.588593}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2226
TI - EEDS: An Efficient Multi Keyword Search Scheme over Encrypted Data on Mobile Cloud
T2 - International Journal of Computer Sciences and Engineering
AU - M. Akhila, K. Madhavi
PY - 2018
DA - 2018/06/30
PB - IJCSE, Indore, INDIA
SP - 588-593
IS - 6
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
315 286 downloads 208 downloads
  
  
           

Abstract

With increasing number of websites the Web users are increased with the massive amount of data available on the internet which is provided by the Web Search Engine (WSE). The aim of the WSE is to provide the relevant search result to the user with the behavior of the user click were they performed. WSE provides the relevant result on behalf of the user frequent click based method. From this method, no assurance to the user privacy and also no securities were providing to their data. Hence users were afraid for their private information during the search has become a major barrier. There were many techniques proposed by researchers of those most of them are based on the server side where it encompasses many security concerns. For minimizing the privacy risk this paper addresses a client-side based technique with the combination of a Greedy method to prevent the user data that we applied in Knowledge mining area.

Key-Words / Index Term

Web Search Engine, personalized search, user query logs, content search and privacy preserving

References

[1] D. Huang, “Mobile cloud computing,” IEEE COMSOC Multimedia Communications Technical Committee (MMTC) E-Letter, 2011.
[2] D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent Dirichlet allocation,” the Journal of Machine Learning Research, vol. 3, 2003, pp. 993–1022.
[3] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “ Order-preserving encryption for numeric data,” in Proceedings of the 2004 ACM SIGMOD international conference on Management of data. ACM, 2004, pp. 563-574.
[4] D. 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.
[5] A. Aizawa, “ An Information-theoretic perspective of tf-IDF measures,” Information Processing and Management, 2003, vol. 39, pp. 45-65.
[6] Y. Chang and M. Mitzenmacher, “ Privacy-preserving keyword searches on remotely encrypted data,” in Applied Cryptography and Network Security. Springer, 2005, pp. 391-421.
[7] A. Swaminathan, Y. Mao, G. Su, H. Gou, A. Varna, S. He, M. Wu, and D. Oard, “ Confidentiality-preserving rank-ordered search,” in Proceedings of the 2007 ACM workshop on Storage security and survivability. ACM 2007, pp. 7-12.