Preserving worker privacy in crowdsourcing

被引:23
作者
Kajino, Hiroshi [1 ]
Arai, Hiromi [2 ]
Kashima, Hisashi [3 ]
机构
[1] Univ Tokyo, Grad Sch Informat Sci & Technol, Dept Math Informat, Bunkyo Ku, Tokyo 1138656, Japan
[2] RIKEN, Adv Ctr Comp & Commun, Wako, Saitama 3510198, Japan
[3] Kyoto Univ, Grad Sch Informat, Dept Intelligence Sci & Technol, Sakyo Ku, Kyoto 6068501, Japan
关键词
Crowdsourcing; Quality control; Privacy-preserving data mining; EM algorithm;
D O I
10.1007/s10618-014-0352-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a crowdsourcing quality control method with worker-privacy preservation. Crowdsourcing allows us to outsource tasks to a number of workers. The results of tasks obtained in crowdsourcing are often low-quality due to the difference in the degree of skill. Therefore, we need quality control methods to estimate reliable results from low-quality results. In this paper, we point out privacy problems of workers in crowdsourcing. Personal information of workers can be inferred from the results provided by each worker. To formulate and to address the privacy problems, we define a worker-private quality control problem, a variation of the quality control problem that preserves privacy of workers. We propose a worker-private latent class protocol where a requester can estimate the true results with worker privacy preserved. The key ideas are decentralization of computation and introduction of secure computation. We theoretically guarantee the security of the proposed protocol and experimentally examine the computational efficiency and accuracy.
引用
收藏
页码:1314 / 1335
页数:22
相关论文
共 19 条
[1]  
Agrawal R, 2000, SIGMOD REC, V29, P439, DOI 10.1145/335191.335438
[2]  
[Anonymous], ADV NEURAL INFORM PR
[3]  
Bernstein M.S., 2011, P CHI 2011 WORKSH CR, P53
[4]  
Burkhart M, 2010, P USENIX SEC S, P223
[5]  
Damgård I, 2001, LECT NOTES COMPUT SC, V1992, P119
[6]  
Dawid A. P., 1979, J R STAT SOC C-APPL, V28, P20, DOI DOI 10.2307/2346806
[7]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[8]  
Ertekin S, 2012, P COLL INT 2012
[9]  
Lease Matthew, 2011, WORKSH 25 AAAI C ART, P1
[10]   Privacy-preserving clustering with distributed EM mixture modeling [J].
Lin, XD ;
Clifton, C ;
Zhu, M .
KNOWLEDGE AND INFORMATION SYSTEMS, 2005, 8 (01) :68-81