<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Secure Hot Path Crowdsourcing with Local Differential Privacy under Fog Computing Architecture</title>
  </titleInfo>
  <name type="personal">
    <namePart>Mengmeng Yang</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">xx</placeTerm>
    </place>
    <dateIssued encoding="marc">2020</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">ng </languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
  </physicalDescription>
  <abstract>Crowdsourcing plays an essential role in the Internet of Things (IoT) for data collection, where a group of workers is equipped with Internet-connected geolocated devices to collect sensor data for marketing or research purpose. In this paper, we consider crowdsourcing these worker's hot travel path. Each worker is required to report his real-time location information, which is sensitive and has to be protected. Encryption-based methods are the most direct way to protect the location, but not suitable for resource-limited devices. Besides, local differential privacy is a strong privacy concept and has been deployed in many software systems. However, the local differential privacy technology needs a large number of participants to ensure the accuracy of the estimation, which is not always the case for crowdsourcing. To solve this problem, we proposed a trie-based iterative statistic metho</abstract>
  <note>Open access — freely available to read.</note>
  <identifier type="uri">https://arxiv.org/pdf/2012.13807v1</identifier>
  <location>
    <url displayLabel="Read the full paper (PDF)">https://arxiv.org/pdf/2012.13807v1</url>
  </location>
  <accessCondition type="restrictionOnAccess">Open access — freely available to read.</accessCondition>
  <recordInfo>
    <recordCreationDate encoding="marc">250101</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260901030333.0</recordChangeDate>
  </recordInfo>
</mods>
