Open Access Open Access  Restricted Access Subscription or Fee Access

Index Based Multi-Keyword Search with Time Based Ranking

S. Bharathi, M. Jayapriya, N. Padmaja, R. Ezhilarasi


With the approach of distributed computing, information managers are persuaded to outsource their complex information administration frameworks from nearby destinations to business open cloud for awesome adaptability and financial funds. Anyway for securing information security, touchy information must be encoded before outsourcing, which obsoletes conventional information use taking into account plaintext magic word seeks. In this manner, empowering an encoded cloud information pursuit administration is of foremost significance. Considering the vast number of information clients and records in cloud, it is essential for the pursuit administration to permit multi-catchphrase question and give result likeness positioning to meet the viable information recovery need. Related deals with searchable encryption concentrate on single catchphrase pursuit or Boolean essential word inquiry, and infrequently separate the query items. In this paper, shockingly, we characterize and fathom the testing issue of security safeguarding multi-essential word positioned hunt over encoded cloud information (MRSE), and build a set of strict security prerequisites for such a protected cloud information usage framework to turn into a reality. Among different multi-essential word semantics, we pick the productive standard of "direction coordinating", i.e., whatever number matches as would be prudent, to catch the similitude between hunt inquiry and information reports, and further utilize "internal item similitude" to quantitatively formalize such standard for comparative estimation. We first propose a fundamental MRSE plan utilizing secure inward item calculation, and afterward fundamentally move forward it to meet diverse protection necessities in two levels of risk.


Privacy-Preserving, Multi-keyword, Coordinate- Matching.

Full Text:



L. M. Vaquero, L. Rodero-Merino, J. Caceres, and M. Lindner, “A break in the clouds: towards a cloud definition,” ACM SIGCOMM Comput.Commun. Rev., vol. 39, no. 1, pp. 50–55, 2009.

S. Kamara and K. Lauter, “Cryptographic cloud storage,” in RLCPS,January 2010, LNCS. Springer, Heidelberg.

A. Singhal, “Modern information retrieval: A brief overview,” IEEEData Engineering Bulletin, vol. 24, no. 4, pp. 35–43, 2001.

I. H. Witten, A. Moffat, and T. C. Bell, “Managing gigabytes: Compress-ing and indexing documents and images,” Morgan Kaufmann Publishing, San Francisco, May 1999.

D. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Proc. of S&P, 2000.

E.-J. Goh, “Secure indexes,” Cryptology ePrint Archive, 2003, http://

Y.-C. Chang and M. Mitzenmacher, “Privacy preserving keyword searches on remote encrypted data,” in Proc. of ACNS, 2005.

R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” in Proc. of ACM CCS, 2006.

D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Proc. of EUROCRYPT, 2004.

M. Bellare, A. Boldyreva, and A. ONeill, “Deterministic and efficiently searchable encryption,” in Proc. of CRYPTO, 2007.

M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, “Searchable encryp-tion revisited: Consistency properties, relation to anonymous ibe, and extensions,” J. Cryptol., vol. 21, no. 3, pp. 350–391, 2008.

J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, “Fuzzy keyword search over encrypted data in cloud computing,” in Proc. of IEEEINFOCOM’10 Mini-Conference, San Diego, CA, USA, March 2010.

D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. S. III, “Public key encryption that allows pir queries,” in Proc. of CRYPTO, 2007.

P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” in Proc. of ACNS, 2004, pp. 31–45.

W. K. Wong, D. W. Cheung, B. Kao, and N. Mamoulis, “Secure knn computation on encrypted databases,” in Proceedings of the 35thSIGMOD international conference on Management of data, 2009, pp.139–152.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.