Filters








2,606 Hits in 3.9 sec

Exploring the potential benefits of expanded rate limiting in Tor

W. Brad Moore, Chris Wacek, Micah Sherr
2011 Proceedings of the 27th Annual Computer Security Applications Conference on - ACSAC '11  
Tor is a volunteer-operated network of application-layer relays that enables users to communicate privately and anonymously.  ...  We demonstrate that Tortoise incurs little penalty for interactive web users, while significantly decreasing the throughput for filesharers.  ...  Acknowledgements We thank the anonymous reviewers for their helpful feedback, and Kevin Bauer for several thoughtful discussions about this work.  ... 
doi:10.1145/2076732.2076762 dblp:conf/acsac/MooreWS11 fatcat:ipovg6abpfbd5iifs5n6e7srhi

Performance and Security Improvements for Tor

Mashael Alsabah, Ian Goldberg
2016 ACM Computing Surveys  
Tor [Dingledine et al. 2004 ] is the most widely used anonymity network today, serving millions of users on a daily basis using a growing number of volunteer-run routers.  ...  Given the significance of this research area, our goal is to provide the reader with the state of current research directions and challenges in anonymous communication systems, focusing on the Tor network  ...  It has been observed that circuits that use bridges are significantly slower than those that use non-bridge routers ].  ... 
doi:10.1145/2946802 fatcat:xbhzj55r2vfs5hzt6dmxdffy6i

PA-SHWMP: a privacy-aware secure hybrid wireless mesh protocol for IEEE 802.11s wireless mesh networks

Hui Lin, Jianfeng Ma, Jia Hu, Kai Yang
2012 EURASIP Journal on Wireless Communications and Networking  
Moreover, the convergence time of PA-SHWMP is smaller than HWMP and SHWMP with any percentage of malicious mesh routers.  ...  Acknowledgements The authors would like to thank the anonymous reviewers and the editor for their constructive comments that have helped us to improve this article.  ...  We classify interactions among nodes into positive interaction, negative interaction, and uncertain interaction.  ... 
doi:10.1186/1687-1499-2012-69 fatcat:5x2ogszpdbaddgiamvavpwkr7e

PA-SHWMP: a privacy-aware secure hybrid wireless mesh protocol for IEEE 802.11s wireless mesh networks

Hui Lin, Jianfeng Ma, Jia Hu, Kai Yang
2012 EURASIP Journal on Wireless Communications and Networking  
Moreover, the convergence time of PA-SHWMP is smaller than HWMP and SHWMP with any percentage of malicious mesh routers.  ...  Acknowledgements The authors would like to thank the anonymous reviewers and the editor for their constructive comments that have helped us to improve this article.  ...  We classify interactions among nodes into positive interaction, negative interaction, and uncertain interaction.  ... 
doi:10.1186/preaccept-1151503215536238 fatcat:hfnv32pvpbel3kke5eo6xuwqym

An Empirical Study of the I2P Anonymity Network and its Censorship Resistance [article]

Nguyen Phong Hoang, Panagiotis Kintis, Manos Antonakakis, Michalis Polychronakis
2018 arXiv   pre-print
Tor and I2P are well-known anonymity networks used by many individuals to protect their online privacy and anonymity.  ...  In this work, we conduct an empirical study of the I2P network, in which we measure properties including population, churn rate, router type, and the geographic distribution of I2P peers.  ...  ACKNOWLEDGMENTS We would like to thank our shepherd, Mirja Kühlewind, the anonymous reviewers, and the following members of the I2P team for their valuable feedback: Sadie Doreen, str4d, echelon, meeh,  ... 
arXiv:1809.09086v1 fatcat:ykxgau74fjgqtbseytwxemdyiq

Shedding Light on the Dark Corners of the Internet: A Survey of Tor Research [article]

Saad Saleh, Junaid Qadir, Muhammad U. Ilyas
2018 arXiv   pre-print
Anonymity services have seen high growth rates with increased usage in the past few years. Among various services, Tor is one of the most popular peer-to-peer anonymizing service.  ...  Our research shows that 'security' and 'anonymity' are the most frequent keywords associated with Tor research studies.  ...  Setup was configured for both experiments separately covering (1) exit router and (2) non-exit router.  ... 
arXiv:1803.02816v1 fatcat:kl5fkcq5tnbczblpgdesatocji

Probabilistic analysis of onion routing in a black-box model

Joan Feigenbaum, Aaron Johnson, Paul Syverson
2012 ACM Transactions on Privacy and Security  
This worst-case anonymity with an adversary that controls a fraction b of the routers is shown to be comparable to the best-case anonymity against an adversary that controls a fraction √ b.  ...  The analysis is presented in a black-box model of anonymous communication in the Universally Composable framework that abstracts the essential properties of onion routing in the presence of an active adversary  ...  Some later designs returned to the non-interactive circuit construction of the original [Øverlier and Syverson 2007; Kate et al. 2007 ].  ... 
doi:10.1145/2382448.2382452 fatcat:mecsvctt7nhv5mah7aaytrwody

Probabilistic analysis of onion routing in a black-box model

Joan Feigenbaum, Aaron Johnson, Paul Syverson
2007 Proceedings of the 2007 ACM workshop on Privacy in electronic society - WPES '07  
This worst-case anonymity with an adversary that controls a fraction b of the routers is shown to be comparable to the best-case anonymity against an adversary that controls a fraction √ b.  ...  The analysis is presented in a black-box model of anonymous communication in the Universally Composable framework that abstracts the essential properties of onion routing in the presence of an active adversary  ...  Some later designs returned to the non-interactive circuit construction of the original [Øverlier and Syverson 2007; Kate et al. 2007 ].  ... 
doi:10.1145/1314333.1314335 dblp:conf/wpes/FeigenbaumJS07 fatcat:dcpqdymyivf3jokr2fbtxpclse

