72 search results - page 3 / 15 » An Optimal Strategy for Anonymous Communication Protocols |
CSFW
2009
IEEE
13 years 11 months ago
2009
IEEE
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
ESAS
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—We propose an interference-aware MAC protocol using a simple transmission strategy motivated by a gametheoretic approach. We formulate a channel access game, which considers nod...
GLOBECOM
2009
IEEE
13 years 2 months ago
2009
IEEE
In this work we study optimal coding strategies for bidirectional relaying under the condition of arbitrarily varying channels. We consider a three-node network where a relay node ...
WAOA
2007
Springer
13 years 11 months ago
2007
Springer
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...