Victoria Manfredi
ABSTRACT
Consider a multi-hop wireless network in which devices act as anonymizing routers. Even if devices anonymize their link transmissions, an adversary may still be able to infer key information by observing the traffic patterns in the network. In this work, we quantify what impacts how well a Kalman-filter based adversary can infer unlinkability, that is, the probability that different pairs of devices are communicating, from anonymized link transmissions. We assume that devices do not reorder packets to mix traffic and thereby increase unlinkability. Instead, we show that traffic mixing is still possible due to the use of multi-hop routing and broadcast transmissions, with the amount of mixing dependent on the network characteristics. In simulation, we find that i) for unicast links, as network connectivity increases, unlinkability decreases, while for broadcast links as connectivity increases unlinkability increases, ii) link dynamics increase unlinkability in poorly connected topologies, iii) well-connected topologies achieve the same level of unlinkability with fewer transmissions per packet delivered, and (iv) a lattice topology has consistently good unlinkability in different scenarios.
- Amos Beimel and Shlomi Dolev. 2003. Buses for Anonymous Message Delivery. Journal of Cryptology 16, 1 (2003).Google Scholar
Cross Ref
- Ron Berman, Amos Fiat, Marcin Gomulkiewicz, Marek Konowski, Miroslaw Kutylowski, Tomer Levinboim, and Ammon Ta-Shma. 2015. Provable Unlinkability Against Traffic Analysis with Low Message Overhead. Journal of Cryptology 28 (2015), 623--640. Google ScholarDigital Library
- Matt Blaze, John Ioannidis, Angelos D Keromytis, Tal G Malkin, and Avi Rubin. 2009. Anonymity in wireless broadcast networks. (2009).Google Scholar
- David L. Chaum. 1981. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Commun. ACM 24, 2 (Feb. 1981). Google ScholarDigital Library
- Chen Chen, Daniele E Asoni, David Barrera, George Danezis, and Adrain Perrig. 2015. HORNET: High-speed onion routing at the network layer. In ACM SIGSAC Conference on Computer and Communications Security. Google ScholarDigital Library
- Fan RK Chung. 1996. Lectures on spectral graph theory. CBMS Lectures, Fresno 6 (1996), 17--21.Google Scholar
- George Danezis. 2003. Mix-networks with restricted routes. In International Workshop on Privacy Enhancing Technologies. 1--17.Google ScholarCross Ref
- Jing Deng, Richard Han, and Shivakant Mishra. 2006. Decorrelating wireless sensor network tra!c to inhibit traffic analysis attacks. Pervasive and Mobile Computing (2006). Google ScholarDigital Library
- Claudia Diaz, Steven Murdoch, and Carmela Troncoso. 2010. Impact of Network Topology on Anonymity and Overhead in Low-Latency Anonymity Networks. In Privacy Enhancing Technologies. Google ScholarDigital Library
- Roger Dingledine, Nick Mathewson, and Paul Syverson. 2004. Tor: The secondgeneration onion router. Technical Report. Naval Research Lab Washington DC.Google Scholar
- Roger Dingledine, Vitaly Shmatikov, and Paul F Syverson. 2004. Synchronous Batching: From Cascades to Free Routes. In PETS, Vol. 4. Springer. Google ScholarDigital Library
- Lars Fischer, Stefan Katzenbeisser, and Claudia Eckert. 2008. Measuring unlinkability revisited. In ACM workshop on Privacy in the electronic society. Google ScholarDigital Library
- Philippe Golle, Markus Jakobsson, Ari Juels, and Paul Syverson. 2004. Universal Re-encryption for Mixnets. In Topics in Cryptology -- CT-RSA 2004. 163--178.Google Scholar
- Thaier Hayajneh, Razvi Doomun, Prashant Krishnamurthy, and David Tipper. 2011. Source destination obfuscation in wireless ad hoc networks. Security and Communication Networks 4, 8 (2011), 888--901.Google ScholarCross Ref
- Dijiang Huang. 2008. Unlinkability measure for IEEE 802.11 based MANETs. IEEE Transactions on Wireless Communications 7, 3 (2008), 1025--1034. Google ScholarDigital Library
- Rudolph Emil Kalman. 1960. A New Approach to Linear Filtering and Prediction Problems. Transactions of the ASME--Journal of Basic Engineering 82, Series D (1960), 35--45.Google Scholar
- Jiejun Kong and Xiaoyan Hong. 2003. ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks. In ACM International symposium on Mobile ad hoc networking & computing. Google ScholarDigital Library
- Stefan Köpsell and Sandra Steinbrecher. 2003. Modeling unlinkability. In Proceedings of the Third Workshop on Privacy Enhancing Technologies.Google Scholar
- Brian N Levine, Michael K Reiter, Chenxi Wang, and Matthew Wright. 2004. Timing attacks in low-latency mix systems. In International Conference on Financial Cryptography. Springer, 251--265.Google ScholarCross Ref
- Yunzhong Liu, Rui Zhang, Jing Shi, and Yanchao Zhang. 2010. Traffic inference in anonymous manets. In IEEE SECON.Google Scholar
- David Luethi, Philipp Erb, and Simon Otziger. 2018. FKF: Fast Kalman Filter. R package version 0.1.5. https://cran.r-project.org/web/packages/FKF/index.html (2018).Google Scholar
- Alberto Medina, Nina Taft, Kave Salamatian, Supratik Bhattacharyya, and Christophe Diot. 2002. Traffic matrix estimation: Existing techniques and new directions. In ACM SIGCOMM Computer Communication Review, Vol. 32. ACM, 161--174. Google ScholarDigital Library
- Prateek Mittal and Nikita Borisov. 2009. Shadowwalker: peer-to-peer anonymous communication using redundant structured topologies. In ACM conference on Computer and communications security. Google ScholarDigital Library
- Prateek Mittal, Matthew Wright, and Nikita Borisov. 2012. Pisces: Anonymous communication using social networks. arXiv preprint arXiv:1208.6326 (2012).Google Scholar
- Marie Elisabeth Gaup Moe. 2009. Quantification of anonymity for mobile ad hoc networks. Electronic Notes in Theoretical Computer Science 244 (2009), 95--107. Google ScholarDigital Library
- Vakul Mohanty, Dhaval Moliya, Chittaranjan Hota, and Muttukrishnan Rajarajan. 2010. Secure anonymous routing for MANETs using distributed dynamic random path selection. In Pacific-Asia Workshop on Intelligence and Security Informatics. Springer, 65--72. Google ScholarDigital Library
- Shishir Nagaraja. 2007. Anonymity in the wild: Mixes on unstructured networks. In International workshop on privacy enhancing technologies. 254--271. Google ScholarDigital Library
- Open Garden. 2019. Firechat Messaging App. https://en.wikipedia.org/wiki/FireChat.Google Scholar
- Andreas Pfitzmann and Marit Hansen. 2010. Terminology for Talking about Privacy by Data Minimization: Anonymity, Unlinkability, Undetectability, Unobservability, Pseudonymity, and Identity Management, Internet Draft (Expired). https://tools.ietf.org/id/draft-hansen-privacy-terminology-00.html.Google Scholar
- Yang Qin, Dijiang Huang, and Bing Li. 2013. STARS: A statistical traffic pattern discovery system for MANETs. IEEE Transactions on Dependable and Secure Computing 11 (2013). Google ScholarDigital Library
- Charles Rackoff and Daniel Simon. 1993. Cryptographic Defense Against Traffic Analysis. In STOC. Google ScholarDigital Library
- Albert Reuther, Jeremy Kepner, Chansup Byun, Siddharth Samsi, William Arcand, David Bestor, Bill Bergeron, Vijay Gadepally, Michael Houle, Matthew Hubbell, et al. 2018. Interactive supercomputing on 40,000 cores for machine learning and data analysis. In 2018 IEEE High Performance extreme Computing Conference (HPEC). IEEE, 1--6.Google Scholar
- Stefaan Seys and Bart Preneel. 2006. ARM: Anonymous routing protocol for mobile ad hoc networks. In International Conference on Advanced Information Networking and Applications-Volume 1 (AINA'06). Google ScholarDigital Library
- Vitaly Shmatikov and Ming-Hsiu Wang. 2006. Measuring relationship anonymity in mix networks. In Proceedings of the 5th ACM workshop on Privacy in electronic society. ACM, 59--62. Google ScholarDigital Library
- Augustin Soule, Kavé Salamatian, Antonio Nucci, and Nina Taft. 2005. Traffic matrix tracking using kalman filters. ACM SIGMETRICS Performance Evaluation Review 33, 3 (2005), 24--31. Google ScholarDigital Library
- Frank Stajano and Ross Anderson. 1999. The cocaine auction protocol: On the power of anonymous broadcast. In International Workshop on Information Hiding. Google ScholarDigital Library
- Carmela Troncoso and George Danezis. 2009. The bayesian traffic analysis of mix networks. In ACM conference on Computer and communications security. ACM, 369--379. Google ScholarDigital Library
- Validity Labs. 2020. HOPR Messaging App. https://hopr.network/.Google Scholar
- Jelle Van Den Hooff, David Lazar, Matei Zaharia, and Nickolai Zeldovich. 2015. Vuvuzela: Scalable private messaging resistant to traffic analysis. In Symposium on Operating Systems Principles. Google ScholarDigital Library
- Yehuda Vardi. 1996. Network tomography: Estimating source-destination traffic intensities from link data. Journal of the American statistical association 91, 433(1996), 365--377.Google ScholarCross Ref
- G. Welch and G. Bishop. 1995. An Introduction to the Kalman filter. Technical Report TR95-041. U of North Carolina at Chapel Hill, Dept. of Computer Science. Google ScholarDigital Library
- Ye Zhu, Xinwen Fu, Bryan Graham, Riccardo Bettati, and Wei Zhao. 2009. Correlation-based traffic analysis attacks on anonymity networks. IEEE Transactions on Parallel and Distributed Systems 21, 7 (2009), 954--967. Google ScholarDigital Library
Index Terms
- Quantifying Unlinkability in Multi-hop Wireless Networks
Recommendations
Quantifying unlinkability in multi-hop wireless networks
AbstractConsider a multi-hop wireless network in which devices act as anonymizing routers. Even if devices anonymize their link transmissions, an adversary may still be able to infer key information by observing the traffic patterns in the ...
A novel solution for achieving anonymity in wireless ad hoc networks
PE-WASUN '04: Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networksA mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of other intermediate nodes to establish communication channels. In such an ...
Bloom filter based secure and anonymous DSR protocol in wireless ad hoc networks
Wireless ad hoc networks, especially in the hostile environment, are vulnerable to traffic analysis which allows the adversary to trace the routing messages and the sensitive data packets. Anonymity mechanism in ad hoc networks is a critical securing ...
Comments