Open Access
Subscription Access
Enhanced Software Puzzle with Client Puzzle Technique
Objectives: To reduce time consumption and overhead occurred at client side by creating puzzles at client side in Denial of Service (DOS) and Distributed Denial Of Service (DDOS).
Findings: In puzzle solving technique, first the server generates some puzzles and sends to the client. Then the client solve the puzzle and sendsback to the server and finally the server confirms the client to obtain the service from the server. In such type of puzzle solving technique, the attackers can merely reply to the server and it cannot be identified in this puzzle solving technique. Graphics Processing Unit (GPU)-inflation DoS publishes puzzle function in advance. It can be enhanced or overcome by using software puzzle solving technique as it dynamically generates puzzle function. This technique exploits the architectural difference between CPU and GPU. If an attacker tries to move a puzzle transition task into CPU, either they want to translate into functionally equivalent GPU or it should do at dynamic puzzle generation. It is time consuming process to translate or rewriting a software puzzle. This software puzzle has some drawbacks as it cannot carry out puzzle solving process on cloud environment and it doesn’t construct client side software puzzle.
Methods: In order to overcome time consuming and overhead problem here we proposed a new client puzzle technique which is based on two puzzles between clients.
Applications/Improvements: To reduce the time consumption and overhead problem new client puzzle technique is proposed.
Keywords
- Subramanirao, Sridhar Rao. Denial of service attacks and mitigation techniques: Real time implementation with detailed analysis. This paper is from the SANS Institute Reading Room site. 2011.
- Y. Wu, Z. Zhao, F. Bao, R.H. Deng. Software puzzle: A countermeasure to resource-inflated denial-of-service attacks. IEEE Transactions on Information Forensics and Security. 2015; 10(1), 168-177.
- M. Maghzi, E. Hadizadeh. Dynamic modeling of the water pumping station in water treatment plant using the bond graph method. Indian Journal of Innovations and Developments. 2012; 5(11), 787-794.
- J. Eun, H. Jung. A technique to make a path table for blocking Distributed Denial-of-Service attacks. In: 2015 9th International Conference on Future Generation Communication and Networking (FGCN),IEEE. 2015; 13-16.
- R. Shankesi, O. Fatemieh, C. A. Gunter. Resource inflation threats to denial of service countermeasures. http://seclab.illinois.edu/wp-content/uploads/2011/03/ShankesiFG10.pdf. Date accessed: 2011.
- J. Green, J. Juen, O. Fatemieh, R. Shankesi, Dong (Kevin) Jin, C. A. Gunter. Reconstructing Hash Reversal based Proof of Work Schemes. In LEET. 2011.
- Y.I. Jerschow, M. Mauve. Non-parallelizable and non-interactive client puzzles from modular square ischolar_mains. In: 2011 Sixth International Conference on Availability, Reliability and Security, IEEE. 2011, 135-142.
- S. Suriadi, D. Stebila, A. Clark, H. Liu. Defending web services against denial of service attacks using client puzzles. In: 2011 IEEE International Conference on Web Services (ICWS), IEEE. 2011; 25-32.
- M. Fallah. A puzzle-based defense strategy against flooding attacks using game theory. IEEE Transactions on Dependable and Secure Computing. 2010; 7(1), 5-19.
- J.Y. Koh, J.T.C. Ming, D. Niyato. Rate limiting client puzzle schemes for denial-of-service mitigation. In 2013 IEEE Wireless Communications and Networking Conference (WCNC). 2013, 1848-1853.
- G.O. Karame, S. Čapkun. Low-cost client puzzles based on modular exponentiation. In European Symposium on Research in Computer Security. Springer Berlin Heidelberg. 2010; 679-697.
Abstract Views: 196
PDF Views: 0