The Unreasonable Effectiveness of Address Clustering
| Title | The Unreasonable Effectiveness of Address Clustering |
| Publication Type | Conference Paper |
| Year of Publication | 2016 |
| Authors | Harrigan, M., Fretter, C. |
| Conference Name | 2016 Intl IEEE Conferences on Ubiquitous Intelligence Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld) |
| ISBN Number | 978-1-5090-2771-2 |
| Keywords | address clustering, address reuse, Bipartite graph, bitcoin, Bitcoin system, blockchain, blockchain security, cryptocurrency, Electronic mail, electronic money, financial data processing, merging, one-to-many mapping, Online banking, pattern clustering, Protocols, pubcrawl, Resiliency, Scalability, security of data, Size measurement, transaction microstructure, Upper bound |
| Abstract | Address clustering tries to construct the one-to-many mapping from entities to addresses in the Bitcoin system. Simple heuristics based on the micro-structure of transactions have proved very effective in practice. In this paper we describe the primary reasons behind this effectiveness: address reuse, avoidable merging, super-clusters with high centrality,, the incremental growth of address clusters. We quantify their impact during Bitcoin's first seven years of existence. |
| URL | https://ieeexplore.ieee.org/document/7816867/ |
| DOI | 10.1109/UIC-ATC-ScalCom-CBDCom-IoP-SmartWorld.2016.0071 |
| Citation Key | harrigan_unreasonable_2016 |
- merging
- Upper bound
- transaction microstructure
- Size measurement
- security of data
- Scalability
- Resiliency
- pubcrawl
- Protocols
- pattern clustering
- Online banking
- one-to-many mapping
- address clustering
- financial data processing
- electronic money
- Electronic mail
- cryptocurrency
- blockchain security
- blockchain
- Bitcoin system
- bitcoin
- Bipartite graph
- address reuse