Distributed Shuffling in Adversarial Environments

Kasper Green Larsen*, Maciej Obremski*, Mark Simkin*

*Corresponding author for this work

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review


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 (c1, ..., cn). 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.

Original languageEnglish
Title of host publication4th Conference on Information-Theoretic Cryptography, ITC 2023
EditorsKai-Min Chung
PublisherDagstuhl Publishing
Publication dateJul 2023
Article number10
ISBN (Electronic)9783959772716
Publication statusPublished - Jul 2023
Event4th Conference on Information-Theoretic Cryptography, ITC 2023 - Aarhus, Denmark
Duration: 6 Jun 20238 Jun 2023


Conference4th Conference on Information-Theoretic Cryptography, ITC 2023
SeriesLeibniz International Proceedings in Informatics, LIPIcs


  • Distributed Computing
  • Shuffling


Dive into the research topics of 'Distributed Shuffling in Adversarial Environments'. Together they form a unique fingerprint.

Cite this