Search

OTP (One Time Passwords) are very important in today’s scenario in various applications like in financial transactions, e-commerce etc. They are used for enhancing the security of data comm...

We know that the importance, need and utility of EHR (Electronic Health Record) system is increasing rapidly in the modern world. The developed countries like USA, Canada has adopted this s...

Secure data communication is the need of hour today specifically when the wireless communication channel is insecure. We are proposing a protocol which can be customized in variety of situations. We want to use steganography as a complementary tool for cryptography. The protocol utilizes the nature of communication protocol and it is even useful for places where data hiding and cryptography is illegal or can’t be performed because of various reasons. We are giving a name to these kinds of networks as disturbed networks. The proposed peer to peer protocol is very useful for insecure channels and disturbed networks and we provide complete analysis to validate its utility. The method is a convenient stop and wait protocol which provides unbeatable security and suitable for mobile phones as well. At the same time, for intruder’s perspective, there is no encryption involved which is a very important aspect.

As everyone is aware that security of data communication is essential in modern scenario. There is a continuous fight between cryptographers and cryptanalysists. Cryptographers want to develop new methods and protocols to safeguard the valuable information but on the other side, cryptanalysists find various methods to extract the information. So a new sequential coding based method for securing data communication is proposed here. The proposed method requires an encryption key along with other ingredients and it can be implementable very easily in various situations. The security analysis is also provided to prove the validity. The claim is that the proposed method also satisfies Kerchoff's law of secrecy. We want to keep the method simple enough so that it can be used on mobile phones as well.

All of us know that one time passwords (OTPs) are a part of life in today’s scenario. We have to use them for authentication in many applications such as financial transactions, e-commerce websites, and in various government and nongovernment websites, etc. The strength of any OTP is uniqueness and it must not be predictable in any case. The method of OTP generation should be simple but safe enough to avoid any vulnerability. So a simple and unique OTP generation mechanism using RSA (Rivest, Shamir, Adleman) based string is presented in this paper with complete randomness analysis which also solves the associated problem of Syndicate bank’s token based OTP procedure.

Now a day's electronic health record (EHR) systems are in vogue. Many big countries like Australia and China are implementing new secure ways to store patient's data. This data can be analyzed in variety of purposes. It is very important to mention that this data or the access to this data has to be secured. If an intruder has unauthorized access to this data then the entire system is in trouble. In this paper, we present an innovative and secure method to store patient health record (when the patient is in medical observation) which is useful in emergency situations as well.

All of us know that authentication and key agreement are the two cryptographic services very important for data communication. People use online methods for information exchange using various wireless communication channels. Intruders want to steal sensitive useful information and they use different cryptanalysis ways for that. Quantum computing methods also produces danger for all the existing protocols and algorithms. So at this point of time, it is essential that researchers find new and innovative protocols for data communication in order to surprise intruders. In this paper we present three party key sharing protocol and its correctness involving polynomial rings.

Entity authentication and key distribution are very important cryptographic problems in mobile communication or in adhoc networks or in wireless communication at large. Mutual entity authentication is seen as the necessary process to the establishment of a secure and authentic connection. For a reliable secure communication, mutual entity authentication is very often seen as the necessity to the establishment of a secure connection. Authentication is necessary in wireless communication such as GSM or for Ad-Hoc purposes [26].Here Latin word ad-hoc means for the specific purpose only. Authentication is also necessary in situations where we need more than two entities in the authentication exchange such as a mobile user, a local AAA (Authentication, Authorization and Accounting) server and a remote (home) AAA server [8,21]. In such situations it is essential to include authentic and secure key exchange mechanism that ensures enhancement of trust in communication. This paper provides an authenticated zero knowledge protocol which is very helpful in establishing secure wireless communication in ad-hoc networks by satisfying cryptographic goals such as authentication, data integrity etc [13].

Diffie and Hellman in their path breaking paper (5) proposed a two party key agreement protocol based on finite field. Diffie - Hellman Key Exchange Protocol (DH protocol) has unique importance in two party wireless communication scenarios. After this protocol several protocols have been proposed which were based on DH protocol but the Man in the middle attack raises a serious security concern on this protocol. Researchers have been working to overcome this security concern to design a new protocol. This paper proposes an authenticated key agreement protocol which is secure against Man in the middle attack. The authors also prove security issues of this protocol.

Signcryption is comparatively new approach in public key cryptography. Signcryption has the virtue to provide the services of digital signature and public key encryption in a single step. So when we compare it in terms of cost and ease of use, signcryption is better than “signature then encryption” (or encryption then signature) approach. So signcryption protocols are obvious choice for WTLS where authentication along with savings of computational overheads is always desired. In this paper we present a signcryption protocol for WTLS using bit commitment scheme with its security analysis.

Identification protocols have an important role for building secure communications amongst two or more entities over the internet. In this paper we introduce a new identification scheme (or money transaction protocol) based on the elliptic curve Diffie - Hellman problem. We show that our protocol meets the security attributes under the assumption that the elliptic curve discrete logarithm problem is secure.