loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
26th IEEE International Conference on Distributed Computing Systems (ICDCS'06)
M2: Multicasting Mixes for Efficient and Anonymous Communication
Lisboa, Portugal
July 04-July 07
ISBN: 0-7695-2540-7
Ginger Perng, Carnegie Mellon University
Michael K. Reiter, Carnegie Mellon University
Chenxi Wang, Carnegie Mellon University
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.
Citation:
Ginger Perng, Michael K. Reiter, Chenxi Wang, "M2: Multicasting Mixes for Efficient and Anonymous Communication," icdcs, pp.59, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.