Local differential privacy for human-centered computing

被引:3
作者
Fang, Xianjin [1 ]
Zeng, Qingkui [1 ]
Yang, Gaoming [1 ]
机构
[1] Anhui Univ Sci & Technol, Sch Comp Sci & Engn, Huainan 232001, Peoples R China
基金
中国国家自然科学基金;
关键词
Human-centered computing; Local differential privacy; Laplace noise; Count sketch; COMPUTATION OFFLOADING METHOD; SERVICE RECOMMENDATION;
D O I
10.1186/s13638-020-01675-8
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Human-centered computing in cloud, edge, and fog is one of the most concerning issues. Edge and fog nodes generate huge amounts of data continuously, and the analysis of these data provides valuable information. But they also increase privacy risks. The personal sensitive data may be disclosed by untrusted third-party service providers, and the current solutions to privacy protection are inefficient, costly. It is difficult to obtain available statistics. To solve these problems, we propose a local differential privacy sensitive data collection protocol in human-centered computing. Firstly, to maintain high data utility, the selection of the optimal number of hash functions and the mapping length is based on the size of the collected data. Secondly, we hash the sensitive data, add the appropriate Laplace noise to the client side, and send the reports to the server side. Thirdly, we construct the count sketch matrix to obtain privacy statistics on the server side. Finally, the utility of the proposed protocol is verified by synthetic datasets and a real dataset. The experimental results demonstrate that the protocol can achieve a balance between data utility and privacy protection.
引用
收藏
页数:12
相关论文
共 34 条
[1]  
Acharya J., 2018, ABS180204705 CORR
[2]  
[Anonymous], 2020, IEEE J OCEANIC ENG, DOI DOI 10.1109/JOE.2019.2920217
[3]  
[Anonymous], R GOEKEN J GROVER E
[4]  
[Anonymous], 2019, ARXIV190508320
[5]  
[Anonymous], 2018, ADV NEURAL INFORM PR
[6]  
[Anonymous], 2019, ARXIV191112834
[7]  
[Anonymous], APPL LEARN PRIV SCAL
[8]   Local, Private, Efficient Protocols for Succinct Histograms [J].
Bassily, Raef ;
Smith, Adam .
STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, :127-135
[9]   An improved data stream summary: the count-min sketch and its applications [J].
Cormode, G ;
Muthukrishnan, S .
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2005, 55 (01) :58-75
[10]  
Ding B., 2017, P 31 C NEUR INF PROC, P3571