Encrypted Key Exchange Protocol Research Articles

“Password Authentication Key Exchange Protocol using Fish Tank Image based True Random Number Generator”

Abstract: We employ a straightforward configuration of a fish tank as the changeable environment, recording its photos over time, in order to limit the computational complexity. To create the initial seed, the image data is then submitted to a reduction method and hash function. In order to get true random numbers, we suggest a method for economically removing the true seed from the image data and applying it to a pseudo-random generator, in this case, a Linear Congruential Generator (LCG). The need for information security is increasing across a range of industries, and security concerns are receiving more and more attention as a result of the Internet's explosive growth in recent years. Any future value cannot be accurately anticipated based on the current set of values and random numbers are those that are a part of a sequence in which values are uniformly distributed over a defined set. A safe session key can be provided to a pair of users interacting over an unstable channel using password-based encrypted key exchange protocols, even if the top secret key or password they share is chosen at random from a tiny set of values. We offer two straightforward Bellovin and Merritt-based encrypted key exchange systems..

An Encrypted key Exchange Protocol to Secure Communication among Fog Nodes and the Cloud

Fog computing is considered as a significantly virtualized perspective that can enable preparing at the Internet of Things devices, living in the edge of the framework, to convey organizations and applications even more capably and feasibly. Since Fog preparing starts from and is a non-minor development of circulated registering, it gets various security and insurance troubles of dispersed processing, causing the expansive stresses in the examination gathering. To engage genuine and confidential exchanges among a social occasion of fog centre points, proposes a capable key exchange show in perspective on figure content approach characteristic based encryption to develop secure correspondences among the individuals. To achieve confidentiality, approval, capriciousness, and access control, to join CP-ABE and mechanized mark techniques. The proposed method explores the efficiency to show similar to security and execution.

Verifier-based Password Authenticated 3P-EKE Protocol using PCLA keys

This paper endeavors to present a novel framework for the generic structure of a verifier-based password authenticated Three-Party Encrypted Key Exchange (3P-EKE) protocol which yields more efficient protocol than the ones knew before. A previous framework presented by Archana and Premchand is more secured against all types of attacks like password guessing, replay, pre-play, man-in-the-middle attack etc. But unfortunately, this protocol does not solve the problem of a server compromise. These proofs help as inspiration to search for another framework. The framework we offer produces more efficient 3P-EKE protocol, and, in addition, delivers perceptive clarification about the existing attacks that do not solve in the previous framework. Moreover, it allows direct change from a class of verge private-key encryption to a hybrid (symmetric & Asymmetric) one without significant overhead.

Design of a Robust, Computation-Efficient and Secure 3P-EKE Protocol using Analogous Message Transmission

In this modern era of digital communication even a trivial task needs to be performed over internet which is not secure. Many cryptographic algorithms existed to provide security which facilitates secure communication through internet. As these algorithms need a secret session key, it is required to interchange this key in a secure way. In two-party communication, two clients initially share a low random (entropy) password through a secure channel to establish a secret session key. But this paradigm necessitates high maintenance of passwords, since each communicating pair requires separate passwords to establish a secure session key. In three-party communication network, each communication party shares a password with the trusted third-party (server) to exchange a secret session key. The beauty of this setting is that, even a server does not know the session key. The Password Authenticated Encrypted Key Exchange (PA-EKE) protocols have attracted a lot of curiosity to authors to propose various two-party and three-party PA-EKE protocols. Security flaws in various protocols proposed by Chang-Chang, Yoon-Yoo, PSRJ and Raj et al. inspired to design a robust, computationally efficient and highly secure protocol. This paper is an attempt to propose a secure and novel Password Authenticated 3P-EKE protocol using XOR operations and analogous (parallel) message transmission. The proposed protocol is easy to design and more secured against all types of attacks like password guessing, replay, pre-play, server spoofing etc. which made this protocol special.

English

Two server secret word-based authentication protocols(Two-Server PAKE), where two servers co- operate to authenticate a client on the basis of secret word only and if one server is compromised due to denial of service attack (DDOS), the attacker still cannot make believe to be the client with information from the compromised server. New research advances in secret word based authentication a n d follow two models. The initial model, called Public key infrastructure suggests, that the client having the server's public key in additional to share a secret word to the server. In this setup, the client has to send the secret word only to the server by public key encryption (PKE). The next model is called secret word- only model which follows encrypted key exchange (EKE) protocols, where the password is used as a secret key to encrypt random numbers for key exchange purpose. A secret word-only authentication protocol which is both convenient and provably secure identify with cryptographic assumption. Our protocol is symmetric and, can run in similar to establish secret session keys between the client and peer servers, respectively. In case any one of the two peer servers shuts down due to the Distributed Denial-of service attack (DDOS), other server can proceed to provide ceremony to valid clients. In case of similar computation and reliable service, a symmetrical protocol is superior to an asymmetrical protocol.

Verifier-based computation-and communication-efficient 3EKE protocols

This paper proposes verifier-based computation-and communication-efficient three-party encrypted key exchange (VBCC3EKE) protocols to minimize the complexity of computational and communicational costs among all users and fit three-party communication environments. Compared with related verifier-based 3EKE protocols, the proposed VBCC3EKE protocols have enhanced computational and communicational efficiency. As a result, the proposed VBCC3EKE protocols are most suitable for use in various applications over distributed three-party network environments such as the Internet and mobile e-commerce.

비대칭 무선랜 환경을 위한 안전한 패스워드 인증 키 교환 프로토콜

사용자 인증과 비밀키 교환은 암호학의 매우 중요한 응용 분야 가운데 하나로서, 사용자 인증의 경우 일반적으로 패스워드를 이용하고 있지만, 패스워드를 이용한 사용자 인증은 패스워드 추측 공격에 취약한 문제가 있다. 1992년 Bellovin과 Merritt은 패스워드 추측 공격에 안전하면서 비밀키 교환까지 할 수 있는 EKE(Encrypted Key Exchange) 프로토콜을 제안한 바 있으며, 이후 효율성과 안전성을 개선한 많은 논문이 제안되고 있다. 이 가운데 Lo는 Yeh 등이 제안한 패스워드 기반 인증키 교환 프로토콜의 취약점을 지적함과 동시에 개선된 프로토콜을 2006년에 제안하였다. 하지만, Lo의 프로토콜 역시 오프라인 패스워드 추측 공격에 취약함이 Cao와 Lin에 의해 지적되었다. 본 논문에서는 새로운 공격 방법으로 Lo의 프로토콜이 온라인 패스워드 추측공격에도 취약함을 보이고, 온라인 패스워드 추측 공격에도 안전한 개선된 프로토콜을 제안한다. 제안한 프로토콜은 비대칭 무선 네트워크 환경에서 패스워드 기반 인증키 교환 프로토콜로 사용될 수 있다. User authentication and key exchange protocols are the most important cryptographic applications. For user authentication, most protocols are based on the users' secret passwords. However, protocols based on the users' secret passwords are vulnerable to the password guessing attack. In 1992, Bellovin and Merritt proposed an EKE(Encrypted Key Exchange) protocol for user authentication and key exchage that is secure against password guessing attack. After that, many enhanced and secure EKE protocols are proposed so far. In 2006, Lo pointed out that Yeh et al.'s password-based authenticated key exchange protocol has a security weakness and proposed an improved protocol. However, Cao and Lin showed that his protocol is also vulnerable to off-line password guessing attack. In this paper, we show his protocol is vulnerable to on-line password guessing attack using new attack method, and propose an improvement of password authenticated key exchange protocol for imbalanced wireless networks secure against password guessing attack.

IMPROVING TWO NOVEL THREE-PARTY ENCRYPTED KEY EXCHANGE PROTOCOLS WITH PERFECT FORWARD SECRECY

It is a crucial that password security be effective and constantly improved. The three-party encrypted key exchange (3PEKE) protocol has been used to protect passwords transmitted between users. Recently, Chang and Chang proposed a novel 3PEKE (ECC-3PEKE) protocol using a super-poly-to-one trapdoor function which demonstrates high efficiency. However, Chen et al. and Yoon et al., respectively, showed that the ECC-3PEKE protocol can not prevent undetectable on-line password guessing attacks and proposed improved protocols. Unfortunately, their improved protocols suffer from off-line password guessing attacks without perfect forward secrecy. Hence, the authors propose an improved protocol to strengthen their security.

Provable Password-Authenticated Key Exchange Protocol against Imposter Attack on Ad Hoc Networks

In wireless ad hoc networks environment, Bellovin and Merritt first developed a password-based Encrypted Key Exchange (EKE) protocol against offline dictionary attacks using both symmetric and public-key cryptography independent of the public key infrastructure (PKI). In this paper, we first discover that there exist some weaknesses in EKE protocol that is subjected to imposter attacks based on the analysis result of BAN logic that we apply in EKE protocol. In order to remedy the flaws, we propose an improved scheme—Provable Password-Authenticated Key Exchange (PPAKE) protocol that generates the session key’s timestamp, and verifies the authenticity of public key against imposter attack without online trusted third parties. The proposed protocol is also proven to be secure and trustworthy by BAN logic analysis. In comparison with other schemes, our measurements show that our proposed PPAKE protocol is more safety and requires less computations cost suitable for wireless ad hoc networks.

An Improvement on A Three-Party Authentication Key Exchange Protocol Using Elliptic Curve Cryptography

The authentication key exchange protocol enables communication participants to authenticate each other and agree on the session key over an insecure public network. Recently, a three-party authentication key exchange protocol based on Elliptic curve cryptograph is proposed. In this paper, we improve the three-party encrypted key exchange protocol by bilinear maps. The proposed threeparty authentication key exchange protocol is provable secure under Computational Diffie-Hellman assumptions in the standard model. Furthermore, the novel protocol is more efficient.

A Note on an Enhanced Three-Party Authentication Key Exchange Protocol

Recently, Chen et al. proposed an efficient three-party encrypted key exchange protocol based upon Schnorr’s digital signature scheme with fewer rounds. However, J.H. Yang and C. C. Chang showed that Chen et al.’s protocol still has the high computation cost and communication cost. Moreover, Chen et al.’s protocol suffers from stolen-verifier attacks. Then J.H. Yang and C. C. Chang proposed a three-party authenticated key exchange protocol without password by using elliptic curve cryptography. Their improved protocol requires smaller transmitted message size and less communication times, which is well suitable for resource-limited environments such as mobile communication and mobile commerce. Unfortunately, we find that Yang et al.’s protocol is vulnerable to replay attacks, denial-of-Service attacks and impersonation attacks.

An Enhanced Three-Party Authentication Key Exchange Protocol for Mobile Commerce Environments

Recently, Yang et al. proposed a three-party encrypted key exchange protocol (3PAKE) which is based on Elliptic curve cryptography. Their 3PAKE protocol is efficient because it requires less computation cost and less communication cost, which is well suitable for mobile commerce environments. However, Yang et al.’s 3PAKE protocol is susceptible to parallel attacks and impersonation attacks. We presented an enhancement to resolve such security problems. Detailed analyses show that our proposed protocol is a secure 3PAKE protocol and more efficient.

Communication-efficient three-party protocols for authentication and key agreement

Encrypted key exchange (EKE) authentication approaches are very important for secure communicating over public networks. In order to solve the security weaknesses three-party EKE, Yeh et al. [H.T. Yeh, H.M. Sun, T. Hwang, Efficient three-party authentication and key agreement protocols resistant to password guessing attacks, Information Science and Engineering 19 (6) (2003) 1059–1070.] proposed two secure and efficient three-party EKE protocols. Based on the protocol developed by Yeh et al., two improved EKE protocols for authentication and key agreement are proposed in this study. The computational costs of the proposed protocols are the same as those of the protocols of Yeh et al. However, the numbers of messages in the communication are fewer than those of the protocols of Yeh et al. Furthermore, the round efficient versions of our proposed protocols are also described.

Cryptanalysis of two three-party encrypted key exchange protocols

Due to the simplicity of maintaining human memorable passwords without any assistant storage device, password-based three-party encrypted key exchange (3PEKE) protocol has become one of the most promising research fields on user authentication and secure communication. In 2008, Chen et al. and Yoon and Yoo both pointed that Chang and Chang's password-based 3PEKE scheme cannot resist against undetectable on-line password guessing attacks, and then respectively proposed an improved protocol to eliminate the security vulnerability. However, based on the security analyses conducted by us, we find that both of their protocols are still vulnerable against undetectable on-line password guessing attacks. Accordingly, we develop a novel 3PEKE protocol to remedy these authentication flaws. Moreover, our proposed protocol can achieve better performance efficiency by requiring only four message transmission rounds. In conclusion, we can claim that our proposed 3PEKE protocol is more secure and efficient in comparison with the protocols proposed by Chen et al. and Yoon and Yoo.

Improving the novel three-party encrypted key exchange protocol

In 2004, Chang and Chang proposed a three-party encrypted key exchange (ECC-3PEKE) protocol without using the server's public keys. They claimed that their proposed ECC-3PEKE protocol is secure, efficient, and practical. Unlike their claims, the ECC-3PEKE protocol, however, is still susceptible to undetectable on-line password guessing attacks. Accordingly, the current paper demonstrates the vulnerability of Chang–Chang's ECC-3PEKE protocol regarding undetectable on-line password guessing attacks and than presents an enhancement to resolve such security problems.

Security enhancement for a three-party encrypted key exchange protocol against undetectable on-line password guessing attacks

In 1995, a potential attack, called undetectable on-line password guessing attack, on three-party encrypted key exchange (3PEKE) protocol is highlighted by Ding and Horster. Since then, this attack has been one of the main concerns for developing a secure 3 PEKE protocol. Recently, Chang and Chang proposed a password-based three-party encrypted key exchange protocol that simultaneously possesses round and computation efficiencies. However, this paper shows that their protocol is potentially vulnerable toward undetectable on-line password guessing attacks. As their protocol is currently one of the most superior of all 3PEKE approaches; it seems worthwhile and valuable to remedy this potential security problem.

Practical encrypted key agreement using passwords

We presented a simple and efficient password-based encrypted key exchange protocol that allows a user to establish secure session keys with remote servers from client terminals in low resource environments. He does not need to carry smart card storing his private information but just needs to know his identity and password. For this purpose, the scheme was implemented over elliptic curves because of their well-known advantages with regard to processing and size constraints. Furthermore, the scheme is provably secure under the assumptions that the hash function closely behaves like a random oracle and that the elliptic curve computational Diffie-Hellman problem is difficult.

Password-authenticated Key Exchange using Efficient MACs

This paper is concerned with password authenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way of choosing a password that achieves an optimum trade-off between usability and security. Indeed, passwords belonging to a highly structured language are essentially equivalent to low entropy strings. A fundamental goal is that of obtaining secure and efficient protocols, with optimum computational complexity, round complexity and communication efficiency. These properties make them ideal candidates for mobile devices. We present DH-BPAKE1 which is an improved version of the protocol presented in previous work (DH-BPAKE). The construction builds upon the encrypted key exchange protocol of Bellovin and Merritt augmented with a key confirmation round based on the use of efficient message authentication codes. We discuss in detail the security properties of the two efficient message authentication schemes which form the basic building blocks of the protocol. In addition, we formally prove the security of protocol DH-BPAKE1 in a modified version of the model of Boyko et al.

Enhanced three-party encrypted key exchange without server public keys

This investigation proposes a secure and efficient three-party encrypted key exchange (3PEKE) protocol based on the LSSH-3PEKE protocol proposed by Lin et al. [Lin, C.-L., Sun, H.-M., Steiner, M., Hwang, T., 2001. IEEE Commun. Lett. 5 (12), 497–499]. The computational cost of the proposed protocol is equal to that of the LSSH-3PEKE protocol. However, the number of steps in communication is one fewer. A round efficient version of the same protocol is also described.

A novel three-party encrypted key exchange protocol

The passwords people can remember are usually simple or meaningful. In three-party key exchange protocols with password authentication, clients are allowed to share an easy-to-remember password with a trusted server such that two clients can communicate with each other through a common secret key without the existence of redundant keys. Such protocols are quite suitable for application when light-weight clients need secure communications. Steiner, Tsudik, and Waidner proposed a three-party protocol based on the encrypted key exchange (EKE) protocols in 1995; however, the proposed protocol suffered from off-line and undetectable on-line guessing attacks. In 2000, Lin, Sun, and Hwang proposed a secure three-party protocol with server's public keys. Because certificates are needed to verify the server's public keys to avoid impersonation attacks, this protocol is not practical for some environments. In 2001, Lin, Sun, Steiner and Hwang proposed a brand-new three-party protocol without servers' public keys. Nevertheless, more rounds are needed by using this protocol. In this paper, we propose a secure three-party EKE protocol with round efficiency.