Efficient Anonymous Multicast and Reception
Shlomi Dolev, Rafail Ostrovsky
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.
comment: Appeared In Proceedings of Advances in cryptology, (CRYPTO-97) Springer-Verlag Lecture Notes in Computer Science. Journal Verion in ACM transaction on Information and System Security vol. 3, no. 2, pp. 64-84, 2000.
Fetch PostScript file of the paper Fetch PDF file of the paper
| Back to Publications List |