<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01428nam a2200169 a 4500</leader>
  <controlfield tag="005">20260901030333.0</controlfield>
  <controlfield tag="008">250101s2020    xx     o     000 0 eng d</controlfield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Mengmeng Yang</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Secure Hot Path Crowdsourcing with Local Differential Privacy under Fog Computing Architecture</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="b">arXiv</subfield>
    <subfield code="c">2020</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">online resource</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">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</subfield>
  </datafield>
  <datafield tag="506" ind1="0" ind2=" ">
    <subfield code="a">Open access &#x2014; freely available to read.</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">https://arxiv.org/pdf/2012.13807v1</subfield>
    <subfield code="y">Read the full paper (PDF)</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">ERES</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">648</subfield>
    <subfield code="d">648</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">3</subfield>
    <subfield code="8">CYB</subfield>
    <subfield code="a">MAIN</subfield>
    <subfield code="b">MAIN</subfield>
    <subfield code="c">SCICOMP</subfield>
    <subfield code="d">2026-09-01</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">YGE000909</subfield>
    <subfield code="r">2026-09-01 03:03:33</subfield>
    <subfield code="u">https://arxiv.org/pdf/2012.13807v1</subfield>
    <subfield code="w">2026-09-01</subfield>
    <subfield code="y">PAPER</subfield>
  </datafield>
</record>
