Author
Abstract
Due to the increasing quality of cloud computing, more and more information owners are actuated to source their information to cloud servers for nice convenience and reduced price in information management. However, sensitive information ought to be encrypted before outsourcing for privacy necessities, that obsoletes information utilization like keyword-based document retrieval. during this paper, we present a secure multi-keyword stratified search theme over encrypted cloud information, that at the same time supports dynamic update operations like deletion and insertion of documents. Specifically, the vector area model and therefore the widely-used TFIDF model are combined in the index construction and question generation. we construct a special tree-based index structure and propose a “Greedy Depth-first Search” algorithmic rule to produce economical multi-keyword stratified search. The secure kNN algorithmic rule is employed to cipher the index and question vectors, and in the meantime guarantee correct connection score calculation between encrypted index and question vectors. so as to resist statistical attacks, phantom terms are additional to the index vector for bright search results . owing to the utilization of our special tree-based index structure, the planned theme can do sub-linear search time and upset the deletion and insertion of documents flexibly. Extensive experiments are conducted to demonstrate the potency of the planned theme.
Suggested Citation
S. Himachand, 2018.
"Privacy preserving search scheme over encrypted data in cloud,"
International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 4(2), pages 463-466, March.
Handle:
RePEc:jbh:ijsrcs:v4:y2018:i2:id:hcseit184180
Note: Article URL: https://ijsrcseit.com/CSEIT184180
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v4:y2018:i2:id:hcseit184180. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.