文章基本信息

标题：A Multi-keyword Ranked Search Scheme that is Dynamic and Secure over Cloud Data
本地全文：下载
作者：Priya S ; Ambika P R
期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2016
期号：ICCSTAR
页码：145
出版社：S&S Publications
摘要：Because of the expanding ubiquity of distributed computing, increasingly information proprietors arepropelled to outsource their information to cloud servers for awesome comfort and decreased expense in informationadministration. Nonetheless, delicate information ought to be encoded some time recently outsourcing for protectionprerequisites, which obsoletes information usage like catchphrase based report recovery. In this paper, we show aprotected multi-watchword positioned look plan over scrambled cloud information, which all the while bolstersdynamic overhaul operations like cancellation and insertion of reports. In particular, the vector space model and thegenerally utilized TFIDF model are consolidated as a part of the record development and question era. We build anuncommon tree-based list structure and propose a "Ravenous Profundity first Seek" calculation to give productivemulti-catchphrase positioned look. The protected kNN calculation is used to encode the record and question vectors,and in the interim guarantee exact importance score count between scrambled file and question vectors. Keeping inmind the end goal to stand up to measurable assaults, ghost terms are added to the record vector for blinding indexedlists . Because of the utilization of our uncommon tree-based list structure, the proposed plan can accomplish substraightpursuit time and manage the erasure and insertion of reports adaptably. Broad tests are led to exhibit theeffectiveness of the proposed plan.
关键词：Searchable encryption; multi-keyword ranked search; dynamic update; cloud computing.