Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data

Pourush; Naresh Sharma; Manish Bhardwaj

doi:doi:10.11648/j.ajnc.20150403.11

| Peer-Reviewed

Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data

Pourush, Naresh Sharma, Manish Bhardwaj

Published in American Journal of Networks and Communications (Volume 4, Issue 3)

Received: 16 March 2015 Accepted: 25 March 2015 Published: 14 April 2015

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

To protect the privacy, sensitive information has to be encrypted before outsourcing to the cloud. Thus the effective data uct keyword search. Related works on searchable encryption emphasis on single keyword based search or Boolean keyword based search, and hardly work on sorting the search results. Our work focuses on realizing secure semantic search through query keyword semantic extension. We mix-ups and used architecture of two clouds, explicitly private cloud and public cloud. The search process is distributed into two steps. The leading step develops the question keyword upon warehoused database in the private cloud. The subsequent step uses the drawn-out query keywords set to recover the index on public cloud. Finally the matched files are resumed in order. Complete security analysis shows that our explanation is privacy-preserving and secure. Trial evaluation determines the efficiency and effectiveness of the scheme.

Published in	American Journal of Networks and Communications (Volume 4, Issue 3)
DOI	10.11648/j.ajnc.20150403.11
Page(s)	25-31
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2024. Published by Science Publishing Group

Keywords

Motion Detection, Background Modeling (BM), Block Based, Human Detection, Wavelet Threshold Algorithm, Confusion Matrix

References

