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
En 2009, Jeong et al. a proposé un nouveau système de cryptage consultable avec récupérabilité par mot-clé qui est sécurisé même si les adversaires disposent d'informations partielles utiles sur le mot-clé. Ils ont également proposé un schéma d'extension pour les mots-clés multiples. Cependant, cet article démontre que les schémas de Jeong et al. sont vulnérables aux attaques de devinettes de mots-clés hors ligne, où un adversaire (initié/étranger) peut récupérer des informations sur certains mots-clés à partir de n'importe quel message de requête capturé du schéma.
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
Eun-Jun YOON, Kee-Young YOO, "Off-Line Keyword Guessing Attacks on Searchable Encryption with Keyword-Recoverability" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 7, pp. 1995-1996, July 2010, doi: 10.1587/transinf.E93.D.1995.
Abstract: In 2009, Jeong et al. proposed a new searchable encryption scheme with keyword-recoverability which is secure even if the adversaries have any useful partial information about the keyword. They also proposed an extension scheme for multi-keywords. However, this paper demonstrates that Jeong et al.'s schemes are vulnerable to off-line keyword guessing attacks, where an adversary (insider/outsider) can retrieve information of certain keyword from any captured query message of the scheme.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.1995/_p
Copier
@ARTICLE{e93-d_7_1995,
author={Eun-Jun YOON, Kee-Young YOO, },
journal={IEICE TRANSACTIONS on Information},
title={Off-Line Keyword Guessing Attacks on Searchable Encryption with Keyword-Recoverability},
year={2010},
volume={E93-D},
number={7},
pages={1995-1996},
abstract={In 2009, Jeong et al. proposed a new searchable encryption scheme with keyword-recoverability which is secure even if the adversaries have any useful partial information about the keyword. They also proposed an extension scheme for multi-keywords. However, this paper demonstrates that Jeong et al.'s schemes are vulnerable to off-line keyword guessing attacks, where an adversary (insider/outsider) can retrieve information of certain keyword from any captured query message of the scheme.},
keywords={},
doi={10.1587/transinf.E93.D.1995},
ISSN={1745-1361},
month={July},}
Copier
TY - JOUR
TI - Off-Line Keyword Guessing Attacks on Searchable Encryption with Keyword-Recoverability
T2 - IEICE TRANSACTIONS on Information
SP - 1995
EP - 1996
AU - Eun-Jun YOON
AU - Kee-Young YOO
PY - 2010
DO - 10.1587/transinf.E93.D.1995
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2010
AB - In 2009, Jeong et al. proposed a new searchable encryption scheme with keyword-recoverability which is secure even if the adversaries have any useful partial information about the keyword. They also proposed an extension scheme for multi-keywords. However, this paper demonstrates that Jeong et al.'s schemes are vulnerable to off-line keyword guessing attacks, where an adversary (insider/outsider) can retrieve information of certain keyword from any captured query message of the scheme.
ER -