Empirical mixnet design
Mixing networks (mixnets) are cryptographic protocols designed to enhance the privacy and anonymity of online communications. Despite their robust privacy features, mixnets remain vulnerable to cyber attacks, such as adversaries compromising mixing nodes (mixes) to track message flows. To mitigate these threats, we propose an empirical mechanism design framework for identifying mixnet configurations that satisfy the designer’s goals. We first introduce two models for mixnets: one with heterogeneous mixes and another with layer-wise homogeneous mixes, capturing the diverse scales and complexities of real-world mixnets. The heterogeneous model allows each mix to have different properties, offering greater expressiveness but posing challenges for scalability of analysis. In contrast, the homogeneous model provides a simplified, yet practical, framework for large-scale analysis. Leveraging these models, we conceptualize adversarial attacks and defensive measures as strategic interactions between an attacker and a defender in a game. We demonstrate how our framework generates data that is useful for a mechanism designer trading off cost versus performance in deploying a mixnet.
| Item Type | Chapter |
|---|---|
| Copyright holders | © The Author(s), under exclusive license to Springer Nature Switzerland AG 2026. |
| Departments | LSE > Academic Departments > Mathematics |
| DOI | 10.1007/978-3-032-08067-7_11 |
| Date Deposited | 08 Jan 2026 |
| URI | https://researchonline.lse.ac.uk/id/eprint/130913 |
Explore Further
- https://www.scopus.com/pages/publications/105020244449 (Scopus publication)