Aarhus Universitets segl

English

Du er her: AU » Om AU » Organisation » Distributed Shuffling in Adversarial Environments

Om AU

Distributed Shuffling in Adversarial Environments

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

DOI

  • Kasper Green Larsen
  • 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 (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.

OriginalsprogEngelsk
Titel4th Conference on Information-Theoretic Cryptography, ITC 2023
RedaktørerKai-Min Chung
ForlagDagstuhl Publishing
Udgivelsesårjul. 2023
Artikelnummer10
ISBN (Elektronisk)9783959772716
DOI
StatusUdgivet - jul. 2023
Begivenhed4th Conference on Information-Theoretic Cryptography, ITC 2023 - Aarhus, Danmark
Varighed: 6 jun. 2023 → 8 jun. 2023

Konference

Konference4th Conference on Information-Theoretic Cryptography, ITC 2023
LandDanmark
ByAarhus
Periode06/06/2023 → 08/06/2023
SerietitelLeibniz International Proceedings in Informatics, LIPIcs
Vol/bind267
ISSN1868-8969

Se relationer på Aarhus Universitet Citationsformater

ID: 341391726