<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-25T05:43:36Z</responseDate>
  <request identifier="11977" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:11977</identifier>
        <datestamp>2024-03-12T11:59:13Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>MixEth: Efficient, Trustless Coin Mixing Service for Ethereum</dc:title>
          <dc:creator>Seres, István András</dc:creator>
          <dc:creator>Nagy, Dániel A.</dc:creator>
          <dc:creator>Buckland, Chris</dc:creator>
          <dc:creator>Burcsi, Péter</dc:creator>
          <dc:subject>Cryptography</dc:subject>
          <dc:subject>Verifiable shuffle</dc:subject>
          <dc:subject>Anonymity</dc:subject>
          <dc:subject>Cryptocurrency</dc:subject>
          <dc:subject>Ethereum</dc:subject>
          <dc:subject>Coin mixer</dc:subject>
          <dc:subject>State Channel</dc:subject>
          <dc:description>Coin mixing is a prevalent privacy-enhancing technology for cryptocurrency users. In this paper, we present MixEth, which is a trustless coin mixing service for Turing-complete blockchains. MixEth does not rely on a trusted setup and is more efficient than any proposed trustless coin tumbler. It requires only 3 on-chain transactions at most per user and 1 off-chain message. It achieves strong notions of anonymity and is able to resist denial-of-service attacks. Furthermore the underlying protocol can also be used to efficiently shuffle ballots, ciphertexts in a trustless and decentralized manner.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>István András Seres and Dániel A. Nagy and Chris Buckland and Péter Burcsi</dc:contributor>
          <dc:date>2020</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 71, International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/OASIcs.Tokenomics.2019.13</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-119770</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2019.13</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
