Technical reports

Rollercoaster: an efficient group-multicast scheme for mix networks

Daniel Hugenroth, Martin Kleppmann, Alastair R. Beresford

27 pages

Originally published in Proceedings of the 30th USENIX Security Symposium

DOI: 10.48456/tr-957

Abstract

Mix network designs such as Loopix provide strong metadata anonymity guarantees that are crucial across many applications. However, because they limit the rate at which messages can be sent by each user, they incur high delays when sending many messages to multiple recipients – for instance, in decentralised collaborative apps.

In this paper we present an efficient multicast scheme named Rollercoaster that reduces the time for delivering a message to all members of a group of size m from O(m) to O(log ⁡m). Rollercoaster can be deployed without modifications to the underlying mix network, allowing it to benefit from the anonymity set provided by existing users. We further develop an extension that achieves the same asymptotic guarantees in the presence of unreliable group members.

While the scheme is applicable to many mix network designs, we evaluate it for the Loopix network, which is the most advanced and practical design to date. For this evaluation we developed a network simulator that allows fast, reproducible, and inspectable runs while eliminating external influences.

Full text

PDF (2.0 MB)

BibTeX record

@TechReport{UCAM-CL-TR-957,
  author =	 {Hugenroth, Daniel and Kleppmann, Martin and Beresford,
          	  Alastair R.},
  title = 	 {{Rollercoaster: an efficient group-multicast scheme for mix
         	   networks}},
  url = 	 {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-957.pdf},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-957},
  number = 	 {UCAM-CL-TR-957}
}