DocumentCode
2176642
Title
M2: Multicasting Mixes for Efficient and Anonymous Communication
Author
Perng, Ginger ; Reiter, Michael K. ; Wang, Chenxi
Author_Institution
Carnegie Mellon University
fYear
2006
fDate
2006
Firstpage
59
Lastpage
59
Abstract
We present a technique to achieve anonymous multicasting in mix networks to deliver content from producers to consumers. Employing multicast allows content producers to send (and mixes to forward) information to multiple consumers without repeating work for each individual consumer. In our approach, consumers register interest for content by creating paths in the mix network to the content’s producers. When possible, these paths are merged in the network so that paths destined for the same producer share a common path suffix to the producer. When a producer sends content, the content travels this common suffix toward its consumers (in the reverse direction) and "branches" into multiple messages when necessary. We detail the design of this technique and then analyze the unlinkability of our approach against a global, passive adversary who controls both the producer and some mixes. We show that there is a subtle degradation of unlinkability that arises from multicast. We discuss techniques to tune our design to mitigate this degradation while retaining the benefits of multicast.
Keywords
Costs; Data structures; Degradation; Merging; Multicast protocols; Network servers; Routing; Unicast;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 2006. ICDCS 2006. 26th IEEE International Conference on
ISSN
1063-6927
Print_ISBN
0-7695-2540-7
Type
conf
DOI
10.1109/ICDCS.2006.53
Filename
1648846
Link To Document