计算机工程与科学2018，Vol.40Issue(3)：418-430,13.DOI:10.3969/j.issn.1007-130X.2018.03.006
H-PCPIR-V:基于Huffman编码的PCPIR-V优化算法
H-PCPIR-V :An optimized PCPIR-V algorithm based on Huffman code
摘要
Abstract
With the privacy issues drawing more and more concerns,privacy protection techniques based on Computational Private Information Retrieval (CPIR) allow a user to retrieve data from a service provider without revealing the users query information.For large-scale applications,there exists a gap between privacy protection techniques and its feasibility.For the problem that the CPIR algorithm needs long computing time so as not to be suitable for large-scale data privacy protection,this paper proposes a CPIR nearest neighbor privacy protection algorithm (H-PCPIR-V) based on Spark and Huffman code.The H-PCPIR-V algorithm partitions the spatial data into Voronoi diagrams according to the points of interest in the data preprocessing stage,and then utilizes the Huffman code to compress the candidate data in order to reduce bit computation operation.Spark parallel framework is used for query grid parallel computing in the server side.The experimental results show that the computational cost of HPCPIR-V algorithm is about 30 ％ lower than that of PCPIR-V algorithm on the server side,the computational cost of client is about 10％ lower,and the communication cost is about 40％ lower.关键词
查询隐私保护/基于计算能力的私有信息检索/哈夫曼编码/最近邻查询Key words
query privacy protection/computational private information retrieval/Huffman code/nearest neighbor query分类
信息技术与安全科学引用本文复制引用
王波涛,李昂,陈月梅,邓诗卓,常博涵,吴俊学..H-PCPIR-V:基于Huffman编码的PCPIR-V优化算法[J].计算机工程与科学,2018,40(3):418-430,13.基金项目
国家自然科学基金(61173030) （61173030）
