TY - GEN
T1 - TightRope
T2 - 17th ACM Workshop on Privacy in the Electronic Society, WPES 2018, held in conjunction with the 25th ACM Conference on Computer and Communications Security, CCS 2018
AU - Darir, Hussein
AU - Sibai, Hussein
AU - Borisov, Nikita
AU - Dullerud, Geir
AU - Mitra, Sayan
N1 - Funding Information:
We would like to thank the anonymous referees for their helpful suggestions. This material is based upon work supported by the National Science Foundation under Grant No. 1739966.
Publisher Copyright:
© 2018 Copyright held by the owner/author(s).
PY - 2018/10/15
Y1 - 2018/10/15
N2 - We study the problem of load-balancing in path selection in anonymous networks such as Tor. We first find that the current Tor path selection strategy can create significant imbalances. We then develop a (locally) optimal algorithm for selecting paths and show, using flow-level simulation, that it results in much better balancing of load across the network. Our initial algorithm uses the complete state of the network, which is impractical in a distributed setting and can compromise users' privacy. We therefore develop a revised algorithm that relies on a periodic, differentially private summary of the network state to approximate the optimal assignment. Our simulations show that the revised algorithm significantly outperforms the current strategy while maintaining provable privacy guarantees.
AB - We study the problem of load-balancing in path selection in anonymous networks such as Tor. We first find that the current Tor path selection strategy can create significant imbalances. We then develop a (locally) optimal algorithm for selecting paths and show, using flow-level simulation, that it results in much better balancing of load across the network. Our initial algorithm uses the complete state of the network, which is impractical in a distributed setting and can compromise users' privacy. We therefore develop a revised algorithm that relies on a periodic, differentially private summary of the network state to approximate the optimal assignment. Our simulations show that the revised algorithm significantly outperforms the current strategy while maintaining provable privacy guarantees.
UR - http://www.scopus.com/inward/record.url?scp=85056826099&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85056826099&partnerID=8YFLogxK
U2 - 10.1145/3267323.3268953
DO - 10.1145/3267323.3268953
M3 - Conference contribution
AN - SCOPUS:85056826099
T3 - Proceedings of the ACM Conference on Computer and Communications Security
SP - 76
EP - 85
BT - WPES 2018 - Proceedings of the 2018 Workshop on Privacy in the Electronic Society, co-located with CCS 2018
PB - Association for Computing Machinery
Y2 - 15 October 2018
ER -