A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf
.
Xor-trees for efficient anonymous multicast and reception
2000
ACM Transactions on Privacy and Security
In this work we examine the problem of e cient anonymous multicast and reception in general communication networks. We present algorithms that achieve anonymous communication with O1 amortized communication complexity on each link and low computational complexity and is protected against tra c analysis. The algorithms support either sender anonymity, receivers anonymity or sender-receiver anonymity.
doi:10.1145/354876.354877
fatcat:7o2z6khuw5dv7a5akkpsi6b5xi