Probabilistic Analysis of Onion Routing in a Black-box Model [article]

Joan Feigenbaum, Aaron Johnson, Paul Syverson
2011 arXiv   pre-print
This worst-case anonymity with an adversary that controls a fraction b of the routers is shown to be comparable to the best-case anonymity against an adversary that controls a fraction \surdb.  ...  The analysis is presented in a black-box model of anonymous communication in the Universally Composable framework that abstracts the essential properties of onion routing in the presence of an active adversary  ...  Some later designs returned to the non-interactive circuit construction of the original [Øverlier and Syverson 2007; Kate et al. 2007 ].  ... 
arXiv:1111.2520v1 fatcat:elowzmvnwfhxtekwatmmaymn5i

Enhancing Tor's performance using real-time traffic classification

Mashael AlSabah, Kevin Bauer, Ian Goldberg
2012 Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12  
It consists of volunteeroperated routers from all around the world that serve hundreds of thousands of users every day.  ...  Tor is a low-latency anonymity-preserving network that enables its users to protect their privacy online.  ...  We thank the anonymous reviewers for their helpful comments and suggestions. We thank NSERC, ORF, Qatar University, and The Tor Project, Inc. for funding this research.  ... 
doi:10.1145/2382196.2382208 dblp:conf/ccs/AlSabahBG12 fatcat:zejmuec3jbgi7ahsx2gjxfyeyy

Security, Privacy, and Access Control in Information-Centric Networking: A Survey [article]

Reza Tourani, Travis Mick, Satyajayant Misra, Gaurav Panwar
2017 arXiv   pre-print
In the broad area of privacy, we discuss user privacy and anonymity, name and signature privacy, and content privacy.  ...  Router Collaboration Dai et al. [24] Router Non-Existent Rate Limiting & PIT Size Monitoring Not Applicable Router Collaboration Statistical Modeling Wang et al. [25] Router Non-Existent Fuzzy  ...  Limiting & Per-face Statistics Storing Statistics Individual Routers Router Existing & Non-Existent Compagno et al. [23] Router Non-Existent Rate Limiting & Per-face Statistics Storing Statistics  ... 
arXiv:1603.03409v3 fatcat:ynhnoqve3nbzrdvlxy4jigzlkq

Congestion-Aware Path Selection for Tor [chapter]

Tao Wang, Kevin Bauer, Clara Forero, Ian Goldberg
2012 Lecture Notes in Computer Science  
This can degrade the network's performance, discourage Tor adoption, and consequently reduce the size of Tor's anonymity set.  ...  Tor, an anonymity network formed by volunteer nodes, uses the estimated bandwidth of the nodes as a central feature of its path selection algorithm.  ...  We empirically find γ = 0.02 s to be a good value; this is not large enough to cover the differential between congested and non-congested nodes, yet it ensures that convergence will not take too long.  ... 
doi:10.1007/978-3-642-32946-3_9 fatcat:zkojiirp3jfangerpcdttwyefi

Spread Identity: A new dynamic address remapping mechanism for anonymity and DDoS defense

Dhananjay Phatak, Alan T. Sherman, Nikhil Joshi, Bhushan Sonawane, Vivek G. Relan, Amol Dawalbhakta
2013 Journal of Computer Security  
We present and experimentally evaluate Spread Identity (SI)-a new dynamic network address remapping mechanism that provides anonymity and DDoS defense capabilities for Internet communications.  ...  Deploying SI requires changes to organizational gateways and, possibly, to the edgerouters that interface with organizational gateways; but network mechanisms farther upstream, including the core routers  ...  Other relay-based anonymity techniques fall into two categories: those that introduce large and variable latency (e.g., Babel [27] and Mixminion [17] , and those for interactive applications such as  ... 
doi:10.3233/jcs-2012-0463 fatcat:fdg2i2hetnbqni2g4dznzrvzni

A Sophisticated Privacy-Enhanced Yet Accountable Security Framework for Metropolitan Wireless Mesh Networks

Kui Ren, Wenjing Lou
2008 2008 The 28th International Conference on Distributed Computing Systems  
Anonymity: It simultaneously enables unilateral anonymous authentication between users and mesh routers and bilateral anonymous authentication between any two users.  ...  In PEACE, the user identity is a multi-faceted information as network users as society members always interact with WMNs in different roles and contexts.  ... 
doi:10.1109/icdcs.2008.18 dblp:conf/icdcs/RenL08 fatcat:zgxstmj7nzhwhmjz6yryrrh7nm

QoS ad hoc Internetworking: Dynamic Adaptation of Differentiated Services Boundaries [chapter]

Michael Smirnov
2000 Lecture Notes in Computer Science  
We address only one issue of this -adaptation of the differentiated services architecture, in particular, dynamic creation of DiffServ virtual boundaries.  ...  Not excluding this possibility, the paper focuses mainly on a traditional differentiation of packet forwarding paths inside a router.  ...  Such an approach is explicitely a non-target for this work.  ... 
doi:10.1007/3-540-40019-2_16 fatcat:inn7kq6jlfgxzfkstox7cvubki
« Previous Showing results 1 — 15 out of 2,606 results