Sciweavers

16 search results - page 1 / 4
» Scalable Link-Based Relay Selection for Anonymous Routing
Sort
View
PET
2009
Springer
13 years 11 months ago
Scalable Link-Based Relay Selection for Anonymous Routing
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 ...
Micah Sherr, Matt Blaze, Boon Thau Loo
CCS
2009
ACM
13 years 11 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...
ICDCSW
2008
IEEE
13 years 11 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li
INFOCOM
2010
IEEE
13 years 3 months ago
A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping
Abstract—With rising concerns on user privacy over the Internet, anonymous communication systems that hide the identity of a participant from its partner or third parties are hig...
Fengjun Li, Bo Luo, Peng Liu, Chao-Hsien Chu
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 4 months ago
Anonymous Networking amidst Eavesdroppers
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
Parvathinathan Venkitasubramaniam, Ting He, Lang T...