{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T18:23:59Z","timestamp":1746815039621},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190735"},{"type":"electronic","value":"9783642190742"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","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-3-642-19074-2_19","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T05:23:43Z","timestamp":1296797023000},"page":"284-301","source":"Crossref","is-referenced-by-count":27,"title":["Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols"],"prefix":"10.1007","author":[{"given":"Douglas","family":"Stebila","sequence":"first","affiliation":[]},{"given":"Lakshmi","family":"Kuppusamy","sequence":"additional","affiliation":[]},{"given":"Jothi","family":"Rangasamy","sequence":"additional","affiliation":[]},{"given":"Colin","family":"Boyd","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Gonzalez Nieto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Proc. Internet Society Network and Distributed System Security Symposium (NDSS) 2003","author":"M. Abadi","year":"2003","unstructured":"Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately hard, memory-bound functions. In: Proc. Internet Society Network and Distributed System Security Symposium (NDSS) 2003, Internet Society, San Diego (2003)"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/996943.996946","volume":"7","author":"W. Aiello","year":"2004","unstructured":"Aiello, W., Bellovin, S.M., Blaze, M., Canetti, R., Ioannidis, J., Keromytis, A.D., Reingold, O.: Just Fast Keying: Key agreement in a hostile Internet. ACM Transactions on Information and System Security\u00a07(2), 1\u201330 (2004)","journal-title":"ACM Transactions on Information and System Security"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BFb0028465","volume-title":"Information and Communications Security","author":"T. Aura","year":"1997","unstructured":"Aura, T., Nikander, P.: Stateless connections. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 87\u201397. Springer, Heidelberg (1997)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44810-1_22","volume-title":"Security Protocols","author":"T. Aura","year":"2001","unstructured":"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.\u00a02133, pp. 170\u2013177. Springer, Heidelberg (2001)"},{"key":"19_CR5","unstructured":"Babbage, S., Catalano, D., Cid, C., Dunkelman, O., Gehrmann, C., Granboulan, L., Lange, T., Lenstra, A., Nguyen, P.Q., Paar, C., Pelzl, J., Pornin, T., Preneel, B., Rechberger, C., Rijmen, V., Robshaw, M., Rupp, A., Smart, N., Ward, M.: ECRYPT yearly report on algorithms and keysizes (2007-2008) (2008), http:\/\/www.ecrypt.eu.org\/documents\/D.SPA.28-1.1.pdf"},{"key":"19_CR6","unstructured":"Back, A.: A partial hash collision based postage scheme (1997), http:\/\/www.hashcash.org\/papers\/announce.txt"},{"key":"19_CR7","unstructured":"Back, A.: Hashcash (2004), http:\/\/www.hashcash.org\/docs\/hashcash.html"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1006\/jcss.1999.1694","volume":"61","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of the cipher block chaining message authentication code. Journal of Computer and System Sciences\u00a061(3), 362\u2013399 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-48329-2_21","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Entity authentication and key distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 232\u2013249. Springer, Heidelberg (1994)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"Proc. 1st ACM Conference on Computer and Communications Security (CCS)","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proc. 1st ACM Conference on Computer and Communications Security (CCS), pp. 62\u201373. ACM, New York (1993)"},{"key":"19_CR11","unstructured":"Boyen, X.: Halting password puzzles: Hard-to-break encryption from human-memorable keys. In: Proc. 16th USENIX Security Symposium, pp. 119\u2013134 (2007)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-30576-7_2","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness amplification of weakly verifiable puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 17\u201333. Springer, Heidelberg (2005)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-10366-7_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"L. Chen","year":"2009","unstructured":"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.\u00a05912, pp. 505\u2013523. Springer, Heidelberg (2009)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-00457-5_9","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2009","unstructured":"Dodis, Y., Impagliazzo, R., Jaiswal, R., Kabanets, V.: Security amplification for interactive cryptographic primitives. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 128\u2013145. Springer, Heidelberg (2009)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-45146-4_25","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"C. Dwork","year":"2003","unstructured":"Dwork, C., Goldberg, A., Naor, M.: On memory-bound functions for fighting spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 426\u2013444. Springer, Heidelberg (2003)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"C. Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 139\u2013147. Springer, Heidelberg (1993)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11535218_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"C. Dwork","year":"2005","unstructured":"Dwork, C., Naor, M., Wee, H.: Pebbling and proofs of work. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 37\u201354. Springer, Heidelberg (2005)"},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-0-387-35568-9_18","volume-title":"Proceedings of the IFIP TC6\/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security. IFIP Conference Proceedings","author":"M. Jakobsson","year":"1999","unstructured":"Jakobsson, M., Juels, A.: Proofs of work and bread pudding protocols (extended abstract). In: Preneel, B. (ed.) Proceedings of the IFIP TC6\/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security. IFIP Conference Proceedings, vol.\u00a0152, pp. 258\u2013272. Kluwer, Dordrecht (1999), http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2049"},{"key":"19_CR19","first-page":"151","volume-title":"Proc. Internet Society Network and Distributed System Security Symposium (NDSS) 1999","author":"A. Juels","year":"1999","unstructured":"Juels, A., Brainard, J.: Client puzzles: A cryptographic countermeasure against connection depletion attacks. In: Proc. Internet Society Network and Distributed System Security Symposium (NDSS) 1999, pp. 151\u2013165. Internet Society, San Diego (1999)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-642-15497-3_41","volume-title":"Computer Security \u2013 ESORICS 2010","author":"G.O. Karame","year":"2010","unstructured":"Karame, G.O., Capkun, S.: Low-cost client puzzles based on modular exponentiation. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 679\u2013697. Springer, Heidelberg (2010)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Kaufman, C.: Internet Key Exchange (IKEv2) protocol, RFC 4306 (2005)","DOI":"10.17487\/rfc4306"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-75670-5_1","volume-title":"Provable Security","author":"B. LaMacchia","year":"2007","unstructured":"LaMacchia, B., Lauter, K., Mityagin, A.: Stronger security of authenticated key exchange. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, vol.\u00a04784, pp. 1\u201316. Springer, Heidelberg (2007)"},{"key":"19_CR23","unstructured":"Mao, W., Paterson, K.G.: On the plausible deniability feature of Internet protocols (2002) (manuscript), http:\/\/citeseer.ist.psu.edu\/678290.html"},{"key":"19_CR24","unstructured":"McNevin, T.J., Park, J.M., Marchany, R.: pTCP: A client puzzle protocol for defending against resource exhaustion denial of service attacks. Technical Report TR-ECE-04-10, Department of Electrical and Computer Engineering, Virginia Tech (2004), http:\/\/www.arias.ece.vt.edu\/publications\/TechReports\/mcNevin-2004-1.pdf"},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/CSFW.1999.779758","volume-title":"Proc. 12th IEEE Computer Security Foundations Workshop (CSFW)","author":"C. Meadows","year":"1999","unstructured":"Meadows, C.: A formal framework and evaluation method for network denial of service. In: Proc. 12th IEEE Computer Security Foundations Workshop (CSFW), p. 4. IEEE, Los Alamitos (1999)"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Moskowitz, R., Nikander, P., Jokela, P., Henderson, T.R.: Host Identity Protocol, RFC 5201 (2008)","DOI":"10.17487\/rfc5201"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-62494-5_6","volume-title":"Security Protocols","author":"R.L. Rivest","year":"1997","unstructured":"Rivest, R.L., Shamir, A.: PayWord and MicroMint: Two simple micropayment schemes. In: Lomas, M. (ed.) Security Protocols 1996. LNCS, vol.\u00a01189, pp. 69\u201387. Springer, Heidelberg (1997)"},{"key":"19_CR28","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Tech. Rep. TR-684, MIT Laboratory for Computer Science (1996), http:\/\/people.csail.mit.edu\/rivest\/RivestShamirWagner-timelock.pdf"},{"key":"19_CR29","unstructured":"Smith, J., Gonz\u00e1lez Nieto, J., Boyd, C.: Modelling denial of service attacks on JFK with Meadows\u2019s cost-based framework. In: Buyya, R., Ma, T., Safavi-Naini, R., Steketee, C., Susilo, W. (eds.) Proc. 4th Australasian Information Security Workshop \u2013 Network Security (AISW-NetSec) 2006. CRPIT, vol.\u00a054, pp. 125\u2013134. Australian Computer Society (2006)"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Stebila, D., Kuppusamy, L., Rangasamy, J., Boyd, C., Gonzalez Nieto, J.: Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols. Cryptology ePrint Archive (2010) (full version), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-19074-2_19"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-02620-1_27","volume-title":"Information Security and Privacy","author":"D. Stebila","year":"2009","unstructured":"Stebila, D., Ustaoglu, B.: Towards denial-of-service-resilient key agreement protocols. In: Boyd, C., Gonz\u00e1lez Nieto, J. (eds.) ACISP 2009. LNCS, vol.\u00a05594, pp. 389\u2013406. Springer, Heidelberg (2009)"},{"key":"19_CR32","volume-title":"Cryptography: Theory and Practice","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Cryptography: Theory and Practice, 2nd edn. Chapman & Hall, Boca Raton (2002)","edition":"2"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-76969-9_16","volume-title":"Cryptology and Network Security","author":"S. Tritilanunt","year":"2007","unstructured":"Tritilanunt, S., Boyd, C., Foo, E., Gonz\u00e1lez Nieto, J.: Toward non-parallelizable client puzzles. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds.) CANS 2007. LNCS, vol.\u00a04856, pp. 247\u2013264. Springer, Heidelberg (2007)"},{"issue":"3","key":"19_CR34","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10623-007-9159-1","volume":"46","author":"B. Ustaoglu","year":"2008","unstructured":"Ustaoglu, B.: Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS. Designs, Codes and Cryptography\u00a046(3), 329\u2013342 (2008)","journal-title":"Designs, Codes and Cryptography"},{"key":"19_CR35","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/1030083.1030117","volume-title":"Proc. 11th ACM Conference on Computer and Communications Security (CCS)","author":"B. Waters","year":"2004","unstructured":"Waters, B., Juels, A., Halderman, J.A., Felten, E.W.: New client puzzle outsourcing techniques for DoS resistance. In: Pfitzmann, B., Liu, P. (eds.) Proc. 11th ACM Conference on Computer and Communications Security (CCS), pp. 246\u2013256. ACM, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19074-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T23:24:01Z","timestamp":1685921041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19074-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190735","9783642190742"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19074-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}