Client Puzzle Approach for Improving Confidentiality

Ms. Sapna; S. Khapre; Prof. Shrikant Ardhapurkar

doi:https://doi.org/10.14445/22312803/IJCTT-V4I5P98

Research Article | Open Access | Download PDF

Volume 4 | Issue 5 | Year 2013 | Article Id. IJCTT-V4I5P98 | DOI : https://doi.org/10.14445/22312803/IJCTT-V4I5P98

Client Puzzle Approach for Improving Confidentiality

Ms. Sapna, S. Khapre, Prof. Shrikant Ardhapurkar

Citation :

Ms. Sapna, S. Khapre, Prof. Shrikant Ardhapurkar, "Client Puzzle Approach for Improving Confidentiality," International Journal of Computer Trends and Technology (IJCTT), vol. 4, no. 5, pp. 1481-1484, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V4I5P98

Abstract

In present scenario, security of data or information is main concerned. Different defense strategies are developed to avoid DoS-Denial of Service attack, but they don’t provide optimal solution against DoS attack. Preventive mechanisms against flooding attacks can be effectively studied through game theory. This is mainly owing to the several trade-offs existing in a flooding attack defense scenario. For an attacker, there is a trade-off between the severity of his attack and the amount of resources he uses to do so; the more damage an attacker intends to cause, the more amounts of resources he should spend. For a defender, on the other hand, there is a trade-off between the effectiveness of his defense and the quality of service he provides for legitimate users; the more difficult it becomes to exhaust the defender’s resources, the more workload, and hence, less quality of service is imposed on legitimate users. To improve the quality of service for legitimate user and also to improve confidentiality, puzzle based defense technique is used. With the help of puzzle based system we can avoid DoS attack.

Keywords

Hierarchical clustering, document clustering, similarity measure

References

[1] Raju Neyyan, Ancy Paul, Mayank Deshwal and Amit Deshmukh, “Game Theory based Defense Mechanism against Flooding Attack using Puzzle,” Emerging Trends in Computer Science and Information Technology, pg 5-10, no. 1, April 2012.
[2] Kumar Dayanand and S. Magesh, ”Defence Strategy against Flooding Attacks Using Nash Equilibrium Game Theory,” International Conference on Computing and Control Engineering (ICCCE 2012), April 2012.
[3] Tanmay Sanjay Khirwadkar, “Defense Against Network Attacks Using Game Theory,” University Of Illinois At Urbana-Champaign, May 2011.
[4] Mehran S. Fallah, ”A Puzzle-Based Defence Strategy Against Flooding Attacks Using Game Theory,” IEEE transactions on dependable and secure computing, vol. 7, no. 1, pg 5-19, 2010.
[5] D. Moore, C. Shannon, D.J. Brown, G.M. Voelker, and S. Savage,“Inferring Internet Denial-of-Service Activity,” ACM Trans.Computer Systems, vol. 24, no. 2, pp. 115-139, May 2006.
[6] Jelena Mirkovic, Janice Martin and Peter Reiher, “A Taxonomy of DDoS Attacks and DDoS Defense Mechanisms,” ACM SIGCOMM Computer Communication, Vol. 34, no. 2, pp. 39 – 53, April 2004.
[7] E. Bursztein and J. Goubalt-Larrecq, “A logical framework for evaluating network resilience against faults and attacks,” Lecture Notes in Computer Science, Vol. 4846, 2007.
[8] T. Aura, P. Nikander, and J. Leiwo. “DoS-Resistant Authentication with Client Puzzles,” Lecture Notes in Computer Science, vol. 2133, 2001.
[9] Liqun Chen, Paul Morrissey, Nigel P. Smart, and Bogdan Warinschi, “Security notions and generic constructions for client puzzles,” In Mitsuru Matsui, editor, Advances in Cryptology,Proc. ASIACRYPT 2009, LNCS, volume 5912, pp. 505, 2009.
[10] Markus Jakobsson and Ari Juels, “ Proofs of work and bread pudding protocols,” In Bart Preneel, editor, Proceedings of the IFIP TC6/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security, IFIP Conference Proceedings, volume 152, pp. 258, 1999.
[11] Douglas Stebila and Berkant Ustaoglu, “Towards denial-of-service-resilient key agreement protocols,” in Colin Boyd and Juan Nieto, editors, Proc. 14th Australasian Conference on Information Security and Privacy (ACISP) 2009, LNCS, volume 5594, pp. 389, 2009.
[12] Ronald L. Rivest and Adi Shamir, “ Payword and micromint: Two simple micropayment schemes,” in Security Protocols, LNCS, volume 1189, pp. 69, 1997.
[13] Timothy J. McNevin, Jung-Min Park, and Randolph Marchany .”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, October 2004.