On the average cost of order-preserving encryption based on hypergeometric distribution

Authors:
Dae Hyun Yum;Pil Joong Lee
Affiliations:
Information Security Lab., EEE, POSTECH, Namgu, Pohang, Kyungbuk, 790-784, Republic of Korea;Information Security Lab., EEE, POSTECH, Namgu, Pohang, Kyungbuk, 790-784, Republic of Korea
Venue:
Information Processing Letters
Year:
2011

Citing 4
Cited 0

Algorithm 668: H2PEC: sampling from the hypergeometric distribution

ACM Transactions on Mathematical Software (TOMS)
Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
Order preserving encryption for numeric data

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Order-Preserving Symmetric Encryption

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.