Cited by 32Cryptography and Data SecurityBlockchain Technology Applications and SecurityInternet Traffic Analysis and Secure E-voting

UCoin: An Efficient Privacy Preserving Scheme for Cryptocurrencies

Open access
Nosouhi, Mohammad Reza, Yu, Shui, Sood, Keshav, Grobler, Marthie, Jurdak, Raja, Dorri, Ali, Shen, Shigen·2023·IEEE Transactions on Dependable and Secure Computing

Abstract

In cryptocurrencies, privacy of users is preserved using pseudonymity . However, it has been shown that pseudonymity does not result in anonymity if a user's transactions are linkable. This makes cryptocurrencies vulnerable to deanonymization attacks. The current solutions proposed in the literature suffer from at least one of the following issues: (1) requiring a trusted third–party entity, (2) poor performance, and (3) incompatible with the standard structure of cryptocurrencies. In this article, we propose Unlinkable Coin (UCoin), a secure mix–based approach to address these issues. In UCoin, the link between the input (payer) and output (payee) addresses in a transaction is broken. This is done by mixing the transactions of multiple users into a single aggregated transaction in which the output addresses have been secretly shuffled. In our protocol design, we first develop HDC–net, a secure shuffling protocol that enables a group of users to anonymously publish their data. Then, we deploy the proposed HDC–net protocol in the UCoin architecture (as a mixing unit) to generate the aggregate transactions. We show that UCoin (1) does not rely on a trusted third–party, (2) can mix 50 transactions in 6.3 seconds that is 18% faster than the current solutions, and (3) is fully compatible with the architecture of cryptocurrencies.

Integrity signals

Registry

Crossref · 10.1109/tdsc.2021.3130952

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Due to the widespread dependency among entities, it is difficult for security personnel to allocate clear security boundary responsibilities to each entity in the smart home, which makes the static access control method ineffective.

    “Due to the widespread dependency among entities, it is difficult for security personnel to allocate clear security boundary responsibilities to each entity in the smart home, which makes the static access control method ineffective [131].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Nosouhi, M. R., Yu, S., Sood, K., Grobler, M., Jurdak, R., Dorri, A., & Shen, S.
Affiliations
  • Deakin University (AU)
  • University of Technology Sydney (AU)
  • Commonwealth Scientific and Industrial Research Organisation (AU)
  • Queensland University of Technology (AU)
  • Shaoxing University (CN)
Venue
IEEE Transactions on Dependable and Secure Computing
Published
2023-01-01
Volume
20
Issue
1
Pages
242-255
ISSN
  • 1545-5971 (ISSN-L)
  • 1941-0018
  • 2160-9209
OpenAlex
W3215847170
Cited by
32
References
3
Citations by year
2026: 5 · 2025: 4 · 2024: 5 · 2023: 11 · 2022: 7
FWCI
2.03
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Dependable and Secure Computing (publishedVersion)
  • QUT ePrints (Queensland University of Technology) (submittedVersion, cc-by-nc)
  • Deakin Research Online (Deakin University) (submittedVersion)
  • Figshare (submittedVersion, cc-by)
Funders
  • National Natural Science Foundation of China (61772018)
  • Zhejiang Provincial Natural Science Foundation of China (LZ22F020002)
  • Australia ARC (DP200101374)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
Keywords
cryptocurrency privacy, de-anonymization, transaction unlinkability, pseudonymity

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review