Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
A note on a method for generating points uniformly on n-dimensional spheres
Communications of the ACM
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Some findings on the network performance of broadband hosts
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
An empirical evaluation of wide-area internet bottlenecks
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Location diversity in anonymity networks
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
The predecessor attack: An analysis of a threat to anonymous communications systems
ACM Transactions on Information and System Security (TISSEC)
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
On suitability of Euclidean embedding of internet hosts
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
S3: a scalable sensing service for monitoring large networked systems
Proceedings of the 2006 SIGCOMM workshop on Internet network management
Hot or not: revealing hidden services by their clock skew
Proceedings of the 13th ACM conference on Computer and communications security
A network positioning system for the internet
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
OASIS: anycast for any service
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Securing internet coordinate embedding systems
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Towards network triangle inequality violation aware distributed systems
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Low-resource routing attacks against tor
Proceedings of the 2007 ACM workshop on Privacy in electronic society
On the accuracy of decentralized virtual coordinate systems in adversarial networks
Proceedings of the 14th ACM conference on Computer and communications security
Towards application-aware anonymous routing
HOTSEC'07 Proceedings of the 2nd USENIX workshop on Hot topics in security
A locality-aware approach to distributed systems
A locality-aware approach to distributed systems
Metrics for Security and Performance in Low-Latency Anonymity Systems
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
On the treeness of internet latency and bandwidth
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
A reputation-based approach for securing vivaldi embedding system
EUNICE'07 Proceedings of the 13th open European summer school and IFIP TC6.6 conference on Dependable and adaptable networks and services
Veracity: a fully decentralized service for securing network coordinate systems
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Veracity: practical secure network coordinates via vote-based agreements
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
Empirical tests of anonymous voice over IP
Journal of Network and Computer Applications
ExperimenTor: a testbed for safe and realistic tor experimentation
CSET'11 Proceedings of the 4th conference on Cyber security experimentation and test
Proceedings of the 27th Annual Computer Security Applications Conference
Poster: shaping network topology for privacy and performance
Proceedings of the 18th ACM conference on Computer and communications security
Collaborative red teaming for anonymity system evaluation
CSET'12 Proceedings of the 5th USENIX conference on Cyber Security Experimentation and Test
Users get routed: traffic correlation on tor by realistic adversaries
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
PCTCP: per-circuit TCP-over-IPsec transport for anonymous communication overlay networks
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
The design and implementation of the A3 application-aware anonymity platform
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The performance of an anonymous path can be described using many network metrics --- e.g., bandwidth, latency, jitter, loss, etc. However, existing relay selection algorithms have focused exclusively on producing paths with high bandwidth. In contrast to traditional node-based path techniques in which relay selection is biased by relays' node-characteristics (i.e., bandwidth), this paper presents the case for link-based path generation in which relay selection is weighted in favor of the highest performing links. Link-based relay selection supports more flexible routing, enabling anonymous paths with low latency, jitter, and loss, in addition to high bandwidth. Link-based approaches are also more secure than node-based techniques, eliminating "hotspots" in the network that attract a disproportionate amount of traffic. For example, misbehaving relays cannot advertise themselves as "low-latency" nodes to attract traffic, since latency has meaning only when measured between two endpoints. We argue that link-based path selection is practical for certain anonymity networks, and describe mechanisms for efficiently storing and disseminating link information.