ISSN (Online) : 2456 - 0774

Email :

ISSN (Online) 2456 - 0774



Abstract— Cloud computing has become a well-known way to deal with oversee individual information for the financial investment funds and the board adaptability in ongoing year. Notwithstanding, the delicate information must be scrambled previously moving operations to cloud workers for the thought of security, which makes some customary information usage capacities, for example, the plaintext keyword search, incomprehensible. To tackle this issue, we present a multi-keyword ranked search conspire over scrambled cloud information supporting dynamic activities productively. Our plan uses the vector space model with cosine likeness measure to accomplish a multi-keyword ranked search. In any case, conventional arrangements need to endure high computational costs. Our plan can uphold dynamic activity appropriately and successfully, which implies that the refreshing expense of our plan is lower than other plans. We present our essential plan first, which is secure under the known ciphertext model. At that point, the improved plan is introduced later to ensure security much under the realized foundation model. The probes this present reality informational index show that the exhibitions of our proposed plans are palatable. Keywords: Cloud computing, dynamic searchable encryption, multi-keyword ranked search.

Full Text PDF


Submit paper at

Paper Submission Open For December 2020
UGC indexed  2017-2019
Last date for paper submission 30 January, 2021
Deadline Submit Paper any time
Publication of Paper Within 01-02 Days after completing all the formalities
Paper Submission Open For online Conference 
Publication Fees(6 Authors) Rs.1000    (Up to 06 Authors)