2026-08-03T14:36:09Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18338 2024-03-06T11:01:42Z ddc:004 open_access

Distributed Shuffling in Adversarial Environments Larsen, Kasper Green Obremski, Maciej Simkin, Mark Distributed Computing Shuffling We study mix-nets in the context of cryptocurrencies. Here we have many computationally weak shufflers that speak one after another and want to joinlty shuffle a list of ciphertexts (c₁, … , c_n). Each shuffler can only permute k << n ciphertexts at a time. An adversary A can track some of the ciphertexts and adaptively corrupt some of the shufflers. We present a simple protocol for shuffling the list of ciphertexts efficiently. The main technical contribution of this work is to prove that our simple shuffling strategy does indeed provide good anonymity guarantees and at the same time terminates quickly. Our shuffling algorithm provides a strict improvement over the current shuffling strategy in Ethereum’s block proposer elections. Our algorithm is secure against a stronger adversary, provides provable security guarantees, and is comparably in efficiency to the current approach. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Kasper Green Larsen and Maciej Obremski and Mark Simkin 2023 Is Part Of LIPIcs, Volume 267, 4th Conference on Information-Theoretic Cryptography (ITC 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITC.2023.10 urn:nbn:de:0030-drops-183385 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.10 eng https://creativecommons.org/licenses/by/4.0/legalcode