کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
428601 686835 2011 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the average cost of order-preserving encryption based on hypergeometric distribution
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
On the average cost of order-preserving encryption based on hypergeometric distribution
چکیده انگلیسی

Order-preserving encryption (OPE) is a deterministic encryption scheme whose encryption function preserves numerical ordering of the plaintexts. The first provably-secure OPE scheme was constructed by Boldyreva, Chenette, Lee, and OʼNeill. The BCLO scheme is based on a sampling algorithm for the hypergeometric distribution and is known to call the sampling algorithm at most 5logM+12 times on average where M   is the size of the plaintext-space. We show that the BCLO scheme actually calls the sampling algorithm less than logM+3 times on average.


► The first provably-secure order-preserving encryption scheme is the BCLO scheme.
► The upper bound for the computational cost of the BCLO scheme is 5logM+12.
► We present a new upper bound of logM+3.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 111, Issue 19, 15 October 2011, Pages 956–959
نویسندگان
, ,