Optimal privacy control for transport network data sharing

Brian Yueshuai He, Joseph Y.J. Chow

Research output: Contribution to journalConference article

Abstract

In the era of smart cities, Internet of Things, and Mobility-as-a-Service, the need for private operators to willingly share data with public agencies is greater than ever before. However, it is still problematic for private operators to share data with the public due to risks to competitive advantages. A privacy control algorithm is proposed to overcome this key obstacle for private operators sharing complex network-oriented data objects. The algorithm is based on information-theoretic k-anonymity where an operator's tour data is used in conjunction with performance measure accuracy controls to synthesize a set of alternative tours with diffused probabilities for sampling during a query. The algorithm is proven to converge sublinearly toward constrained maximum entropy under certain asymptotic conditions with measurable optimality gap. Computational experiments verify the applicability to multi-vehicle fleet tour data; confirm that reverse engineered parameters from the diffused data results in controllable sampling error; and tests conducted on a set of realistic routing records from travel data in Long Island, NY, demonstrate the use of the methodology from both the adversary and user perspectives.

Original languageEnglish (US)
Pages (from-to)792-811
Number of pages20
JournalTransportation Research Procedia
Volume38
DOIs
StatePublished - Jan 1 2018
Event23rd International Symposium on Transportation and Traffic Theory, ISTTT 2019 - Lausanne, Switzerland
Duration: Jul 24 2018Jul 26 2018

Fingerprint

transport network
privacy
Sampling
Complex networks
Entropy
sampling error
anonymity
entropy
Experiments
travel
Internet
experiment
methodology
performance

Keywords

  • Entropy maximization
  • K-anonymity
  • Open data
  • Privacy
  • Tour generation

ASJC Scopus subject areas

  • Transportation

Cite this

Optimal privacy control for transport network data sharing. / He, Brian Yueshuai; Chow, Joseph Y.J.

In: Transportation Research Procedia, Vol. 38, 01.01.2018, p. 792-811.

Research output: Contribution to journalConference article

@article{b7d58291f8224042ad2da67645a158ed,
title = "Optimal privacy control for transport network data sharing",
abstract = "In the era of smart cities, Internet of Things, and Mobility-as-a-Service, the need for private operators to willingly share data with public agencies is greater than ever before. However, it is still problematic for private operators to share data with the public due to risks to competitive advantages. A privacy control algorithm is proposed to overcome this key obstacle for private operators sharing complex network-oriented data objects. The algorithm is based on information-theoretic k-anonymity where an operator's tour data is used in conjunction with performance measure accuracy controls to synthesize a set of alternative tours with diffused probabilities for sampling during a query. The algorithm is proven to converge sublinearly toward constrained maximum entropy under certain asymptotic conditions with measurable optimality gap. Computational experiments verify the applicability to multi-vehicle fleet tour data; confirm that reverse engineered parameters from the diffused data results in controllable sampling error; and tests conducted on a set of realistic routing records from travel data in Long Island, NY, demonstrate the use of the methodology from both the adversary and user perspectives.",
keywords = "Entropy maximization, K-anonymity, Open data, Privacy, Tour generation",
author = "He, {Brian Yueshuai} and Chow, {Joseph Y.J.}",
year = "2018",
month = "1",
day = "1",
doi = "10.1016/j.trpro.2019.05.041",
language = "English (US)",
volume = "38",
pages = "792--811",
journal = "Transportation Research Procedia",
issn = "2352-1457",
publisher = "Elsevier",

}

TY - JOUR

T1 - Optimal privacy control for transport network data sharing

AU - He, Brian Yueshuai

AU - Chow, Joseph Y.J.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In the era of smart cities, Internet of Things, and Mobility-as-a-Service, the need for private operators to willingly share data with public agencies is greater than ever before. However, it is still problematic for private operators to share data with the public due to risks to competitive advantages. A privacy control algorithm is proposed to overcome this key obstacle for private operators sharing complex network-oriented data objects. The algorithm is based on information-theoretic k-anonymity where an operator's tour data is used in conjunction with performance measure accuracy controls to synthesize a set of alternative tours with diffused probabilities for sampling during a query. The algorithm is proven to converge sublinearly toward constrained maximum entropy under certain asymptotic conditions with measurable optimality gap. Computational experiments verify the applicability to multi-vehicle fleet tour data; confirm that reverse engineered parameters from the diffused data results in controllable sampling error; and tests conducted on a set of realistic routing records from travel data in Long Island, NY, demonstrate the use of the methodology from both the adversary and user perspectives.

AB - In the era of smart cities, Internet of Things, and Mobility-as-a-Service, the need for private operators to willingly share data with public agencies is greater than ever before. However, it is still problematic for private operators to share data with the public due to risks to competitive advantages. A privacy control algorithm is proposed to overcome this key obstacle for private operators sharing complex network-oriented data objects. The algorithm is based on information-theoretic k-anonymity where an operator's tour data is used in conjunction with performance measure accuracy controls to synthesize a set of alternative tours with diffused probabilities for sampling during a query. The algorithm is proven to converge sublinearly toward constrained maximum entropy under certain asymptotic conditions with measurable optimality gap. Computational experiments verify the applicability to multi-vehicle fleet tour data; confirm that reverse engineered parameters from the diffused data results in controllable sampling error; and tests conducted on a set of realistic routing records from travel data in Long Island, NY, demonstrate the use of the methodology from both the adversary and user perspectives.

KW - Entropy maximization

KW - K-anonymity

KW - Open data

KW - Privacy

KW - Tour generation

UR - http://www.scopus.com/inward/record.url?scp=85074907092&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85074907092&partnerID=8YFLogxK

U2 - 10.1016/j.trpro.2019.05.041

DO - 10.1016/j.trpro.2019.05.041

M3 - Conference article

AN - SCOPUS:85074907092

VL - 38

SP - 792

EP - 811

JO - Transportation Research Procedia

JF - Transportation Research Procedia

SN - 2352-1457

ER -