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. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Yum, D. H., Kim, D. S., Kim, J. S., Lee, P. J., & Hong, S. J. (2012). Order-preserving encryption for non-uniformly distributed plaintexts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7115 LNCS, pp. 84–97). https://doi.org/10.1007/978-3-642-27890-7_7
Mendeley helps you to discover research relevant for your work.