Privacy-Preserving Batch-based Task Assignment in Spatial Crowdsourcing with Untrusted Server

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 pre...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Li, Maocheng, Wang, Jiachuan, Zheng, Libin, Wu, Han, Cheng, Peng, Chen, Lei, Lin, Xuemin
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 23.08.2021
Subjects
Online AccessGet full text

Cover

Loading…
Abstract 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.
AbstractList 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.
Author Zheng, Libin
Li, Maocheng
Wu, Han
Chen, Lei
Wang, Jiachuan
Cheng, Peng
Lin, Xuemin
Author_xml – sequence: 1
  givenname: Maocheng
  surname: Li
  fullname: Li, Maocheng
– sequence: 2
  givenname: Jiachuan
  surname: Wang
  fullname: Wang, Jiachuan
– sequence: 3
  givenname: Libin
  surname: Zheng
  fullname: Zheng, Libin
– sequence: 4
  givenname: Han
  surname: Wu
  fullname: Wu, Han
– sequence: 5
  givenname: Peng
  surname: Cheng
  fullname: Cheng, Peng
– sequence: 6
  givenname: Lei
  surname: Chen
  fullname: Chen, Lei
– sequence: 7
  givenname: Xuemin
  surname: Lin
  fullname: Lin, Xuemin
BookMark eNqNzN0KgjAcBfARBVn5DoOuBduaH5clRZdCdhmydOnMpu0_ld4-gx6gq3Nxzu8s0FQ1SkyQRSjdOMGWkDmyASrXdYnnE8aoha6xlj3P3k6sBQjdS1XgPTdZ6dw4iBwnHB54ByAL9RTKYKnwueVG8hpHuhlyaDqdfdEgTYkvyugOzOjO45fQKzS78xqE_cslWh8PSXRyWt28OgEmrUavxiolzKOhH7LAp_-tPslaRjM
ContentType Paper
Copyright 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PIMPY
PQEST
PQQKQ
PQUKI
PRINS
PTHSS
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Database (Proquest)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
ProQuest Engineering Database
Publicly Available Content Database
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest One Academic
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PIMPY
PQEST
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-proquest_journals_25639795873
IEDL.DBID 8FG
IngestDate Tue Sep 24 21:25:05 EDT 2024
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-proquest_journals_25639795873
OpenAccessLink https://www.proquest.com/docview/2563979587/abstract/?pq-origsite=%requestingapplication%
PQID 2563979587
PQPubID 2050157
ParticipantIDs proquest_journals_2563979587
PublicationCentury 2000
PublicationDate 20210823
PublicationDateYYYYMMDD 2021-08-23
PublicationDate_xml – month: 08
  year: 2021
  text: 20210823
  day: 23
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2021
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 3.3433084
SecondaryResourceType preprint
Snippet 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...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Computation
Crowdsourcing
Privacy
Title Privacy-Preserving Batch-based Task Assignment in Spatial Crowdsourcing with Untrusted Server
URI https://www.proquest.com/docview/2563979587/abstract/
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LS8NAEB5qg-DNJz5qWdDr0s07OQktiUFoCdJCL1Kym00tQvpIEbz4251ZWgUPPYZlk82w-33km5l8AI_IYaoSQnEdRIp7stJcRoHk0lcxjgShU1Hv8HAUZBPvZepPW5Dte2GorHKPiQaoy6UijbyH1EwpKD8Ke4UkFUBte0-rNSf_KMqz7sw0jsCy6Z941DOePv-qLQ4-1CcD5H-Aa1gkPQUrL1Z6cwYtXZ_DsSm-VM0FvOWbxWehvjjVQ9DZreesjxD5zoljSjYumg-GcVzMTeqeLWpGTsK4c9gAv6JLI8DTJBJV2aQ2fRQ4j3BAby7hIU3Gg4zv1zTb7Z9m9ve27hW062Wtr4E5cRViaIVna-FJMtcMhHZLt5Q61n5l30Dn0J1uDw_fwYlD9RoCT47bgTauVd8j4W5l18SyC1Y_GeWveDX8Tn4AlvCODg
link.rule.ids 786,790,12792,21416,33408,33779,43635,43840
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LS8NAEB60RezNJz6qLuh1cZt3ToLFGLUtPaTQi4TsZlODEGtSBP-9M0uq4KHnZV_DznzsNzN8ADeIYaoQQnHtBYo7stBcBp7k0lUhjni-VVDv8HjixTPnee7OW8Ktacsq1zHRBOr8QxFHfovQTCkoN_Dvlp-cVKMou9pKaGxD17FxW-oUjx5_ORYLt3JJ9vhfmDXYEe1Bd5otdb0PW7o6gB1TcqmaQ3id1uVXpr45VUGQx1YLdo-B8Y0TsuQsyZp3htYrFyZhz8qKkX4wvhc2xL9zbmh3mkRUKptVpnsC55H36_oIrqOHZBjz9ZnS9tU06d8d7WPo4PdfnwCzwsJHgwpnoIUjSVLTE9rO7VzqULvF4BT6m1Y62zx8BbtxMh6lo6fJyzn0LKrYEOg7dh86eG59gZC7kpfGrj_fn4px
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Privacy-Preserving+Batch-based+Task+Assignment+in+Spatial+Crowdsourcing+with+Untrusted+Server&rft.jtitle=arXiv.org&rft.au=Li%2C+Maocheng&rft.au=Wang%2C+Jiachuan&rft.au=Zheng%2C+Libin&rft.au=Wu%2C+Han&rft.date=2021-08-23&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422