Paper 2022/560

Distributed Shuffling in Adversarial Environments

Kasper Green Larsen, Aarhus University
Maciej Obremski, National University of Singapore
Mark Simkin, Ethereum Foundation

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_1, \dots, c_n)$. Each shuffler can only permute $k << n$ ciphertexts at a time. An adversary $\mathcal{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 anonynmity 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.

Available format(s)
Publication info
Shuffling Leader Election Mix-Nets
Contact author(s)
larsen @ cs au dk
obremski math @ gmail com
mark simkin @ etherum org
2022-10-12: last of 2 revisions
2022-05-10: received
See all versions
Short URL
Creative Commons Attribution


      author = {Kasper Green Larsen and Maciej Obremski and Mark Simkin},
      title = {Distributed Shuffling in Adversarial Environments},
      howpublished = {Cryptology ePrint Archive, Paper 2022/560},
      year = {2022},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.