Since the first formal cryptographic study of order-preserving encryption (OPE) by Boldyreva et al., few OPE schemes with provable security have been published. In this paper, we analyze the security of Jho et al.'s OPE scheme, and show that it is not POPF-CCA secure in opposition to what they claim.
Minkyu KIM
National Security Research Institute
Je HONG PARK
National Security Research Institute
Dongyoung ROH
National Security Research Institute
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Minkyu KIM, Je HONG PARK, Dongyoung ROH, "Comment on the Security of an Order-Preserving Encryption Scheme Using Pseudo-Random Function" in IEICE TRANSACTIONS on Communications,
vol. E99-B, no. 9, pp. 2108-2111, September 2016, doi: 10.1587/transcom.2015EBL0001.
Abstract: Since the first formal cryptographic study of order-preserving encryption (OPE) by Boldyreva et al., few OPE schemes with provable security have been published. In this paper, we analyze the security of Jho et al.'s OPE scheme, and show that it is not POPF-CCA secure in opposition to what they claim.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2015EBL0001/_p
Copy
@ARTICLE{e99-b_9_2108,
author={Minkyu KIM, Je HONG PARK, Dongyoung ROH, },
journal={IEICE TRANSACTIONS on Communications},
title={Comment on the Security of an Order-Preserving Encryption Scheme Using Pseudo-Random Function},
year={2016},
volume={E99-B},
number={9},
pages={2108-2111},
abstract={Since the first formal cryptographic study of order-preserving encryption (OPE) by Boldyreva et al., few OPE schemes with provable security have been published. In this paper, we analyze the security of Jho et al.'s OPE scheme, and show that it is not POPF-CCA secure in opposition to what they claim.},
keywords={},
doi={10.1587/transcom.2015EBL0001},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - Comment on the Security of an Order-Preserving Encryption Scheme Using Pseudo-Random Function
T2 - IEICE TRANSACTIONS on Communications
SP - 2108
EP - 2111
AU - Minkyu KIM
AU - Je HONG PARK
AU - Dongyoung ROH
PY - 2016
DO - 10.1587/transcom.2015EBL0001
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E99-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2016
AB - Since the first formal cryptographic study of order-preserving encryption (OPE) by Boldyreva et al., few OPE schemes with provable security have been published. In this paper, we analyze the security of Jho et al.'s OPE scheme, and show that it is not POPF-CCA secure in opposition to what they claim.
ER -