2017
DOI: 10.1007/s12095-017-0264-3
|View full text |Cite
|
Sign up to set email alerts
|

Malleability of the blockchain’s entropy

Abstract: Abstract. Trustworthy generation of public random numbers is necessary for the security of a number of cryptographic applications. It was suggested to use the inherent unpredictability of blockchains as a source of public randomness. Entropy from the Bitcoin blockchain in particular has been used in lotteries and has been suggested for a number of other applications ranging from smart contracts to election auditing. In this Arcticle, we analyse this idea and show how an adversary could manipulate these random … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 39 publications
(17 citation statements)
references
References 9 publications
0
17
0
Order By: Relevance
“…We stress that the fact that the hash value of blocks generated in the future cannot be predicted does not means that the hash value cannot be biased by an adversary who has infinite budget. Since the adversary can incentivize a miner who first mine a block to throw the newly mined block away and continue to mine if the hash value of the block does not meet the adversary's requirement [42]. We utilize the Ethereum blockchain as the underlying public blockchain.…”
Section: Public Blockchain and On-chain Currenciesmentioning
confidence: 99%
See 1 more Smart Citation
“…We stress that the fact that the hash value of blocks generated in the future cannot be predicted does not means that the hash value cannot be biased by an adversary who has infinite budget. Since the adversary can incentivize a miner who first mine a block to throw the newly mined block away and continue to mine if the hash value of the block does not meet the adversary's requirement [42]. We utilize the Ethereum blockchain as the underlying public blockchain.…”
Section: Public Blockchain and On-chain Currenciesmentioning
confidence: 99%
“…Now, we compute the probability that the adversary successfully biases Bl t . The adversary model and game model follow the ones proposed by Pierrot et al [42].…”
Section: Security Analysismentioning
confidence: 99%
“…Proof 4: Assume that the adversary is a miner, and the cloud server may collude with the miner. We follow the existing threat model of miner in [48]. Suppose that data M = {m i } 1≤i≤n consists of n blocks, where κ blocks are VOLUME 8, 2020 not valid, e.g.…”
Section: Theoremmentioning
confidence: 99%
“…-Constructing a trustworthy randomness beacon, like the one introduced by Rabin in [62], where a public service produces a continuous stream of guaranteed unbiased randomness. The classic approach consisting in extracting randomness from entropy pool sources, such as stock prices or proof-of-work blockchainsà la Bitcoin, has been shown to be manipulable by active attackers [58]. For example, while the price of a particular stock may seem unpredictable to a passive observer, a powerful trader can influence the market trend, making the random output biased.…”
Section: Applicationsmentioning
confidence: 99%