Algorithm 668: H2PEC: sampling from the hypergeometric distribution
ACM Transactions on Mathematical Software (TOMS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Design of Rijndael
Order preserving encryption for numeric data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
IEEE Transactions on Mobile Computing
Protection and retrieval of encrypted multimedia content: when cryptography meets signal processing
EURASIP Journal on Information Security
Order-Preserving Symmetric Encryption
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
The security of triple encryption and a framework for code-based game-playing proofs
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
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.