DPSelect: A Differential Privacy Based Guard Relay Selection Algorithm for Tor
Recent work has shown that Tor is vulnerable to attacks that manipulate inter-domain routing to compromise user privacy. Proposed solutions such as Counter-RAPTOR [29] attempt to ameliorate this issue by favoring Tor entry relays that have high resilience to these attacks. However, because these def...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2019-04-01
|
Series: | Proceedings on Privacy Enhancing Technologies |
Subjects: | |
Online Access: | https://doi.org/10.2478/popets-2019-0025 |
id |
doaj-77e3848198764bf09ec5b48815bcac70 |
---|---|
record_format |
Article |
spelling |
doaj-77e3848198764bf09ec5b48815bcac702021-09-05T14:01:09ZengSciendoProceedings on Privacy Enhancing Technologies2299-09842019-04-012019216618610.2478/popets-2019-0025popets-2019-0025DPSelect: A Differential Privacy Based Guard Relay Selection Algorithm for TorHanley Hans0Sun Yixin1Wagh Sameer2Mittal Prateek3Princeton UniversityPrinceton UniversityPrinceton UniversityPrinceton UniversityRecent work has shown that Tor is vulnerable to attacks that manipulate inter-domain routing to compromise user privacy. Proposed solutions such as Counter-RAPTOR [29] attempt to ameliorate this issue by favoring Tor entry relays that have high resilience to these attacks. However, because these defenses bias Tor path selection on the identity of the client, they invariably leak probabilistic information about client identities. In this work, we make the following contributions. First, we identify a novel means to quantify privacy leakage in guard selection algorithms using the metric of Max-Divergence. Max-Divergence ensures that probabilistic privacy loss is within strict bounds while also providing composability over time. Second, we utilize Max-Divergence and multiple notions of entropy to understand privacy loss in the worst-case for Counter-RAPTOR. Our worst-case analysis provides a fresh perspective to the field, as prior work such as Counter-RAPTOR only analyzed average case-privacy loss. Third, we propose modifications to Counter-RAPTOR that incorporate worst-case Max-Divergence in its design. Specifically, we utilize the exponential mechanism (a mechanism for differential privacy) to guarantee a worst-case bound on Max-Divergence/privacy loss. For the quality function used in the exponential mechanism, we show that a Monte-Carlo sampling-based method for stochastic optimization can be used to improve multi-dimensional trade-offs between security, privacy, and performance. Finally, we demonstrate that compared to Counter-RAPTOR, our approach achieves an 83% decrease in Max-Divergence after one guard selection and a 245% increase in worst-case Shannon entropy after 5 guard selections. Notably, experimental evaluations using the Shadow emulator shows that our approach provides these privacy benefits with minimal impact on system performance.https://doi.org/10.2478/popets-2019-0025differential privacymax-divergencebgp hijack attacks |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hanley Hans Sun Yixin Wagh Sameer Mittal Prateek |
spellingShingle |
Hanley Hans Sun Yixin Wagh Sameer Mittal Prateek DPSelect: A Differential Privacy Based Guard Relay Selection Algorithm for Tor Proceedings on Privacy Enhancing Technologies differential privacy max-divergence bgp hijack attacks |
author_facet |
Hanley Hans Sun Yixin Wagh Sameer Mittal Prateek |
author_sort |
Hanley Hans |
title |
DPSelect: A Differential Privacy Based Guard Relay Selection Algorithm for Tor |
title_short |
DPSelect: A Differential Privacy Based Guard Relay Selection Algorithm for Tor |
title_full |
DPSelect: A Differential Privacy Based Guard Relay Selection Algorithm for Tor |
title_fullStr |
DPSelect: A Differential Privacy Based Guard Relay Selection Algorithm for Tor |
title_full_unstemmed |
DPSelect: A Differential Privacy Based Guard Relay Selection Algorithm for Tor |
title_sort |
dpselect: a differential privacy based guard relay selection algorithm for tor |
publisher |
Sciendo |
series |
Proceedings on Privacy Enhancing Technologies |
issn |
2299-0984 |
publishDate |
2019-04-01 |
description |
Recent work has shown that Tor is vulnerable to attacks that manipulate inter-domain routing to compromise user privacy. Proposed solutions such as Counter-RAPTOR [29] attempt to ameliorate this issue by favoring Tor entry relays that have high resilience to these attacks. However, because these defenses bias Tor path selection on the identity of the client, they invariably leak probabilistic information about client identities. In this work, we make the following contributions. First, we identify a novel means to quantify privacy leakage in guard selection algorithms using the metric of Max-Divergence. Max-Divergence ensures that probabilistic privacy loss is within strict bounds while also providing composability over time. Second, we utilize Max-Divergence and multiple notions of entropy to understand privacy loss in the worst-case for Counter-RAPTOR. Our worst-case analysis provides a fresh perspective to the field, as prior work such as Counter-RAPTOR only analyzed average case-privacy loss. Third, we propose modifications to Counter-RAPTOR that incorporate worst-case Max-Divergence in its design. Specifically, we utilize the exponential mechanism (a mechanism for differential privacy) to guarantee a worst-case bound on Max-Divergence/privacy loss. For the quality function used in the exponential mechanism, we show that a Monte-Carlo sampling-based method for stochastic optimization can be used to improve multi-dimensional trade-offs between security, privacy, and performance. Finally, we demonstrate that compared to Counter-RAPTOR, our approach achieves an 83% decrease in Max-Divergence after one guard selection and a 245% increase in worst-case Shannon entropy after 5 guard selections. Notably, experimental evaluations using the Shadow emulator shows that our approach provides these privacy benefits with minimal impact on system performance. |
topic |
differential privacy max-divergence bgp hijack attacks |
url |
https://doi.org/10.2478/popets-2019-0025 |
work_keys_str_mv |
AT hanleyhans dpselectadifferentialprivacybasedguardrelayselectionalgorithmfortor AT sunyixin dpselectadifferentialprivacybasedguardrelayselectionalgorithmfortor AT waghsameer dpselectadifferentialprivacybasedguardrelayselectionalgorithmfortor AT mittalprateek dpselectadifferentialprivacybasedguardrelayselectionalgorithmfortor |
_version_ |
1717810708084686848 |