133 search results - page 18 / 27 » A k-anonymous communication protocol for overlay networks |
IWCMC
2009
ACM
14 years 2 months ago
2009
ACM
This paper proposes a dynamic trust establishment protocol that enables the nodes of an ad hoc network to establish security associations among each other in a distributed and pee...
SERSCISA
2009
Springer
14 years 2 months ago
2009
Springer
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...