No Country for Old Privacy: The Evolving Challenges of Anonymity in Bitcoin

• URL: http://arxiv.org/abs/2607.00772v1
• Date: Wed, 01 Jul 2026 10:57:58 GMT
• Title: No Country for Old Privacy: The Evolving Challenges of Anonymity in Bitcoin
• Abstract summary: We identify over 5.94 million CoinJoin and 23.3 million CoinSwap transactions.<n>Our analysis reveals consistently low adoption rates, with these protocols constituting less than 1% of network transactions.<n>We find no evidence of standardised Stealth Address, indicating a failure to converge on a common privacy standard.
• Score: 1.816432734197056
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a longitudinal measurement study on the adoption of detectable, second-generation anonymisation protocols in the Bitcoin network, including CoinJoin, CoinSwap, CoinShuffle and Stealth Addresses. By implementing and refining a suite of heuristic filters, we identify over 5.94 million CoinJoin and 23.3 million CoinSwap transactions. Besides, the use of CoinShuffle was unexpectedly found to be closely aligned with the Wasabi wallet operation period. Our analysis reveals consistently low adoption rates, with these protocols constituting less than 1% of network transactions, and a sharp decline in detectable usage following key regulatory events. Furthermore, we find no evidence of standardised Stealth Address adoption, indicating a failure to converge on a common privacy standard. This study provides a comprehensive picture of a niche ecosystem whose on-chain visibility has been largely suppressed, strongly suggesting the migration of privacy-seeking users to less transparent and less detectable methods.

Related papers

• A Tattered Cloak of Invisibility: Measuring Anonymity Loss in Railgun on Ethereum [3.47720456613335]
  We study behavioral leakage in Railgun on cryptocurrency mixers.<n>We consider five sources of leakage: characteristic timing patterns, address reuse, proximity in the transaction graph that preserve distinctive digit patterns across transaction values, and knapsack type matches in which groups of transaction amounts add up in revealing ways.
  arXiv  Detail & Related papers  (2026-06-24T15:03:56Z)
• Temporal Motif-aware Graph Test-time Adaptation for OOD Blockchain Anomaly Detection [55.18577006122169]
  We propose a novel framework termed textbfTEmporal textbfMotif-aware textbfGraph textbfTest-textbfTime textbfAdaptation (textbfTEMG-TTA)<n>First, we comprehensively capture the 3-node temporal motif distribution of each active address using an efficient computational mechanism.<n>Second, we design a simple yet effective test-time adaptation strategy to facilitate the sharing of common patterns between training and testing graphs.
  arXiv  Detail & Related papers  (2026-05-28T07:43:20Z)
• MemeChain: A Multimodal Cross-Chain Dataset for Meme Coin Forensics and Risk Analysis [52.468043639056596]
  The meme coin ecosystem has grown into one of the most active yet least observable segments of the cryptocurrency market.<n>MemeChain integrates on-chain data with off-chain artifacts, including website HTML source code, token logos, and linked social media accounts.<n>We quantify the ecosystem's extreme volatility, identifying 1,801 tokens (5.15%) that cease all trading activity within just 24 hours of launch.
  arXiv  Detail & Related papers  (2026-01-28T14:42:02Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Blink: Link Local Differential Privacy in Graph Neural Networks via Bayesian Estimation [79.64626707978418]
  We propose using link local differential privacy over decentralized nodes to train graph neural networks. Our approach spends the privacy budget separately on links and degrees of the graph for the server to better denoise the graph topology. Our approach outperforms existing methods in terms of accuracy under varying privacy budgets.
  arXiv  Detail & Related papers  (2023-09-06T17:53:31Z)
• Transaction Fraud Detection via an Adaptive Graph Neural Network [64.9428588496749]
  We propose an Adaptive Sampling and Aggregation-based Graph Neural Network (ASA-GNN) that learns discriminative representations to improve the performance of transaction fraud detection. A neighbor sampling strategy is performed to filter noisy nodes and supplement information for fraudulent nodes. Experiments on three real financial datasets demonstrate that the proposed method ASA-GNN outperforms state-of-the-art ones.
  arXiv  Detail & Related papers  (2023-07-11T07:48:39Z)
• Towards Measuring the Traceability of Cryptocurrencies [0.5371337604556311]
  We put forward a formal framework to measure the (un)traceability and anonymity of cryptocurrencies. Our work provides the first practical, efficient, and probabilistic measure to assess the traceability of cryptocurrencies. We implement and extensively evaluate our proposed traceability measure on several cryptocurrency transaction graphs.
  arXiv  Detail & Related papers  (2022-11-08T14:08:39Z)
• Adoption and Actual Privacy of Decentralized CoinJoin Implementations in Bitcoin [12.765777260084322]
  We present a first measurement study on the adoption and actual privacy of two popular CoinJoin implementations, Wasabi and Samourai. By applying highly accurate (> 99%) algorithms we can effectively detect 30,251 Wasabi and 223,597 Samourai transactions within the block range 530,500 to 725,348.
  arXiv  Detail & Related papers  (2021-09-21T14:49:18Z)
• Summarizing and Analyzing the Privacy-Preserving Techniques in Bitcoin and other Cryptocurrencies [0.6138671548064355]
  We present some well-known attacks and analysis techniques that have compromised the privacy of Bitcoin and many other similar. We also analyze and study different privacy-preserving algorithms and the problems these algorithms manage to solve.
  arXiv  Detail & Related papers  (2021-09-16T00:24:19Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• Collaborative Deanonymization [0.0]
  We propose protocols to resolve the tension between anonymity and accountability in a peer-to-peer manner. We illustrate how the protocols could apply to Monero rings and CoinJoin transactions in Bitcoin.
  arXiv  Detail & Related papers  (2020-05-07T15:03:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.