In this paper, we study the privacy-preserving task assignment in spatial crowdsourcing, where the locations of both workers and tasks, prior to their release to the server, are perturbed with Geo-Indistinguishability (a differential privacy notion for location-based systems). Different from the previously studied online setting, where each task is assigned immediately upon arrival, we target the batch-based setting, where the server maximizes the number of successfully assigned tasks after a batch of tasks arrive. To achieve this goal, we propose the k-Switch solution, which first divides the workers into small groups based on the perturbed distance between workers/tasks, and then utilizes Homomorphic Encryption (HE) based secure computation to enhance the task assignment. Furthermore, we expedite HE-based computation by limiting the size of the small groups under k. Extensive experiments demonstrate that, in terms of the number of successfully assigned tasks, the k-Switch solution improves batch-based baselines by 5.9X and the existing online solution by 1.74X, with no privacy leak.
翻译:在本文中,我们研究了空间众包中保护隐私的任务分配,在空间众包中,工人的位置和任务在被放入服务器之前都与地理不易分化(基于地点的系统有区别的隐私概念 ) 。 与以前研究过的在线设置不同,每个任务都是在抵达后立即分配的,我们的目标是分批设置,服务器在一组任务到达后最大限度地增加成功分配任务的数量。为了实现这一目标,我们提议了 k-开关解决方案,首先根据工人/任务之间的间隔距离将工人分成小群体,然后利用基于基因变异加密(HE)的安全计算来加强任务分配。 此外,我们通过限制K.下的小群体的规模,加快基于HE的计算。 广泛的实验表明,从成功分配任务的数量来看,K-开关解决方案将基于批量的基线提高5.9X,现有在线解决方案改进1.74X,没有隐私泄漏。