Security Analysis of Collusion-Resistant Nearest Neighbor Query Scheme on Encrypted Cloud Data

Youwen ZHU  Tsuyoshi TAKAGI  Rong HU  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E97-D   No.2   pp.326-330
Publication Date: 2014/02/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E97.D.326
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Data Engineering, Web Information Systems
Keyword: 
cloud computing,  encrypted query,  nearest neighbor,  attack,  

Full Text: PDF(215KB)>>
Buy this Article




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.