Abstract
Client puzzles have been proposed as a mechanism for proving legitimate intentions by providing “proofs of work”, which can be applied to discourage malicious usage of resources. A typical problem of puzzle constructions is the difference in expected solving time on different computing platforms. We call puzzles which can be solved independently of client computing resources fair client puzzles.
We propose a construction for client puzzles requiring widely distributed computational effort for their solution. These puzzles can be solved using the mining process of Bitcoin, or similar cryptocurrencies. Adapting existing definitions, we show that our puzzle construction satisfies formal requirements of client puzzles under reasonable assumptions. We describe a way of transforming our client puzzles for use in denial of service scenarios and demonstrate a practical construction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Throughout we use DoS to refer to both DoS and DDoS, when not explicitly stated otherwise.
- 2.
- 3.
The full version of the paper can be found online, on the IACR eprint page: https://eprint.iacr.org/.
References
Ateniese, G., Bonacina, I., Faonio, A., Galesi, N.: Proofs of space: when space is of the essence. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 538–557. Springer, Heidelberg (2014)
Aura, T., Nikander, P., Leiwo, J.: DOS-resistant authentication with client puzzles. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2000. LNCS, vol. 2133, pp. 170–177. Springer, Heidelberg (2001)
Back, A.: Hashcash-a denial of service counter-measure (2002).http://www.hashcash.org/papers/hashcash.pdf
Barber, S., Boyen, X., Shi, E., Uzun, E.: Bitter to Better — how to make bitcoin a better currency. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 399–414. Springer, Heidelberg (2012)
Bonneau, J., Miller, A., Clark, J., Narayanan, A., Kroll, J.A., Felten, E.W.: SoK: research perspectives and challenges for bitcoin and cryptocurrencies. In: IEEE Symposium on Security and Privacy, SP 2015, pp. 104–121. IEEE Computer Society (2015)
Boyd, C., et al.: Cryptographic approaches to denial-of-service resistance. In: Raghavan, S.V., Dawson, E. (eds.) An Investigation into the Detection and Mitigation of Denialof Service (DoS) Attacks, pp. 183–238. Springer, Heidelberg (2011)
Chen, L., Morrissey, P., Smart, N.P., Warinschi, B.: Security notions and generic constructions for client puzzles. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 505–523. Springer, Heidelberg (2009)
Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139–147. Springer, Heidelberg (1993)
Groza, B., Warinschi, B.: Revisiting difficulty notions for client puzzles and DoS resilience. In: Gollmann, D., Freiling, F.C. (eds.) ISC 2012. LNCS, vol. 7483, pp. 39–54. Springer, Heidelberg (2012)
Jakobsson, M., Juels, A.: Proofs of work and bread pudding protocols. In: Secure Information Networks: Communications and MultimediaSecurity, IFIP Conference Proceedings, vol. 152, pp. 258–272. Kluwer (1999)
Juels, A., Brainard, J.G.: Client puzzles: a cryptographic countermeasure against connectiondepletion attacks. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 1999. The Internet Society (1999)
Karame, G.O., Čapkun, S.: Low-cost client puzzles based on modular exponentiation. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 679–697. Springer, Heidelberg (2010)
Mao, W., Paterson, K.G.: On the plausible deniability feature of Internet protocols (2002). www.isg.rhul.ac.uk/~kp/IKE.ps
Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369–378. Springer, Heidelberg (1988)
Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https://bitcoin.org/bitcoin.pdf
Percival, C.: Stronger key derivation via sequential memory-hard functions (2009). http://bitcoin-class.org/0/classes/class16/scrypt.pdf
Stebila, D., Kuppusamy, L., Rangasamy, J., Boyd, C., Gonzalez Nieto, J.: Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 284–301. Springer, Heidelberg (2011)
Stebila, D., Ustaoglu, B.: Towards denial-of-service-resilient key agreement protocols. In: Boyd, C., González Nieto, J. (eds.) ACISP 2009. LNCS, vol. 5594, pp. 389–406. Springer, Heidelberg (2009)
Tschorsch, F., Scheuermann, B.: Bitcoin and beyond: a technical survey on decentralized digital currencies. IACR ePrint Archive 2015:464 (2015)
Web: Ken shirriff www.righto.com. http://www.righto.com/2014/02/bitcoins-hard-way-using-raw-bitcoin.html. (Accessed on Oct 15)
Web: Bitcoin Block Explorer (2015). http://blockexplorer.com/.(Accessed on Nov 15)
Web: Bitcoin Wiki (2015). https://en.bitcoin.it/wiki/Main_Page (Accessed on Nov 15)
Web: CoinDesk (2015). http://www.coindesk.com/. (Accessed on Nov 15)
Web: michaelnielsen.org (2015). http://www.michaelnielsen.org/ddi/how-the-bitcoin-protocol-actually-works/. (Accessed on Nov 15)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Boyd, C., Carr, C. (2016). Fair Client Puzzles from the Bitcoin Blockchain. In: Liu, J., Steinfeld, R. (eds) Information Security and Privacy. ACISP 2016. Lecture Notes in Computer Science(), vol 9722. Springer, Cham. https://doi.org/10.1007/978-3-319-40253-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-40253-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40252-9
Online ISBN: 978-3-319-40253-6
eBook Packages: Computer ScienceComputer Science (R0)