A Puzzle Based Client-Server Authentication Model with Secure Data Transfer
Laxman Dande , Soppari Kavitha , Lt. K.Ravindra Babu , Akash Singh , Kiran Vanam."A Puzzle Based Client-Server Authentication Model with Secure Data Transfer". International Journal of Computer Trends and Technology (IJCTT) V12(5):231-234, June 2014. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.
In the present day scenario, we are seeing that many online applications are attacked by the intruders, and there is no proper solution built for the same. Here in this proposed work we are working on the area which is not only providing security to the data but also it is providing security to the communication link. Communication link here refers to the connection between two computer network bodies i.e. Client and Server. Client is generally a system which is going to request for the data and Server is a machine which takes the request coming in from the client and processes it. Client and Server are two major bodies in the computer networks responsible for network level communication and this information interchange between them is an example of inter-process communication. The language and the rules for communication are defined in a communication protocol and all these protocols operate in the application layer. The main purpose for working on this area is that we wanted to have a secure communication architecture which is being developed with the below architecture. As there are many attackers who mainly concentrate to crash the server, so to overcome this problem we are designing a framework where a puzzle will be shown to the request sender and only after solving that puzzle the client will be able to request anything to the server. In the next level for improving security i.e. for the data transmission in the network we are taking the help of cryptography and ensuring the second level safety for the data which is travelling in the network.
1. M.Naor and A. Shamir, “Visual cryptography,” in Proc. Advances in Cryptography (EUROCRYPT’94), 1995, vol. 950, LNCS, pp. 1–12.
2. R. Ito, H. Kuwakado, and H. Tanaka, “Image size invariant visual cryptography,” IEICE Trans. Fundam. Electron., Commun., Comput. Sci.,vol. 82, pp. 2172–2177, Oct. 1999.
3. C. N. Yang, “New visual secret sharing schemes using probabilistic method,” Pattern Recognit. Lett., vol. 25, pp. 481–494, Mar. 2004.
4. S. J. Lin, S. K. Chen, and J. C. Lin, “Flip visual cryptography (FVC) with perfect security, conditionally-optimal contrast, and no expansion,”J. Vis. Commun. Image Represent., vol. 21, pp. 900–916, Nov.2010.
5. G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, “Visual cryptography for general access structures,” Inf. Computat., vol. 129, no. 2,
6. pp. 86–106, Sep. 1996.
7. F. Liu, C. Wu, and X. Lin, “Step onstruction of visual cryptography schemes,” IEEE Trans. Inf. Forensics Security, vol. 5, no. 1, pp. 27–38, Mar. 2010.
8. Z. Zhou, G. R. Arce, and G. Di Crescenzo, “Halftone visual cryptography,” IEEE Trans. Image Process., vol. 15, no. 8, pp. 2441–2453,Aug. 2006.
communication, client, server, protocol, puzzle, attacker, intruders, cryptography.