2011
DOI: 10.1145/2325702.2325704
|View full text |Cite
|
Sign up to set email alerts
|

On Bitcoin and red balloons

Abstract: In this letter we present a brief report of our recent research on information distribution mechanisms in networks [Babaioff et al. 2011]. We study scenarios in which all nodes that become aware of the information compete for the same prize, and thus have an incentive not to propagate information. Examples of such scenarios include the 2009 DARPA Network Challenge (finding red balloons), and raffles. We give special attention to one application domain, namely Bitcoi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
146
0
1

Year Published

2013
2013
2022
2022

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 88 publications
(150 citation statements)
references
References 2 publications
3
146
0
1
Order By: Relevance
“…In [8], Elias investigates the legal aspects of privacy in Bitcoin. In [9], Babaioff et al address the lack of incentives for Bitcoin users to include recently announced transactions in a block. Furthermore, in [7], Syed et al propose a userfriendly technique for managing Bitcoin wallets.…”
Section: Related Workmentioning
confidence: 99%
“…In [8], Elias investigates the legal aspects of privacy in Bitcoin. In [9], Babaioff et al address the lack of incentives for Bitcoin users to include recently announced transactions in a block. Furthermore, in [7], Syed et al propose a userfriendly technique for managing Bitcoin wallets.…”
Section: Related Workmentioning
confidence: 99%
“…Babaioff et al show that, as the Bitcoin protocol is currently defined, it does not provide incentives for nodes to broadcast transactions; in fact, it provides strong disincentives [26]. However, the Bitcoin economy seems to be -at least in this respect -working well in practice.…”
Section: Incentive Modeling Of the Bitcoin Economymentioning
confidence: 99%
“…As in address unlinkability, we measure profile indistinguishability against A by measuring the degree of profile distinguishability that A can achieve, i.e., we assess the advantage of A in approximating GT prof over A R by Prof A = Sim(E prof , GT prof ) − Sim(E R prof , GT prof ). 7 We quantify Sim(E prof , GT prof ) and Prof A by relying on two commonly used entropy based distance metrics, namely: the Normalized Mutual Information (NMI) and the Adjusted Mutual Information, (AMI). NMI assesses the similarity of two groupings of the same items (in our case, E prof and GT prof ), and takes higher values (1) the more identical the groupings are [19,20].…”
Section: Quantifying Privacy In Bitcoinmentioning
confidence: 99%
“…In [7], Babaioff et al address the lack of incentives for Bitcoin users to include recently announced transactions in a block, while in [4], Syed et al propose a user-friendly technique for managing Bitcoin wallets. In [14], Karame et al thoroughly investigate double-spending attacks in Bitcoin and show that double-spending fast payments in Bitcoin can be performed in spite of the measures recommended by Bitcoin developers.…”
Section: Related Workmentioning
confidence: 99%