{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:12:11Z","timestamp":1778263931580,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":23,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_264","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:53:57Z","timestamp":1319709237000},"page":"244-245","source":"Crossref","is-referenced-by-count":0,"title":["Computational Puzzles"],"prefix":"10.1007","author":[{"given":"XiaoFeng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"264_CR1_264","first-page":"139","volume-title":"Lecture Notes in Computer Science","author":"C Dwork","year":"1992","unstructured":"Dwork C, Naor M (1992) Pricing via processing or combating junk mail. In Brickell E (ed) Proceedings of Advances in Cryptology\u2014CRYPTO 92, Lecture Notes in Computer Science, 1328:139\u2013147. Springer, Berlin"},{"key":"264_CR2_264","first-page":"151","volume-title":"Client puzzle: a cryptographic defense against connection depletion attacks","author":"A Juels","year":"1999","unstructured":"Juels A, Brainard J (1999) Client puzzle: a cryptographic defense against connection depletion attacks. In Kent S (ed) Proceedings of the 16th Annual Network and Distributed System Security Symposium, pp 151\u2013165"},{"key":"264_CR3_264","unstructured":"Rivest R, Shamir A, Wagner D (1996) Time-lock puzzles and timed-release crypto. MIT\/LCS\/TR-684"},{"key":"264_CR4_264","first-page":"246","volume-title":"New client puzzle outsourcing techniques for dos resistance","author":"B Waters","year":"2004","unstructured":"Waters B, Juels A, Halderman JA, Felten EW (2004) New client puzzle outsourcing techniques for dos resistance. In Proceedings of the 11th ACM Conference on Computer and Communications Security, pp. 246\u2013256. ACM Press, New York"},{"key":"264_CR5_264","first-page":"78","volume-title":"Defending against denial-of-service attacks with puzzle auctions","author":"X Wang","year":"2003","unstructured":"Wang X, Reiter M (2003) Defending against denial-of-service attacks with puzzle auctions. In Proceedings of the IEEE Symposium on Security and Privacy, pp. 78\u201392. IEEE Press, New\u00a0York"},{"key":"264_CR6_264","first-page":"257","volume-title":"Mitigating bandwidth-exhaustion attacks using congestion puzzles","author":"X Wang","year":"2004","unstructured":"Wang X, Reiter M (2004) Mitigating bandwidth-exhaustion attacks using congestion puzzles. In Proceedings of the 11th ACM Conference on Computer and Communication Security, pp. 257\u2013267. ACM Press, New York"},{"key":"264_CR7_264","unstructured":"Back A. HashCash. In: http:\/\/hashcash.org\/"},{"key":"264_CR8_264","unstructured":"Jakobsson M, Juels A (1999) Proofs of work and bread pudding protocols. In Communications and Multimedia Security, pp. 258\u2013272. Kluwer Academic Publishers, Dordrecht, the Netherland"},{"key":"264_CR9_264","series-title":"Lecture Notes in Computer Science","first-page":"198","volume-title":"Curbing junk e-mail via secure classification","author":"E Gabber","year":"1998","unstructured":"Gabber E, Jakobsson M, Matias Y, Mayer AJ (1998) Curbing junk e-mail via secure classification. In Proceedings of the Second International Conference on Financial Cryptography, Lecture Notes in Computer Science, 1465:198\u2013213. Springer, Berlin"},{"key":"264_CR10_264","first-page":"170","volume-title":"Lecture Notes in Computer Science","author":"T Aura","year":"2000","unstructured":"Aura T, Nikander P, Leiwo J (2000) Dos-resistant authentication with client puzzles. In Proceedings of the 8th International Workshop on Security Protocols, Lecture Notes in Computer Science, pp. 170\u2013177. Springer, Berlin"},{"key":"264_CR11_264","first-page":"25","volume-title":"Moderately hard, memory-bound functions","author":"M Abadi","year":"2003","unstructured":"Abadi M, Burrow M, Manasse M, Wobber T (2003) Moderately hard, memory-bound functions. In Proceedings of the 10th Annual Network and Distributed System Security Symposium, pp. 25\u201339. San Diego, California"},{"key":"264_CR12_264","first-page":"426","volume-title":"Lecture Notes in Computer Science","author":"C Dwork","year":"2003","unstructured":"Dwork C, Goldberg A, Naor M (2003) On memory-bound functions for fighting spam. In Proceedings of Advances in Cryptology - CRYPTO, Lecture Notes in Computer Science, 2729:426\u2013444"},{"key":"264_CR13_264","volume-title":"Exponential memory-bound functions for proof of work protocols","author":"F Coelho","year":"2006","unstructured":"Coelho F (2006) Exponential memory-bound functions for proof of work protocols. In Proceedings of Cryptology ePrint Archive, Report 2005\/356"},{"issue":"4","key":"264_CR14_264","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/972426.944771","volume":"33","author":"W Feng","year":"2003","unstructured":"Feng W (2003) The case for TCP\/IP puzzles. In SIGCOMM Comput Comm Rev 33(4):322\u2013327. ACM Press, New York","journal-title":"SIGCOMM Comput Comm Rev"},{"key":"264_CR15_264","first-page":"2372","volume-title":"Design and implementation of network puzzles","author":"W Feng","year":"2005","unstructured":"Feng W, Kaiser E, Luu A (2005) Design and implementation of network puzzles. In Proceedings of IEEE INFOCOM, pp. 2372\u20132382"},{"key":"264_CR16_264","unstructured":"Penny Black Project at Microsoft Research. In: http:\/\/research.microsoft.com\/en-us\/projects\/pennyblack\/"},{"key":"264_CR17_264","volume-title":"Proceedings of Financial Cryptography 97 (FC 97), Lecture Notes in Computer Science 1318:151\u2013160","author":"M Franklin","year":"1997","unstructured":"Franklin M, Malkhi D (1997) Auditable metering with lightweight security. In Hirschfeld R (ed) Proceedings of Financial Cryptography 97 (FC 97), Lecture Notes in Computer Science 1318:151\u2013160. Springer, Berlin"},{"key":"264_CR18_264","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/BFb0055485","volume":"1465","author":"D Goldschlag","year":"1998","unstructured":"Goldschlag D, Stubblebine S (1998) Publically verifiable lotteries: applications of delaying functions (extend abstract). In Proceedings of Financial Cryptography 98, Lecture Notes in Computer Science 1465:214\u2013226","journal-title":"Lecture Notes in Computer Science"},{"key":"264_CR19_264","unstructured":"Syverson P (1998) Weakly secret bit commitment: Applications to lotteries and fair exchange. In CSFW \u201998: Proceedings of the 11th IEEE Workshop on Computer Security Foundations, pp. 2\u201313"},{"key":"264_CR20_264","first-page":"168","volume-title":"emph Lecture Notes in Computer Science","author":"J Garay","year":"2002","unstructured":"Garay J, Jakobsson M (2002) Timed release of standard digital signatures. In Proceedings of Financial Cryptography, emph Lecture Notes in Computer Science 2357:168\u2013182. Springer, Berlin"},{"key":"264_CR21_264","first-page":"236","volume-title":"Lecture Notes in Computer Science","author":"D Boneh","year":"2000","unstructured":"Boneh D, Naor M (2000) Timed commitments (extended abstract). In Proceedings of Advances in Cryptology\u2014CRYPTO\u201900, Lecture Notes in Computer Science 1880:236\u2013254. Springer, Berlin"},{"key":"264_CR22_264","volume-title":"Proof of work proves not to work","author":"B Laurie","year":"2004","unstructured":"Laurie B, Clayton R (2004) Proof of work proves not to work. In Proceedings of Workshop on the Economics of Information Security"},{"key":"264_CR23_264","volume-title":"Proof of work can work","author":"D Liu","year":"2006","unstructured":"Liu D, Camp LJ (2006) Proof of work can work. In Proceedings of Workshop on the Economics of Information Security"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:03:04Z","timestamp":1778263384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_264","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}