Xor-Trees for Efficient Anonymous Multicast and Reception

Shlomi Dolev; Rafail Ostrovsky

doi:10.1145/354876.354877

Xor-Trees for Efficient Anonymous Multicast and Reception

Shlomi Dolev, Rafail Ostrovsky

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

50 Scopus citations

Abstract

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 language	English
Pages (from-to)	63-84
Number of pages	22
Journal	ACM Transactions on Information and System Security
Volume	3
Issue number	2
DOIs	https://doi.org/10.1145/354876.354877
State	Published - 1 May 2000

Keywords

Algorithms
Anonymous communication
Security
anonymous multicast

ASJC Scopus subject areas

General Computer Science
Safety, Risk, Reliability and Quality

Access to Document

10.1145/354876.354877

Cite this

@article{58da955e84de4cc9bc22a47a6de24305,

title = "Xor-Trees for Efficient Anonymous Multicast and Reception",

abstract = "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.",

keywords = "Algorithms, Anonymous communication, Security, anonymous multicast",

author = "Shlomi Dolev and Rafail Ostrovsky",

year = "2000",

month = may,

day = "1",

doi = "10.1145/354876.354877",

language = "English",

volume = "3",

pages = "63--84",

journal = "ACM Transactions on Information and System Security",

issn = "1094-9224",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - Xor-Trees for Efficient Anonymous Multicast and Reception

AU - Dolev, Shlomi

AU - Ostrovsky, Rafail

PY - 2000/5/1

Y1 - 2000/5/1

N2 - 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.

AB - 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.

KW - Algorithms

KW - Anonymous communication

KW - Security

KW - anonymous multicast

UR - http://www.scopus.com/inward/record.url?scp=0011586610&partnerID=8YFLogxK

U2 - 10.1145/354876.354877

DO - 10.1145/354876.354877

M3 - Article

AN - SCOPUS:0011586610

SN - 1094-9224

VL - 3

SP - 63

EP - 84

JO - ACM Transactions on Information and System Security

JF - ACM Transactions on Information and System Security

IS - 2

ER -

Xor-Trees for Efficient Anonymous Multicast and Reception

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this