{"title":"Source detection in the bitcoin network: a multi-reporting approach","authors":"Chong Zhang, Xiaoying Gan","doi":"10.1145/3321408.3321609","DOIUrl":null,"url":null,"abstract":"Motivated by analyzing anonymity properties of Bitcoin network and identification of the origin of illegal transactions, we study the problem of detecting the source node of a transaction message in the Bitcoin network, based on the present spreading model-diffusion. We start by adopting a listening model to get the information of which part of nodes have received the message, say an observation, which is an important premise of solving source detection problem. We propose an estimator for regular trees based on independent multi-reporting observations, and theoretically give a lower bound of the correct detection probability when the observation moment tends to infinity. We show that the more independent reporting observations we have, the higher the probability of detection is, and it further approaches one. The effectiveness of our source estimator is also established in several simulations.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM Turing Celebration Conference - China","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3321408.3321609","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Motivated by analyzing anonymity properties of Bitcoin network and identification of the origin of illegal transactions, we study the problem of detecting the source node of a transaction message in the Bitcoin network, based on the present spreading model-diffusion. We start by adopting a listening model to get the information of which part of nodes have received the message, say an observation, which is an important premise of solving source detection problem. We propose an estimator for regular trees based on independent multi-reporting observations, and theoretically give a lower bound of the correct detection probability when the observation moment tends to infinity. We show that the more independent reporting observations we have, the higher the probability of detection is, and it further approaches one. The effectiveness of our source estimator is also established in several simulations.