Decentralized Reliability Estimation for Mixnets
<|reference_start|>Decentralized Reliability Estimation for Mixnets: Continuous-time decryption mixnets can anonymously route data packets with end to end latency that can be as low as a second, making them usable for a variety of applications. Such mixnets however lack verifiable reliability properties that ensure the correct processing and delivery of packets, while existing verifiability mechanisms are incompatible with scalable low latency continuous-time mixnets due to imposing overheads measuring in minutes to hours. This work addresses this gap by proposing a scheme that can estimate reliability scores for links and nodes forming a continuous-time mixnet where some form of credentials authorize clients to send traffic. The scores can be computed publicly by all participants from a set of measurement packets that are eventually revealed and act as a random sample of the traffic, without affecting mixnet transmission latency for client packets. Our scheme relies on VRF-based routing, a novel primitive that ensures that legitimate client packets follow the routing policy of the mixnet, as well as randomly generating unforgeable measurement packets. We experimentally validate our construction both in unreliable and adversarial settings, demonstrating its feasibility.<|reference_end|>
@article{diaz2024decentralized,
    title={Decentralized Reliability Estimation for Mixnets},
    author={Claudia Diaz and Harry Halpin and Aggelos Kiayias},
    journal={arXiv preprint arXiv:2406.06760},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.06760},
    primaryClass={cs.CR}
}