390 search results - page 14 / 78 » Protecting Data Privacy in Structured P2P Networks |
CCS
2010
ACM
13 years 7 months ago
2010
ACM
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...
IPTPS
2005
Springer
14 years 1 months ago
2005
Springer
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
GIR
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
WAND is a meta-data management system that provides a file-system tree for users of an internet based P2P network. The tree is robust and retains its structure even when nodes (pe...
ICCNMC
2005
Springer
14 years 1 months ago
2005
Springer
The emergence of Internet, Intranet, local area networks, and ad hoc wireless networks introduces a plethora of new problems in information processing. In order to overcome these p...