کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9506433 | 1340749 | 2005 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Two provably secure k-out-of-n oblivious transfer schemes
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Oblivious transfer (OT) is a fundamental cryptographic tool. In a k-out-of-n oblivious transfer (OT) model, one party Alice (the sender) sends n bits to another party Bob (the receiver), Bob can get only k bits from n bits. However, Alice cannot know which k bits Bob received. In this paper, we propose two efficient k-out-of-n oblivious transfer schemes, which are proved security without using random oracle. At the same time, security of the two schemes is based on DDH assumption. As efficiency of computation and communication, the cost of communication and computation of the receiver is independent of number n of messages; a prominent advantage is that the sender only computes one exponentiation in the second oblivious transfer scheme. To the best of my knowledge, it is least computation in the oblivious transfer available.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 169, Issue 2, 15 October 2005, Pages 1211-1220
Journal: Applied Mathematics and Computation - Volume 169, Issue 2, 15 October 2005, Pages 1211-1220
نویسندگان
Jianhong Zhang, Yumin Wang,