Comment on the Security of an Order-Preserving Encryption Scheme Using Pseudo-Random Function
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...
Gespeichert in:
Veröffentlicht in: | IEICE Transactions on Communications 2016/09/01, Vol.E99.B(9), pp.2108-2111 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0916-8516 1745-1345 |
DOI: | 10.1587/transcom.2015EBL0001 |