Title
Order-Preserving encryption for non-uniformly distributed plaintexts
Abstract
Order-preserving encryption (OPE) is a deterministic encryption scheme whose encryption function preserves numerical ordering of the plaintexts. While the concept of OPE was introduced in 2004, the first provably-secure OPE scheme was constructed by Boldyreva, Chenette, Lee, and O'Neill at Eurocrypt 2009. The BCLO scheme uses a sampling algorithm for the hypergeometric distribution as a subroutine and maps the Euclidean middle range gap to a domain gap. We study how to utilize the (non-uniform) distribution of the plaintext-space to reduce the number of sampling algorithm invocations in the BCLO scheme. Instead of the Euclidean middle range gap, we map the probabilistic middle range gap to a domain gap. Our simulation shows that the proposed method is effective for various distributions and especially for distributions with small variance.
Year
DOI
Venue
2011
10.1007/978-3-642-27890-7_7
WISA
Keywords
Field
DocType
probabilistic middle range gap,bclo scheme,order-preserving encryption,hypergeometric distribution,euclidean middle range gap,encryption function,algorithm invocation,provably-secure ope scheme,domain gap,deterministic encryption scheme
Hypergeometric distribution,Subroutine,Computer science,Deterministic encryption,Theoretical computer science,Encryption,Sampling (statistics),Probabilistic encryption,Euclidean geometry,Probabilistic logic
Conference
Citations 
PageRank 
References 
12
0.64
6
Authors
5
Name
Order
Citations
PageRank
Dae Hyun Yum131524.95
Duk Soo Kim2120.98
Jin Seok Kim3566.25
Pil Joong Lee41039103.09
Sung Je Hong526728.92