Skip to main content

Why Buy When You Can Rent?

Bribery Attacks on Bitcoin-Style Consensus

  • Conference paper
  • First Online:
Financial Cryptography and Data Security (FC 2016)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9604))

Included in the following conference series:

Abstract

The Bitcoin cryptocurrency introduced a novel distributed consensus mechanism relying on economic incentives. While a coalition controlling a majority of computational power may undermine the system, for example by double-spending funds, it is often assumed it would be incentivized not to attack to protect its long-term stake in the health of the currency. We show how an attacker might purchase mining power (perhaps at a cost premium) for a short duration via bribery. Indeed, bribery can even be performed in-band with the system itself enforcing the bribe. A bribing attacker would not have the same concerns about the long-term health of the system, as their majority control is inherently short-lived. New modeling assumptions are needed to explain why such attacks have not been observed in practice. The need for all miners to avoid short-term profits by accepting bribes further suggests a potential tragedy of the commons which has not yet been analyzed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Bitcoin’s mining puzzle is not a strict proof-of-work scheme but a probabilistic one.

  2. 2.

    An issue remains that pool participants could report shares but withhold valid blocks. This is an issue for all mining pools and has been analyzed in the context of attacks between mining pools [2–4], however it is not profitable for individuals.

  3. 3.

    If the attacker’s attempt to introduce a fork fails and another block is found on the main chain, they can move the funds from address \(K_1\) again. By cycling these funds every block they can ensure their fork is arbitrarily close to the longest chain.

  4. 4.

    This script would be achieved using a single OP_CHECK_LOCK_TIME_VERIFY command, which has been standard in Bitcoin since mid-2015.

  5. 5.

    As mentioned in Sect. 2.3, bribers placed in band will not be at risk if the attack fails, though this method may be the most difficult to execute.

References

  1. Bonneau, J., Miller, A., Clark, J., Narayanan, A., Kroll, J.A., Felten, E.W.: Research perspectives and challenges for bitcoin and cryptocurrencies. In: 2015 IEEE Symposium on Security and Privacy, May 2015

    Google Scholar 

  2. Courtois, N.T., Bahack, L.: On subversive miner strategies and block withholding attack in bitcoin digital currency. arXiv preprint arXiv:1402.1718 (2014)

  3. Eyal, I.: The Miner’s Dilemma. In: IEEE Symposium on Security and Privacy (2015)

    Google Scholar 

  4. Luu, L., Saha, R., Parameshwaran, I., Saxena, P., Hobor, A.: On power splitting games in distributed computation: the case of bitcoin pooled mining. Technical report, Cryptology ePrint Archive, Report 2015/155 (2015). http://eprint.iacr.org

  5. Moore, T., Christin, N.: Beware the middleman: empirical analysis of bitcoin-exchange risk. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 25–33. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  6. Nakamoto, S.: Bitcoin: a peer-to-peer electionic cash system (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joseph Bonneau .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 International Financial Cryptography Association

About this paper

Cite this paper

Bonneau, J. (2016). Why Buy When You Can Rent?. In: Clark, J., Meiklejohn, S., Ryan, P., Wallach, D., Brenner, M., Rohloff, K. (eds) Financial Cryptography and Data Security. FC 2016. Lecture Notes in Computer Science(), vol 9604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53357-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-53357-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-53356-7

  • Online ISBN: 978-3-662-53357-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics