On Tue, 2 Apr 2002, Tim May wrote: > Imagine N transponders. Coded sequences are broadcast, recipients are > unknown. (Actually, _everyone_ receives, but only some can decode.)
Sounds vaguely like the setting for this paper: Xor-Trees for Efficient Anonymous Multicast and Reception Shlomi Dolev, Rafail Ostrovsky http://citeseer.nj.nec.com/dolev98xortree.html 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.
