کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
459898 696291 2011 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An efficient public key encryption with conjunctive-subset keywords search
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
An efficient public key encryption with conjunctive-subset keywords search
چکیده انگلیسی

Since Boneh et al. proposed the notion and construction of Public Key Encryption with Keyword Search (PEKS) scheme, many revisions and extensions have been given. Conjunctive keyword search is one of these extensions, however, most of these constructed schemes can not solve conjunctive with subset keywords search function. Subset keywords search means that the receiver could query the subset keywords of all the keywords embedded in the ciphertext.In this paper, we study the problem of conjunctive with subset keywords search function, discuss the drawbacks about the existed schemes, and then give out a more efficient construction of Public Key Encryption with Conjunctive-Subset Keywords Search (PECSK) scheme. A comparison with other schemes about efficiency will be presented. We also list the security requirements of our scheme, then give out the security analysis.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Network and Computer Applications - Volume 34, Issue 1, January 2011, Pages 262–267
نویسندگان
, ,