Abstract
Distributed Denial of Service Attacks has recently emerged as one of the most newsworthy, if not the greatest, weaknesses of the Internet. DDoS attacks aim to deny legitimate users of the services. In this paper, we introduce a novel secure scheme for defending against the DDoS attack. When the number of requests arriving at the victim crosses the threshold value (T), integer factorization solution is invoked and the victim server starts sending encrypted e(n) which is generated by RSA instead of ‘n’ to all the users. If the user is not an attacker, decrypts the ‘n’ by using CRT and generate ‘p’ and ‘q’ through integer factorization. If the user fails to provide the computational power to decrypt ‘n’ value as well as to find the factors ‘p’ and ‘q’ then consider him as a malicious user.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
MadhuBabu, J., et. al: Throttling DDoS attack. In: Secrypt 2009, Italy (2009)
Edpegg, J.R.: Chinese Remainder theorem. Wolfram Demonstrations project (2007)
Rupa, C., Sridevi, P.: Solution to the Dictionary Attacks using Time-Space Tradeoff with Asymmetric key Cryptography. In: Proceedings in ERTSP organized by Vignan Institute of Information Technology, pp. 120– 124 (2010)
Hwang, R.-J., Su, F.-F.: An efficient decryption method for RSA ceryptosystem. In: Proceedings of the 19th International Conference on Advanced Information Networking and Applications (2005)
Yen, S.-M., et al.: RSA Speed up with Chinese remainder theorem Immune against Hardware fault crypt analysis. IEEE Transactions on Computers 52(4) (2003)
Patra, J.C., et al.: DCT Domain water marking scheme using chaise reminder theorem for image authentication. In: Proceedings in ICME. IEEE (2010)
Edpegg, J.R.: Chinese Remainder theorem. Wolfram Demonstrations project (2007)
Ogiwara, M.: A method for generating cryptographically strong primes. IEICE Trans., 985–994 (1990)
Pinkas, B., Sander, T.: Securing passwords against dictionary attacks. In: Proc. 9th ACM Conference on Computer and Communications Security (CCS), pp. 161–170. ACM (2002)
Mori, G., Malik, J.: Recognizing objects in adversarial clutter: Breaking a visual CAPTCHA. In: Proceedings of Conference on Computer Vision and Pattern Recognition (CVPR 2003), vol. 1, pp. 134–141. IEEE Computer Society (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rupa, C., Madhu Babu, J., Siva Prasad, P., Avadhani, P.S. (2012). An Efficient Authentication Method for Throttling DDoS Attacks. In: Krishna, P.V., Babu, M.R., Ariwa, E. (eds) Global Trends in Computing and Communication Systems. ObCom 2011. Communications in Computer and Information Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29219-4_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-29219-4_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29218-7
Online ISBN: 978-3-642-29219-4
eBook Packages: Computer ScienceComputer Science (R0)