IEICE TRANSACTIONS on Information
Security Analysis of Collusion-Resistant Nearest Neighbor Query Scheme on Encrypted Cloud Data
Summary :
Recently, Yuan et al. (IEEE Infocom'13, pp.2652-2660) proposed an efficient secure nearest neighbor (SNN) search scheme on encrypted cloud database. Their scheme is claimed to be secure against the collusion attack of query clients and cloud server, because the colluding attackers cannot infer the encryption/decryption key. In this letter, we observe that the encrypted dataset in Yuan's scheme can be broken by the collusion attack without deducing the key, and present a simple but powerful attack to their scheme. Experiment results validate the high efficiency of our attacking approach. Additionally, we also indicate an upper bound of collusion-resistant ability of any accurate SNN query scheme.
- Publication
- IEICE TRANSACTIONS on Information Vol.E97-D No.2 pp.326-330
- Publication Date
- 2014/02/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E97.D.326
- Type of Manuscript
- LETTER
- Category
- Data Engineering, Web Information Systems
Authors
Youwen ZHU
Kyushu University
Tsuyoshi TAKAGI
Kyushu University
Rong HU
Kyushu University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Youwen ZHU, Tsuyoshi TAKAGI, Rong HU, "Security Analysis of Collusion-Resistant Nearest Neighbor Query Scheme on Encrypted Cloud Data" in IEICE TRANSACTIONS on Information,
vol. E97-D, no. 2, pp. 326-330, February 2014, doi: 10.1587/transinf.E97.D.326.
Abstract: Recently, Yuan et al. (IEEE Infocom'13, pp.2652-2660) proposed an efficient secure nearest neighbor (SNN) search scheme on encrypted cloud database. Their scheme is claimed to be secure against the collusion attack of query clients and cloud server, because the colluding attackers cannot infer the encryption/decryption key. In this letter, we observe that the encrypted dataset in Yuan's scheme can be broken by the collusion attack without deducing the key, and present a simple but powerful attack to their scheme. Experiment results validate the high efficiency of our attacking approach. Additionally, we also indicate an upper bound of collusion-resistant ability of any accurate SNN query scheme.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E97.D.326/_p
Copy
@ARTICLE{e97-d_2_326,
author={Youwen ZHU, Tsuyoshi TAKAGI, Rong HU, },
journal={IEICE TRANSACTIONS on Information},
title={Security Analysis of Collusion-Resistant Nearest Neighbor Query Scheme on Encrypted Cloud Data},
year={2014},
volume={E97-D},
number={2},
pages={326-330},
abstract={Recently, Yuan et al. (IEEE Infocom'13, pp.2652-2660) proposed an efficient secure nearest neighbor (SNN) search scheme on encrypted cloud database. Their scheme is claimed to be secure against the collusion attack of query clients and cloud server, because the colluding attackers cannot infer the encryption/decryption key. In this letter, we observe that the encrypted dataset in Yuan's scheme can be broken by the collusion attack without deducing the key, and present a simple but powerful attack to their scheme. Experiment results validate the high efficiency of our attacking approach. Additionally, we also indicate an upper bound of collusion-resistant ability of any accurate SNN query scheme.},
keywords={},
doi={10.1587/transinf.E97.D.326},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - Security Analysis of Collusion-Resistant Nearest Neighbor Query Scheme on Encrypted Cloud Data
T2 - IEICE TRANSACTIONS on Information
SP - 326
EP - 330
AU - Youwen ZHU
AU - Tsuyoshi TAKAGI
AU - Rong HU
PY - 2014
DO - 10.1587/transinf.E97.D.326
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E97-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2014
AB - Recently, Yuan et al. (IEEE Infocom'13, pp.2652-2660) proposed an efficient secure nearest neighbor (SNN) search scheme on encrypted cloud database. Their scheme is claimed to be secure against the collusion attack of query clients and cloud server, because the colluding attackers cannot infer the encryption/decryption key. In this letter, we observe that the encrypted dataset in Yuan's scheme can be broken by the collusion attack without deducing the key, and present a simple but powerful attack to their scheme. Experiment results validate the high efficiency of our attacking approach. Additionally, we also indicate an upper bound of collusion-resistant ability of any accurate SNN query scheme.
ER -
English
