On the Average Cost of Order-Preserving Encryption Based on Hypergeometric Distribution
SCIE
SCOPUS
- Title
- On the Average Cost of Order-Preserving Encryption Based on Hypergeometric Distribution
- Authors
- Yum, DH; Lee, PJ
- Date Issued
- 2011-10-15
- Publisher
- ELSEVIER SCIENCE BV
- 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 5 log M + 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 log M + 3 times on average. (C) 2011 Elsevier B.V. All rights reserved.
- Keywords
- Cryptography; Order-preserving encryption; Hypergeometric distribution
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/16548
- DOI
- 10.1016/J.IPL.2011.07.004
- ISSN
- 0020-0190
- Article Type
- Article
- Citation
- INFORMATION PROCESSING LETTERS, vol. 111, no. 19, page. 956 - 959, 2011-10-15
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.