Sciweavers

110 search results - page 1 / 22
» A Kademlia-Based Node Lookup System for Anonymization Networ...
Sort
View
SERSCISA
2009
Springer
13 years 12 months ago
A Kademlia-Based Node Lookup System for Anonymization Networks
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...
Benedikt Westermann, Andriy Panchenko, Lexi Pimeni...
CCS
2010
ACM
13 years 5 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov
CCS
2008
ACM
13 years 7 months ago
Information leaks in structured peer-to-peer anonymous communication systems
We analyze information leaks in the lookup mechanisms of structured peer-to-peer anonymous communication systems and how these leaks can be used to compromise anonymity. We show t...
Prateek Mittal, Nikita Borisov
CCS
2009
ACM
14 years 5 days 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...
PE
2006
Springer
127views Optimization» more  PE 2006»
13 years 5 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen