Session Key Generation Research Articles

NFC Secure Payment and Verification Scheme with CS E-Ticket

As one of the most important techniques in IoT, NFC (Near Field Communication) is more interesting than ever. NFC is a short-range, high-frequency communication technology well suited for electronic tickets, micropayment, and access control function, which is widely used in the financial industry, traffic transport, road ban control, and other fields. However, NFC is becoming increasingly popular in the relevant field, but its secure problems, such as man-in-the-middle-attack and brute force attack, have hindered its further development. To address the security problems and specific application scenarios, we propose a NFC mobile electronic ticket secure payment and verification scheme in the paper. The proposed scheme uses a CS E-Ticket and offline session key generation and distribution technology to prevent major attacks and increase the security of NFC. As a result, the proposed scheme can not only be a good alternative to mobile e-ticket system but also be used in many NFC fields. Furthermore, compared with other existing schemes, the proposed scheme provides a higher security.

A lightweight multi-layer authentication protocol for wireless body area networks

Nowadays, the technology of Internet of Things (IoT) is getting more and more important which brings a lot of convenience to people’s life and city’s development. As a key application of IoT, wireless body area networks (WBANs) provides people high quality of life and high level of medical service. However, due to the sensitiveness of medical system, security and privacy issues in WBANs are very important. In previous research, there are no comprehensive authentication protocols designed for WBANs according to its characteristics of network structure. In this paper, we propose an efficient multilayer authentication protocol and a secure session key generation method for WBANs. Firstly, we design a one-to-many group authentication protocol and a group key establishment algorithm between personal digital assistance (PDA) and each of sensor nodes with energy efficiency and low computational cost. Then, we present a new certificateless authentication protocol with no pairings based on certificateless cryptography between PDA and application provider (AP), using ECC algorithm that provides low computational cost with high security. In addition, the validation of the proposed protocol can be proved. Finally, the security and performance analysis shows that our protocol is secure and efficient.

User Revocation Mechanism for Service Oriented Wireless Adhoc Networks

Adhoc network is basically infrastructure less in nature and it is vulnerable to attacks. In such a network it is necessary to create the security autonomously without the involvement of centralized architecture. Address allocation, name resolution, services rendering, authentication and access control policies represent some of the functionalities that are supported by the Adhoc Networks. To solve the above issue, a novel security protocol is proposed for the Passionate network formation. Initial network formation done based on trust. For each newly added user authorization is performed using certificate generation. Authentication is carried out using certificate verification mechanism. Session key is used by all the nodes in the network, for the defended communication. Symmetric key encryption is used for data encryption. Asymmetric cryptography is used for session key encryption and signature generation. Session key updating is carried out based on expiration time. To revoke the attacker from participating in the network, User revocation mechanism is contributed to the proposed security protocol. Security is enhanced with revocation capabilities.

A lightweight message authentication scheme for Smart Grid communications in power sector

The Internet of Things (IoT) has plenty of applications including Smart Grid (SG). IoT enables smooth and efficient utilization of SG. It is assumed as the prevalent illustration of IoT at the moment. IP-based communication technologies are used for setting SG communication network, but they are challenged by huge volume of delay sensitive data and control information between consumers and utility providers. It is also challenged by numerous security attacks due to resource constraints in smart meters. Sundry schemes proposed for addressing these problems are inappropriate due to high communication, computation overhead and latency. In this paper, we propose a hybrid Diffie–Hellman based lightweight authentication scheme using AES and RSA for session key generation. To ensure message integrity, the advantages of hash based message authentication code are exploited. The scheme provides mutual authentication, thwarting replay and man-in-the-middle attacks and achieves message integrity, while reducing overall communication and computation overheads.

Mutual Authentication Scheme in Secure Internet of Things Technology for Comfortable Lifestyle.

The Internet of Things (IoT), which can be regarded as an enhanced version of machine-to-machine communication technology, was proposed to realize intelligent thing-to-thing communications by utilizing the Internet connectivity. In the IoT, “things” are generally heterogeneous and resource constrained. In addition, such things are connected to each other over low-power and lossy networks. In this paper, we propose an inter-device authentication and session-key distribution system for devices with only encryption modules. In the proposed system, unlike existing sensor-network environments where the key distribution center distributes the key, each sensor node is involved with the generation of session keys. In addition, in the proposed scheme, the performance is improved so that the authenticated device can calculate the session key in advance. The proposed mutual authentication and session-key distribution system can withstand replay attacks, man-in-the-middle attacks, and wiretapped secret-key attacks.

A Robust Authentication Scheme for Telecare Medicine Information Systems

Telecare Medicine Information System (TMIS) has established a connection between patients at home and doctors at a clinical center by using telecommunication systems and physiological monitoring devices. Authentication, security, patient's privacy protection and data confidentiality are important for patient or doctors accessing to Electronic Medical Records (EMR). Remote user authentication is desirable for TMIS to verify the correctness of communicating parties. The password based authentication schemes provide efficient and scalable solutions for remote user authentication. In this context, numerous schemes have been proposed to achieve these goals. However, these schemes are vulnerable to various attacks. Moreover, they are neither efficient nor user friendly. Specially, some schemes require the exponential computation or public key cryptography which leads to very low efficiency for smart card. This paper shows that recently proposed Zhian Zhu's scheme is incorrect. Moreover, it has insecure change of password, and no early wrong password detection and session key generation. To remedy, robust authentication scheme for TMIS has been proposed using one way hash function. KeywordsHash function, Password, Smart card, TMIS.

Analysis of Multimodal Biometric Fusion Based Authentication Techniques for Network Security

Multibiometrics is the usage of more than one physiological or behavioral characteristic to identify an individual. Multibiometrics is advantageous over unibiometrics as it is resilience to spoofing and has low False Acceptance Rate (FAR). However Multibiometrics requires storage of multiple biometric templates for each user, which results in increased risk to user privacy and system security. This paper will discuss the concept off biometrics and biometric system, multimodal biometric fusion techniques, crypto-biometrics and an algorithm for session key generation for secure communication of data.

Securing Online Bank Transactions from Phishing Attacks using MFA and Secure Session Key

Phishing is an online criminal activity using the collection of social engineering methods such as messages and emails to make the users to disclose their sensitive information such as personal details, username /password4 , etc. Since 2007 Net-Banking transactions are the target of the phishers. The strong techniques are required to avoid phishing attacks. In our paper, we proposed Multi Factor Authentication (MFA) and secure session key generation using Gaussian distribution to reduce the attacks caused by the phishers. Multi Factor Authentication technique authenticates the users using user’s signature image recognition8 and secret question answer. After successful authentication of user using Multi Factor Authentication technique, session key generated using Gaussian distribution is sent to user’s mobile phone. User proceeds with the transaction only after entering the session key received1 . By incorporating above mentioned techniques users can perform online transactions safely and securely. Keywords: Gaussian Distribution, Multi Factor Authentication, Phishing, Session Key, Social Engineering

상용 비디오 콘텐츠 보호를 위한 일회용 바이오메트릭 키 생성 및 인증 모델

Most peoples are used to prefer to view the video contents rather than the other contents since the video contents are more easy to understand with both their eyes and ears. As the wide spread use of smartphones, the demands for the contents services are increasing rapidly. To promote the contents business, it`s important to provide security of subscriber authentication and corresponding communication channels through which the contents are delivered. Generally, symmetric key encryption scheme is used to protect the contents in the channel, and the session key should be upadated periodically for the security reasons. In addition, to protect viewing paid contents by illegal users, the proxy authentication should not be allowed. In this paper, we propose biometric based user authentication and one time key generation models. The proposed model is consist of biometric template registration, session key generation and chanel encryption steps. We analyze the difference and benefits of our model with existing CAS models which are made for CATV contents protection, and also provides applications of our model in electronic commerce area.

Intelligent Soft Computing Based Cryptographic Technique Using Chaos Synchronization for Wireless Communication (CSCT)

In this paper a novel intelligent soft computing based cryptographic technique based on synchronization of two chaotic systems (CSCT) between sender and receiver has been proposed to generate session key using Pecora and Caroll (PC) method. Chaotic system has some unique features like sensitive to initial conditions, topologically mixing; and dense periodic orbits. By nature, the Lorenz system is very sensitive to initial conditions meaning that the error between attacker and receiver is going to grow exponentially if there is a very slight difference between their initial conditions. All these features make chaotic system as good alternatives for session key generation. In the proposed CSCT few parameters ( �, b , r , x1 ,y 2 and z 2 ) are being exchanged between sender and receiver. Some of the parameter which takes major roles to form the session key does not get transmitted via public channel, sender keeps these parameters secret. This way of handling parameter passing mechanism prevents any kind of attacks during exchange of parameters like sniffing, spoofing or phishing.

Privacy-Preserving Mobile Roaming Authentication with Security Proof in Global Mobility Networks

Mobile roaming authentication scheme achieves the mutual authentication and session key establishment between the mobile user and the foreign agent. In 2013, Xie et al. pointed out that Chen et al.'s scheme is vulnerable to offline password attack, and does not achieve fair session key generation, user untraceability, user friendliness, and perfect forward secrecy, and then they proposed an improved scheme. In this paper, we propose an improvement of Xie et al.'s scheme, since the foreign agent may confuse the mobile users when multiple mobile users simultaneously access the foreign agent in Xie et al.'s scheme. Further, we prove the formal security of the proposed scheme, and present the performance comparison between our scheme and some related schemes. The proposed scheme is more efficient and secure than other related schemes and is suitable for using in the global mobility network.

모바일 환경에서 안전한 일회용 패스워드 인증

Abstract With the active Internet e-commerce and the financial sector, mutual authentication between users and service providers has become very important. Because ID- and password-based authentication is of low security, one-time password authentication methods are widely used. The existing one-time password authentication scheme of S/Key authentication method is fraught with a number of issues in addition to plain text transmission, and the method of Kim Gong-ki et al. does not offer suggestions for session key generation and distribution method. Proposed in this paper is a protocol that solves these problems. Key Words : One Time Password, Authentication, Security, Smart Phone, Hash Function Received 1 December 2013, Revised 20 December 2013Accepted 20 December 2013Corresponding Author: Dong-Ryool Kim(Tongmyong University)Email: drkim@tu.ac.krⒸ The Society of Digital Policy & Management. All rights reserved. This is an open-access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.otg/licenses/by-nc/3.0), which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is ISSN: 1738-1916 properly cited.

Dynamic Encryption Key based Smart Card Authentication Scheme

In order to keep away from difficulties associated with traditional password based authentication methods, smart card based authentication schemes have been widely used. It has already been accepted worldwide due to its low computational cost. However, most of these schemes are vulnerable to one or the other possible attack. This paper describes a new smart card authentication scheme using symmetric key cryptography, which covers all the identified security pitfalls and satisfies the needs of a user. Its security is based on encrypting the contents of all the communicating messages exchanged between remote user and the server. Moreover, it provides users to choose and change their passwords freely, mutual authentication and session key generation. In addition, it uses nonce instead of timestamp to resist replay attack. Security analysis proves that this scheme is secure against impersonation attack, password guessing attack, replay attack, reflection attack, parallel session attack, insider attack, attack on perfect forward secrecy, stolen verifier attack, smart card loss attack and man-in-the-middle attack. The proposed scheme can be easily extended to Internet protocol television broadcasting, Multi-server authentication, Wireless communication and Healthcare, where the user needs to access data from server.

Secure Session Key Generation Technique for Group Communication

 Abstract—In order to provide confidentiality in group communication, data is encrypted using a session key. Group key generation, session key generation and their distribution are the most important issues in multicast. This paper presents a secure session key distribution technique for group communication. In this framework, any member in the group can generate and distribute the session key to all the group members securely.

Cluster-based secure communication mechanism in wireless ad hoc networks

In a multi-agent system, there are many intelligent agents distributed in the network. To connect with these agents easily and arbitrarily, wireless ad hoc network is a candidate. Wireless ad hoc network is a distinct network environment with characteristics in self-organisation, dynamical network topologies and easy construction. To provide such networks with secure communication, many researchers tried different ways to create the session key(s). However, there are some drawbacks in session key generation procedure, and the robust session key could not be created. The authors propose a cluster-based secure communication mechanism in wireless ad hoc networks. The proposal applies the Diffie–Hellman key exchange protocol for the session key creation. It helps the clusterhead to reduce the communication overload, to avoid the time synchronisation problem in nodes authentication and to preserve the complete secrecy requirements.

An Enhanced Remote User Authentication Scheme with Smart Card

In 2000, Hwang and Li's proposed a new remote user authentication scheme with smart cards. Some researchers pointed out the security weaknesses of Hwang and Li's scheme and they also proposed some modified schemes to avoid these weaknesses. In 2004, Kumar proposed a new remote user authentication scheme and try to solve the security problems of Hwang and Li's scheme. This paper analyzes that Kumar's scheme does not satisfy some essential security requirements. Kumar's scheme does not support mutual authentication, session key generation phase for secure communication. In addition, in Kumar's scheme, the remote user is not free to change his password. This paper present an enhanced remote user authentication scheme with smart card that not only resolves all the security problems of Hwang and Li's scheme, but also adds mutual authentication, session key generation and password change phase to Kumar's scheme and provides forward secrecy to the long term secret key of the remote server. In the proposed scheme, first the server and user authenticate one another and then generate a secret session key for secure communication. In our scheme, the remote user is free to change his/her password without connecting to server.

RSA-Based Password-Authenticated Key Exchange, Revisited

The RSA-based Password-Authenticated Key Exchange (PAKE) protocols have been proposed to realize both mutual authentication and generation of secure session keys where a client is sharing his/her password only with a server and the latter should generate its RSA public/private key pair (e, n), (d, n) every time due to the lack of PKI (Public-Key Infrastructures). One of the ways to avoid a special kind of off-line (so called e-residue) attacks in the RSA-based PAKE protocols is to deploy a challenge/response method by which a client verifies the relative primality of e and φ(n) interactively with a server. However, this kind of RSA-based PAKE protocols did not give any proof of the underlying challenge/response method and therefore could not specify the exact complexity of their protocols since there exists another security parameter, needed in the challenge/response method. In this paper, we first present an RSA-based PAKE (RSA-PAKE) protocol that can deploy two different challenge/response methods (denoted by Challenge/Response Method1 and Challenge/Response Method2). The main contributions of this work include: (1) Based on the number theory, we prove that the Challenge/Response Method1 and the Challenge/Response Method2 are secure against e-residue attacks for any odd prime e; (2) With the security parameter for the on-line attacks, we show that the RSA-PAKE protocol is provably secure in the random oracle model where all of the off-line attacks are not more efficient than on-line dictionary attacks; and (3) By considering the Hamming weight of e and its complexity in the RSA-PAKE protocol, we search for primes to be recommended for a practical use. We also compare the RSA-PAKE protocol with the previous ones mainly in terms of computation and communication complexities.

An efficient session key generation for NTDR networks based on bilinear paring

Near-term digital radio (NTDR) network is a kind of MANET in which mobile nodes are assigned into different clusters. Therefore, it can let the nodes to communicate with each other efficiently in a large area. Despite several NTDR protocols have been proposed, there still lacks an efficient secure one. Accordingly, in this paper, we propose a new method based on ID-based bilinear pairings to overcome the unsolved security problems nowadays. After our analysis, we conclude that our scheme is the first protocol for NTDR network that is not only secure but also very efficient.

An Efficient and Leakage-Resilient RSA-Based Authenticated Key Exchange Protocol with Tight Security Reduction

Both mutual authentication and generation of session keys can be accomplished by an authenticated key exchange (AKE) protocol. Let us consider the following situation: (1) a client, who communicates with many different servers, remembers only one password and has insecure devices (e.g., mobile phones or PDAs) with very-restricted computing power and built-in memory capacity; (2) the counterpart servers have enormous computing power, but they are not perfectly secure against various attacks (e.g., virus or hackers); (3) neither PKI (Public Key Infrastructures) nor TRM (Tamper-Resistant Modules) is available. The main goal of this paper is to provide security against the leakage of stored secrets as well as to attain high efficiency on client's side. For those, we propose an efficient and leakage-resilient RSA-based AKE (RSA-AKE) protocol suitable for the above situation whose authenticity is based on password and another secret. In the extended model where an adversary is given access to the stored secret of client, we prove that its security of the RSA-AKE protocol is reduced tightly to the RSA one-wayness in the random oracle model. We also show that the RSA-AKE protocol guarantees several security properties (e.g., security of password, multiple sever scenario with only one password, perfect forward secrecy and anonymity). To our best knowledge, the RSA-AKE protocol is the most efficient, in terms of both computation costs of client and communication costs, over the previous AKE protocols of their kind (using password and RSA).

Session-Key Generation Using Human Passwords Only

We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password, and there is no additional set-up assumption in the network. Our protocol is proven secure under the assumption that enhanced trapdoor permutations exist. The security guarantee holds with respect to probabilistic polynomial-time adversaries that control the communication channel (between the parties), and may omit, insert, and modify messages at their choice. Loosely speaking, the effect of such an adversary that attacks an execution of our protocol is comparable with an attack in which an adversary is only allowed to make a constant number of queries of the form "is w the password of Party A." We stress that the result holds also in case the passwords are selected at random from a small dictionary so that it is feasible (for the adversary) to scan the entire directory. We note that prior to our result, it was not known whether or not such protocols were attainable without the use of random oracles or additional set-up assumptions.