[1]	Oxford dictionaries, the oec: (June 2011).“Facts about the language.”http://oxforddictionaries.com/page/oecfactslanguage/the-oec-facts-about-the-language.
[2]	D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. Skeith. (2007). “Public key encryption that allows pirqueries”; In Advances in Cryptology - CRYPTO, volume 4622 of Lecture Notes in Computer Science, pages 50{67. Springer Berlin / Heidelberg, 2007.
[3]	N. Cao, C. Wang, M. Li, K. Ren, and W. Lou. (2011). “Privacy-preserving multi-keyword ranked search over encrypted cloud data”. In IEEE INFOCOM.
[4]	Y.-C. Chang and M. Mitzenmacher. (2005). “Privacy Preserving Keyword Searches on Remote Encrypted Data”. In Applied Cryptography and Network Security, pages 442{455. Springer.
[5]	D. Chaum. (1982). “Blind signatures for untraceable payments”. In Advances in Cryptology: Proceedings of CRYPTO'82, pages 199{203.
[6]	B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. (November 1998). “Private information retrieval”. J. ACM, 45:965{981.
[7]	L. E. Dickson. (2003). “Linear Groups with an Exposition of Galois Field Theory”. Dover Publications, New York.
[8]	M. J. Freedman, Y. Ishai, B. Pinkas, and O. Reingold. (2005). “Keyword search and oblivious pseudorandom functions”. In Theory of Cryptography Conference -TCC 2005, pages 303{324.
[9]	J. Groth, A. Kiayias, and H. Lipmaa. (2010).“Multi-query computationally-private information retrieval with constant communication rate”. In PKC, pages 107{123.
[10]	W. Ogata and K. Kurosawa. (2004). “Oblivious keyword search”. In Journal of Complexity, Vol.20, pages 356{371.
[11]	J. T. Trostle and A. Parrish. (2010). “Efficient computationally private information retrieval from anonymity or trapdoor groups”. In ISC'10, pages 114{128.
[12]	L. M. Vaquero, L. Rodero-Merino, J. Caceres, and M. Lindner. (December 2008). “A break in the clouds: towards a cloud definition”. SIGCOMM Computer. Commun. Rev., 39:50{55.
[13]	C. Wang, N. Cao, J. Li, K. Ren, and W. Lou. (2010). “Secure ranked keyword search over encrypted cloud data”. In ICDCS'10, pages 253{262.
[14]	P. Wang, H. Wang, and J. Pieprzyk. (2009). “An efficient scheme of common secure indices for conjunctive keyword-based retrieval on encrypted data”. In Information Security Applications, Lecture Notes in Computer Science, pages 145{159. Springer.
[15]	J. Zobel and A. Mo_at. (1998). “Exploring the similarity space”. SIGIR FORUM, 32:18{34.

Cite This Article

Plain Text BibTeX RIS

APA Style

Pourush, Naresh Sharma, Manish Bhardwaj. (2015). Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data. American Journal of Networks and Communications, 4(3), 25-31. https://doi.org/10.11648/j.ajnc.20150403.11

Copy | Download

ACS Style

Pourush; Naresh Sharma; Manish Bhardwaj. Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data. Am. J. Netw. Commun. 2015, 4(3), 25-31. doi: 10.11648/j.ajnc.20150403.11

Copy | Download

AMA Style

Pourush, Naresh Sharma, Manish Bhardwaj. Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data. Am J Netw Commun. 2015;4(3):25-31. doi: 10.11648/j.ajnc.20150403.11

Copy | Download

@article{10.11648/j.ajnc.20150403.11,
  author = {Pourush and Naresh Sharma and Manish Bhardwaj},
  title = {Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data},
  journal = {American Journal of Networks and Communications},
  volume = {4},
  number = {3},
  pages = {25-31},
  doi = {10.11648/j.ajnc.20150403.11},
  url = {https://doi.org/10.11648/j.ajnc.20150403.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajnc.20150403.11},
  abstract = {To protect the privacy, sensitive information has to be encrypted before outsourcing to the cloud. Thus the effective data uct keyword search. Related works on searchable encryption emphasis on single keyword based search or Boolean keyword based search, and hardly work on sorting the search results. Our work focuses on realizing secure semantic search through query keyword semantic extension. We mix-ups and used architecture of two clouds, explicitly private cloud and public cloud. The search process is distributed into two steps. The leading step develops the question keyword upon warehoused database in the private cloud. The subsequent step uses the drawn-out query keywords set to recover the index on public cloud. Finally the matched files are resumed in order. Complete security analysis shows that our explanation is privacy-preserving and secure. Trial evaluation determines the efficiency and effectiveness of the scheme.},
 year = {2015}
}

Copy | Download

TY  - JOUR
T1  - Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
AU  - Pourush
AU  - Naresh Sharma
AU  - Manish Bhardwaj
Y1  - 2015/04/14
PY  - 2015
N1  - https://doi.org/10.11648/j.ajnc.20150403.11
DO  - 10.11648/j.ajnc.20150403.11
T2  - American Journal of Networks and Communications
JF  - American Journal of Networks and Communications
JO  - American Journal of Networks and Communications
SP  - 25
EP  - 31
PB  - Science Publishing Group
SN  - 2326-8964
UR  - https://doi.org/10.11648/j.ajnc.20150403.11
AB  - To protect the privacy, sensitive information has to be encrypted before outsourcing to the cloud. Thus the effective data uct keyword search. Related works on searchable encryption emphasis on single keyword based search or Boolean keyword based search, and hardly work on sorting the search results. Our work focuses on realizing secure semantic search through query keyword semantic extension. We mix-ups and used architecture of two clouds, explicitly private cloud and public cloud. The search process is distributed into two steps. The leading step develops the question keyword upon warehoused database in the private cloud. The subsequent step uses the drawn-out query keywords set to recover the index on public cloud. Finally the matched files are resumed in order. Complete security analysis shows that our explanation is privacy-preserving and secure. Trial evaluation determines the efficiency and effectiveness of the scheme.
VL  - 4
IS  - 3
ER  -

Copy | Download

Author Information

Pourush

Department of Computer Science and Engineering, SRM University, NCR Campus, Modinagar, India
Naresh Sharma

Department of Computer Science and Engineering, SRM University, NCR Campus, Modinagar, India
Manish Bhardwaj

Department of Computer Science and Engineering, SRM University, NCR Campus, Modinagar, India

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Pourush, Naresh Sharma, Manish Bhardwaj. (2015). Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data. American Journal of Networks and Communications, 4(3), 25-31. https://doi.org/10.11648/j.ajnc.20150403.11

Copy | Download

ACS Style

Pourush; Naresh Sharma; Manish Bhardwaj. Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data. Am. J. Netw. Commun. 2015, 4(3), 25-31. doi: 10.11648/j.ajnc.20150403.11

Copy | Download

AMA Style

Pourush, Naresh Sharma, Manish Bhardwaj. Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data. Am J Netw Commun. 2015;4(3):25-31. doi: 10.11648/j.ajnc.20150403.11

Copy | Download

@article{10.11648/j.ajnc.20150403.11,
  author = {Pourush and Naresh Sharma and Manish Bhardwaj},
  title = {Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data},
  journal = {American Journal of Networks and Communications},
  volume = {4},
  number = {3},
  pages = {25-31},
  doi = {10.11648/j.ajnc.20150403.11},
  url = {https://doi.org/10.11648/j.ajnc.20150403.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajnc.20150403.11},
  abstract = {To protect the privacy, sensitive information has to be encrypted before outsourcing to the cloud. Thus the effective data uct keyword search. Related works on searchable encryption emphasis on single keyword based search or Boolean keyword based search, and hardly work on sorting the search results. Our work focuses on realizing secure semantic search through query keyword semantic extension. We mix-ups and used architecture of two clouds, explicitly private cloud and public cloud. The search process is distributed into two steps. The leading step develops the question keyword upon warehoused database in the private cloud. The subsequent step uses the drawn-out query keywords set to recover the index on public cloud. Finally the matched files are resumed in order. Complete security analysis shows that our explanation is privacy-preserving and secure. Trial evaluation determines the efficiency and effectiveness of the scheme.},
 year = {2015}
}

Copy | Download

TY  - JOUR
T1  - Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
AU  - Pourush
AU  - Naresh Sharma
AU  - Manish Bhardwaj
Y1  - 2015/04/14
PY  - 2015
N1  - https://doi.org/10.11648/j.ajnc.20150403.11
DO  - 10.11648/j.ajnc.20150403.11
T2  - American Journal of Networks and Communications
JF  - American Journal of Networks and Communications
JO  - American Journal of Networks and Communications
SP  - 25
EP  - 31
PB  - Science Publishing Group
SN  - 2326-8964
UR  - https://doi.org/10.11648/j.ajnc.20150403.11
AB  - To protect the privacy, sensitive information has to be encrypted before outsourcing to the cloud. Thus the effective data uct keyword search. Related works on searchable encryption emphasis on single keyword based search or Boolean keyword based search, and hardly work on sorting the search results. Our work focuses on realizing secure semantic search through query keyword semantic extension. We mix-ups and used architecture of two clouds, explicitly private cloud and public cloud. The search process is distributed into two steps. The leading step develops the question keyword upon warehoused database in the private cloud. The subsequent step uses the drawn-out query keywords set to recover the index on public cloud. Finally the matched files are resumed in order. Complete security analysis shows that our explanation is privacy-preserving and secure. Trial evaluation determines the efficiency and effectiveness of the scheme.
VL  - 4
IS  - 3
ER  -

Copy | Download