(∈, δ)-Indistinguishable Mixing for Cryptocurrencies
We propose a new theoretical approach for building anonymous mixing mechanisms for cryptocurrencies. Rather than requiring a fully uniform permutation during mixing, we relax the requirement, insisting only that neighboring permutations are similarly likely. This is defined formally by borrowing fro...
Guardado en:
Autores principales: | , , , , |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Sciendo
2022
|
Materias: | |
Acceso en línea: | https://doaj.org/article/c541e98a77c44c908efd3ef8bb0f5315 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
id |
oai:doaj.org-article:c541e98a77c44c908efd3ef8bb0f5315 |
---|---|
record_format |
dspace |
spelling |
oai:doaj.org-article:c541e98a77c44c908efd3ef8bb0f53152021-12-05T14:11:09Z(∈, δ)-Indistinguishable Mixing for Cryptocurrencies2299-098410.2478/popets-2022-0004https://doaj.org/article/c541e98a77c44c908efd3ef8bb0f53152022-01-01T00:00:00Zhttps://doi.org/10.2478/popets-2022-0004https://doaj.org/toc/2299-0984We propose a new theoretical approach for building anonymous mixing mechanisms for cryptocurrencies. Rather than requiring a fully uniform permutation during mixing, we relax the requirement, insisting only that neighboring permutations are similarly likely. This is defined formally by borrowing from the definition of differential privacy. This relaxed privacy definition allows us to greatly reduce the amount of interaction and computation in the mixing protocol. Our construction achieves O(n·polylog(n)) computation time for mixing n addresses, whereas all other mixing schemes require O(n2) total computation across all parties. Additionally, we support a smooth tolerance of fail-stop adversaries and do not require any trusted setup. We analyze the security of our generic protocol under the UC framework, and under a stand-alone, game-based definition. We finally describe an instantiation using ring signatures and confidential transactions.Liang MingyuKarantaidou IoannaBaldimtsi FoteiniGordon S. DovVaria MayankSciendoarticleanonymous mixingcryptocurrencydifferential privacyEthicsBJ1-1725Electronic computers. Computer scienceQA75.5-76.95ENProceedings on Privacy Enhancing Technologies, Vol 2022, Iss 1, Pp 49-74 (2022) |
institution |
DOAJ |
collection |
DOAJ |
language |
EN |
topic |
anonymous mixing cryptocurrency differential privacy Ethics BJ1-1725 Electronic computers. Computer science QA75.5-76.95 |
spellingShingle |
anonymous mixing cryptocurrency differential privacy Ethics BJ1-1725 Electronic computers. Computer science QA75.5-76.95 Liang Mingyu Karantaidou Ioanna Baldimtsi Foteini Gordon S. Dov Varia Mayank (∈, δ)-Indistinguishable Mixing for Cryptocurrencies |
description |
We propose a new theoretical approach for building anonymous mixing mechanisms for cryptocurrencies. Rather than requiring a fully uniform permutation during mixing, we relax the requirement, insisting only that neighboring permutations are similarly likely. This is defined formally by borrowing from the definition of differential privacy. This relaxed privacy definition allows us to greatly reduce the amount of interaction and computation in the mixing protocol. Our construction achieves O(n·polylog(n)) computation time for mixing n addresses, whereas all other mixing schemes require O(n2) total computation across all parties. Additionally, we support a smooth tolerance of fail-stop adversaries and do not require any trusted setup. We analyze the security of our generic protocol under the UC framework, and under a stand-alone, game-based definition. We finally describe an instantiation using ring signatures and confidential transactions. |
format |
article |
author |
Liang Mingyu Karantaidou Ioanna Baldimtsi Foteini Gordon S. Dov Varia Mayank |
author_facet |
Liang Mingyu Karantaidou Ioanna Baldimtsi Foteini Gordon S. Dov Varia Mayank |
author_sort |
Liang Mingyu |
title |
(∈, δ)-Indistinguishable Mixing for Cryptocurrencies |
title_short |
(∈, δ)-Indistinguishable Mixing for Cryptocurrencies |
title_full |
(∈, δ)-Indistinguishable Mixing for Cryptocurrencies |
title_fullStr |
(∈, δ)-Indistinguishable Mixing for Cryptocurrencies |
title_full_unstemmed |
(∈, δ)-Indistinguishable Mixing for Cryptocurrencies |
title_sort |
(∈, δ)-indistinguishable mixing for cryptocurrencies |
publisher |
Sciendo |
publishDate |
2022 |
url |
https://doaj.org/article/c541e98a77c44c908efd3ef8bb0f5315 |
work_keys_str_mv |
AT liangmingyu dindistinguishablemixingforcryptocurrencies AT karantaidouioanna dindistinguishablemixingforcryptocurrencies AT baldimtsifoteini dindistinguishablemixingforcryptocurrencies AT gordonsdov dindistinguishablemixingforcryptocurrencies AT variamayank dindistinguishablemixingforcryptocurrencies |
_version_ |
1718371322184073216 |