@inproceedings{e56e07a100d14a5989c7f694991d2fba,
title = "Efficient anonymous multicast and reception",
abstract = "In this work we examine the problem of efficient anonymous broadcast and reception in general communication networks. We show an algorithm which achieves anonymous communication with O(1) amortized communication complexity on each link and low computational complexity. In contrast, all previous solutions require polynomial (in the size of the network and security parameter) amortized communication complexity.",
author = "Shlomi Dolev and Rafail Ostrovsky",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 17th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO 1997 ; Conference date: 17-08-1997 Through 21-08-1997",
year = "1997",
month = jan,
day = "1",
doi = "10.1007/BFb0052251",
language = "English",
isbn = "3540633847",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "395--409",
editor = "{Kaliski }, B.S.",
booktitle = "Advances in Cryptology — CRYPTO 1997 - 17th Annual International Cryptology Conference, Proceedings",
address = "Germany",
}