作者
Boyang Wang, Yantian Hou, Ming Li
发表日期
2016/4/10
研讨会论文
IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications
页码范围
1-9
出版商
IEEE
简介
Nearest neighbor search (or k-nearest neighbor search in general) is one of the most fundamental queries on massive datasets, and it has extensive applications such as pattern recognition, statistical classification, graph algorithms, Location-Based Services and online recommendations. With the raising trend of outsourcing massive sensitive datasets to public clouds, it is urgent for companies and organizations to demand fast and secure nearest neighbor search solutions over their outsourced data, but without revealing privacy to untrusted clouds. However, existing solutions for secure nearest neighbor search still face significant limitations, which make them far from practice. In this paper, we propose a new searchable encryption scheme, which can efficiently and securely enable nearest neighbor search over encrypted data on untrusted clouds. Specifically, we modify the search algorithm of nearest neighbors …
引用总数
2016201720182019202020212022202320243615815103115
学术搜索中的文章