کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4957373 | 1445076 | 2017 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Compact public key encryption without full random oracles
ترجمه فارسی عنوان
رمزگذاری کلید عمومی فشرده بدون وقفه های تصادفی کامل
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
اوراکل تصادفی قابل مشاهده بودن، رمزگذاری کلید عمومی، امنیت رمزنگاری انتخاب شده متن سربرگ،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
چکیده انگلیسی
Achieving shorter ciphertext length under weaker assumptions in chosen-ciphertext (CCA) secure public-key encryption (PKE) is one of the most important research topics in cryptography. However, it is also known that it is hard to construct a CCA-secure PKE whose ciphertext overhead is less than two group elements in the underlying prime-order group under non-interactive assumptions. A naive approach for achieving more compactness than the above bound is to use random oracles (ROs), but the full RO has various ideal properties like programmability. In this paper, we pursue how to achieve compact PKE only with a minimum ideal property of ROs. Specifically, only with observability, we can give three CCA-secure PKE schemes whose ciphertext overhead is less than two group elements. Our schemes are provably secure under standard assumptions such as the CDH and DDH assumptions. This study shows that ideal properties other than observability are not necessary to construct compact PKE beyond the bound.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pervasive and Mobile Computing - Volume 41, October 2017, Pages 286-299
Journal: Pervasive and Mobile Computing - Volume 41, October 2017, Pages 286-299
نویسندگان
Kazuki Yoneyama, Goichiro Hanaoka,