480 search results - page 21 / 96 » Anonymous Transactions in Computer Networks |
130
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
157
Voted
SPC
2005
Springer
15 years 5 months ago
2005
Springer
The ephemeral pairing problem requires two or more specific physical nodes in a wireless broadcast network, that do not yet know each other, to establish a short-term relationship...
SP
2006
IEEE
15 years 6 months ago
2006
IEEE
The MIX technique forms the basis of many popular services that offer anonymity of communication in open and shared networks such as the Internet. In this paper, fundamental limit...
83
Voted
IPPS
2008
IEEE
15 years 6 months ago
2008
IEEE
Although a significant amount of effort has been directed at discovering attacks against anonymity communication networks and developing countermeasures to those attacks, there i...
101
click to vote
CCS
2005
ACM
15 years 6 months ago
2005
ACM
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...