کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6885372 | 1444510 | 2018 | 49 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Secure multi-keyword ranked search over encrypted cloud data for multiple data owners
ترجمه فارسی عنوان
جستجوی کلیدواژه چند منظوره امن بر روی داده های ابر رمزگذاری شده برای صاحبان چندین اطلاعات
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
جستجو کلید واژه امن صاحبان چندگانه، کیفیت اسناد، پردازش ابری،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
چکیده انگلیسی
Secure multi-keyword ranked search over outsourced cloud data has become a hot research field. Most existing works follow the model of “Single Owner”, which just supports searching on the outsourced data belong to only one data owner. But the more realistic scenario is “Multiple Owners”, users could search on all datasets outsourced by different data owners. However, directly extending “Single Owner” schemes into “Multiple Owners” scenario still face the major two challenges: (1) the inconvenient key management and the resulting high communication cost; (2) due to the different authorities of owners, the qualities of documents are also different even if they are about the similar topic, but current rank functions in this area cannot rank documents based on their qualities. In this paper, we propose a secure multi-keyword ranked search scheme for multiple data owners. A trusted third party is imported to solve the problem of key management. We exploit the vector space model for generating index and query, and our new-designed KDO algorithm is utilized for providing keyword weight, so that the rank function not only considers about the relevance between query and document, but also takes into account the document quality. In order to protect privacy for both owners and users, the Asymmetric Scalar-product Preserving Encryption approach is utilized for encrypting weighted index and query. Besides, we construct the Grouped Balanced Binary tree index, which could further improve the search efficiency by Greedy Depth-first search algorithm. Extensive experiments demonstrate that our proposed scheme is secure, accurate and efficient.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Systems and Software - Volume 137, March 2018, Pages 380-395
Journal: Journal of Systems and Software - Volume 137, March 2018, Pages 380-395
نویسندگان
Ziqing Guo, Hua Zhang, Caijun Sun, Qiaoyan Wen, Wenmin Li,