M2: Multicasting Mixes for Efficient and Anonymous Communication. Perng, G., Reiter, M. K., & Wang, C. July 2006.
M2: Multicasting Mixes for Efficient and Anonymous Communication [link]Paper  doi  abstract   bibtex   
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\textquoterights 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.
@conference {icdcs2006:m2,
	title = {M2: Multicasting Mixes for Efficient and Anonymous Communication},
	booktitle = {Proceedings of the 26th IEEE Conference on Distributed Computing Systems},
	year = {2006},
	month = {July},
	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{\textquoteright}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 = {anonymous multicast},
	isbn = {0-7695-2540-7 },
	doi = {10.1109/ICDCS.2006.53 },
	url = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel5\%2F10967\%2F34569\%2F01648846.pdf\%3Ftp\%3D\%26isnumber\%3D\%26arnumber\%3D1648846\&authDecision=-203},
	author = {Ginger Perng and Michael K. Reiter and Chenxi Wang}
}

Downloads: 0