Defeating DDoS Attack By Using Software Puzzle Scheme

Ananda Babu Kudupudi, M.Anil Kumar


Denial of-administration and passed on DoS are among the genuine dangers to cutting edge security, and customer bewilder, which requests a customer to perform computationally exorbitant operations before being yielded associations from a server, is a notable countermeasure to them. In any case, an assailant can extend its capacity of DoS/DDoS aggressors with energetic confuse understanding programming and also worked in representation arranging unit (GPU) hardware to fundamentally debilitate the adequacy of client conundrums. In this wander, we concentrate how to counteract DoS/DDoS assailants from detonating their puzzle appreciating limits. To this end, we present another customer address proposed as programming riddle. A puzzle algorithm in the present programming riddle plan is subjectively made not long after a customer deals is gotten at the server side and the algorithm is conveyed with the ultimate objective that: 1) an assailant can't get readied an execution to loosen up the puzzler early and 2) the aggressor needs incredible exertion in deciphering a focal dealing with unit programming riddle to its in every practical sense indistinguishable GPU adaptation to such a degree, to the point that the elucidation is unfathomable sensibly.


J. Larimer. (Oct. 28, 2014). Pushdo SSL DDoS Attacks. [Online].Available:

C. Douligeris and A. Mitrokotsa, “DDoS attacks and defensemechanisms:Classification and state-of-the-art,” Comput. Netw., vol. 44, no. 5,pp. 643–666, 2004.

A. Juels and J. Brainard, “Client puzzles: A cryptographic countermeasureagainst connection depletion attacks,” in Proc. Netw. Distrib. Syst.Secur. Symp., 1999, pp. 151–165.

T. J. McNevin, J.-M. Park, and R. Marchany, “pTCP: A client puzzleprotocol for defending against resource exhaustion denial of serviceattacks,” Virginia Tech Univ., Dept. Elect. Comput. Eng., Blacksburg,VA, USA, Tech. Rep. TR-ECE-04-10, Oct. 2004.

R. Shankesi, O. Fatemieh, and C. A. Gunter, “Resource inflation threatsto denial of service countermeasures,” Dept. Comput. Sci., UIUC,Champaign, IL, USA, Tech. Rep., Oct. 2010. [Online]. Available:

J. Green, J. Juen, O. Fatemieh, R. Shankesi, D. Jin, and C. A. Gunter,“Reconstructing Hash Reversal based Proof of Work Schemes,” in Proc.4th USENIX Workshop Large-Scale Exploits Emergent Threats, 2011.

Y. I. Jerschow and M. Mauve, “Non-parallelizable and non-interactiveclient puzzles from modular square roots,” in Proc. Int. Conf. Availability,Rel. Secur., Aug. 2011, pp. 135–142.

R. L. Rivest, A. Shamir, and D. A. Wagner, “Time-lockpuzzles and timed-release crypto,” Dept. Comput. Sci.,Massachusetts Inst. Technol., Cambridge, MA, USA, Tech.Rep. T/LCS/TR-684, Feb. 1996. [Online]. Available:

W.-C. Feng and E. Kaiser, “The case for public work,” in Proc. IEEEGlobal Internet Symp., May 2007, pp. 43–48.

D. Keppel, S. J. Eggers, and R. R. Henry, “A case for runtime codegeneration,” Dept. Comput. Sci. Eng., Univ. Washington, Seattle, WA,USA, Tech. Rep. CSE-91-11-04, 1991.

E. Kaiser and W.-C. Feng, “mod_kaPoW: Mitigating DoS with transparentproof-of-work,” in Proc. ACM CoNEXT Conf., 2007, p. 74.

NVIDIA CUDA. (Apr. 4, 2012). NVIDIA CUDA C Programming Guide,Version 4.2. [Online]. Available:

X. Wang and M. K. Reiter, “Mitigating bandwidth-exhaustion attacksusing congestion puzzles,” in Proc. 11th ACM Conf. Comput. Commun.Secur., 2004, pp. 257–267.

M. Jakobsson and A. Juels, “Proofs of work and bread pudding protocols,”inProc. IFIP TC6/TC11 Joint Working Conf. Secure Inf. Netw.,Commun. Multimedia Secur., 1999, pp. 258–272.

D. Kahn, The Codebreakers: The Story of Secret Writing, 2nd ed.New York, NY, USA: Scribners, 1996, p. 235.

Full Text: PDF [Full Text]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.|

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at