International Journal of Electrical and Computer Engineering (IJECE) Vol. 6, No. 4, August 2016, pp. 1785~1791 ISSN: 2088-8708, DOI: 10.11591/ijece.v6i4.9674  1785 Journal homepage: http://iaesjournal.com/online/index.php/IJECE Two Way Mechanism to Enhance Confidentiality and Accuracy of Shared Information Manash Pratim Dutta, Subhasish Banerjee, Swarnendu Kumar Chakraborty, Chandan Tilak Bhunia Department of Computer Science & Engineering, National Institute of Technology, Arunachal Pradesh, India Article Info ABSTRACT Article history: Received Dec 9, 2015 Revised Feb 18, 2016 Accepted Mar 2, 2016 As such internet and information technology have influenced the human life significantly thus the current technology cannot solely assure the security of shared information. Hence, to fulfil such requirements mass amount of research have been undertaken by various researchers among which one of the mechanisms is the use of dynamic key rather than static one. In this regard, we have proposed a method of key generation to provide the dynamic keys. The scheme not only can change the key but also provide the error control mechanism. At the end of this paper, a comparison with the existing techniques has also been made to prove the efficiency of the proposed scheme. Keyword: Dynamic key Error control Randomness Security Copyright © 2016 Institute of Advanced Engineering and Science. All rights reserved. Corresponding Author: Manash Pratim Dutta, Department of Computer Science & Engineering, National Institute of Technology, Arunachal Pradesh, Yupia, India 791110. Email: manashpdutta@gmail.com 1. INTRODUCTION With the rapid development of computer networks and micro electromechanical devices (smart phone, pad etc.), it becomes feasible to access the different services from different service provider servers at anytime and anywhere in the world within a fraction of second. Due to the large number of users, accessing the services at a time, it creates a huge traffic and load overhead in the communication networks. As a result, the chances of noises are growing exponentially. This may occur due to load overhead or interference by the unwanted users. Therefore, to improve the throughput and security of the shared information, mass amount of research in the field of advanced error control [1],[2] and security in shared information have been undertaken by many researchers. In 1981, Lamport [3] proposed first conventional authentication system to verify the legitimacy among the users in which the remote server maintained a password table. However, due to the system overhead, smart cards based authentication schemes [4]-[6] have been widely adopted. In addition, since the number of service provider servers for users are usually more than one, remote user authentication schemes used for multi-server architecture rather than single server circumstance is considered [7],[8]. To improve the security to next higher level, a biometric based recognization has also been incorporated as another parameter of authentication [9],[10]. But, main common factor in all those mechanisms is key must be secured enough. Meanwhile, assuring such necessity is not feasible any more with the same key; does not matter how long it is. Hence, one of the solutions is why not making the keys dynamic in nature those change in every fraction of time. But, to provide such option, either both the parties must have to agree upon a bunch of keys or they must have to share a new key by encrypting with the previous one. However, in first case, the cost of negotiating such bunch of keys and protecting the same will be too high similarly in the other case, if any one of the keys is compromised then the entire rest of the keys