Password-based remote user authentication schemes are widely investigated, with recent research increasingly combining a user's biometrics with a password to design a remote user authentication scheme that enhances the level of the security However, these authentication schemes are designed for a single server environment and result in users needing to register many times when they want to access different application servers To solve this problem, in this paper we propose an anonymous multi-server authenticating key agreement scheme based on trust computing using smart cards, password, and biometrics Our scheme not only supports multi-server environments but also achieves many security requirements In addition, our scheme is a lightweight authentication scheme which only uses the nonce and a hash function From the subsequent analysis, the proposed scheme can be seen to resist several kinds of attacks, and to have more security properties than other comparable schemes

An anonymous multi-server authenticated key agreement scheme based on trust computing using smart cards and biometrics

Smart-card-based remote user password authentication schemes are commonly used for providing authorized users a secure method for remotely accessing resources over insecure networks. In 2009, Xu etal. proposed a smart-card-based password authentication scheme. They claimed their scheme can withstand attacks when the information stored on the smart card is disclosed. Recently, Sood etal. and Song discovered that the smart-card-based password authentication scheme of Xu etal. is vulnerable to impersonation and internal attacks. They then proposed their respective improved schemes. However, we found that there are still flaws in their schemes: the scheme of Sood etal. does not achieve mutual authentication and the secret key in the login phase of Song's scheme is permanent and thus vulnerable to stolen-smart-card and off-line guessing attacks. In this paper, we will propose an improved and efficient smart-card-based password authentication and key agreement scheme. According to our analysis, the proposed scheme not only maintains the original secret requirement but also achieves mutual authentication and withstands the stolen-smart-card attack. Copyright © 2012 John Wiley & Sons, Ltd.

Robust smart-card-based remote user password authenticationscheme

From the perspective of information theory and cryptography, we analyze the security of two quantum dialogue protocols and a bidirectional quantum secure direct communication (QSDC) protocol, and point out that the transmitted information would be partly leaked out in them. That is, any eavesdropper can elicit some information about the secrets from the public annunciations of the legal users. This phenomenon should have been strictly forbidden in a quantum secure communication. In fact, this problem exists in quite a few recent proposals and, therefore, it deserves more research attention in the following related study.

Revisiting the security of quantum dialogue and bidirectional quantum secure direct communication

In this paper, we propose a scheme utilizing three-party password-based authenticated key exchange protocol with user anonymity using extended chaotic maps, which is more efficient and secure than previously proposed schemes. In order to enhance the efficiency and security, we use the extended chaotic maps to encrypt and decrypt the information transmitted by the user or the server. In addition, the proposed protocol provides user anonymity to guarantee the identity of users, which is transmitted in the insecure public network.

A three-party password-based authenticated key exchange protocol with user anonymity using extended chaotic maps

Recently, Yoon et al. and Wang et al. independently proposed a dynamic ID authentication scheme and claimed that their schemes can withstand the risk of ID-theft, and several attacks. In this paper, we first demonstrate that both of the proposed schemes cannot achieve the security requirement for user anonymity and resist an impersonation attack yet. Then, we shall propose a new dynamic ID authentication scheme to overcome the above security weaknesses. We formally analyzed our proposed scheme with the BAN-logic and shown that it can withstand the several possible attacks. Copyright © 2010 John Wiley & Sons, Ltd.

New dynamic ID authentication scheme using smart cards

In 2009, Huang (Int. J. Commun. Syst., 22, 857–862) proposed a simple and efficient three-party password-based key exchange protocol without server's public key. This work shows that the protocol could be vulnerable to an undetectable online password guessing attack. Furthermore, an improved protocol is proposed to avoid the attack. Copyright © 2011 John Wiley & Sons, Ltd.

On ‘a simple three-party password-based key exchange protocol’

This work proposes a quantum dialogue (QD) based on single photons, which not only allows two communicants to exchange their secret messages simultaneously via a one-step quantum transmission but also can confirm the message integrity. Moreover, the proposed QD protocol is free from information leakage. Compared with the previous QDs, the proposed QD protocol is more efficient. It is also secure against several well-known attacks.

Efficient quantum dialogue using single photons

This work proposes an authenticated quantum dialogue (AQD) based on Bell states, allowing two communicants to perform mutual authentication and secure bidirectional communications simultaneously via public classical channels. Compared with the other AQDs, the proposed protocol is free from information leakage and is secure under several well-known attacks.

Authenticated Quantum Dialogue Based on Bell States

Recently, Xiu et al. proposed a deterministic secure quantum communication (DSQC) protocol using the entanglement swapping of four-particle genuine entangled states. Later, Qin et al. showed a double-CNOT attack on the protocol and also provided an improvement to avoid the attack. This work tries to use a batch of decoy single photons prepared randomly in one of four different states, to enhance the qubit efficiency on their DSQC protocols and avoid the double-CNOT attack at the same time.

On the "Deterministic Secure Quantum Communication using Four-Particle Entangled State and Entanglement Swapping"

In 2009, Shi et al [Opt Commun 282 (2009) 2460-2463] proposed a bidirectional quantum secure communication protocol based on a shared private Bell state The protocol allows two legitimate users to exchange their secret messages simultaneously and is free from information leakage This work tries to use random permutation on photons to reduce the communication cost and enhance the quantum bit efficiency on Shi et al's protocol

Ching-Ying Lin

Papers

On ‘a simple three-party password-based key exchange protocol’

Efficient quantum dialogue using single photons

Authenticated Quantum Dialogue Based on Bell States

On the "Deterministic Secure Quantum Communication using Four-Particle Entangled State and Entanglement Swapping"

Improved “bidirectional quantum secure communication protocol based on a shared private Bell state”