{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T21:15:01Z","timestamp":1773090901982,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T00:00:00Z","timestamp":1300752000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,22]]},"DOI":"10.1145\/1966913.1966929","type":"proceedings-article","created":{"date-parts":[[2011,4,7]],"date-time":"2011-04-07T09:36:11Z","timestamp":1302168971000},"page":"114-123","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["An integrated approach to cryptographic mitigation of denial-of-service attacks"],"prefix":"10.1145","author":[{"given":"Jothi","family":"Rangasamy","sequence":"first","affiliation":[{"name":"Queensland University of Technology, Brisbane, QLD, Australia"}]},{"given":"Douglas","family":"Stebila","sequence":"additional","affiliation":[{"name":"Queensland University of Technology, Brisbane, QLD, Australia"}]},{"given":"Colin","family":"Boyd","sequence":"additional","affiliation":[{"name":"Queensland University of Technology, Brisbane, QLD, Australia"}]},{"given":"Juan Gonz\u00e1lez","family":"Nieto","sequence":"additional","affiliation":[{"name":"Queensland University of Technology, Brisbane, QLD, Australia"}]}],"member":"320","published-online":{"date-parts":[[2011,3,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"March","author":"Labs ACME","year":"2006","unstructured":"ACME Labs . http_load , March 2006 . URL : http:\/\/www.acme.com\/software\/http_load\/. ACME Labs. http_load, March 2006. URL: http:\/\/www.acme.com\/software\/http_load\/."},{"key":"e_1_3_2_1_2_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BFb0028465","volume-title":"Proceedings of the First International Conference on Information and Communications Security (ICICS)","author":"Aura T.","year":"1997","unstructured":"T. Aura and P. Nikander . Stateless connections . In Y. Han, T. Okamoto, and S. Qing, editors, Proceedings of the First International Conference on Information and Communications Security (ICICS) 1997 , volume 1334 of LNCS , pages 87 -- 97 . Springer , 1997. T. Aura and P. Nikander. Stateless connections. In Y. Han, T. Okamoto, and S. Qing, editors, Proceedings of the First International Conference on Information and Communications Security (ICICS) 1997, volume 1334 of LNCS, pages 87--97. Springer, 1997."},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","first-page":"170","volume-title":"Security Protocols: 8th International Workshop","author":"Aura T.","year":"2000","unstructured":"T. Aura , P. Nikander , and J. Leiwo . DoS-resistant authentication with client puzzles . In B. Christianson, B. Crispo, J. A. Malcolm, and M. Roe, editors, Security Protocols: 8th International Workshop , volume 2133 of LNCS , pages 170 -- 177 . Springer , 2000 . T. Aura, P. Nikander, and J. Leiwo. DoS-resistant authentication with client puzzles. In B. Christianson, B. Crispo, J. A. Malcolm, and M. Roe, editors, Security Protocols: 8th International Workshop, volume 2133 of LNCS, pages 170--177. Springer, 2000."},{"key":"e_1_3_2_1_4_1","volume-title":"Hashcash: A denial-of-service countermeasure","author":"Back A.","year":"2002","unstructured":"A. Back . Hashcash: A denial-of-service countermeasure . 2002 . URL : http:\/\/www.hashcash.org\/papers\/hashcash.pdf. A. Back. Hashcash: A denial-of-service countermeasure. 2002. URL: http:\/\/www.hashcash.org\/papers\/hashcash.pdf."},{"key":"e_1_3_2_1_5_1","volume-title":"August","author":"Bernstein D. J.","year":"2000","unstructured":"D. J. Bernstein . A secure public-key signature system with extremely fast verification , August 2000 . URL : http:\/\/cr.yp.to\/papers.html#sigs. D. J. Bernstein. A secure public-key signature system with extremely fast verification, August 2000. URL: http:\/\/cr.yp.to\/papers.html#sigs."},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"70","volume-title":"Advances in Cryptology -- Proc. EUROCRYPT","author":"Bernstein D. J.","year":"2008","unstructured":"D. J. Bernstein . Proving tight security for Rabin-Williams signatures . In N. Smart, editor, Advances in Cryptology -- Proc. EUROCRYPT 2008 , volume 4965 of LNCS , pages 70 -- 87 . Springer , 2008. D. J. Bernstein. Proving tight security for Rabin-Williams signatures. In N. Smart, editor, Advances in Cryptology -- Proc. EUROCRYPT 2008, volume 4965 of LNCS, pages 70--87. Springer, 2008."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1128817.1128826"},{"key":"e_1_3_2_1_8_1","volume-title":"URL: http:\/\/www.cert.org\/tech_tips\/denial_of_service.html","author":"CERT.","year":"2010","unstructured":"CERT. Denial of service attacks. URL: http:\/\/www.cert.org\/tech_tips\/denial_of_service.html , 3 May 2010 . CERT. Denial of service attacks. URL: http:\/\/www.cert.org\/tech_tips\/denial_of_service.html, 3 May 2010."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_30"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1124153.1124155"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. 10th USENIX Security Symposium","author":"Dean D.","year":"2001","unstructured":"D. Dean and A. Stubblefield . Using client puzzles to protect TLS . In Proc. 10th USENIX Security Symposium , 2001 . D. Dean and A. Stubblefield. Using client puzzles to protect TLS. In Proc. 10th USENIX Security Symposium, 2001."},{"key":"e_1_3_2_1_12_1","first-page":"2372","volume-title":"INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE","volume":"4","author":"Feng W.","year":"2005","unstructured":"W. Feng , E. Kaiser , and A. Luu . Design and implementation of network puzzles . In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE , volume 4 , pages 2372 -- 2382 . IEEE, 2005 . W. Feng, E. Kaiser, and A. Luu. Design and implementation of network puzzles. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, volume 4, pages 2372--2382. IEEE, 2005."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_3_2_1_14_1","first-page":"151","volume-title":"Proc. Internet Society Network and Distributed System Security Symposium (NDSS) 1999","author":"Juels A.","year":"1999","unstructured":"A. Juels and J. Brainard . Client puzzles: A cryptographic countermeasure against connection depletion attacks . In Proc. Internet Society Network and Distributed System Security Symposium (NDSS) 1999 , pages 151 -- 165 . Internet Society , 1999 . A. Juels and J. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proc. Internet Society Network and Distributed System Security Symposium (NDSS) 1999, pages 151--165. Internet Society, 1999."},{"key":"e_1_3_2_1_15_1","volume-title":"March","author":"Karn P.","year":"1999","unstructured":"P. Karn and W. A. Simpson . Photuris: Session-key management protocol , March 1999 . RFC 2522. URL : http:\/\/www.ietf.org\/rfc\/rfc2522.txt. P. Karn and W. A. Simpson. Photuris: Session-key management protocol, March 1999. RFC 2522. URL: http:\/\/www.ietf.org\/rfc\/rfc2522.txt."},{"key":"e_1_3_2_1_16_1","volume-title":"December","author":"Kaufman C.","year":"2005","unstructured":"C. Kaufman . Internet Key Exchange (IKEv2) protocol , December 2005 . RFC 4306. URL : http:\/\/www.ietf.org\/rfc\/rfc4306.txt. C. Kaufman. Internet Key Exchange (IKEv2) protocol, December 2005. RFC 4306. URL: http:\/\/www.ietf.org\/rfc\/rfc4306.txt."},{"issue":"4","key":"e_1_3_2_1_17_1","first-page":"326","article-title":"Requirements for client puzzles to defeat the denial of service and the distributed denial of service attacks","volume":"3","author":"Laurens V.","year":"2006","unstructured":"V. Laurens , A. El-Saddik , and A. Nayak . Requirements for client puzzles to defeat the denial of service and the distributed denial of service attacks . International Arab Journal of Information Technology , 3 ( 4 ): 326 -- 333 , 2006 . V. Laurens, A. El-Saddik, and A. Nayak. Requirements for client puzzles to defeat the denial of service and the distributed denial of service attacks. International Arab Journal of Information Technology, 3(4):326--333, 2006.","journal-title":"International Arab Journal of Information Technology"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/794199.795127"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/374742.374757"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132026.1132027"},{"key":"e_1_3_2_1_21_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system","author":"Nakamoto S.","year":"2009","unstructured":"S. Nakamoto . Bitcoin: A peer-to-peer electronic cash system , 2009 . URL : http:\/\/www.bitcoin.org\/bitcoin.pdf. S. Nakamoto. Bitcoin: A peer-to-peer electronic cash system, 2009. URL: http:\/\/www.bitcoin.org\/bitcoin.pdf."},{"key":"e_1_3_2_1_22_1","first-page":"125","volume-title":"Proceedings of the 2006 Australasian Workshops on Grid Computing and e-research","volume":"54","author":"Smith J.","year":"2006","unstructured":"J. Smith , J. Gonz ález Nieto, and C. Boyd . Modelling denial of service attacks on JFK with Meadows's cost-based framework . In Proceedings of the 2006 Australasian Workshops on Grid Computing and e-research , volume 54 , pages 125 -- 134 . Australian Computer Society, Inc. , 2006 . J. Smith, J. González Nieto, and C. Boyd. Modelling denial of service attacks on JFK with Meadows's cost-based framework. In Proceedings of the 2006 Australasian Workshops on Grid Computing and e-research, volume 54, pages 125--134. Australian Computer Society, Inc., 2006."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1358393.1358399"},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/978-3-642-19074-2_19","volume-title":"Topics in Cryptology -- CT-RSA 2011 -- The Cryptographers' Track at the RSA Conference","author":"Stebila D.","year":"2011","unstructured":"D. Stebila , L. Kuppusamy , J. Rangasamy , C. Boyd , and J. Gonz ález Nieto. Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols . In A. Kiayias, editor, Topics in Cryptology -- CT-RSA 2011 -- The Cryptographers' Track at the RSA Conference , volume 6558 of LNCS , pages 284 -- 301 . Springer , 2011 . URL: http:\/\/eprint.iacr.org\/2010\/649. pdf D. Stebila, L. Kuppusamy, J. Rangasamy, C. Boyd, and J. González Nieto. Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols. In A. Kiayias, editor, Topics in Cryptology -- CT-RSA 2011 -- The Cryptographers' Track at the RSA Conference, volume 6558 of LNCS, pages 284--301. Springer, 2011. URL: http:\/\/eprint.iacr.org\/2010\/649. pdf"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02620-1_27"},{"key":"e_1_3_2_1_26_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-540-76969-9_16","volume-title":"Cryptology and Network Security (CANS)","author":"Tritilanunt S.","year":"2007","unstructured":"S. Tritilanunt , C. Boyd , E. Foo , and J. Gonz ález Nieto. Toward non-parallelizable client puzzles . In F. Bao, S. Ling, T. Okamoto, H. Wang, and C. Xing, editors, Cryptology and Network Security (CANS) 2007 , volume 4856 of LNCS , pages 247 -- 264 . Springer , 2007. S. Tritilanunt, C. Boyd, E. Foo, and J. González Nieto. Toward non-parallelizable client puzzles. In F. Bao, S. Ling, T. Okamoto, H. Wang, and C. Xing, editors, Cryptology and Network Security (CANS) 2007, volume 4856 of LNCS, pages 247--264. Springer, 2007."},{"key":"e_1_3_2_1_27_1","first-page":"78","volume-title":"Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP'03)","author":"Wang X.","year":"2003","unstructured":"X. Wang and M. K. Reiter . Defending against denial-of-service attacks with puzzle auctions . In Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP'03) , pages 78 -- 92 . IEEE Press , 2003 . X. Wang and M. K. Reiter. Defending against denial-of-service attacks with puzzle auctions. In Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP'03), pages 78--92. IEEE Press, 2003."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056264"},{"key":"e_1_3_2_1_29_1","volume-title":"The OpenSSL project","author":"Young E. A.","year":"2007","unstructured":"E. A. Young and T. J. Hudson . The OpenSSL project , 2007 . URL : http:\/\/www.openssl.org. E. A. Young and T. J. Hudson. The OpenSSL project, 2007. URL: http:\/\/www.openssl.org."},{"key":"e_1_3_2_1_30_1","volume-title":"The need for speed II","author":"Research Zona","year":"2001","unstructured":"Zona Research . The need for speed II . April , 2001 . URL: http:\/\/www.keynote.com\/downloads\/Zona Need _For_Speed.pdf. Zona Research. The need for speed II. April, 2001. URL: http:\/\/www.keynote.com\/downloads\/Zona Need_For_Speed.pdf."}],"event":{"name":"ASIA CCS '11: 6th ACM Symposium on Information, Compuer and Communications Security","location":"Hong Kong China","acronym":"ASIA CCS '11","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1966913.1966929","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1966913.1966929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:25Z","timestamp":1750243945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1966913.1966929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,22]]},"references-count":30,"alternative-id":["10.1145\/1966913.1966929","10.1145\/1966913"],"URL":"https:\/\/doi.org\/10.1145\/1966913.1966929","relation":{},"subject":[],"published":{"date-parts":[[2011,3,22]]},"assertion":[{"value":"2011-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}