skip to main content
research-article

DDoS defense by offense

Published:04 August 2010Publication History
Skip Abstract Section

Abstract

This article presents the design, implementation, analysis, and experimental evaluation of speak-up, a defense against application-level distributed denial-of-service (DDoS), in which attackers cripple a server by sending legitimate-looking requests that consume computational resources (e.g., CPU cycles, disk). With speak-up, a victimized server encourages all clients, resources permitting, to automatically send higher volumes of traffic. We suppose that attackers are already using most of their upload bandwidth so cannot react to the encouragement. Good clients, however, have spare upload bandwidth so can react to the encouragement with drastically higher volumes of traffic. The intended outcome of this traffic inflation is that the good clients crowd out the bad ones, thereby capturing a much larger fraction of the server's resources than before. We experiment under various conditions and find that speak-up causes the server to spend resources on a group of clients in rough proportion to their aggregate upload bandwidths, which is the intended result.

References

  1. Abadi, M., Burrows, M., Manasse, M., and Wobber, T. 2005. Moderately hard, memory-bound functions. ACM Trans. Inter. Tech. 5, 2. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Agarwal, S., Dawson, T., and Tryfonas, C. 2003. DDoS mitigation via regional cleaning centers. Sprint ATL Res. rep. RR04-ATL-013177.Google ScholarGoogle Scholar
  3. Anderson, T., Roscoe, T., and Wetherall, D. 2003. Preventing Internet denial-of-service with capabilities. In Proceedings of the ACM Workshop on Hot Topics in Networks (HotNets).Google ScholarGoogle Scholar
  4. Aura, T., Nikander, P., and Leiwo, J. 2000. DoS-resistant authentication with client puzzles. In Proceedings of the International Workshop on Security Protocols. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Back, A. 2002. Hashcash—a denial of service counter-measure. http://www.cypherspace.org/adam/hashcash/hashcash.pdf.Google ScholarGoogle Scholar
  6. Balakrishnan, H., Rahul, H. S., and Seshan, S. 1999. An integrated congestion management architecture for Internet hosts. In Proceedings of the ACM SIGCOMM Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Banga, G., Druschel, P., and Mogul, J. C. 1999. Resource containers: A new facility for resource management in server systems. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Boothe, P., Hiebert, J., and Bush, R. 2006. Short-lived prefix hijacking on the Internet. Presentation to nanog. http://www.nanog.org/mtg-0602/pdf/boothe.pdf.Google ScholarGoogle Scholar
  9. Brown, D. 2006. Gangsters hijack home PCs to choke internet with spam. The Times. http://business.timesonline.co.uk/tol/business/law/public_law/article649541.ece.Google ScholarGoogle Scholar
  10. CNET News. 2005. Bots slim down to get tough. http://news.com.com/Bots+slim+down+to+get+tough/2100-7355_3-5956143.html.Google ScholarGoogle Scholar
  11. Cooke, E., Jahanian, F., and McPherson, D. 2005. The zombie roundup: Understanding, detecting and disrupting botnets. In Proceedings of the USENIX Conference on Steps to Reducing Unwanted Traffic on the Internet Workshop (SRUTI). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. cyberslam. 2004. Criminal complaint filed Aug. 25, 2004, United States v. Ashley et al., No. 04 mj 02112 (Central District of California). http://www.reverse.net/operationcyberslam.pdf.Google ScholarGoogle Scholar
  13. Dagon, D., Zou, C., and Lee, W. 2006. Modeling botnet propagation using time zones. In Proceedings of the Conference on Network and Distributed System Security Symposium (NDSS).Google ScholarGoogle Scholar
  14. Dean, D. and Stubblefield, A. 2001. Using client puzzles to protect TLS. In Proceedings of the USENIX Security Symposium. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Demers, A., Keshav, S., and Shenker, S. 1995. Analysis and simulation of a fair queuing algorithm. ACM SIGCOMM Comput. Comm. Rev. 25, 1.Google ScholarGoogle Scholar
  16. Douceur, J. 2002. The sybil attack. In Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS). Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Dwork, C., Goldberg, A., and Naor, M. 2003. On memory-bound functions for fighting spam. In Proceedings of CRYPTO.Google ScholarGoogle Scholar
  18. Dwork, C. and Naor, M. 1992. Pricing via processing or combatting junk mail. In Proceedings of CRYPTO. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. eWEEK. 2006. Money bots: Hackers cash in on hijacked PCs. http://www.eweek.com/article2/0,1895,2013957,00.asp.Google ScholarGoogle Scholar
  20. Falk, E. 2006. New host cloaking technique used by spammers. http://thespamdiaries.blogspot.com/2006/02/new-host-cloaking-technique-used-by.html.Google ScholarGoogle Scholar
  21. Feamster, N., Jung, J., and Balakrishnan, H. 2005. An empirical study of “bogon” route advertisements. ACM SIGCOMM Comput. Comm. Rev. 35, 1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Feng, W. 2003. The case for TCP/IP puzzles. In Proceedings of the ACM SIGCOMM Workshop on Future Directions in Network Architecture. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Fraleigh, C., Moon, S., Lyles, B., Cotton, C., Khan, M., Moll, D., Rockell, R., Seely, T., and Diot, C. 2003. Packet-level traffic measurements from the Sprint IP backbone. IEEE Netw. 17, 6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Freiling, F. C., Holz, T., and Wicherski, G. 2005. Botnet tracking: Exploring a root-cause methodology to prevent distributed denial-of-service attacks. In Proceedings of the European Symposium on Research in Computer Security (ESORICS). Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Gligor, V. D. 2003. Guaranteeing access in spite of distributed service-flooding attacks. In Proceedings of the International Workshop on Security Protocols. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Google Captcha. 2005. Stupid Google virus/spyware captcha page. http://plo.hostingprod.com/@spyblog.org.uk/blog/2005/06/13/stupid-google-virusspyware-cap.html.Google ScholarGoogle Scholar
  27. Gunter, C. A., Khanna, S., Tan, K., and Venkatesth, S. 2004. DoS protection for reliably authenticated broadcast. In Proceedings of the Network and Distributed System Security Symposium (NDSS).Google ScholarGoogle Scholar
  28. Handley, M. 2005. In a presentation to Internet architecture working group, DoS-resistant Internet subgroup.Google ScholarGoogle Scholar
  29. Handley, M. and Greenhalgh, A. 2004. Steps towards a DoS-resistant Internet architecture. In Proceedings of the ACM SIGCOMM Workshop on Future Directions in Network Architecture. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Honeynet Project and Research Alliance. 2005. Know your enemy: Tracking botnets. http://www.honeynet.org/papers/bots/.Google ScholarGoogle Scholar
  31. Juels, A. and Brainard, J. 1999. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proceedings of the Conference on Network and Distributed System Security Symposium (NDSS).Google ScholarGoogle Scholar
  32. Kandula, S., Katabi, D., Jacob, M., and Berger, A. 2005. Botz-4-sale: Surviving organized DDoS attacks that mimic flash crowds. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI). Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Knuth, D. E. 1998. The Art of Computer Programming 3rd Ed., Vol. 2. Addison-Wesley, Chapter 3.4.2.Google ScholarGoogle Scholar
  34. Kohler, E., Handley, M., and Floyd, S. 2006. Designing DCCP: Congestion control without reliability. In Proceedings of the ACM SIGCOMM Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Krohn, M. 2004. Building secure high-performance Web services with OKWS. In Proceedings of the USENIX Technical Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Laurie, B. and Clayton, R. 2004. “Proof-of-Work” proves not to work; version 0.2. http://www.cl.cam.ac.uk/users/rnc1/proofwork2.pdf.Google ScholarGoogle Scholar
  37. Lyon, B. 2006. Private communication.Google ScholarGoogle Scholar
  38. Mahimkar, A., Dange, J., Shmatikov, V., Vin, H., and Zhang, Y. 2007. dFence: Transparent network-based denial of service mitigation. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI). Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Mankins, D., Krishnan, R., Boyd, C., Zao, J., and Frentz, M. 2001. Mitigating distributed denial of service attacks with dynamic resource pricing. In Proceedings of the IEEE Computer Security Applications Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Mazières, D. 2001. A toolkit for user-level file systems. In Proceedings of the USENIX Technical Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. McLaughlin, L. 2004. Bot software spreads, causes new worries. IEEE Distrib. Syst. Online 5, 6. http://csdl2.computer.org/comp/mags/ds/2004/06/o6001.pdf. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. McPherson, D. and Labovitz, C. 2006. Worldwide infrastructure security report, vol. II. Arbor Networks, Inc. http://www.arbor.net/downloads/worldwide_infrastructure_security_report_sept06.pdf.Google ScholarGoogle Scholar
  43. Mirkovic, J. and Reiher, P. 2004. A taxonomy of DDoS attacks and DDoS defense mechanisms. ACM SIGCOMM Comput. Comm. Rev. 34, 2. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Morein, W., Stavrou, A., Cook, D., Keromytis, A., Mishra, V., and Rubenstein, D. 2003. Using graphic Turing tests to counter automated DDoS attacks against Web servers. In Proceedings of the ACM Conference on Computer and Communications Security (CCS). Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Network World. 2005. Extortion via DDoS on the rise. http://www.networkworld.com/news/2005/051605-ddos-extortion.html.Google ScholarGoogle Scholar
  46. Park, K., Pai, V. S., Lee, K.-W., and Calo, S. 2006. Securing Web service by automatic robot detection. In Proceedings of the USENIX Technical Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Parno, B., Wendlandt, D., Shi, E., Perrig, A., Maggs, B., and Hu, Y.-C. 2007. Portcullis: Protecting connection setup from denial-of-capability attacks. In Proceedings of the ACM SIGCOMM Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Pittsburgh Post-Gazette. 2003. CMU student taps brain's game skills. http://www.post-gazette.com/pg/03278/228349.stm.Google ScholarGoogle Scholar
  49. Rajab, M. A., Zarfoss, J., Monrose, F., and Terzis, A. 2006. A multifaceted approach to understanding the botnet phenomenon. In Proceedings of the ACM Internet Measurement Conference (IMC). Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Rajab, M. A., Zarfoss, J., Monrose, F., and Terzis, A. 2007. My botnet is bigger than yours (maybe, better than yours): why size estimates remain challenging. In Proceedings of the 1st USENIX Workshop on Hot Topics in Understanding Botnets (HotBots). http://www.usenix.org/events/hotbots07/tech/full_papers/rajab/rajab.pdf. Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. Ramachandran, A. and Feamster, N. 2006. Understanding the network-level behavior of spammers. In Proceedings of the ACM SIGCOMM Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. Ramasubramanian, V. and Sirer, E. G. 2004. The design and implementation of a next generation name service for the Internet. In Proceedings of the ACM SIGCOMM Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. Ranjan, S., Swaminathan, R., Uysal, M., and Knightly, E. W. 2006. DDoS-resilient scheduling to counter application layer attacks under imperfect detection. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Society.Google ScholarGoogle Scholar
  54. Ratliff, E. 2005. The zombie hunters. The New Yorker.Google ScholarGoogle Scholar
  55. Register. 2003. East European gangs in online protection racket. http://www.theregister.co.uk/2003/11/12/east_european_gangs_in_online.Google ScholarGoogle Scholar
  56. Rhea, S., Godfrey, B., Karp, B., Kubiatowicz, J., Ratnasamy, S., Shenker, S., Stoica, I., and Yu, H. 2005. OpenDHT: A public DHT service and its uses. In Proceedings of the ACM SIGCOMM Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. SecurityFocus. 2004. FBI busts alleged DDoS mafia. http://www.securityfocus.com/news/9411.Google ScholarGoogle Scholar
  58. Sekar, V. 2007. Private communication.Google ScholarGoogle Scholar
  59. Sekar, V., Duffield, N., Spatscheck, O., van der Merwe, J., and Zhang, H. 2006. LADS: Large-scale automated DDoS detection system. In Proceedings of the USENIX Technical Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  60. Sherr, M., Greenwald, M., Gunter, C. A., Khanna, S., and Venkatesh, S. S. 2005. Mitigating DoS attack through selective bin verification. In Proceedings of the 1st Workshop on Secure Network Protocols. Google ScholarGoogle ScholarDigital LibraryDigital Library
  61. Singh, K. K. 2006. Botnets—An introduction. Course Project, CS6262, Georgia Institute of Technology. http://www-static.cc.gatech.edu/classes/AY2006/cs6262_spring/botnets.ppt.Google ScholarGoogle Scholar
  62. Srivatsa, M., Iyengar, A., Yin, J., and Liu, L. 2006. A middleware system for protecting against application level denial of service attacks. In Proceedings of the ACM/IFIP/USENIX International Middleware Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  63. Stavrou, A., Ioannidis, J., Keromytis, A. D., Misra, V., and Rubenstein, D. 2004. A pay-per-use DoS protection mechanism for the Web. In Proceedings of the International Conference on Applied Cryptography and Network Security.Google ScholarGoogle Scholar
  64. Sturgeon, W. 2005. Denial of service attack victim speaks out. http://management.silicon.com/smedirector/0,39024679,39130810,00.htm.Google ScholarGoogle Scholar
  65. TechWeb News. 2005. Dutch botnet bigger than expected. http://informationweek.com/story/showArticle.jhtml?articleID=172303265.Google ScholarGoogle Scholar
  66. Thomas, D. 2005. Deterrence must be the key to avoiding DDoS attacks. http://www.vnunet.com/computing/analysis/2137395/deterrence-key-avoiding-ddos-attacks.Google ScholarGoogle Scholar
  67. Vasudevan, R., Mao, Z. M., Spatscheck, O., and van der Merwe, J. 2006. Reval: A tool for real-time evaluation of DDoS mitigation strategies. In Proceedings of the USENIX Technical Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  68. Vitter, J. S. 1985. Random sampling with a reservoir. ACM Trans. Math. Softw. 11, 1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  69. von Ahn, L., Blum, M., and Langford, J. 2004. Telling humans and computers apart automatically. Comm. ACM 47, 2. Google ScholarGoogle ScholarDigital LibraryDigital Library
  70. Walfish, M., Balakrishnan, H., Karger, D., and Shenker, S. 2005. DoS: Fighting fire with fire. In Proceedings of the ACM Workshop on Hot Topics in Networks (HotNets).Google ScholarGoogle Scholar
  71. Walfish, M., Vutukuru, M., Balakrishnan, H., Karger, D., and Shenker, S. 2006. DDoS defense by offense. In Proceedings of the ACM SIGCOMM Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  72. Wang, X. and Reiter, M. K. 2007. A multi-layer framework for puzzle-based denial-of-service defense. Int. J. Inform. Secur. Forthcoming and published online http://dx.doi.org/10.1007/s10207-007-0042-x. Google ScholarGoogle ScholarDigital LibraryDigital Library
  73. Waters, B., Juels, A., Halderman, J. A., and Felten, E. W. 2004. New client puzzle outsourcing techniques for DoS resistance. In Proceedings of the ACM Conference on Computer and Communications Security (CCS). Google ScholarGoogle ScholarDigital LibraryDigital Library
  74. Weber, L. 2007a. Wikimedia request statistics. http://tools.wikimedia.de/~leon/stats/reqstats.Google ScholarGoogle Scholar
  75. Weber, L. 2007b. Wikimedia traffic statistics. http://tools.wikimedia.de/~leon/stats/trafstats.Google ScholarGoogle Scholar
  76. Yaar, A., Perrig, A., and Song, D. 2004. SIFF: A stateless Internet flow filter to mitigate DDoS flooding attacks. In Proceedings of the IEEE Symposium on Security and Privacy.Google ScholarGoogle Scholar
  77. Yang, X., Wetherall, D., and Anderson, T. 2005. A DoS-limiting network architecture. In Proceedings of the ACM SIGCOMM Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. DDoS defense by offense

    Recommendations

    Reviews

    Ruay-Shiung Chang

    Two methods are usually used to defend against distributed denial-of-service (DDoS) attacks: the first method provides lots of resources to satisfy requests, so that services cannot be denied; the other method builds a blacklist for denying requests. This paper proposes a different approach: allocate a fair amount of bandwidth and resources, such as central processing unit (CPU) time and memory, to each connection, instead of trying to distinguish who is and who isn't an attacker. The assumption is that attackers would use most of their uplink bandwidth to infiltrate; therefore, the method encourages all clients to promote their bandwidth usage. Under this scenario, malicious clients cannot react to the encouragement and good clients can obtain better service than before. This method has three main steps: limit requests to a defending server to a threshold; encourage all clients to send more traffic (for example, by resending the same message); and proportionally allocate bandwidth owned by the server according to the delivered bandwidth of all clients. The authors claim that the idea is also applicable to network address translation (NAT) and proxy environments. However, the corresponding evaluation is not included in Section 8, the experimental evaluation part. The claim that evaluation is based on local area networks (LANs) disregards the fact that, currently, many connect to the Internet via asymmetric digital subscriber lines (ADSLs). While users with bandwidth to spare could apply this method, most users are controlled by service providers or run peer-to-peer (P2P) applications. Bandwidth is not something that users can control. The paper is written in a question-and-answer style, and the first part reads like an advertisement. Online Computing Reviews Service

    Access critical reviews of Computing literature here

    Become a reviewer for Computing Reviews.

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Computer Systems
      ACM Transactions on Computer Systems  Volume 28, Issue 1
      March 2010
      106 pages
      ISSN:0734-2071
      EISSN:1557-7333
      DOI:10.1145/1731060
      Issue’s Table of Contents

      Copyright © 2010 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 4 August 2010
      • Accepted: 1 January 2010
      • Revised: 1 August 2009
      • Received: 1 February 2008
      Published in tocs Volume 28, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader