PolySphinx: Extending the Sphinx Mix Format With Better Multicast Support
Daniel Schadt, Christoph Coijanovic, Christiane Weis, Thorsten Strufe
Abstract
Mix networks are a well-known technique to hide communication metadata, but incur a high overhead especially in group communication settings. This hinders their adoption in real-world usage, as group communication makes up a big part of modern communication patterns. In this paper, we introduce "PolySphinx", a mix format that is a step towards efficient anonymous multicasting and allows a mix node to replicate the message payload to multiple recipients. We prove that PolySphinx does not compromise on the anonymity offered to users, while considerably reducing the latency of group messages: In a group with 25 members, the average latency drops from 6.1s using the state-of-the-art Rollercoaster approach to 4.1s using PolySphinx.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get cf2e7ea8-90f6-431b-89f9-00ac899b598fRelated papers
- Rollercoaster: An Efficient Group-Multicast Scheme for Mix NetworksDaniel Hugenroth, Martin Kleppmann, Alastair R. BeresfordUSENIX Security 2021 · 5 citations
- LARMix: Latency-Aware Routing in Mix NetworksMahdi Rahimi, Piyush Kumar Sharma, Claudia DíazNDSS 2024
- LAMP: Lightweight Approaches for Latency Minimization in Mixnets with Practical Deployment ConsiderationsMahdi Rahimi, Piyush Kumar Sharma, Claudia DíazNDSS 2025
- OptiMix: Scalable and Distributed Approaches for Latency Optimization in Modern MixnetsMahdi RahimiNDSS 2026 · 3 citations
- MCMix: Anonymous Messaging via Secure Multiparty ComputationNikolaos Alexopoulos, Aggelos Kiayias, Riivo Talviste, Thomas ZachariasUSENIX Security 2017 · 85 citations
