The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Pour prendre en charge une gestion sécurisée des bases de données, un certain nombre de schémas de chiffrement à valeur ajoutée ont été étudiés, notamment les schémas de chiffrement à révélation d'ordre (ORE). L’une des caractéristiques exceptionnelles des schémas ORE est l’efficacité des requêtes de plage sous forme cryptée. Par rapport aux méthodes de chiffrement existantes, ORE entraîne une augmentation de la longueur des textes chiffrés. Pour améliorer l'efficacité des schémas ORE en termes de longueur du texte chiffré, un nouveau schéma ORE avec un texte chiffré plus court a été proposé par Kim. Dans cet article, nous revisitons le schéma ORE de Kim et montrons que la longueur des textes chiffrés n'est pas aussi courte que celle analysée dans leur article. Nous introduisons également une modification simple réduisant les besoins en mémoire par rapport aux schémas ORE existants.
Taek Young YOUN
Dankook University
Bo Sun KWAK
Dankook University
Seungkwang LEE
Dankook University
Hyun Sook RHEE
Samsung Electronics
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.
Copier
Taek Young YOUN, Bo Sun KWAK, Seungkwang LEE, Hyun Sook RHEE, "Practical Order-Revealing Encryption with Short Ciphertext" in IEICE TRANSACTIONS on Information,
vol. E105-D, no. 11, pp. 1934-1937, November 2022, doi: 10.1587/transinf.2022NGL0004.
Abstract: To support secure database management, a number of value-added encryption schemes have been studied including order-revealing encryption (ORE) schemes. One of outstanding features of ORE schemes is the efficiency of range queries in an encrypted form. Compared to existing encryption methods, ORE leads to an increase in the length of ciphertexts. To improve the efficiency of ORE schemes in terms of the length of ciphertext, a new ORE scheme with shorter ciphertext has been proposed by Kim. In this paper, we revisit Kim's ORE scheme and show that the length of ciphertexts is not as short as analyzed in their paper. We also introduce a simple modification reducing the memory requirement than existing ORE schemes.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2022NGL0004/_p
Copier
@ARTICLE{e105-d_11_1934,
author={Taek Young YOUN, Bo Sun KWAK, Seungkwang LEE, Hyun Sook RHEE, },
journal={IEICE TRANSACTIONS on Information},
title={Practical Order-Revealing Encryption with Short Ciphertext},
year={2022},
volume={E105-D},
number={11},
pages={1934-1937},
abstract={To support secure database management, a number of value-added encryption schemes have been studied including order-revealing encryption (ORE) schemes. One of outstanding features of ORE schemes is the efficiency of range queries in an encrypted form. Compared to existing encryption methods, ORE leads to an increase in the length of ciphertexts. To improve the efficiency of ORE schemes in terms of the length of ciphertext, a new ORE scheme with shorter ciphertext has been proposed by Kim. In this paper, we revisit Kim's ORE scheme and show that the length of ciphertexts is not as short as analyzed in their paper. We also introduce a simple modification reducing the memory requirement than existing ORE schemes.},
keywords={},
doi={10.1587/transinf.2022NGL0004},
ISSN={1745-1361},
month={November},}
Copier
TY - JOUR
TI - Practical Order-Revealing Encryption with Short Ciphertext
T2 - IEICE TRANSACTIONS on Information
SP - 1934
EP - 1937
AU - Taek Young YOUN
AU - Bo Sun KWAK
AU - Seungkwang LEE
AU - Hyun Sook RHEE
PY - 2022
DO - 10.1587/transinf.2022NGL0004
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E105-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2022
AB - To support secure database management, a number of value-added encryption schemes have been studied including order-revealing encryption (ORE) schemes. One of outstanding features of ORE schemes is the efficiency of range queries in an encrypted form. Compared to existing encryption methods, ORE leads to an increase in the length of ciphertexts. To improve the efficiency of ORE schemes in terms of the length of ciphertext, a new ORE scheme with shorter ciphertext has been proposed by Kim. In this paper, we revisit Kim's ORE scheme and show that the length of ciphertexts is not as short as analyzed in their paper. We also introduce a simple modification reducing the memory requirement than existing ORE schemes.
ER -