Xor-Trees for Efficient Anonymous Multicast and Reception

Shlomi Dolev, Rafail Ostrovsky

Research output: Contribution to journalArticlepeer-review

50 Scopus citations


We examine the problem of efficient anonymous multicast and reception in general communication networks. We present algorithms that achieve anonymous communication, are protected against traffic analysis, and require O(1) amortized communication complexity on each link and low computational complexity. The algorithms support sender anonymity, receiver(s) anonymity, or sender-receiver anonymity.

Original languageEnglish
Pages (from-to)63-84
Number of pages22
JournalACM Transactions on Information and System Security
Issue number2
StatePublished - 1 May 2000


  • Algorithms
  • Anonymous communication
  • Security
  • anonymous multicast

ASJC Scopus subject areas

  • General Computer Science
  • Safety, Risk, Reliability and Quality


Dive into the research topics of 'Xor-Trees for Efficient Anonymous Multicast and Reception'. Together they form a unique fingerprint.

Cite this